Lines Matching full:absent

860 ** present. We want to find a larger key that is absent from the
862 ** find a boundary. We keep doubling 'j' until we get an absent index.
864 ** absent, we are ready for the binary search. ('j', being max integer,
866 ** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a
880         break;  /* 'j' now is an absent index */  in hash_search()
884   } while (!isempty(luaH_getint(t, j)));  /* repeat until an absent t[j] */  in hash_search()
885   /* i < j  &&  t[i] present  &&  t[j] absent */  in hash_search()
908 ** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent
927 ** (absent), which is found with a binary search. (This boundary always
933 ** or 'limit+1' is absent, 'limit' is a boundary.  Otherwise, call
980     return limit;  /* 'limit + 1' is absent */  in luaH_getn()