/external/toybox/tests/ |
D | find.test | 24 "find dir -type l -a -type d -o -type p" "dir/fifo\n" "" "" 25 testing "-type l -type d -o -type p" "find dir -type l -type d -o -type p" \ 28 "find dir -type l -o -type d -a -type p" "dir/link\n" "" "" 29 testing "-type l -o -type d -type p" "find dir -type l -o -type d -type p" \ 32 "find dir -type l \( -type d -o -type l \)" "dir/link\n" "" "" 34 "find dir \( \( -type l \) \( -type d -o \( \( -type l \) \) \) \)" \ 37 "find dir \( -type p -o -type d \) -type p" "dir/fifo\n" "" "" 39 "find dir -type l -o -type d -type p -o -type f | sort" \ 45 "find dir -type f -a -print" "dir/file\n" "" "" 47 "find dir -type f -a \( -print -o -print \)" "dir/file\n" "" "" [all …]
|
/external/libcxx/test/std/containers/associative/multiset/ |
D | find.pass.cpp | 14 // iterator find(const key_type& k); 15 // const_iterator find(const key_type& k) const; 43 R r = m.find(5); in main() 45 r = m.find(6); in main() 47 r = m.find(7); in main() 49 r = m.find(8); in main() 51 r = m.find(9); in main() 53 r = m.find(10); in main() 55 r = m.find(11); in main() 57 r = m.find(12); in main() [all …]
|
/external/libcxx/test/std/containers/associative/set/ |
D | find.pass.cpp | 14 // iterator find(const key_type& k); 15 // const_iterator find(const key_type& k) const; 43 R r = m.find(5); in main() 45 r = m.find(6); in main() 47 r = m.find(7); in main() 49 r = m.find(8); in main() 51 r = m.find(9); in main() 53 r = m.find(10); in main() 55 r = m.find(11); in main() 57 r = m.find(12); in main() [all …]
|
/external/libcxx/test/std/containers/associative/map/map.ops/ |
D | find.pass.cpp | 14 // iterator find(const key_type& k); 15 // const_iterator find(const key_type& k) const; 44 R r = m.find(5); in main() 46 r = m.find(6); in main() 48 r = m.find(7); in main() 50 r = m.find(8); in main() 52 r = m.find(9); in main() 54 r = m.find(10); in main() 56 r = m.find(11); in main() 58 r = m.find(12); in main() [all …]
|
/external/google-fruit/tests/data_structures/ |
D | test_semistatic_graph.py | 54 Assert(graph.find(0) == graph.end()); 55 Assert(graph.find(2) == graph.end()); 56 Assert(graph.find(5) == graph.end()); 58 Assert(cgraph.find(0) == cgraph.end()); 59 Assert(cgraph.find(2) == cgraph.end()); 60 Assert(cgraph.find(5) == cgraph.end()); 75 Assert(graph.find(0) == graph.end()); 76 Assert(!(graph.find(2) == graph.end())); 79 Assert(graph.find(5) == graph.end()); 81 Assert(cgraph.find(0) == cgraph.end()); [all …]
|
D | test_semistatic_map.py | 35 Assert(map.find(0) == nullptr); 36 Assert(map.find(2) == nullptr); 37 Assert(map.find(5) == nullptr); 52 Assert(map.find(0) == nullptr); 53 Assert(map.find(2) != nullptr); 55 Assert(map.find(5) == nullptr); 74 Assert(map.find(0) == nullptr); 75 Assert(map.find(2) != nullptr); 77 Assert(map.find(5) == nullptr); 92 Assert(map.find(0) == nullptr); [all …]
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
D | swap_member.pass.cpp | 85 assert(c1.find(10)->second == "ten"); in main() 86 assert(c1.find(20)->second == "twenty"); in main() 87 assert(c1.find(30)->second == "thirty"); in main() 88 assert(c1.find(40)->second == "forty"); in main() 89 assert(c1.find(50)->second == "fifty"); in main() 90 assert(c1.find(60)->second == "sixty"); in main() 91 assert(c1.find(70)->second == "seventy"); in main() 92 assert(c1.find(80)->second == "eighty"); in main() 144 assert(s.find(c2.find(1)->second) != s.end()); in main() 145 s.erase(s.find(c2.find(1)->second)); in main() [all …]
|
D | reserve.pass.cpp | 34 assert(s.find(c.find(1)->second) != s.end()); in test() 35 s.erase(s.find(c.find(1)->second)); in test() 36 assert(s.find(next(c.find(1))->second) != s.end()); in test() 42 assert(s.find(c.find(2)->second) != s.end()); in test() 43 s.erase(s.find(c.find(2)->second)); in test() 44 assert(s.find(next(c.find(2))->second) != s.end()); in test() 46 assert(c.find(3)->second == "three"); in test() 47 assert(c.find(4)->second == "four"); in test()
|
/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
D | find.pass.cpp | 14 // iterator find(const key_type& k); 15 // const_iterator find(const key_type& k) const; 45 R r = m.find(5); in main() 47 r = m.find(6); in main() 49 r = m.find(7); in main() 51 r = m.find(8); in main() 53 r = m.find(9); in main() 55 r = m.find(10); in main() 73 R r = m.find(5); in main() 75 r = m.find(6); in main() [all …]
|
/external/boringssl/src/third_party/wycheproof_testvectors/ |
D | aes_cbc_pkcs5_test.txt | 210 # unexpected padding. This allows to find implementations that are not properly 221 # unexpected padding. This allows to find implementations that are not properly 232 # unexpected padding. This allows to find implementations that are not properly 243 # unexpected padding. This allows to find implementations that are not properly 254 # unexpected padding. This allows to find implementations that are not properly 265 # unexpected padding. This allows to find implementations that are not properly 276 # unexpected padding. This allows to find implementations that are not properly 287 # unexpected padding. This allows to find implementations that are not properly 298 # unexpected padding. This allows to find implementations that are not properly 309 # unexpected padding. This allows to find implementations that are not properly [all …]
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
D | swap_non_member.pass.cpp | 83 assert(c1.find(10)->second == "ten"); in main() 84 assert(c1.find(20)->second == "twenty"); in main() 85 assert(c1.find(30)->second == "thirty"); in main() 86 assert(c1.find(40)->second == "forty"); in main() 87 assert(c1.find(50)->second == "fifty"); in main() 88 assert(c1.find(60)->second == "sixty"); in main() 89 assert(c1.find(70)->second == "seventy"); in main() 90 assert(c1.find(80)->second == "eighty"); in main() 138 assert(c2.find(1)->second == "one"); in main() 139 assert(next(c2.find(1))->second == "four"); in main() [all …]
|
/external/openssh/regress/ |
D | keygen-knownhosts.sh | 61 fail "didn't find $_name" 65 # Find key 69 check_find host-a "simple find" 71 # find CA key 74 check_find host-c "find CA key" 76 # find revoked key 79 check_find host-d "find revoked key" 81 # find key with wildcard 84 check_find host-e.somedomain "find wildcard key" 86 # find key among multiple hosts [all …]
|
/external/libtextclassifier/utils/utf8/ |
D | unilib-javaicu.h | 64 // Approximate Matches() implementation implemented using Find(). It uses 65 // the first Find() result and then checks that it spans the whole input. 67 // NOTE: Resets the matcher, so the current Find() state will be lost. 71 // Can be called repeatedly to find all occurences. A call will update 74 // NOTE: Any call to ApproximatelyMatches() in between Find() calls will 76 bool Find(int* status); 78 // Gets the start offset of the last match (from 'Find'). 79 // Sets status to 'kError' if 'Find' 84 // (from 'Find'). 85 // Sets status to 'kError' if an invalid group was specified or if 'Find' [all …]
|
/external/tensorflow/tensorflow/core/profiler/internal/ |
D | tfprof_show.cc | 150 if (opts.select.find(kShown[2]) != opts.select.end()) { in FormatNode() 163 if (opts.select.find(kShown[3]) != opts.select.end()) { in FormatNode() 173 if (opts.select.find(kShown[0]) != opts.select.end()) { in FormatNode() 177 if (opts.select.find(kShown[11]) != opts.select.end()) { in FormatNode() 181 if (opts.select.find(kShown[12]) != opts.select.end()) { in FormatNode() 185 if (opts.select.find(kShown[13]) != opts.select.end()) { in FormatNode() 189 if (opts.select.find(kShown[1]) != opts.select.end()) { in FormatNode() 194 if (opts.select.find(kShown[9]) != opts.select.end() && in FormatNode() 195 opts.select.find(kShown[1]) == opts.select.end()) { in FormatNode() 198 if (opts.select.find(kShown[10]) != opts.select.end() && in FormatNode() [all …]
|
/external/spirv-llvm/lib/SPIRV/ |
D | OCLUtil.cpp | 166 if (OCLSPIRVBuiltinMap::find(Info.UniqName, &OC)) in getSPIRVInst() 378 if (UnmangledName.find("async_work_group") == 0) { in init() 381 } else if (UnmangledName.find("write_imageui") == 0) in init() 406 } else if (UnmangledName.find("get_") == 0 || in init() 409 UnmangledName.find("shuffle") == 0){ in init() 411 if (UnmangledName.find(kOCLBuiltinName::GetFence) == 0){ in init() 415 } else if (UnmangledName.find("barrier") == 0 || in init() 416 UnmangledName.find("work_group_barrier") == 0 || in init() 417 UnmangledName.find("sub_group_barrier") == 0) { in init() 419 } else if (UnmangledName.find("atomic_work_item_fence") == 0) { in init() [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
D | SparseMultiSetTest.cpp | 28 EXPECT_TRUE(Set.find(0) == Set.end()); in TEST() 29 EXPECT_TRUE(Set.find(9) == Set.end()); in TEST() 35 EXPECT_TRUE(CSet.find(0) == CSet.end()); in TEST() 36 USet::const_iterator I = CSet.find(5); in TEST() 51 EXPECT_TRUE(Set.find(0) == Set.end()); in TEST() 52 EXPECT_TRUE(Set.find(9) == Set.end()); in TEST() 60 EXPECT_TRUE(I == ++Set.find(5)); in TEST() 62 EXPECT_TRUE(I == Set.find(5)); in TEST() 65 I = Set.find(1); in TEST() 68 EXPECT_EQ(5u, *Set.find(5)); in TEST() [all …]
|
/external/llvm/unittests/ADT/ |
D | SparseMultiSetTest.cpp | 28 EXPECT_TRUE(Set.find(0) == Set.end()); in TEST() 29 EXPECT_TRUE(Set.find(9) == Set.end()); in TEST() 35 EXPECT_TRUE(CSet.find(0) == CSet.end()); in TEST() 36 USet::const_iterator I = CSet.find(5); in TEST() 51 EXPECT_TRUE(Set.find(0) == Set.end()); in TEST() 52 EXPECT_TRUE(Set.find(9) == Set.end()); in TEST() 60 EXPECT_TRUE(I == ++Set.find(5)); in TEST() 62 EXPECT_TRUE(I == Set.find(5)); in TEST() 65 I = Set.find(1); in TEST() 68 EXPECT_EQ(5u, *Set.find(5)); in TEST() [all …]
|
/external/v8/src/ast/ |
D | prettyprinter.cc | 50 Find(program); in Print() 55 void CallPrinter::Find(AstNode* node, bool print) { in Find() function in v8::internal::CallPrinter 92 Find(node->expression()); in VisitExpressionStatement() 101 Find(node->statement()); in VisitSloppyBlockFunctionStatement() 106 Find(node->condition()); in VisitIfStatement() 107 Find(node->then_statement()); in VisitIfStatement() 109 Find(node->else_statement()); in VisitIfStatement() 121 Find(node->expression()); in VisitReturnStatement() 126 Find(node->expression()); in VisitWithStatement() 127 Find(node->statement()); in VisitWithStatement() [all …]
|
/external/python/cpython3/Lib/test/test_importlib/frozen/ |
D | test_finder.py | 13 def find(self, name, path=None): member in FindSpecTests 19 spec = self.find(name) 23 spec = self.find('__phello__') 27 spec = self.find('__phello__.spam', ['__phello__']) 37 spec = self.find('<not real>') 50 def find(self, name, path=None): member in FinderTests 56 loader = self.find(name) 60 loader = self.find('__phello__') 64 loader = self.find('__phello__.spam', ['__phello__']) 74 loader = self.find('<not real>')
|
/external/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char16_t/ |
D | find.pass.cpp | 14 // static const char_type* find(const char_type* s, size_t n, const char_type& a); 26 return std::char_traits<char16_t>::find(p, 3, u'1') == p in test_constexpr() 27 && std::char_traits<char16_t>::find(p, 3, u'2') == p + 1 in test_constexpr() 28 && std::char_traits<char16_t>::find(p, 3, u'3') == p + 2 in test_constexpr() 29 && std::char_traits<char16_t>::find(p, 3, u'4') == nullptr; in test_constexpr() 37 assert(std::char_traits<char16_t>::find(s1, 3, char16_t(1)) == s1); in main() 38 assert(std::char_traits<char16_t>::find(s1, 3, char16_t(2)) == s1+1); in main() 39 assert(std::char_traits<char16_t>::find(s1, 3, char16_t(3)) == s1+2); in main() 40 assert(std::char_traits<char16_t>::find(s1, 3, char16_t(4)) == 0); in main() 41 assert(std::char_traits<char16_t>::find(s1, 3, char16_t(0)) == 0); in main() [all …]
|
/external/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char/ |
D | find.pass.cpp | 14 // static const char_type* find(const char_type* s, size_t n, const char_type& a); 26 return std::char_traits<char>::find(p, 3, '1') == p in test_constexpr() 27 && std::char_traits<char>::find(p, 3, '2') == p + 1 in test_constexpr() 28 && std::char_traits<char>::find(p, 3, '3') == p + 2 in test_constexpr() 29 && std::char_traits<char>::find(p, 3, '4') == nullptr; in test_constexpr() 36 assert(std::char_traits<char>::find(s1, 3, char(1)) == s1); in main() 37 assert(std::char_traits<char>::find(s1, 3, char(2)) == s1+1); in main() 38 assert(std::char_traits<char>::find(s1, 3, char(3)) == s1+2); in main() 39 assert(std::char_traits<char>::find(s1, 3, char(4)) == 0); in main() 40 assert(std::char_traits<char>::find(s1, 3, char(0)) == 0); in main() [all …]
|
/external/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char32_t/ |
D | find.pass.cpp | 14 // static const char_type* find(const char_type* s, size_t n, const char_type& a); 26 return std::char_traits<char32_t>::find(p, 3, U'1') == p in test_constexpr() 27 && std::char_traits<char32_t>::find(p, 3, U'2') == p + 1 in test_constexpr() 28 && std::char_traits<char32_t>::find(p, 3, U'3') == p + 2 in test_constexpr() 29 && std::char_traits<char32_t>::find(p, 3, U'4') == nullptr; in test_constexpr() 37 assert(std::char_traits<char32_t>::find(s1, 3, char32_t(1)) == s1); in main() 38 assert(std::char_traits<char32_t>::find(s1, 3, char32_t(2)) == s1+1); in main() 39 assert(std::char_traits<char32_t>::find(s1, 3, char32_t(3)) == s1+2); in main() 40 assert(std::char_traits<char32_t>::find(s1, 3, char32_t(4)) == 0); in main() 41 assert(std::char_traits<char32_t>::find(s1, 3, char32_t(0)) == 0); in main() [all …]
|
/external/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.wchar.t/ |
D | find.pass.cpp | 14 // static const char_type* find(const char_type* s, size_t n, const char_type& a); 26 return std::char_traits<wchar_t>::find(p, 3, L'1') == p in test_constexpr() 27 && std::char_traits<wchar_t>::find(p, 3, L'2') == p + 1 in test_constexpr() 28 && std::char_traits<wchar_t>::find(p, 3, L'3') == p + 2 in test_constexpr() 29 && std::char_traits<wchar_t>::find(p, 3, L'4') == nullptr; in test_constexpr() 36 assert(std::char_traits<wchar_t>::find(s1, 3, wchar_t(1)) == s1); in main() 37 assert(std::char_traits<wchar_t>::find(s1, 3, wchar_t(2)) == s1+1); in main() 38 assert(std::char_traits<wchar_t>::find(s1, 3, wchar_t(3)) == s1+2); in main() 39 assert(std::char_traits<wchar_t>::find(s1, 3, wchar_t(4)) == 0); in main() 40 assert(std::char_traits<wchar_t>::find(s1, 3, wchar_t(0)) == 0); in main() [all …]
|
/external/slf4j/slf4j-migrator/src/test/java/org/slf4j/migrator/ |
D | AternativeApproach.java | 65 assertTrue(m.find()); in test2() 71 assertTrue(m.find()); in test2() 77 assertTrue(m.find()); in test2() 81 assertTrue(m.find()); in test2() 93 assertTrue(m.find()); in test3() 99 assertFalse(m.find()); in test3() 110 assertTrue(m.find()); in test4() 116 assertFalse(m.find()); in test4() 120 assertFalse(m.find()); in test4() 124 assertFalse(m.find()); in test4() [all …]
|
/external/protobuf/src/google/protobuf/stubs/ |
D | stringpiece_unittest.cc | 128 TestMap::iterator new_iter = map.find("zot"); in TEST() 131 new_iter = map.find("bar"); in TEST() 320 EXPECT_EQ(a.find(b), 0); in TEST() 321 EXPECT_EQ(a.find(b, 1), StringPiece::npos); in TEST() 322 EXPECT_EQ(a.find(c), 23); in TEST() 323 EXPECT_EQ(a.find(c, 9), 23); in TEST() 324 EXPECT_EQ(a.find(c, StringPiece::npos), StringPiece::npos); in TEST() 325 EXPECT_EQ(b.find(c), StringPiece::npos); in TEST() 326 EXPECT_EQ(b.find(c, StringPiece::npos), StringPiece::npos); in TEST() 327 EXPECT_EQ(a.find(d), 0); in TEST() [all …]
|