blocks|key|3356086|text|Lua语言的作者之一language所写的lmapm+library。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3356087|entityMap|0|LINK|mutability|MUTABLE|url|http://www.tecgraf.puc-rio.br/~lhf/ftp/lua/#lmapm^0|L|D|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

The <a href="http://www.tecgraf.puc-rio.br/~lhf/ftp/lua/#lmapm" rel="noreferrer">lmapm library</a> by Luiz Figueiredo, one of the authors of the Lua language.

blocks|key|3356203|text|使用lbc而不是lmapm会更容易，因为lbc是自包含的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3356204|local+bc+=+require"bc"
s=bc.pow(2,1000):tostring()
z=0
for+i=1,#s+do
++++++++z=z%2Bs:byte(i)-("0"):byte(1)
end
print(z)|code-block|syntax|javascript|3356205|entityMap|0|LINK|mutability|MUTABLE|url|http://www.tecgraf.puc-rio.br/%257Elhf/ftp/lua/#lbc^0|2|3|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Using <a href="http://www.tecgraf.puc-rio.br/%7Elhf/ftp/lua/#lbc" rel="nofollow noreferrer" title="lbc">lbc</a> instead of lmapm would be easier because lbc is self-contained.
<pre><code>local bc = require&quot;bc&quot;
s=bc.pow(2,1000):tostring()
z=0
for i=1,#s do
 z=z+s:byte(i)-(&quot;0&quot;):byte(1)
end
print(z)
</code></pre>

blocks|key|3356190|text|我使用Norman+Ramsey的建议来解决项目Euler+problem+#16。我不认为说问题的症结在于准确地计算一个303位的整数是一个剧透。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3356191|以下是安装和使用该库所需的步骤：|3356192|构建|3356193|Lua时需要启用动态加载。我使用Cygwin，但我将src/Makefile中的PLAT改为linux。缺省值none不支持动态加载。|ordered-list-item|style|CODE|3356194|+MAMP需要构建并安装在C编译器可以找到的地方。我把libmapm.a放在/usr/local/lib/里了。接下来，m_apm.h和m_apm_lc.h转到/usr/local/include/.|3356195|The+makefile，因为需要将lmamp更改为Lua和MAMP库的正确位置。对我来说，这意味着取消注释LUA、LUAINC、LUALIB和LUABIN的第二个声明，并编辑MAMP的声明。|3356196|最后，mapm.so需要放在Lua能找到的地方。我把它放在/usr/local/lib/lua/5.1/.|3356197|上|3356198|感谢大家的建议！|3356199|entityMap|0|LINK|mutability|MUTABLE|url|http://projecteuler.net/index.php?section=problems&id=16|1|http://www.tc.umn.edu/~ringx004/mapm-main.html|2|http://www.tecgraf.puc-rio.br/~lhf/ftp/lua/#lmapm^0|12|3|0|0|0|0|Q|C|14|4|1A|5|1J|4|0|R|9|12|F|1O|7|1W|A|28|J|1|4|1|0|1I|3|1M|6|1T|6|20|6|2G|4|I|5|2|0|3|7|T|N|0|0|0^^$0|@$1|2|3|4|5|6|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|D|3|E|5|6|7|1C|8|@]|9|@]|C|$]]|$1|F|3|G|5|6|7|1D|8|@]|9|@]|C|$]]|$1|H|3|I|5|J|7|1E|8|@$A|1F|B|1G|K|L]|$A|1H|B|1I|K|L]|$A|1J|B|1K|K|L]|$A|1L|B|1M|K|L]]|9|@]|C|$]]|$1|M|3|N|5|J|7|1N|8|@$A|1O|B|1P|K|L]|$A|1Q|B|1R|K|L]|$A|1S|B|1T|K|L]|$A|1U|B|1V|K|L]|$A|1W|B|1X|K|L]]|9|@$A|1Y|B|1Z|1|20]]|C|$]]|$1|O|3|P|5|J|7|21|8|@$A|22|B|23|K|L]|$A|24|B|25|K|L]|$A|26|B|27|K|L]|$A|28|B|29|K|L]|$A|2A|B|2B|K|L]]|9|@$A|2C|B|2D|1|2E]]|C|$]]|$1|Q|3|R|5|J|7|2F|8|@$A|2G|B|2H|K|L]|$A|2I|B|2J|K|L]]|9|@]|C|$]]|$1|S|3|T|5|6|7|2K|8|@]|9|@]|C|$]]|$1|U|3|V|5|6|7|2L|8|@]|9|@]|C|$]]|$1|W|3|-4|5|6|7|2M|8|@]|9|@]|C|$]]]|X|$Y|$5|Z|10|11|C|$12|13]]|14|$5|Z|10|11|C|$12|15]]|16|$5|Z|10|11|C|$12|17]]]]

I used Norman Ramsey's suggestion to solve Project Euler problem <a href="http://projecteuler.net/index.php?section=problems&amp;id=16" rel="noreferrer">#16</a>. I don't think it's a spoiler to say that the crux of the problem is calculating a 303 digit integer accurately. 

Here are the steps I needed to install and use the library:

<ol>
<li>Lua needs to be built with dynamic loading enabled. I use Cygwin, but I changed <code>PLAT</code> in <code>src/Makefile</code> to be <code>linux</code>. The default, <code>none</code>, doesn't enable dynamic loading.</li>
<li>The <a href="http://www.tc.umn.edu/~ringx004/mapm-main.html" rel="noreferrer">MAMP</a> needs to be built and installed somewhere that your C compiler can find it. I put <code>libmapm.a</code> in <code>/usr/local/lib/</code>. Next <code>m_apm.h</code> and <code>m_apm_lc.h</code> went to <code>/usr/local/include/</code>.</li>
<li>The makefile for <a href="http://www.tecgraf.puc-rio.br/~lhf/ftp/lua/#lmapm" rel="noreferrer">lmamp</a> needs to be altered to the correct location of the Lua and MAMP libraries. For me, that means uncommenting the second declaration of <code>LUA</code>, <code>LUAINC</code>, <code>LUALIB</code>, and <code>LUABIN</code> and editing the declaration of <code>MAMP</code>. </li>
<li>Finally, <code>mapm.so</code> needs to be placed somewhere that Lua will find it. I put it at <code>/usr/local/lib/lua/5.1/</code>.</li>
</ol>

Thank you all for the suggestions!

blocks|key|355606|text|我真的不能回答，但我会添加LGMP，一个GMP绑定。未使用。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|355607|不是我的专业领域，但我希望GNU多精度算术库在这里成为一个相当标准的库，不是吗？|355608|entityMap|0|LINK|mutability|MUTABLE|url|http://lua-users.org/lists/lua-l/2007-07/msg00560.html^0|D|4|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

I can't really answer, but I will add <a href="http://lua-users.org/lists/lua-l/2007-07/msg00560.html" rel="noreferrer" title="LGMP">LGMP</a>, a GMP binding. Not used.

Not my field of expertise, but I would expect the GNU multiple precision arithmetic library to be quite a standard here, no?

blocks|key|360394|text|虽然不是任意精度，但Lua+decNumber实现了建议的通用十进制算术标准IEEE754r。它具有Lua+5.1算术运算符和更多，完全控制舍入模式，工作精度高达69位十进制数字。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|360395|entityMap|0|LINK|mutability|MUTABLE|url|http://luaforge.net/projects/ldecnumber/^0|A|D|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

Though not arbitrary precision, <a href="http://luaforge.net/projects/ldecnumber/" rel="nofollow noreferrer">Lua decNumber</a>, a Lua 5.1 wrapper for IBM decNumber, implements the proposed General Decimal Arithmetic standard IEEE 754r. It has the Lua 5.1 arithmetic operators and more, full control over rounding modes, and working precision up to 69 decimal digits.

blocks|key|3143360|text|有几个库可以解决这个问题，每个库都有你的优点和缺点，最好的选择取决于你的请求。我想说，如果lbc能够满足您的需求，或者Luiz的任何其他产品，那么它是一个很好的首选。对于最有效的一个，我想应该是任何使用GMP绑定的，因为GMP是一个处理大整数的标准C库，并且经过了很好的优化。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3143361|然而，如果你正在寻找一个纯粹的Lua+one，lua-bint库可能是处理大整数的一个选择，我不会说它是最好的，因为有更有效和完整的，比如上面提到的，但它们通常需要编译C代码，或者设置起来很麻烦。但是，在比较纯Lua大整型库时，根据您的用例，它可能是一个有效的选择。这个库是文档化的，测试完全覆盖了代码，并且有很多示例。但请相信我的建议，因为我是这个库的作者。|3143362|要安装，您可以使用luarock，如果您的计算机中已经有它，或者简单地下载项目中的bint.lua文件，因为除了需要Lua+5.3%2B之外，它没有其他依赖项。|3143363|下面是一个小示例，使用它来解决Project+Euler中的问题#16+(在前面的答案中提到过)：|3143364|local+bint+=+require+'bint'(1024)
local+n+=+bint(1)+<<+1000
local+digits+=+tostring(n)
local+sum+=+0
for+i=1,#digits+do
++sum+=+sum+%2B+tonumber(digits:sub(i,i))
end
print(sum)+--+should+output+1366|code-block|syntax|javascript|3143365|entityMap|0|LINK|mutability|MUTABLE|url|http://webserver2.tecgraf.puc-rio.br/%257Elhf/ftp/lua/#lbc|1|https://github.com/edubart/lua-bint|2|https://github.com/edubart/lua-bint/blob/master/bint.lua^0|19|3|0|0|N|8|1|0|15|8|2|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|F|3|G|5|6|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|H|3|I|5|6|7|1C|8|@]|9|@]|C|$]]|$1|J|3|K|5|L|7|1D|8|@]|9|@]|C|$M|N]]|$1|O|3|-4|5|6|7|1E|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

There are several libraries for the problem, each one with your advantages
and disadvantages, the best choice depends on your requeriments. I would say
<a href="http://webserver2.tecgraf.puc-rio.br/%7Elhf/ftp/lua/#lbc" rel="nofollow noreferrer">lbc</a> is a good first pick if it
fulfills your requirements or any other by Luiz Figueiredo. For the most efficient one I guess would be any using GMP bindings as GMP is a standard C library for dealing with large integers and is very well optimized.
Nevertheless in case you are looking for a pure Lua one, <a href="https://github.com/edubart/lua-bint" rel="nofollow noreferrer">lua-bint</a>
library could be an option for dealing with big integers,
I wouldn't say it's the best because there are more efficient
and complete ones such the ones mentioned above, but usually they requires compiling C code
or can be troublesome to setup. However when comparing pure Lua big integer libraries
and depending in your use case it could perhaps be an efficient choice. The library is documented,
code fully covered by tests and have many examples. But take this recommendation with grant of
salt because I am the library author.
To install you can use luarocks if you already have it in your computer or simply download the
<a href="https://github.com/edubart/lua-bint/blob/master/bint.lua" rel="nofollow noreferrer">bint.lua</a>
file in your project, as it has no other dependencies other than requiring Lua 5.3+.
Here is a small example using it to solve the problem #16 from Project Euler
(mentioned in previous answers):
<pre class="lang-lua prettyprint-override"><code>local bint = require 'bint'(1024)
local n = bint(1) &lt;&lt; 1000
local digits = tostring(n)
local sum = 0
for i=1,#digits do
 sum = sum + tonumber(digits:sub(i,i))
end
print(sum) -- should output 1366
</code></pre>

I'm working with large numbers that I can't have rounded off. Using Lua's standard math library, there seem to be no convenient way to preserve precision past some internal limit. I also see there are several libraries that can be loaded to work with big numbers:

<ol>
<li><a href="http://oss.digirati.com.br/luabignum/" rel="noreferrer">http://oss.digirati.com.br/luabignum/</a></li>
<li><a href="http://www.tc.umn.edu/~ringx004/mapm-main.html" rel="noreferrer">http://www.tc.umn.edu/~ringx004/mapm-main.html</a></li>
<li><a href="http://lua-users.org/lists/lua-l/2002-02/msg00312.html" rel="noreferrer">http://lua-users.org/lists/lua-l/2002-02/msg00312.html</a> (might be identical to #2)</li>
<li><a href="http://www.gammon.com.au/scripts/doc.php?general=lua_bc" rel="noreferrer">http://www.gammon.com.au/scripts/doc.php?general=lua_bc</a> (but I can't find any source)</li>
</ol>

Further, there are <a href="http://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic#Arbitrary-precision_software" rel="noreferrer">many libraries</a> in C that could be called from Lua, if the bindings where established.

Have you had any experience with one or more of these libraries?

What is the standard (or best supported) big number (arbitrary precision) library for Lua?

编译器

Lua语言

我正在处理我不能舍入的大数字。使用Lua的标准数学库，似乎没有便捷的方法来保持超出内部限制的精度。我还看到有几个库可以加载以处理大数字： (可能与#2)相同(但我找不到任何源码)此外，如果绑定已建立，则可以从Lua调用C中的。您是否有过使用其中一个或多个库的经验？

问Lua的标准(或最受支持的)大数字(任意精度)库是什么？
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Lua的标准(或最受支持的)大数字(任意精度)库是什么？EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Lua的标准(或最受支持的)大数字(任意精度)库是什么？
EN