lua-l archive

Search lua-l

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

131. Re: Feature request: userdata slice (score: 29)

Author: William Ahern <william@...>

Date: Wed, 19 Aug 2015 07:25:44 -0700

This seems needlessly complicated. Firstly, I don't agree that 2^32 handles is enough. Lua tables might be limited to 2^32-1 entries, but you can have many tables. Rather, if anything 2^32 slices is

132. Re: Dead Batteries (score: 26)

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

Date: Sat, 18 Jan 2020 10:43:41 +0300

On Wed, Jan 15, 2020 at 11:44 PM Dibyendu Majumdar wrote: Mixing arrays and maps in a single data structure was a big mistake in my view! Merging arrays with dictionaries is a step toward making Lua

133. Re: Name resolution in Lua (was: Feature ...) (score: 26)

Author: Philippe Verdy <verdy_p@...>

Date: Fri, 16 Nov 2018 17:20:02 +0100

My point is not that the table has to be implemetned necessarily as a hash with a vector indexed by hash(key) containing pointers/references to keys and collision pointers (or a randomization functio

134. Re: Arrays and Tables (score: 26)

Author: Charles Heywood <vandor2012@...>

Date: Sat, 24 Jun 2017 23:21:03 +0000

Personally I feel like it would lead to more confusion (strangely, people think tables being a merge of arrays and objects being confusing) because tables are already optimized for array sections, ri

135. Re: Storing User Input in Tables/Arrays (score: 26)

Author: Andrew Starks <andrew@...>

Date: Fri, 5 May 2017 12:12:32 -0500

Tables are supremely flexible, able to store any and all value types in the key or the value (except that nil cannot be a key). So, in your example, we can take any one of multiple approaches, depend

136. Re: [Feature Request?] __key (score: 26)

Author: "Soni L." <fakedme@...>

Date: Thu, 14 Jul 2016 12:27:42 -0300

On 11/07/16 11:38 PM, Sean Conner wrote: It was thus said that the Great Soni L. once stated: After LuaConf 2016, more specifically the Lua stored procedures talk, I kept thinking about something...

137. Re: tables holding nil: another way to look at the question itself (score: 26)

Author: Cosmin Apreutesei <cosmin.apreutesei@...>

Date: Tue, 28 Jul 2009 17:56:43 +0300

Yea, but providing the arg. count is leaking the abstraction. If I am to make an optional parameter in the middle of the arg. list, should I account for the real arg. count or use an ipairs()-like i

138. Re: Memory leak? (score: 26)

Author: "Mark Meijer" <meijer78@...>

Date: Wed, 30 Jan 2008 16:23:10 +0100

Thanks all for your replies and insights. Never knew about the remembering keys thing, but it makes sense. See below for individual replies. Thanks, looks like a useful tool. Good points. I just figu

139. Re: Why does numeric for loop not accept an explist? (score: 26)

Author: Jean-Claude Wippler <jcw@...>

Date: Thu, 17 Jan 2008 22:27:27 +0100

AFAICS, the numeric for is simply a syntactical convenience which allows loops like this: The generic for loop is also a syntactical convenience (although generic for and numeric for both use dedicat

140. Re: Tables as vectors weirdness (score: 26)

Author: Mark Hamburg <mhamburg@...>

Date: Mon, 05 Nov 2007 09:11:55 -0700

It would help if the standard changed to have pairs and ipairs look for __pairs and __ipairs metamethods. It's easy enough to change the implementation of these routines, but providing extensions wou