lua-l archive

Search lua-l

This index contains 143,604 documents and 1,774,497 keywords. Last update on 2023-03-08 .

1. [Proposal] Table literal indexing (Was: Re: [Proposal] .name global indexing (Was: Re: 'with' statement)) (score: 435)

Author: Andrew Cannon <ajc@...>

Date: Tue, 15 Mar 2016 20:09:23 +0100

[snip] I can't really agree with your objection - after all, the order of things in a program _is_ generally significant, so why shouldn't this apply to a table literal too. The order of indexed (arr

2. Re: So I had this weird idea to solve the indexing problem (score: 320)

Author: Philippe Verdy <verdy_p@...>

Date: Mon, 10 Jun 2019 12:36:17 +0200

Nothing prevents an implementation to use a balanced tree approach instead of a hash. Both approaches can be used simultaneously, depending on statistics factors, notably: - the fill factor density f

3. Re: So I had this weird idea to solve the indexing problem (score: 320)

Author: Egor Skriptunoff <egor.skriptunoff@...>

Date: Sun, 9 Jun 2019 17:02:55 +0300

On Sun, Jun 9, 2019 at 2:06 PM Soni "They/Them" L. wrote: hi, so, a lot of ppl won't use Lua because Lua uses 1-based indexing. well, other languages use 0-based indexing. but, what if we had neither

4. So I had this weird idea to solve the indexing problem (score: 297)

Author: "Soni \"They/Them\" L." <fakedme@...>

Date: Sun, 9 Jun 2019 08:05:31 -0300

hi, so, a lot of ppl won't use Lua because Lua uses 1-based indexing. well, other languages use 0-based indexing. but, what if we had neither? the trivial solution for "neither" is just to use linked

5. Re: 1-based indexing in Lua (score: 281)

Author: Marc Balmer <marc@...>

Date: Fri, 30 Mar 2018 11:36:23 +0200

If you embed Lua in any hosting program, you will have to carefully provide Luaisms anyways (iterators, strings as options etc.). So index basing is one such thing. An come on, adding or subtracting

6. Re: 1-based indexing in Lua (score: 281)

Author: Coda Highland <chighland@...>

Date: Thu, 29 Mar 2018 12:01:36 -0500

The argument isn't that it's absolutely bad for a language to have 1-based indexing. The argument is that it's bad to MIX 1-based and 0-based indexing in the same system, and unfortunately for Lua's

7. Re: String indexing again (score: 279)

Author: HyperHacker <hyperhacker@...>

Date: Mon, 20 Dec 2010 14:50:18 -0700

Well, it returns a byte either way; you just need to use :byte() to get the numeric value. You can, as people suggested earlier, wrap strings in an object with its own metatable: function myString(st

8. Re: 1-based indexing in Lua (score: 274)

Author: Axel Kittenberger <axkibe@...>

Date: Thu, 29 Mar 2018 10:51:28 +0200

Agreed. Moreover, it is not strictly correct to say that Lua has 1-based indexing. Even to say that the Lua standard library and the default length function have 1-based indexing, is only partially

9. Re: String indexing again (score: 272)

Author: HyperHacker <hyperhacker@...>

Date: Mon, 20 Dec 2010 14:03:58 -0700

That could be done with __newindex. It might also allow s[3] = 65 (assigning by character value instead of string). Regarding the question of whether s[n] should return a substring ('A') or a byte va

10. Re: So I had this weird idea to solve the indexing problem (score: 269)

Author: Pavel <temp213@...>

Date: Tue, 11 Jun 2019 02:00:30 -0700 (MST)

Use or not to use some particular language only because of array indexing is absolutely stupid. Not all the languages have 'native' hardware pointers and thus pointer arithmetic, with the array index