| /third_party/mindspore/tests/ut/cpp/dataset/ |
| D | subset_random_sampler_test.cc | 42 std::unordered_set<int64_t> in_set(in.begin(), in.end()); in TEST_F() local
60 ASSERT_NE(in_set.find(out[i]), in_set.end()); in TEST_F()
99 std::unordered_set<int64_t> in_set(in.begin(), in.end()); in TEST_F() local
117 ASSERT_NE(in_set.find(out[i]), in_set.end()); in TEST_F()
132 ASSERT_NE(in_set.find(out[i]), in_set.end()); in TEST_F()
|
| D | subset_sampler_test.cc | 42 std::unordered_set<int64_t> in_set(in.begin(), in.end()); in TEST_F() local
100 std::unordered_set<int64_t> in_set(in.begin(), in.end()); in TEST_F() local
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/ |
| D | enum_set.h | 95 bool HasAnyOf(const EnumSet<EnumType>& in_set) const { in HasAnyOf() argument
96 if (in_set.IsEmpty()) return true; in HasAnyOf()
98 if (mask_ & in_set.mask_) in HasAnyOf()
101 if (!overflow_ || !in_set.overflow_) in HasAnyOf()
104 for (uint32_t item : *in_set.overflow_) { in HasAnyOf()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/ |
| D | enum_set.h | 123 bool HasAnyOf(const EnumSet<EnumType>& in_set) const { in HasAnyOf() argument
124 if (in_set.IsEmpty()) return true; in HasAnyOf()
126 if (mask_ & in_set.mask_) return true; in HasAnyOf()
128 if (!overflow_ || !in_set.overflow_) return false; in HasAnyOf()
130 for (uint32_t item : *in_set.overflow_) { in HasAnyOf()
|
| /third_party/spirv-tools/source/ |
| D | enum_set.h | 123 bool HasAnyOf(const EnumSet<EnumType>& in_set) const { in HasAnyOf() argument
124 if (in_set.IsEmpty()) return true; in HasAnyOf()
126 if (mask_ & in_set.mask_) return true; in HasAnyOf()
128 if (!overflow_ || !in_set.overflow_) return false; in HasAnyOf()
130 for (uint32_t item : *in_set.overflow_) { in HasAnyOf()
|
| /third_party/skia/third_party/externals/spirv-tools/source/ |
| D | enum_set.h | 123 bool HasAnyOf(const EnumSet<EnumType>& in_set) const { in HasAnyOf() argument
124 if (in_set.IsEmpty()) return true; in HasAnyOf()
126 if (mask_ & in_set.mask_) return true; in HasAnyOf()
128 if (!overflow_ || !in_set.overflow_) return false; in HasAnyOf()
130 for (uint32_t item : *in_set.overflow_) { in HasAnyOf()
|
| /third_party/boost/boost/xpressive/detail/core/matcher/ |
| D | set_matcher.hpp | 64 bool in_set(Traits const &tr, char_type ch) const in in_set() function
74 if(state.eos() || this->not_ == this->in_set(traits_cast<Traits>(state), *state.cur_)) in match()
|
| /third_party/boost/boost/spirit/home/x3/support/ |
| D | no_case.hpp | 22 bool in_set(Char ch, CharSet const& set) in in_set() function
44 bool in_set(Char ch_, CharSet const& set) in in_set() function
|
| /third_party/musl/src/stdio/ |
| D | vfwscanf.c | 56 static int in_set(const wchar_t *set, int c) in in_set() function
257 if (in_set(set, c) == invert) in vfwscanf()
|
| /third_party/boost/boost/spirit/home/x3/char/ |
| D | char_set.hpp | 99 return get_case_compare<encoding>(context).in_set(ch_, chset); in test()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 306 struct in_set { struct
307 in_set(const NodeSet &S) : NS(S) {} in in_set() function
663 NodeVect::iterator NewE = remove_if(Nodes, in_set(Erase)); in common()
|
| /third_party/glib/gobject/tests/ |
| D | signals.c | 1353 in_set (const gchar *s, in in_set() function
1412 g_assert_true (in_set (name, names)); in test_introspection()
|
| /third_party/curl/lib/ |
| D | urldata.h | 1627 void *in_set; /* CURLOPT_READDATA */ member
|
| D | transfer.c | 1393 data->state.in = data->set.in_set; in Curl_init_CONNECT()
|
| D | setopt.c | 1286 data->set.in_set = va_arg(param, void *); in Curl_vsetopt()
|
| D | url.c | 495 set->in_set = stdin; /* default input from stdin */ in Curl_init_userdefined()
|