HomeSort by relevance Sort by last modified time
    Searched refs:has_index (Results 1 - 8 of 8) sorted by null

  /external/chromium_org/third_party/re2/util/
sparse_array.h 151 inline bool has_index(int i) const;
174 // Fast but unsafe: only use if has_index(i) is true.
178 // Fast but unsafe: only use if has_index(i) is false.
182 // Fast but unsafe: only use if has_index(i) is true.
207 // Fast but unsafe: only use if has_index(i) is true.
212 // Only use if has_index(i) is known to be false.
295 bool SparseArray<Value>::has_index(int i) const { function in class:re2::SparseArray
316 if (!has_index(i))
326 if (has_index(new_value.index_)) {
337 if (!has_index(i)
    [all...]
sparse_array_test.cc 33 ASSERT_TRUE(set.has_index(order[j]));
39 ASSERT_FALSE(set.has_index(order[j]));
52 ASSERT_FALSE(set.has_index(i));
140 }, "Check failed: !has_index\\(i\\)");
  /external/regex-re2/util/
sparse_array.h 151 inline bool has_index(int i) const;
174 // Fast but unsafe: only use if has_index(i) is true.
178 // Fast but unsafe: only use if has_index(i) is false.
182 // Fast but unsafe: only use if has_index(i) is true.
207 // Fast but unsafe: only use if has_index(i) is true.
212 // Only use if has_index(i) is known to be false.
294 bool SparseArray<Value>::has_index(int i) const { function in class:re2::SparseArray
315 if (!has_index(i))
325 if (has_index(new_value.index_)) {
336 if (!has_index(i)
    [all...]
sparse_array_test.cc 33 ASSERT_TRUE(set.has_index(order[j]));
39 ASSERT_FALSE(set.has_index(order[j]));
52 ASSERT_FALSE(set.has_index(i));
140 }, "Check failed: !has_index\\(i\\)");
  /external/regex-re2/re2/
prefilter_tree.cc 256 if (!uniq_child.has_index(child_id))
260 if (!child_entry->parents->has_index(prefilter->unique_id()))
335 if (count.has_index(j)) {
nfa.cc 209 if (q->has_index(id)) {
  /external/chromium_org/third_party/re2/re2/
prefilter_tree.cc 342 if (count.has_index(j)) {
nfa.cc 209 if (q->has_index(id)) {

Completed in 371 milliseconds