<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>rpm: lua/ltable.c Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
</ul></div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul></div>
<h1>lua/ltable.c</h1><a href="ltable_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment">** $Id: ltable.c,v 1.2 2004/03/23 05:09:14 jbj Exp $</span>
<a name="l00003"></a>00003 <span class="comment">** Lua tables (hash)</span>
<a name="l00004"></a>00004 <span class="comment">** See Copyright Notice in lua.h</span>
<a name="l00005"></a>00005 <span class="comment">*/</span>
<a name="l00006"></a>00006
<a name="l00007"></a>00007
<a name="l00008"></a>00008 <span class="comment">/*</span>
<a name="l00009"></a>00009 <span class="comment">** Implementation of tables (aka arrays, objects, or hash tables).</span>
<a name="l00010"></a>00010 <span class="comment">** Tables keep its elements in two parts: an array part and a hash part.</span>
<a name="l00011"></a>00011 <span class="comment">** Non-negative integer keys are all candidates to be kept in the array</span>
<a name="l00012"></a>00012 <span class="comment">** part. The actual size of the array is the largest `n' such that at</span>
<a name="l00013"></a>00013 <span class="comment">** least half the slots between 0 and n are in use.</span>
<a name="l00014"></a>00014 <span class="comment">** Hash uses a mix of chained scatter table with Brent's variation.</span>
<a name="l00015"></a>00015 <span class="comment">** A main invariant of these tables is that, if an element is not</span>
<a name="l00016"></a>00016 <span class="comment">** in its main position (i.e. the `original' position that its hash gives</span>
<a name="l00017"></a>00017 <span class="comment">** to it), then the colliding element is in its own main position.</span>
<a name="l00018"></a>00018 <span class="comment">** In other words, there are collisions only when two elements have the</span>
<a name="l00019"></a>00019 <span class="comment">** same main position (i.e. the same hash values for that table size).</span>
<a name="l00020"></a>00020 <span class="comment">** Because of that, the load factor of these tables can be 100% without</span>
<a name="l00021"></a>00021 <span class="comment">** performance penalties.</span>
<a name="l00022"></a>00022 <span class="comment">*/</span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="preprocessor">#include <string.h></span>
<a name="l00025"></a>00025
<a name="l00026"></a><a class="code" href="ltable_8c.html#a114e7aec320ef3b294533e55b5d08d4">00026</a> <span class="preprocessor">#define ltable_c</span>
<a name="l00027"></a>00027 <span class="preprocessor"></span>
<a name="l00028"></a>00028 <span class="preprocessor">#include "lua.h"</span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="preprocessor">#include "<a class="code" href="ldebug_8h.html">ldebug.h</a>"</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include "<a class="code" href="ldo_8h.html">ldo.h</a>"</span>
<a name="l00032"></a>00032 <span class="preprocessor">#include "<a class="code" href="lgc_8h.html">lgc.h</a>"</span>
<a name="l00033"></a>00033 <span class="preprocessor">#include "<a class="code" href="lmem_8h.html">lmem.h</a>"</span>
<a name="l00034"></a>00034 <span class="preprocessor">#include "<a class="code" href="lobject_8h.html">lobject.h</a>"</span>
<a name="l00035"></a>00035 <span class="preprocessor">#include "<a class="code" href="lstate_8h.html">lstate.h</a>"</span>
<a name="l00036"></a>00036 <span class="preprocessor">#include "<a class="code" href="ltable_8h.html">ltable.h</a>"</span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038
<a name="l00039"></a>00039 <span class="comment">/*</span>
<a name="l00040"></a>00040 <span class="comment">** max size of array part is 2^MAXBITS</span>
<a name="l00041"></a>00041 <span class="comment">*/</span>
<a name="l00042"></a>00042 <span class="preprocessor">#if BITS_INT > 26</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span><span class="preprocessor">#define MAXBITS 24</span>
<a name="l00044"></a>00044 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00045"></a><a class="code" href="ltable_8c.html#6fcad31e688110d9d61bdcc99b2a59d7">00045</a> <span class="preprocessor"></span><span class="preprocessor">#define MAXBITS (BITS_INT-2)</span>
<a name="l00046"></a>00046 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00047"></a>00047 <span class="preprocessor"></span>
<a name="l00048"></a>00048 <span class="comment">/* check whether `x' < 2^MAXBITS */</span>
<a name="l00049"></a><a class="code" href="ltable_8c.html#717571655483bc97ed8a7c5adb6b8874">00049</a> <span class="preprocessor">#define toobig(x) ((((x)-1) >> MAXBITS) != 0)</span>
<a name="l00050"></a>00050 <span class="preprocessor"></span>
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="comment">/* function to convert a lua_Number to int (with any rounding method) */</span>
<a name="l00053"></a>00053 <span class="preprocessor">#ifndef lua_number2int</span>
<a name="l00054"></a><a class="code" href="ltable_8c.html#75d07a0cde355316e25ef9ccef42a8c3">00054</a> <span class="preprocessor"></span><span class="preprocessor">#define lua_number2int(i,n) ((i)=(int)(n))</span>
<a name="l00055"></a>00055 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span>
<a name="l00057"></a>00057
<a name="l00058"></a><a class="code" href="ltable_8c.html#7797860730de6e3edbcc2916a0f7f166">00058</a> <span class="preprocessor">#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span>
<a name="l00060"></a><a class="code" href="ltable_8c.html#6dc1377ebc2524e79284729ad0e1b838">00060</a> <span class="preprocessor">#define hashstr(t,str) hashpow2(t, (str)->tsv.hash)</span>
<a name="l00061"></a><a class="code" href="ltable_8c.html#97178f1176950bb9830839b579d7ac1a">00061</a> <span class="preprocessor"></span><span class="preprocessor">#define hashboolean(t,p) hashpow2(t, p)</span>
<a name="l00062"></a>00062 <span class="preprocessor"></span>
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="comment">/*</span>
<a name="l00065"></a>00065 <span class="comment">** for some types, it is better to avoid modulus by power of 2, as</span>
<a name="l00066"></a>00066 <span class="comment">** they tend to have many 2 factors.</span>
<a name="l00067"></a>00067 <span class="comment">*/</span>
<a name="l00068"></a><a class="code" href="ltable_8c.html#70c9da7c141750e8e7c69bad3c0e4f20">00068</a> <span class="preprocessor">#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))</span>
<a name="l00069"></a>00069 <span class="preprocessor"></span>
<a name="l00070"></a>00070
<a name="l00071"></a><a class="code" href="ltable_8c.html#be268656b5851fdac88c13241391f41c">00071</a> <span class="preprocessor">#define hashpointer(t,p) hashmod(t, IntPoint(p))</span>
<a name="l00072"></a>00072 <span class="preprocessor"></span>
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="comment">/*</span>
<a name="l00075"></a>00075 <span class="comment">** number of ints inside a lua_Number</span>
<a name="l00076"></a>00076 <span class="comment">*/</span>
<a name="l00077"></a><a class="code" href="ltable_8c.html#682a9912365397494d65a0b2ab7d2a81">00077</a> <span class="preprocessor">#define numints cast(int, sizeof(lua_Number)/sizeof(int))</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span>
<a name="l00079"></a>00079
<a name="l00080"></a>00080 <span class="comment">/*</span>
<a name="l00081"></a>00081 <span class="comment">** hash for lua_Numbers</span>
<a name="l00082"></a>00082 <span class="comment">*/</span>
<a name="l00083"></a><a class="code" href="ltable_8c.html#6cec79051ddb52d782a29948787f5f42">00083</a> <span class="keyword">static</span> <a class="code" href="structNode.html">Node</a> *<a class="code" href="ltable_8c.html#6cec79051ddb52d782a29948787f5f42">hashnum</a> (<span class="keyword">const</span> <a class="code" href="structTable.html">Table</a> *t, lua_Number n)
<a name="l00084"></a>00084 <span class="comment">/*@*/</span>
<a name="l00085"></a>00085 {
<a name="l00086"></a>00086 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a[<a class="code" href="ltable_8c.html#682a9912365397494d65a0b2ab7d2a81">numints</a>];
<a name="l00087"></a>00087 <span class="keywordtype">int</span> i;
<a name="l00088"></a>00088 n += 1; <span class="comment">/* normalize number (avoid -0) */</span>
<a name="l00089"></a>00089 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<span class="keyword">sizeof</span>(a) <= <span class="keyword">sizeof</span>(n));
<a name="l00090"></a>00090 memcpy(a, &n, <span class="keyword">sizeof</span>(a));
<a name="l00091"></a>00091 <span class="keywordflow">for</span> (i = 1; i < <a class="code" href="ltable_8c.html#682a9912365397494d65a0b2ab7d2a81">numints</a>; i++) a[0] += a[i];
<a name="l00092"></a>00092 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#70c9da7c141750e8e7c69bad3c0e4f20">hashmod</a>(t, <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<a class="code" href="llimits_8h.html#6bd8ffeee8032212306017a8f3dda6c6">lu_hash</a>, a[0]));
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094
<a name="l00095"></a>00095
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="comment">/*</span>
<a name="l00098"></a>00098 <span class="comment">** returns the `main' position of an element in a table (that is, the index</span>
<a name="l00099"></a>00099 <span class="comment">** of its hash value)</span>
<a name="l00100"></a>00100 <span class="comment">*/</span>
<a name="l00101"></a><a class="code" href="ltable_8h.html#248adf3579e5e32f66ea45bad0ddc851">00101</a> <a class="code" href="structNode.html">Node</a> *<a class="code" href="ltable_8c.html#248adf3579e5e32f66ea45bad0ddc851">luaH_mainposition</a> (<span class="keyword">const</span> <a class="code" href="structTable.html">Table</a> *t, <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *key) {
<a name="l00102"></a>00102 <span class="keywordflow">switch</span> (<a class="code" href="lobject_8h.html#cd205ab396b96fba48e1f758c17a2cf3">ttype</a>(key)) {
<a name="l00103"></a>00103 <span class="keywordflow">case</span> LUA_TNUMBER:
<a name="l00104"></a>00104 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#6cec79051ddb52d782a29948787f5f42">hashnum</a>(t, <a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key));
<a name="l00105"></a>00105 <span class="keywordflow">case</span> LUA_TSTRING:
<a name="l00106"></a>00106 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#6dc1377ebc2524e79284729ad0e1b838">hashstr</a>(t, <a class="code" href="lobject_8h.html#8661397faed512ccc9c70a4661f1a83d">tsvalue</a>(key));
<a name="l00107"></a>00107 <span class="keywordflow">case</span> LUA_TBOOLEAN:
<a name="l00108"></a>00108 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#97178f1176950bb9830839b579d7ac1a">hashboolean</a>(t, <a class="code" href="lobject_8h.html#cabf05e821337a6de6a4a6632045032b">bvalue</a>(key));
<a name="l00109"></a>00109 <span class="keywordflow">case</span> LUA_TLIGHTUSERDATA:
<a name="l00110"></a>00110 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#be268656b5851fdac88c13241391f41c">hashpointer</a>(t, <a class="code" href="lobject_8h.html#16c0267c035b3e4edda082e25069e8cf">pvalue</a>(key));
<a name="l00111"></a>00111 <span class="keywordflow">default</span>:
<a name="l00112"></a>00112 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#be268656b5851fdac88c13241391f41c">hashpointer</a>(t, <a class="code" href="lobject_8h.html#05cdf6070135f10ad37e1048a730b634">gcvalue</a>(key));
<a name="l00113"></a>00113 }
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <span class="comment">/*</span>
<a name="l00118"></a>00118 <span class="comment">** returns the index for `key' if `key' is an appropriate key to live in</span>
<a name="l00119"></a>00119 <span class="comment">** the array part of the table, -1 otherwise.</span>
<a name="l00120"></a>00120 <span class="comment">*/</span>
<a name="l00121"></a><a class="code" href="ltable_8c.html#366975bbb99b20ceacd3594b11d4c2a1">00121</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ltable_8c.html#366975bbb99b20ceacd3594b11d4c2a1">arrayindex</a> (<span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *key)
<a name="l00122"></a>00122 <span class="comment">/*@*/</span>
<a name="l00123"></a>00123 {
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#7a1392f89b1f29ed3b1afa37a22d0be2">ttisnumber</a>(key)) {
<a name="l00125"></a>00125 <span class="keywordtype">int</span> k;
<a name="l00126"></a>00126 <a class="code" href="ltable_8c.html#75d07a0cde355316e25ef9ccef42a8c3">lua_number2int</a>(k, (<a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key)));
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (<a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(lua_Number, k) == <a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key) && k >= 1 && !<a class="code" href="ltable_8c.html#717571655483bc97ed8a7c5adb6b8874">toobig</a>(k))
<a name="l00128"></a>00128 <span class="keywordflow">return</span> k;
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130 <span class="keywordflow">return</span> -1; <span class="comment">/* `key' did not match some condition */</span>
<a name="l00131"></a>00131 }
<a name="l00132"></a>00132
<a name="l00133"></a>00133
<a name="l00134"></a>00134 <span class="comment">/*</span>
<a name="l00135"></a>00135 <span class="comment">** returns the index of a `key' for table traversals. First goes all</span>
<a name="l00136"></a>00136 <span class="comment">** elements in the array part, then elements in the hash part. The</span>
<a name="l00137"></a>00137 <span class="comment">** beginning and end of a traversal are signalled by -1.</span>
<a name="l00138"></a>00138 <span class="comment">*/</span>
<a name="l00139"></a><a class="code" href="ltable_8c.html#21114f45d4dbfe3d4bbd8b5b80730cf3">00139</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ltable_8c.html#21114f45d4dbfe3d4bbd8b5b80730cf3">luaH_index</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <a class="code" href="structlua__TObject.html">StkId</a> key)
<a name="l00140"></a>00140 <span class="comment">/*@modifies L @*/</span>
<a name="l00141"></a>00141 {
<a name="l00142"></a>00142 <span class="keywordtype">int</span> i;
<a name="l00143"></a>00143 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(key)) <span class="keywordflow">return</span> -1; <span class="comment">/* first iteration */</span>
<a name="l00144"></a>00144 i = <a class="code" href="ltable_8c.html#366975bbb99b20ceacd3594b11d4c2a1">arrayindex</a>(key);
<a name="l00145"></a>00145 <span class="keywordflow">if</span> (0 <= i && i <= t->sizearray) { <span class="comment">/* is `key' inside array part? */</span>
<a name="l00146"></a>00146 <span class="keywordflow">return</span> i-1; <span class="comment">/* yes; that's the index (corrected to C) */</span>
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148 <span class="keywordflow">else</span> {
<a name="l00149"></a>00149 <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *v = <a class="code" href="ltable_8c.html#204738ae06731c9be950e7385bb1fd17">luaH_get</a>(t, key);
<a name="l00150"></a>00150 <span class="keywordflow">if</span> (v == &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>)
<a name="l00151"></a>00151 <a class="code" href="ldebug_8c.html#5ef43f05a00bde7ee94539f3d765789c">luaG_runerror</a>(L, <span class="stringliteral">"invalid key for `next'"</span>);
<a name="l00152"></a>00152 i = <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<span class="keywordtype">int</span>, (<a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<span class="keyword">const</span> <a class="code" href="llimits_8h.html#e1fe9ac10d9803bd1d7bdf30b18bad68">lu_byte</a> *, v) -
<a name="l00153"></a>00153 <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<span class="keyword">const</span> <a class="code" href="llimits_8h.html#e1fe9ac10d9803bd1d7bdf30b18bad68">lu_byte</a> *, <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(<a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, 0)))) / <span class="keyword">sizeof</span>(<a class="code" href="structNode.html">Node</a>));
<a name="l00154"></a>00154 <span class="keywordflow">return</span> i + t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>; <span class="comment">/* hash elements are numbered after array ones */</span>
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157
<a name="l00158"></a>00158
<a name="l00159"></a><a class="code" href="ltable_8h.html#3c4370ade14fcc86ede5ca90271d0f30">00159</a> <span class="keywordtype">int</span> <a class="code" href="ltable_8c.html#3c4370ade14fcc86ede5ca90271d0f30">luaH_next</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <a class="code" href="structlua__TObject.html">StkId</a> key) {
<a name="l00160"></a>00160 <span class="keywordtype">int</span> i = <a class="code" href="ltable_8c.html#21114f45d4dbfe3d4bbd8b5b80730cf3">luaH_index</a>(L, t, key); <span class="comment">/* find original element */</span>
<a name="l00161"></a>00161 <span class="keywordflow">for</span> (i++; i < t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>; i++) { <span class="comment">/* try first array part */</span>
<a name="l00162"></a>00162 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(&t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[i])) { <span class="comment">/* a non-nil value? */</span>
<a name="l00163"></a>00163 <a class="code" href="lobject_8h.html#6e4ca2bc0025d5b310e7a78f3ac04fcc">setnvalue</a>(key, <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(lua_Number, i+1));
<a name="l00164"></a>00164 <a class="code" href="lobject_8h.html#1c51b9462c606f1f97242fae6b1220d1">setobj2s</a>(key+1, &t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[i]);
<a name="l00165"></a>00165 <span class="keywordflow">return</span> 1;
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167 }
<a name="l00168"></a>00168 <span class="keywordflow">for</span> (i -= t->sizearray; i < <a class="code" href="lobject_8h.html#2fbf715e78eaa889ed0fb9d4514e736a">sizenode</a>(t); i++) { <span class="comment">/* then hash part */</span>
<a name="l00169"></a>00169 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(<a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, i)))) { <span class="comment">/* a non-nil value? */</span>
<a name="l00170"></a>00170 <a class="code" href="lobject_8h.html#1c51b9462c606f1f97242fae6b1220d1">setobj2s</a>(key, <a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(<a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, i)));
<a name="l00171"></a>00171 <a class="code" href="lobject_8h.html#1c51b9462c606f1f97242fae6b1220d1">setobj2s</a>(key+1, <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(<a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, i)));
<a name="l00172"></a>00172 <span class="keywordflow">return</span> 1;
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174 }
<a name="l00175"></a>00175 <span class="keywordflow">return</span> 0; <span class="comment">/* no more elements */</span>
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177
<a name="l00178"></a>00178
<a name="l00179"></a>00179 <span class="comment">/*</span>
<a name="l00180"></a>00180 <span class="comment">** {=============================================================</span>
<a name="l00181"></a>00181 <span class="comment">** Rehash</span>
<a name="l00182"></a>00182 <span class="comment">** ==============================================================</span>
<a name="l00183"></a>00183 <span class="comment">*/</span>
<a name="l00184"></a>00184
<a name="l00185"></a>00185
<a name="l00186"></a><a class="code" href="ltable_8c.html#e070c26655667481f48b6a7fb921e2c7">00186</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#e070c26655667481f48b6a7fb921e2c7">computesizes</a> (<span class="keywordtype">int</span> nums[], <span class="keywordtype">int</span> ntotal, <span class="keywordtype">int</span> *narray, <span class="keywordtype">int</span> *nhash)
<a name="l00187"></a>00187 <span class="comment">/*@modifies *narray, *nhash @*/</span>
<a name="l00188"></a>00188 {
<a name="l00189"></a>00189 <span class="keywordtype">int</span> i;
<a name="l00190"></a>00190 <span class="keywordtype">int</span> a = nums[0]; <span class="comment">/* number of elements smaller than 2^i */</span>
<a name="l00191"></a>00191 <span class="keywordtype">int</span> na = a; <span class="comment">/* number of elements to go to array part */</span>
<a name="l00192"></a>00192 <span class="keywordtype">int</span> n = (na == 0) ? -1 : 0; <span class="comment">/* (log of) optimal size for array part */</span>
<a name="l00193"></a>00193 <span class="keywordflow">for</span> (i = 1; a < *narray && *narray >= <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(i-1); i++) {
<a name="l00194"></a>00194 <span class="keywordflow">if</span> (nums[i] > 0) {
<a name="l00195"></a>00195 a += nums[i];
<a name="l00196"></a>00196 <span class="keywordflow">if</span> (a >= <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(i-1)) { <span class="comment">/* more than half elements in use? */</span>
<a name="l00197"></a>00197 n = i;
<a name="l00198"></a>00198 na = a;
<a name="l00199"></a>00199 }
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201 }
<a name="l00202"></a>00202 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(na <= *narray && *narray <= ntotal);
<a name="l00203"></a>00203 *nhash = ntotal - na;
<a name="l00204"></a>00204 *narray = (n == -1) ? 0 : <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(n);
<a name="l00205"></a>00205 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(na <= *narray && na >= *narray/2);
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207
<a name="l00208"></a>00208
<a name="l00209"></a><a class="code" href="ltable_8c.html#9c09a90761eb1d829ecfbd25c1e3a40f">00209</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#9c09a90761eb1d829ecfbd25c1e3a40f">numuse</a> (<span class="keyword">const</span> <a class="code" href="structTable.html">Table</a> *t, <span class="keywordtype">int</span> *narray, <span class="keywordtype">int</span> *nhash)
<a name="l00210"></a>00210 <span class="comment">/*@modifies *narray, *nhash @*/</span>
<a name="l00211"></a>00211 {
<a name="l00212"></a>00212 <span class="keywordtype">int</span> nums[<a class="code" href="ltable_8c.html#6fcad31e688110d9d61bdcc99b2a59d7">MAXBITS</a>+1];
<a name="l00213"></a>00213 <span class="keywordtype">int</span> i, lg;
<a name="l00214"></a>00214 <span class="keywordtype">int</span> totaluse = 0;
<a name="l00215"></a>00215 <span class="comment">/* count elements in array part */</span>
<a name="l00216"></a>00216 <span class="keywordflow">for</span> (i=0, lg=0; lg<=<a class="code" href="ltable_8c.html#6fcad31e688110d9d61bdcc99b2a59d7">MAXBITS</a>; lg++) { <span class="comment">/* for each slice [2^(lg-1) to 2^lg) */</span>
<a name="l00217"></a>00217 <span class="keywordtype">int</span> ttlg = <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(lg); <span class="comment">/* 2^lg */</span>
<a name="l00218"></a>00218 <span class="keywordflow">if</span> (ttlg > t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>) {
<a name="l00219"></a>00219 ttlg = t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>;
<a name="l00220"></a>00220 if (i >= ttlg) <span class="keywordflow">break</span>;
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 nums[lg] = 0;
<a name="l00223"></a>00223 <span class="keywordflow">for</span> (; i<ttlg; i++) {
<a name="l00224"></a>00224 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(&t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[i])) {
<a name="l00225"></a>00225 nums[lg]++;
<a name="l00226"></a>00226 totaluse++;
<a name="l00227"></a>00227 }
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230 <span class="keywordflow">for</span> (; lg<=<a class="code" href="ltable_8c.html#6fcad31e688110d9d61bdcc99b2a59d7">MAXBITS</a>; lg++) nums[lg] = 0; <span class="comment">/* reset other counts */</span>
<a name="l00231"></a>00231 *narray = totaluse; <span class="comment">/* all previous uses were in array part */</span>
<a name="l00232"></a>00232 <span class="comment">/* count elements in hash part */</span>
<a name="l00233"></a>00233 i = <a class="code" href="lobject_8h.html#2fbf715e78eaa889ed0fb9d4514e736a">sizenode</a>(t);
<a name="l00234"></a>00234 <span class="keywordflow">while</span> (i--) {
<a name="l00235"></a>00235 <a class="code" href="structNode.html">Node</a> *n = &t->node[i];
<a name="l00236"></a>00236 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(n))) {
<a name="l00237"></a>00237 <span class="keywordtype">int</span> k = <a class="code" href="ltable_8c.html#366975bbb99b20ceacd3594b11d4c2a1">arrayindex</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(n));
<a name="l00238"></a>00238 <span class="keywordflow">if</span> (k >= 0) { <span class="comment">/* is `key' an appropriate array index? */</span>
<a name="l00239"></a>00239 nums[<a class="code" href="lobject_8c.html#dd64dfff81baeccf18056c1e0aa665f7">luaO_log2</a>(k-1)+1]++; <span class="comment">/* count as such */</span>
<a name="l00240"></a>00240 (*narray)++;
<a name="l00241"></a>00241 }
<a name="l00242"></a>00242 totaluse++;
<a name="l00243"></a>00243 }
<a name="l00244"></a>00244 }
<a name="l00245"></a>00245 <a class="code" href="ltable_8c.html#e070c26655667481f48b6a7fb921e2c7">computesizes</a>(nums, totaluse, narray, nhash);
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00248"></a>00248
<a name="l00249"></a><a class="code" href="ltable_8c.html#37db62d911b832dedb61743a30ab1219">00249</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#37db62d911b832dedb61743a30ab1219">setarrayvector</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <span class="keywordtype">int</span> size)
<a name="l00250"></a>00250 <span class="comment">/*@modifies L, t @*/</span>
<a name="l00251"></a>00251 {
<a name="l00252"></a>00252 <span class="keywordtype">int</span> i;
<a name="l00253"></a>00253 <a class="code" href="lmem_8h.html#b1174e625ed7a62e5f8ba33a7e1c1917">luaM_reallocvector</a>(L, t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>, t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>, size, <a class="code" href="structlua__TObject.html">TObject</a>);
<a name="l00254"></a>00254 <span class="keywordflow">for</span> (i=t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>; i<size; i++)
<a name="l00255"></a>00255 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(&t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[i]);
<a name="l00256"></a>00256 t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a> = size;
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258
<a name="l00259"></a>00259
<a name="l00260"></a><a class="code" href="ltable_8c.html#fe611d60899095100e73841e1046a07a">00260</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#fe611d60899095100e73841e1046a07a">setnodevector</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <span class="keywordtype">int</span> lsize)
<a name="l00261"></a>00261 <span class="comment">/*@modifies L, t @*/</span>
<a name="l00262"></a>00262 {
<a name="l00263"></a>00263 <span class="keywordtype">int</span> i;
<a name="l00264"></a>00264 <span class="keywordtype">int</span> size = <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(lsize);
<a name="l00265"></a>00265 <span class="keywordflow">if</span> (lsize > <a class="code" href="ltable_8c.html#6fcad31e688110d9d61bdcc99b2a59d7">MAXBITS</a>)
<a name="l00266"></a>00266 <a class="code" href="ldebug_8c.html#5ef43f05a00bde7ee94539f3d765789c">luaG_runerror</a>(L, <span class="stringliteral">"table overflow"</span>);
<a name="l00267"></a>00267 <span class="keywordflow">if</span> (lsize == 0) { <span class="comment">/* no elements to hash part? */</span>
<a name="l00268"></a>00268 t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a> = <a class="code" href="lstate_8h.html#103db2de6edf3420c6c6c9a282562406">G</a>(L)->dummynode; <span class="comment">/* use common `dummynode' */</span>
<a name="l00269"></a>00269 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>))); <span class="comment">/* assert invariants: */</span>
<a name="l00270"></a>00270 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>)));
<a name="l00271"></a>00271 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> == NULL); <span class="comment">/* (`dummynode' must be empty) */</span>
<a name="l00272"></a>00272 }
<a name="l00273"></a>00273 <span class="keywordflow">else</span> {
<a name="l00274"></a>00274 t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a> = <a class="code" href="lmem_8h.html#715cc368a85506c7a104cda58f270f3e">luaM_newvector</a>(L, size, <a class="code" href="structNode.html">Node</a>);
<a name="l00275"></a>00275 <span class="keywordflow">for</span> (i=0; i<size; i++) {
<a name="l00276"></a>00276 t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>[i].<a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = NULL;
<a name="l00277"></a>00277 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(<a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, i)));
<a name="l00278"></a>00278 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(<a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, i)));
<a name="l00279"></a>00279 }
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281 t-><a class="code" href="structTable.html#ed057d880ebe0f38f65e626f646adf6a">lsizenode</a> = <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<a class="code" href="llimits_8h.html#e1fe9ac10d9803bd1d7bdf30b18bad68">lu_byte</a>, lsize);
<a name="l00282"></a>00282 t-><a class="code" href="structTable.html#bab599417e4012c09675c2aff716b116">firstfree</a> = <a class="code" href="ltable_8h.html#644cfa3b6d4be1782e818a8340b5f78b">gnode</a>(t, size-1); <span class="comment">/* first free position to be used */</span>
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284
<a name="l00285"></a>00285
<a name="l00286"></a><a class="code" href="ltable_8c.html#4fd20c653904e3ff033c51d1d137724d">00286</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#4fd20c653904e3ff033c51d1d137724d">resize</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <span class="keywordtype">int</span> nasize, <span class="keywordtype">int</span> nhsize)
<a name="l00287"></a>00287 <span class="comment">/*@modifies L, t @*/</span>
<a name="l00288"></a>00288 {
<a name="l00289"></a>00289 <span class="keywordtype">int</span> i;
<a name="l00290"></a>00290 <span class="keywordtype">int</span> oldasize = t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>;
<a name="l00291"></a>00291 <span class="keywordtype">int</span> oldhsize = t-><a class="code" href="structTable.html#ed057d880ebe0f38f65e626f646adf6a">lsizenode</a>;
<a name="l00292"></a>00292 <a class="code" href="structNode.html">Node</a> *nold;
<a name="l00293"></a>00293 <a class="code" href="structNode.html">Node</a> temp[1];
<a name="l00294"></a>00294 <span class="keywordflow">if</span> (oldhsize)
<a name="l00295"></a>00295 nold = t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>; <span class="comment">/* save old hash ... */</span>
<a name="l00296"></a>00296 <span class="keywordflow">else</span> { <span class="comment">/* old hash is `dummynode' */</span>
<a name="l00297"></a>00297 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a> == <a class="code" href="lstate_8h.html#103db2de6edf3420c6c6c9a282562406">G</a>(L)->dummynode);
<a name="l00298"></a>00298 temp[0] = t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>[0]; <span class="comment">/* copy it to `temp' */</span>
<a name="l00299"></a>00299 nold = temp;
<a name="l00300"></a>00300 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(<a class="code" href="lstate_8h.html#103db2de6edf3420c6c6c9a282562406">G</a>(L)->dummynode)); <span class="comment">/* restate invariant */</span>
<a name="l00301"></a>00301 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(<a class="code" href="lstate_8h.html#103db2de6edf3420c6c6c9a282562406">G</a>(L)->dummynode));
<a name="l00302"></a>00302 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<a class="code" href="lstate_8h.html#103db2de6edf3420c6c6c9a282562406">G</a>(L)->dummynode->next == NULL);
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304 <span class="keywordflow">if</span> (nasize > oldasize) <span class="comment">/* array part must grow? */</span>
<a name="l00305"></a>00305 <a class="code" href="ltable_8c.html#37db62d911b832dedb61743a30ab1219">setarrayvector</a>(L, t, nasize);
<a name="l00306"></a>00306 <span class="comment">/* create new hash part with appropriate size */</span>
<a name="l00307"></a>00307 <a class="code" href="ltable_8c.html#fe611d60899095100e73841e1046a07a">setnodevector</a>(L, t, nhsize);
<a name="l00308"></a>00308 <span class="comment">/* re-insert elements */</span>
<a name="l00309"></a>00309 <span class="keywordflow">if</span> (nasize < oldasize) { <span class="comment">/* array part must shrink? */</span>
<a name="l00310"></a>00310 t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a> = nasize;
<a name="l00311"></a>00311 <span class="comment">/* re-insert elements from vanishing slice */</span>
<a name="l00312"></a>00312 <span class="keywordflow">for</span> (i=nasize; i<oldasize; i++) {
<a name="l00313"></a>00313 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(&t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[i]))
<a name="l00314"></a>00314 <a class="code" href="lobject_8h.html#0b6916971c4766bf58d942bf7a426c80">setobjt2t</a>(<a class="code" href="ltable_8c.html#2a07d7b8b8057a42614efed8847eb857">luaH_setnum</a>(L, t, i+1), &t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[i]);
<a name="l00315"></a>00315 }
<a name="l00316"></a>00316 <span class="comment">/* shrink array */</span>
<a name="l00317"></a>00317 <a class="code" href="lmem_8h.html#b1174e625ed7a62e5f8ba33a7e1c1917">luaM_reallocvector</a>(L, t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>, oldasize, nasize, <a class="code" href="structlua__TObject.html">TObject</a>);
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319 <span class="comment">/* re-insert elements in hash part */</span>
<a name="l00320"></a>00320 <span class="keywordflow">for</span> (i = <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(oldhsize) - 1; i >= 0; i--) {
<a name="l00321"></a>00321 <a class="code" href="structNode.html">Node</a> *old = nold+i;
<a name="l00322"></a>00322 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(old)))
<a name="l00323"></a>00323 <a class="code" href="lobject_8h.html#0b6916971c4766bf58d942bf7a426c80">setobjt2t</a>(<a class="code" href="ltable_8c.html#593c3efe2746f45037990c660743e005">luaH_set</a>(L, t, <a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(old)), <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(old));
<a name="l00324"></a>00324 }
<a name="l00325"></a>00325 <span class="keywordflow">if</span> (oldhsize)
<a name="l00326"></a>00326 <a class="code" href="lmem_8h.html#0e7e8302eb92be56c1043f086deed39a">luaM_freearray</a>(L, nold, <a class="code" href="lobject_8h.html#a341ef742b199e1c29a19d2c490ad74e">twoto</a>(oldhsize), <a class="code" href="structNode.html">Node</a>); <span class="comment">/* free old array */</span>
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328
<a name="l00329"></a>00329
<a name="l00330"></a><a class="code" href="ltable_8c.html#e444aec471e0a4199a5ae38d17e9df32">00330</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#e444aec471e0a4199a5ae38d17e9df32">rehash</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t)
<a name="l00331"></a>00331 <span class="comment">/*@modifies L, t @*/</span>
<a name="l00332"></a>00332 {
<a name="l00333"></a>00333 <span class="keywordtype">int</span> nasize, nhsize;
<a name="l00334"></a>00334 <a class="code" href="ltable_8c.html#9c09a90761eb1d829ecfbd25c1e3a40f">numuse</a>(t, &nasize, &nhsize); <span class="comment">/* compute new sizes for array and hash parts */</span>
<a name="l00335"></a>00335 <a class="code" href="ltable_8c.html#4fd20c653904e3ff033c51d1d137724d">resize</a>(L, t, nasize, <a class="code" href="lobject_8c.html#dd64dfff81baeccf18056c1e0aa665f7">luaO_log2</a>(nhsize)+1);
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337
<a name="l00338"></a>00338
<a name="l00339"></a>00339
<a name="l00340"></a>00340 <span class="comment">/*</span>
<a name="l00341"></a>00341 <span class="comment">** }=============================================================</span>
<a name="l00342"></a>00342 <span class="comment">*/</span>
<a name="l00343"></a>00343
<a name="l00344"></a>00344
<a name="l00345"></a><a class="code" href="ltable_8h.html#a3da0ffbd52f1add68d003264c60eb6b">00345</a> <a class="code" href="structTable.html">Table</a> *<a class="code" href="ltable_8c.html#a3da0ffbd52f1add68d003264c60eb6b">luaH_new</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <span class="keywordtype">int</span> narray, <span class="keywordtype">int</span> lnhash) {
<a name="l00346"></a>00346 <a class="code" href="structTable.html">Table</a> *t = <a class="code" href="lmem_8h.html#e72bd363be924fa9a67be67de0802ad7">luaM_new</a>(L, <a class="code" href="structTable.html">Table</a>);
<a name="l00347"></a>00347 <a class="code" href="lgc_8c.html#8ceb43f94e1513c18f99e7d2ee6f944e">luaC_link</a>(L, <a class="code" href="lstate_8h.html#b45b06e8618aa4a7bf53171933f30d57">valtogco</a>(t), LUA_TTABLE);
<a name="l00348"></a>00348 t-><a class="code" href="structTable.html#99c20fa696fb6a4e89890efa3819ebdc">metatable</a> = <a class="code" href="lobject_8h.html#336a6ce5e8340e6de133ec249cf47ebf">hvalue</a>(<a class="code" href="lstate_8h.html#9e5e09b7a0a8beffba454495b5124ac7">defaultmeta</a>(L));
<a name="l00349"></a>00349 t-><a class="code" href="structTable.html#643cf38ebbab9e5af99ff8a980ffbae5">flags</a> = <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<a class="code" href="llimits_8h.html#e1fe9ac10d9803bd1d7bdf30b18bad68">lu_byte</a>, ~0);
<a name="l00350"></a>00350 <span class="comment">/* temporary values (kept only if some malloc fails) */</span>
<a name="l00351"></a>00351 t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a> = NULL;
<a name="l00352"></a>00352 t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a> = 0;
<a name="l00353"></a>00353 t-><a class="code" href="structTable.html#ed057d880ebe0f38f65e626f646adf6a">lsizenode</a> = 0;
<a name="l00354"></a>00354 t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a> = NULL;
<a name="l00355"></a>00355 <a class="code" href="ltable_8c.html#37db62d911b832dedb61743a30ab1219">setarrayvector</a>(L, t, narray);
<a name="l00356"></a>00356 <a class="code" href="ltable_8c.html#fe611d60899095100e73841e1046a07a">setnodevector</a>(L, t, lnhash);
<a name="l00357"></a>00357 <span class="keywordflow">return</span> t;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359
<a name="l00360"></a>00360
<a name="l00361"></a><a class="code" href="ltable_8h.html#c6d94de2e83b5b0865b4aca30dec5c8c">00361</a> <span class="keywordtype">void</span> <a class="code" href="ltable_8c.html#c6d94de2e83b5b0865b4aca30dec5c8c">luaH_free</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t) {
<a name="l00362"></a>00362 <span class="keywordflow">if</span> (t-><a class="code" href="structTable.html#ed057d880ebe0f38f65e626f646adf6a">lsizenode</a>)
<a name="l00363"></a>00363 <a class="code" href="lmem_8h.html#0e7e8302eb92be56c1043f086deed39a">luaM_freearray</a>(L, t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>, <a class="code" href="lobject_8h.html#2fbf715e78eaa889ed0fb9d4514e736a">sizenode</a>(t), <a class="code" href="structNode.html">Node</a>);
<a name="l00364"></a>00364 <a class="code" href="lmem_8h.html#0e7e8302eb92be56c1043f086deed39a">luaM_freearray</a>(L, t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>, t-><a class="code" href="structTable.html#2c648e99fcf88c4660c97e7d9408b50f">sizearray</a>, <a class="code" href="structlua__TObject.html">TObject</a>);
<a name="l00365"></a>00365 <a class="code" href="lmem_8h.html#950211b6f3cdd2a18ea3e2ad59412897">luaM_freelem</a>(L, t);
<a name="l00366"></a>00366 }
<a name="l00367"></a>00367
<a name="l00368"></a>00368
<a name="l00369"></a>00369 <span class="preprocessor">#if 0</span>
<a name="l00370"></a>00370 <span class="preprocessor"></span><span class="comment">/*</span>
<a name="l00371"></a>00371 <span class="comment">** try to remove an element from a hash table; cannot move any element</span>
<a name="l00372"></a>00372 <span class="comment">** (because gc can call `remove' during a table traversal)</span>
<a name="l00373"></a>00373 <span class="comment">*/</span>
<a name="l00374"></a>00374 <span class="keywordtype">void</span> luaH_remove (<a class="code" href="structTable.html">Table</a> *t, <a class="code" href="structNode.html">Node</a> *e) {
<a name="l00375"></a>00375 <a class="code" href="structNode.html">Node</a> *mp = <a class="code" href="ltable_8c.html#248adf3579e5e32f66ea45bad0ddc851">luaH_mainposition</a>(t, <a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(e));
<a name="l00376"></a>00376 <span class="keywordflow">if</span> (e != mp) { <span class="comment">/* element not in its main position? */</span>
<a name="l00377"></a>00377 <span class="keywordflow">while</span> (mp-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> != e) mp = mp-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a>; <span class="comment">/* find previous */</span>
<a name="l00378"></a>00378 mp-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = e-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a>; <span class="comment">/* remove `e' from its list */</span>
<a name="l00379"></a>00379 }
<a name="l00380"></a>00380 <span class="keywordflow">else</span> {
<a name="l00381"></a>00381 <span class="keywordflow">if</span> (e-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> != NULL) ??
<a name="l00382"></a>00382 }
<a name="l00383"></a>00383 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(node)));
<a name="l00384"></a>00384 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(e)); <span class="comment">/* clear node `e' */</span>
<a name="l00385"></a>00385 e-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = NULL;
<a name="l00386"></a>00386 }
<a name="l00387"></a>00387 <span class="preprocessor">#endif</span>
<a name="l00388"></a>00388 <span class="preprocessor"></span>
<a name="l00389"></a>00389
<a name="l00390"></a>00390 <span class="comment">/*</span>
<a name="l00391"></a>00391 <span class="comment">** inserts a new key into a hash table; first, check whether key's main </span>
<a name="l00392"></a>00392 <span class="comment">** position is free. If not, check whether colliding node is in its main </span>
<a name="l00393"></a>00393 <span class="comment">** position or not: if it is not, move colliding node to an empty place and </span>
<a name="l00394"></a>00394 <span class="comment">** put new key in its main position; otherwise (colliding node is in its main </span>
<a name="l00395"></a>00395 <span class="comment">** position), new key goes to an empty position. </span>
<a name="l00396"></a>00396 <span class="comment">*/</span>
<a name="l00397"></a><a class="code" href="ltable_8c.html#a16052b12a0460b9330fc6e6514a4766">00397</a> <span class="keyword">static</span> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#a16052b12a0460b9330fc6e6514a4766">newkey</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *key)
<a name="l00398"></a>00398 <span class="comment">/*@modifies L, t @*/</span>
<a name="l00399"></a>00399 {
<a name="l00400"></a>00400 <a class="code" href="structlua__TObject.html">TObject</a> *val;
<a name="l00401"></a>00401 <a class="code" href="structNode.html">Node</a> *mp = <a class="code" href="ltable_8c.html#248adf3579e5e32f66ea45bad0ddc851">luaH_mainposition</a>(t, key);
<a name="l00402"></a>00402 <span class="keywordflow">if</span> (!<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(mp))) { <span class="comment">/* main position is not free? */</span>
<a name="l00403"></a>00403 <a class="code" href="structNode.html">Node</a> *othern = <a class="code" href="ltable_8c.html#248adf3579e5e32f66ea45bad0ddc851">luaH_mainposition</a>(t, <a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(mp)); <span class="comment">/* `mp' of colliding node */</span>
<a name="l00404"></a>00404 <a class="code" href="structNode.html">Node</a> *n = t-><a class="code" href="structTable.html#bab599417e4012c09675c2aff716b116">firstfree</a>; <span class="comment">/* get a free place */</span>
<a name="l00405"></a>00405 <span class="keywordflow">if</span> (othern != mp) { <span class="comment">/* is colliding node out of its main position? */</span>
<a name="l00406"></a>00406 <span class="comment">/* yes; move colliding node into free position */</span>
<a name="l00407"></a>00407 <span class="keywordflow">while</span> (othern-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> != mp) othern = othern-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a>; <span class="comment">/* find previous */</span>
<a name="l00408"></a>00408 othern-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = n; <span class="comment">/* redo the chain with `n' in place of `mp' */</span>
<a name="l00409"></a>00409 *n = *mp; <span class="comment">/* copy colliding node into free pos. (mp->next also goes) */</span>
<a name="l00410"></a>00410 mp-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = NULL; <span class="comment">/* now `mp' is free */</span>
<a name="l00411"></a>00411 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(mp));
<a name="l00412"></a>00412 }
<a name="l00413"></a>00413 <span class="keywordflow">else</span> { <span class="comment">/* colliding node is in its own main position */</span>
<a name="l00414"></a>00414 <span class="comment">/* new node will go into free position */</span>
<a name="l00415"></a>00415 n-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = mp-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a>; <span class="comment">/* chain new position */</span>
<a name="l00416"></a>00416 mp-><a class="code" href="structNode.html#f67b110ca1a258b793bf69d306929b22">next</a> = n;
<a name="l00417"></a>00417 mp = n;
<a name="l00418"></a>00418 }
<a name="l00419"></a>00419 }
<a name="l00420"></a>00420 <a class="code" href="lobject_8h.html#defdd17d98f1f5734ee296395e1805d4">setobj2t</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(mp), key); <span class="comment">/* write barrier */</span>
<a name="l00421"></a>00421 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(mp)));
<a name="l00422"></a>00422 <span class="keywordflow">for</span> (;;) { <span class="comment">/* correct `firstfree' */</span>
<a name="l00423"></a>00423 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(t-><a class="code" href="structTable.html#bab599417e4012c09675c2aff716b116">firstfree</a>)))
<a name="l00424"></a>00424 <span class="keywordflow">return</span> <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(mp); <span class="comment">/* OK; table still has a free place */</span>
<a name="l00425"></a>00425 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (t-><a class="code" href="structTable.html#bab599417e4012c09675c2aff716b116">firstfree</a> == t-><a class="code" href="structTable.html#519f179c707cb4e93bb66d09151c89e5">node</a>) <span class="keywordflow">break</span>; <span class="comment">/* cannot decrement from here */</span>
<a name="l00426"></a>00426 else (t-><a class="code" href="structTable.html#bab599417e4012c09675c2aff716b116">firstfree</a>)--;
<a name="l00427"></a>00427 }
<a name="l00428"></a>00428 <span class="comment">/* no more free places; must create one */</span>
<a name="l00429"></a>00429 <a class="code" href="lobject_8h.html#22e86755164a1bc172b40f344d7ce70e">setbvalue</a>(<a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(mp), 0); <span class="comment">/* avoid new key being removed */</span>
<a name="l00430"></a>00430 <a class="code" href="ltable_8c.html#e444aec471e0a4199a5ae38d17e9df32">rehash</a>(L, t); <span class="comment">/* grow table */</span>
<a name="l00431"></a>00431 val = <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<a class="code" href="structlua__TObject.html">TObject</a> *, <a class="code" href="ltable_8c.html#204738ae06731c9be950e7385bb1fd17">luaH_get</a>(t, key)); <span class="comment">/* get new position */</span>
<a name="l00432"></a>00432 <a class="code" href="llimits_8h.html#5978f5fda715bd80e845df1e16ad7780">lua_assert</a>(<a class="code" href="lobject_8h.html#44a87a5873bd05973d6e3a4747175c06">ttisboolean</a>(val));
<a name="l00433"></a>00433 <a class="code" href="lobject_8h.html#d9034def7bbc1965ec3d714d84620b07">setnilvalue</a>(val);
<a name="l00434"></a>00434 <span class="comment">/*@-observertrans -dependenttrans @*/</span>
<a name="l00435"></a>00435 <span class="keywordflow">return</span> val;
<a name="l00436"></a>00436 <span class="comment">/*@=observertrans =dependenttrans @*/</span>
<a name="l00437"></a>00437 }
<a name="l00438"></a>00438
<a name="l00439"></a>00439
<a name="l00440"></a>00440 <span class="comment">/*</span>
<a name="l00441"></a>00441 <span class="comment">** generic search function</span>
<a name="l00442"></a>00442 <span class="comment">*/</span>
<a name="l00443"></a>00443 <span class="comment">/*@observer@*/</span>
<a name="l00444"></a><a class="code" href="ltable_8c.html#95bb779ef4b580efeaf16c97c53318db">00444</a> <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#95bb779ef4b580efeaf16c97c53318db">luaH_getany</a> (<a class="code" href="structTable.html">Table</a> *t, <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *key)
<a name="l00445"></a>00445 <span class="comment">/*@*/</span>
<a name="l00446"></a>00446 {
<a name="l00447"></a>00447 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(key)) <span class="keywordflow">return</span> &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>;
<a name="l00448"></a>00448 <span class="keywordflow">else</span> {
<a name="l00449"></a>00449 <a class="code" href="structNode.html">Node</a> *n = <a class="code" href="ltable_8c.html#248adf3579e5e32f66ea45bad0ddc851">luaH_mainposition</a>(t, key);
<a name="l00450"></a>00450 <span class="keywordflow">do</span> { <span class="comment">/* check whether `key' is somewhere in the chain */</span>
<a name="l00451"></a>00451 <span class="keywordflow">if</span> (<a class="code" href="lobject_8c.html#2c963aaa8c57f506eaededeea54c65ba">luaO_rawequalObj</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(n), key)) <span class="keywordflow">return</span> <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(n); <span class="comment">/* that's it */</span>
<a name="l00452"></a>00452 <span class="keywordflow">else</span> n = n->next;
<a name="l00453"></a>00453 } <span class="keywordflow">while</span> (n);
<a name="l00454"></a>00454 <span class="keywordflow">return</span> &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>;
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456 }
<a name="l00457"></a>00457
<a name="l00458"></a>00458
<a name="l00459"></a>00459 <span class="comment">/*</span>
<a name="l00460"></a>00460 <span class="comment">** search function for integers</span>
<a name="l00461"></a>00461 <span class="comment">*/</span>
<a name="l00462"></a><a class="code" href="ltable_8h.html#5adc9d98c41d5fc34a64ee820eb6f9c4">00462</a> <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#5adc9d98c41d5fc34a64ee820eb6f9c4">luaH_getnum</a> (<a class="code" href="structTable.html">Table</a> *t, <span class="keywordtype">int</span> key) {
<a name="l00463"></a>00463 <span class="keywordflow">if</span> (1 <= key && key <= t->sizearray)
<a name="l00464"></a>00464 <span class="keywordflow">return</span> &t-><a class="code" href="structTable.html#193ec6402a4e6e6aa976ca1ffe7186d3">array</a>[key-1];
<a name="l00465"></a>00465 <span class="keywordflow">else</span> {
<a name="l00466"></a>00466 lua_Number nk = <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(lua_Number, key);
<a name="l00467"></a>00467 <a class="code" href="structNode.html">Node</a> *n = <a class="code" href="ltable_8c.html#6cec79051ddb52d782a29948787f5f42">hashnum</a>(t, nk);
<a name="l00468"></a>00468 <span class="keywordflow">do</span> { <span class="comment">/* check whether `key' is somewhere in the chain */</span>
<a name="l00469"></a>00469 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#7a1392f89b1f29ed3b1afa37a22d0be2">ttisnumber</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(n)) && <a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(n)) == nk)
<a name="l00470"></a>00470 <span class="keywordflow">return</span> <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(n); <span class="comment">/* that's it */</span>
<a name="l00471"></a>00471 <span class="keywordflow">else</span> n = n->next;
<a name="l00472"></a>00472 } <span class="keywordflow">while</span> (n);
<a name="l00473"></a>00473 <span class="keywordflow">return</span> &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>;
<a name="l00474"></a>00474 }
<a name="l00475"></a>00475 }
<a name="l00476"></a>00476
<a name="l00477"></a>00477
<a name="l00478"></a>00478 <span class="comment">/*</span>
<a name="l00479"></a>00479 <span class="comment">** search function for strings</span>
<a name="l00480"></a>00480 <span class="comment">*/</span>
<a name="l00481"></a><a class="code" href="ltable_8h.html#52ff8a892cd9c613613f1c90717fd6c8">00481</a> <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#52ff8a892cd9c613613f1c90717fd6c8">luaH_getstr</a> (<a class="code" href="structTable.html">Table</a> *t, <a class="code" href="unionTString.html">TString</a> *key) {
<a name="l00482"></a>00482 <a class="code" href="structNode.html">Node</a> *n = <a class="code" href="ltable_8c.html#6dc1377ebc2524e79284729ad0e1b838">hashstr</a>(t, key);
<a name="l00483"></a>00483 <span class="keywordflow">do</span> { <span class="comment">/* check whether `key' is somewhere in the chain */</span>
<a name="l00484"></a>00484 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#9bdf057a0de8da2ffae3ac35662dd255">ttisstring</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(n)) && <a class="code" href="lobject_8h.html#8661397faed512ccc9c70a4661f1a83d">tsvalue</a>(<a class="code" href="ltable_8h.html#d8f233e3b7156cd470d0ac21d7b54c11">gkey</a>(n)) == key)
<a name="l00485"></a>00485 <span class="keywordflow">return</span> <a class="code" href="ltable_8h.html#cbbecd9bd8fbb72a17f6e2f5acf7113d">gval</a>(n); <span class="comment">/* that's it */</span>
<a name="l00486"></a>00486 <span class="keywordflow">else</span> n = n->next;
<a name="l00487"></a>00487 } <span class="keywordflow">while</span> (n);
<a name="l00488"></a>00488 <span class="keywordflow">return</span> &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>;
<a name="l00489"></a>00489 }
<a name="l00490"></a>00490
<a name="l00491"></a>00491
<a name="l00492"></a>00492 <span class="comment">/*</span>
<a name="l00493"></a>00493 <span class="comment">** main search function</span>
<a name="l00494"></a>00494 <span class="comment">*/</span>
<a name="l00495"></a><a class="code" href="ltable_8h.html#204738ae06731c9be950e7385bb1fd17">00495</a> <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#204738ae06731c9be950e7385bb1fd17">luaH_get</a> (<a class="code" href="structTable.html">Table</a> *t, <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *key) {
<a name="l00496"></a>00496 <span class="keywordflow">switch</span> (<a class="code" href="lobject_8h.html#cd205ab396b96fba48e1f758c17a2cf3">ttype</a>(key)) {
<a name="l00497"></a>00497 <span class="keywordflow">case</span> LUA_TSTRING: <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#52ff8a892cd9c613613f1c90717fd6c8">luaH_getstr</a>(t, <a class="code" href="lobject_8h.html#8661397faed512ccc9c70a4661f1a83d">tsvalue</a>(key));
<a name="l00498"></a>00498 <span class="keywordflow">case</span> LUA_TNUMBER: {
<a name="l00499"></a>00499 <span class="keywordtype">int</span> k;
<a name="l00500"></a>00500 <a class="code" href="ltable_8c.html#75d07a0cde355316e25ef9ccef42a8c3">lua_number2int</a>(k, (<a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key)));
<a name="l00501"></a>00501 <span class="keywordflow">if</span> (<a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(lua_Number, k) == <a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key)) <span class="comment">/* is an integer index? */</span>
<a name="l00502"></a>00502 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#5adc9d98c41d5fc34a64ee820eb6f9c4">luaH_getnum</a>(t, k); <span class="comment">/* use specialized version */</span>
<a name="l00503"></a>00503 <span class="comment">/* else go through */</span>
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505 <span class="keywordflow">default</span>: <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#95bb779ef4b580efeaf16c97c53318db">luaH_getany</a>(t, key);
<a name="l00506"></a>00506 }
<a name="l00507"></a>00507 }
<a name="l00508"></a>00508
<a name="l00509"></a>00509
<a name="l00510"></a><a class="code" href="ltable_8h.html#593c3efe2746f45037990c660743e005">00510</a> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#593c3efe2746f45037990c660743e005">luaH_set</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *key) {
<a name="l00511"></a>00511 <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *p = <a class="code" href="ltable_8c.html#204738ae06731c9be950e7385bb1fd17">luaH_get</a>(t, key);
<a name="l00512"></a>00512 t-><a class="code" href="structTable.html#643cf38ebbab9e5af99ff8a980ffbae5">flags</a> = 0;
<a name="l00513"></a>00513 <span class="keywordflow">if</span> (p != &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>)
<a name="l00514"></a>00514 <span class="comment">/*@-observertrans -dependenttrans @*/</span>
<a name="l00515"></a>00515 <span class="keywordflow">return</span> <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<a class="code" href="structlua__TObject.html">TObject</a> *, p);
<a name="l00516"></a>00516 <span class="comment">/*@=observertrans =dependenttrans @*/</span>
<a name="l00517"></a>00517 <span class="keywordflow">else</span> {
<a name="l00518"></a>00518 <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#8630c13eaefbeaba1aa0933cab6e0238">ttisnil</a>(key)) <a class="code" href="ldebug_8c.html#5ef43f05a00bde7ee94539f3d765789c">luaG_runerror</a>(L, <span class="stringliteral">"table index is nil"</span>);
<a name="l00519"></a>00519 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="lobject_8h.html#7a1392f89b1f29ed3b1afa37a22d0be2">ttisnumber</a>(key) && <a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key) != <a class="code" href="lobject_8h.html#690ab618235691bb5a82610f07dd8684">nvalue</a>(key))
<a name="l00520"></a>00520 <a class="code" href="ldebug_8c.html#5ef43f05a00bde7ee94539f3d765789c">luaG_runerror</a>(L, <span class="stringliteral">"table index is NaN"</span>);
<a name="l00521"></a>00521 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#a16052b12a0460b9330fc6e6514a4766">newkey</a>(L, t, key);
<a name="l00522"></a>00522 }
<a name="l00523"></a>00523 }
<a name="l00524"></a>00524
<a name="l00525"></a>00525
<a name="l00526"></a><a class="code" href="ltable_8h.html#2a07d7b8b8057a42614efed8847eb857">00526</a> <a class="code" href="structlua__TObject.html">TObject</a> *<a class="code" href="ltable_8c.html#2a07d7b8b8057a42614efed8847eb857">luaH_setnum</a> (<a class="code" href="structlua__State.html">lua_State</a> *L, <a class="code" href="structTable.html">Table</a> *t, <span class="keywordtype">int</span> key) {
<a name="l00527"></a>00527 <span class="keyword">const</span> <a class="code" href="structlua__TObject.html">TObject</a> *p = <a class="code" href="ltable_8c.html#5adc9d98c41d5fc34a64ee820eb6f9c4">luaH_getnum</a>(t, key);
<a name="l00528"></a>00528 <span class="keywordflow">if</span> (p != &<a class="code" href="lobject_8c.html#d1a3c1dd876eb5bb36cb081eee03b12f">luaO_nilobject</a>)
<a name="l00529"></a>00529 <span class="comment">/*@-observertrans -dependenttrans @*/</span>
<a name="l00530"></a>00530 <span class="keywordflow">return</span> <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(<a class="code" href="structlua__TObject.html">TObject</a> *, p);
<a name="l00531"></a>00531 <span class="comment">/*@=observertrans =dependenttrans @*/</span>
<a name="l00532"></a>00532 <span class="keywordflow">else</span> {
<a name="l00533"></a>00533 TObject k;
<a name="l00534"></a>00534 <a class="code" href="lobject_8h.html#6e4ca2bc0025d5b310e7a78f3ac04fcc">setnvalue</a>(&k, <a class="code" href="llimits_8h.html#f17d62ec9e237a7644de6b9b34a48a34">cast</a>(lua_Number, key));
<a name="l00535"></a>00535 <span class="keywordflow">return</span> <a class="code" href="ltable_8c.html#a16052b12a0460b9330fc6e6514a4766">newkey</a>(L, t, &k);
<a name="l00536"></a>00536 }
<a name="l00537"></a>00537 }
<a name="l00538"></a>00538
</pre></div><hr size="1"><address style="align: right;"><small>Generated on 1 Oct 2013 for rpm by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>
