Lines Matching full:absent
845 ** present. We want to find a larger key that is absent from the
847 ** find a boundary. We keep doubling 'j' until we get an absent index.
849 ** absent, we are ready for the binary search. ('j', being max integer,
851 ** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a
865 break; /* 'j' now is an absent index */ in hash_search()
869 } while (!isempty(luaH_getint(t, j))); /* repeat until an absent t[j] */ in hash_search()
870 /* i < j && t[i] present && t[j] absent */ in hash_search()
893 ** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent
912 ** (absent), which is found with a binary search. (This boundary always
918 ** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call
965 return limit; /* 'limit + 1' is absent */ in luaH_getn()