diff --git a/luprex/eris-master/src/ltable.c b/luprex/eris-master/src/ltable.c
index 5d76f97e..85a31071 100644
--- a/luprex/eris-master/src/ltable.c
+++ b/luprex/eris-master/src/ltable.c
@@ -558,21 +558,23 @@ static int unbound_search (Table *t, unsigned int j) {
 ** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).
 */
 int luaH_getn (Table *t) {
-  unsigned int j = t->sizearray;
-  if (j > 0 && ttisnil(&t->array[j - 1])) {
-    /* there is a boundary in the array part: (binary) search for it */
-    unsigned int i = 0;
-    while (j - i > 1) {
-      unsigned int m = (i+j)/2;
-      if (ttisnil(&t->array[m - 1])) j = m;
-      else i = m;
-    }
-    return i;
-  }
-  /* else must find a boundary in hash part */
-  else if (isdummy(t->node))  /* hash part is empty? */
-    return j;  /* that is easy... */
-  else return unbound_search(t, j);
+  return unbound_search(t, 0);
+
+//   unsigned int j = t->sizearray;
+//   if (j > 0 && ttisnil(&t->array[j - 1])) {
+//     /* there is a boundary in the array part: (binary) search for it */
+//     unsigned int i = 0;
+//     while (j - i > 1) {
+//       unsigned int m = (i+j)/2;
+//       if (ttisnil(&t->array[m - 1])) j = m;
+//       else i = m;
+//     }
+//     return i;
+//   }
+//   /* else must find a boundary in hash part */
+//   else if (isdummy(t->node))  /* hash part is empty? */
+//     return j;  /* that is easy... */
+//   else return unbound_search(t, j);
 }