Home
last modified time | relevance | path

Searched refs:linear_search (Results 1 – 25 of 27) sorted by relevance

12

/external/cronet/tot/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc35 TEST_F(LinearSearchTest, linear_search) { in TEST_F() argument
36 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
37 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
43 absl::linear_search(const_container->begin(), const_container->end(), 3)); in TEST_F()
45 absl::linear_search(const_container->begin(), const_container->end(), 4)); in TEST_F()
53 static_assert(absl::linear_search(kArray.begin(), kArray.end(), 3)); in TEST_F()
54 static_assert(!absl::linear_search(kArray.begin(), kArray.end(), 4)); in TEST_F()
Dalgorithm.h56 ABSL_INTERNAL_CONSTEXPR_SINCE_CXX20 bool linear_search( in linear_search() function
/external/cronet/stable/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc35 TEST_F(LinearSearchTest, linear_search) { in TEST_F() argument
36 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
37 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
43 absl::linear_search(const_container->begin(), const_container->end(), 3)); in TEST_F()
45 absl::linear_search(const_container->begin(), const_container->end(), 4)); in TEST_F()
53 static_assert(absl::linear_search(kArray.begin(), kArray.end(), 3)); in TEST_F()
54 static_assert(!absl::linear_search(kArray.begin(), kArray.end(), 4)); in TEST_F()
Dalgorithm.h56 ABSL_INTERNAL_CONSTEXPR_SINCE_CXX20 bool linear_search( in linear_search() function
Dcontainer.h139 return absl::linear_search(container_algorithm_internal::c_begin(c),
/external/angle/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc35 TEST_F(LinearSearchTest, linear_search) { in TEST_F() argument
36 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
37 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
43 absl::linear_search(const_container->begin(), const_container->end(), 3)); in TEST_F()
45 absl::linear_search(const_container->begin(), const_container->end(), 4)); in TEST_F()
53 static_assert(absl::linear_search(kArray.begin(), kArray.end(), 3)); in TEST_F()
54 static_assert(!absl::linear_search(kArray.begin(), kArray.end(), 4)); in TEST_F()
Dalgorithm.h56 ABSL_INTERNAL_CONSTEXPR_SINCE_CXX20 bool linear_search( in linear_search() function
Dcontainer.h139 return absl::linear_search(container_algorithm_internal::c_begin(c),
/external/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc37 TEST_F(LinearSearchTest, linear_search) { in TEST_F() argument
38 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
39 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
45 absl::linear_search(const_container->begin(), const_container->end(), 3)); in TEST_F()
47 absl::linear_search(const_container->begin(), const_container->end(), 4)); in TEST_F()
Dalgorithm.h56 bool linear_search(InputIterator first, InputIterator last, in linear_search() function
Dcontainer.h136 return linear_search(container_algorithm_internal::c_begin(c),
/external/openscreen/third_party/abseil/src/absl/algorithm/
Dalgorithm_test.cc159 TEST_F(LinearSearchTest, linear_search) { in TEST_F() argument
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
167 absl::linear_search(const_container->begin(), const_container->end(), 3)); in TEST_F()
169 absl::linear_search(const_container->begin(), const_container->end(), 4)); in TEST_F()
Dalgorithm.h131 bool linear_search(InputIterator first, InputIterator last, in linear_search() function
Dcontainer.h142 return linear_search(container_algorithm_internal::c_begin(c),
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc168 TEST_F(LinearSearchTest, linear_search) { in TEST_F() argument
169 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
170 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
176 absl::linear_search(const_container->begin(), const_container->end(), 3)); in TEST_F()
178 absl::linear_search(const_container->begin(), const_container->end(), 4)); in TEST_F()
Dalgorithm.h131 bool linear_search(InputIterator first, InputIterator last, in linear_search() function
Dcontainer.h145 return linear_search(container_algorithm_internal::c_begin(c),
/external/pdfium/third_party/abseil-cpp/absl/algorithm/
Dalgorithm.h56 ABSL_INTERNAL_CONSTEXPR_SINCE_CXX20 bool linear_search( in linear_search() function
/external/ltp/utils/benchmark/ebizzy-0.3/
Debizzy.c329 static void *linear_search(record_t key, record_t * base, size_t size) in linear_search() function
405 found = linear_search(key, copy, copy_size); in search_mem()
/external/openscreen/third_party/abseil/src/absl/container/internal/
Dbtree.h681 return use_linear_search::value ? linear_search(k, comp)
688 return use_linear_search::value ? linear_search(k, upper_compare).value
694 linear_search(const K &k, const Compare &comp) const {
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/
Dbtree.h780 return use_linear_search::value ? linear_search(k, comp)
787 return use_linear_search::value ? linear_search(k, upper_compare).value
793 linear_search(const K &k, const Compare &comp) const {
/external/cronet/stable/third_party/abseil-cpp/absl/container/internal/
Dbtree.h775 return use_linear_search::value ? linear_search(k, comp)
782 return use_linear_search::value ? linear_search(k, upper_compare).value
788 linear_search(const K &k, const Compare &comp) const {
/external/abseil-cpp/absl/container/internal/
Dbtree.h775 return use_linear_search::value ? linear_search(k, comp)
782 return use_linear_search::value ? linear_search(k, upper_compare).value
788 linear_search(const K &k, const Compare &comp) const {
/external/angle/third_party/abseil-cpp/absl/container/internal/
Dbtree.h778 return use_linear_search::value ? linear_search(k, comp)
785 return use_linear_search::value ? linear_search(k, upper_compare).value
791 linear_search(const K &k, const Compare &comp) const {
/external/cronet/tot/third_party/abseil-cpp/absl/container/internal/
Dbtree.h775 return use_linear_search::value ? linear_search(k, comp)
782 return use_linear_search::value ? linear_search(k, upper_compare).value
788 linear_search(const K &k, const Compare &comp) const {

12