lua-l archive

Search lua-l

This index contains 143,615 documents and 1,774,615 keywords. Last update on 2023-03-09 .

81. PATCH Lua 5.2 reentrant Lua metamethods (score: 138)

Author: Tom N Harris <telliamed@...>

Date: Wed, 22 Sep 2010 21:17:55 +0000

"Reentrant" in this case refers to executing a function call by restarting the current loop. (To be honest, I don't like using the term this way, but it was already written in the code, see CIST_REEN

82. LuaJIT vs. PyPy JIT (score: 138)

Author: François Perrad <francois.perrad@...>

Date: Wed, 10 Feb 2010 10:05:08 +0100

After reading this post http://indefinitestudies.org/2010/02/08/creating-a-toy-virtual-machine-with-pypy/ and the referenced paper http://codespeak.net/pypy/extradoc/talk/Ficooolps2009/bolz-tracing-j

83. Patch for escaping '\n' with string.format("%Q") (was Re: finding keys in a table) (score: 134)

Author: Doug Rogers <rogers@...>

Date: Thu, 21 Feb 2008 14:11:34 -0500

It would be too complex to have a '%Q' format that automatically escaped '[-*[', otherwise Q could be q's big sister, just like [[]] are to '". For anyone interested I've attached a patch for lstrlib

84. Re: table.n (score: 133)

Author: Roberto Ierusalimschy <roberto@...>

Date: Mon, 02 Apr 2001 10:14:09 -0300

As Steve pointed out, the '.n' avoids the recalculation of the 'size' of an array each time getn is called. Actually, you should avoid using it directly; instead, use `getn'. But `getn' is much faste

85. In place modification/assignment - A Patch (score: 130)

Author: Ian Millington <idmillington@...>

Date: Mon, 27 Jun 2011 00:04:51 +0100

A while back I posted a commercial job offer for someone to help add in-place mutation operators to Lua (+=, -=, *=, /=, %= and ^=). My domain is in a scripting language for games, and a good deal of

86. Not able to access lua table values in C++ (score: 130)

Author: "Gokul N" <gokul.n@...>

Date: Thu, 28 Sep 2006 09:36:25 +0530

Hi, Iam trying to access the lua table values in c++,Iam not able to print the values. here is the code of what iam doing. -- A Table to be called from c++ -- imageTable.lua imag = {"bg1", "bg2", "bg

87. simple n-ary tree (long) (score: 129)

Author: mnicolet <mnicolet@...>

Date: Sat, 09 Aug 2003 17:09:06 -0300

I learned lots from the lua community. I am a beginner, and every day I can uncover another powerful way of lua usage. Great work of the lua team !!! It's like I must contribute this to the list. The

88. Re: toLua 4.0a improvements (score: 129)

Author: "Nick Trout" <nick@...>

Date: Wed, 2 May 2001 18:03:50 +0100

time I forgot to actually attach it). Let me know if you find it useful. Well I may well attach mine in Python :-) Access is set using comments: eg. // "public" or // "private" . You should include

89. What IS the syntax of Lua 4.1 programs? (score: 126)

Author: ramsdell@... (John D. Ramsdell)

Date: 07 Aug 2001 17:58:11 -0400

After looking at the 4.1 alpha manual and then viewing the source code, I realized that the section giving the complete syntax of Lua is no longer valid. This explains some of the inconsistencies bet

90. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 125)

Author: Jay Carlson <nop@...>

Date: Fri, 6 Jan 2012 20:40:31 -0500

I wonder if combining a secret seed with the contents of the accumulated hash to choose how far to jump ahead each time is sufficiently annoying. Instead of jumping ahead stepsize, jump ahead stepsiz

91. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 125)

Author: Sam Roberts <vieuxtech@...>

Date: Wed, 4 Jan 2012 16:16:00 -0800

OK, so quoting the report: ruby could be caused to take 6 hours of i7 CPU time to parse a 2 MB post request That seems ripe for exploit. Whereas I rearranged your code to run standalone, and what I'm

92. Re: Change in behaviour of "n" field in Lua 5.1(work) (score: 125)

Author: Roberto Ierusalimschy <roberto@...>

Date: Mon, 24 May 2004 16:04:49 -0300

Those changes are experimental. We would like to move away from the old ".n", but we do not want to break too much compatibility... -- Roberto

93. Re: Using lua_yield with common C functions (score: 123)

Author: Sean Conner <sean@...>

Date: Fri, 30 Oct 2009 16:13:55 -0400

It was thus said that the Great Peter LaDow once stated: I recently finished a project using Lua threads (extending a network daemon--sockets handled by C, logic by Lua) here's what works for me, and

94. Re: Threaded vm core loop (score: 122)

Author: gz@...

Date: Wed, 05 Apr 2017 15:16:34 +0200

Am 2017-04-05 14:52, schrieb Daurnimator: On 5 April 2017 at 22:28, <gz@tset.de> wrote: I had a go at making the core vm loop of lua 5.3.4 into a direct threaded interpreter. The change itself was pr

95. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 122)

Author: KHMan <keinhong@...>

Date: Sat, 07 Jan 2012 10:35:16 +0800

On 1/7/2012 9:40 AM, Jay Carlson wrote: [snip snip] On Fri, Jan 6, 2012 at 10:41 AM, Roberto Ierusalimschy wrote: Yes, it would be great to hear "official" opinion from both Lua team and Mike. Well,

96. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 122)

Author: Patrick Rapin <toupie300@...>

Date: Fri, 6 Jan 2012 18:00:45 +0100

Thank you Roberto for the distance you take from the mainstream ideas. All propositions made in this thread to solve the (potential) collision problem look like patches to me, increasing both code s

97. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 122)

Author: Roberto Ierusalimschy <roberto@...>

Date: Fri, 6 Jan 2012 13:41:19 -0200

If I understood the problem correctly, a variable hash seed would solve it, except for the skipping of characters. So, one approach is to implement strings using two variants: short strings (up to 3

98. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 122)

Author: Roberto Ierusalimschy <roberto@...>

Date: Fri, 6 Jan 2012 08:22:35 -0200

Well, this is not an official opinion, but one possible approach would be to break strings into two variants: short strings and long strings, where long strings would not be interned any more. More

99. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 122)

Author: Jerome Vuarand <jerome.vuarand@...>

Date: Fri, 6 Jan 2012 11:22:08 +0100

2012/1/5 Petite Abeille <petite.abeille@gmail.com>: I gave it a try too. The collision generation is based on Florian Weimer's code (see [1]). For some reason I could not detect any noticeable differ

100. Re: Hash Table Collisions (n.runs-SA-2011.004) (score: 122)

Author: Petite Abeille <petite.abeille@...>

Date: Thu, 5 Jan 2012 22:24:55 +0100

Excellent. Thanks for giving it a go :)