Searched defs:seen (Results 1 - 25 of 84) sorted by relevance

1234

/external/pdfium/core/fxcrt/
H A Dfx_random_unittest.cpp18 std::set<std::array<uint32_t, 16>> seen; local
22 EXPECT_TRUE(seen.insert(current).second);
/external/libevent/test/
H A Dregress_testutils.h36 int seen; member in struct:regress_dns_server_table
/external/google-breakpad/src/client/linux/minidump_writer/
H A Ddirectory_reader_unittest.cc63 unsigned seen = 0; local
68 seen++;
76 ASSERT_EQ(dent_set.size(), seen);
/external/libchrome/base/files/
H A Ddir_reader_posix_unittest.cc48 std::set<unsigned> seen; local
75 EXPECT_EQ(0u, seen.count(value));
76 seen.insert(value);
92 EXPECT_EQ(kNumFiles, seen.size());
/external/tensorflow/tensorflow/core/lib/core/
H A Dbitmap_test.cc82 int seen = 0; local
88 seen++;
91 EXPECT_EQ(seen, n - one_count) << " " << bitmap.ToString();
112 int seen = 0; local
118 seen++;
122 EXPECT_EQ(seen, zero_bits) << " " << bitmap.ToString();
/external/turbine/java/com/google/turbine/binder/env/
H A DLazyEnv.java45 private final LinkedHashSet<S> seen = new LinkedHashSet<>(); field in class:LazyEnv
69 if (!seen.add(sym)) {
70 throw new LazyBindingError(Joiner.on(" -> ").join(seen) + " -> " + sym);
73 seen.remove(sym);
/external/valgrind/coregrind/m_demangle/
H A Drust-demangle.c164 char seen[16]; local
172 memset (seen, 0, sizeof(seen));
175 seen[*str - '0'] = 1;
177 seen[*str - 'a' + 10] = 1;
181 /* Count how many distinct digits seen */
184 if (seen[i])
/external/caliper/caliper/src/main/java/com/google/caliper/memory/
H A DObjectExplorer.java176 private final Set<Object> seen = Collections.newSetFromMap( field in class:ObjectExplorer.AtMostOncePredicate
180 return seen.add(chain.getValue());
/external/jemalloc/test/unit/
H A Dckh.c157 bool seen[NITEMS]; local
160 memset(seen, 0, sizeof(seen));
169 assert_false(seen[k],
170 "Item %zu already seen", k);
171 seen[k] = true;
178 assert_true(seen[j], "Item %zu not seen", j);
180 assert_false(seen[j], "Item %zu seen",
[all...]
/external/perfetto/src/traced/probes/filesystem/
H A Dfile_scanner_unittest.cc99 uint64_t seen = 0; local
102 [&seen](BlockDeviceID, Inode, const std::string&,
104 ++seen;
112 EXPECT_EQ(seen, 1u);
117 uint64_t seen = 0; local
120 [&seen](BlockDeviceID, Inode, const std::string&,
122 ++seen;
132 EXPECT_EQ(seen, 1u);
/external/strace/tests/
H A Dpoll.c112 unsigned int *const seen,
115 if (!pfd->revents || pfd->fd < 0 || *seen > abbrev)
118 if (*seen)
120 ++(*seen);
122 if (*seen > abbrev) {
156 unsigned int seen = 0; local
159 print_pollfd_exiting(&pfd[i], &seen, abbrev);
111 print_pollfd_exiting(const struct pollfd *const pfd, unsigned int *const seen, const unsigned int abbrev) argument
/external/strace/tests-m32/
H A Dpoll.c112 unsigned int *const seen,
115 if (!pfd->revents || pfd->fd < 0 || *seen > abbrev)
118 if (*seen)
120 ++(*seen);
122 if (*seen > abbrev) {
156 unsigned int seen = 0; local
159 print_pollfd_exiting(&pfd[i], &seen, abbrev);
111 print_pollfd_exiting(const struct pollfd *const pfd, unsigned int *const seen, const unsigned int abbrev) argument
/external/strace/tests-mx32/
H A Dpoll.c112 unsigned int *const seen,
115 if (!pfd->revents || pfd->fd < 0 || *seen > abbrev)
118 if (*seen)
120 ++(*seen);
122 if (*seen > abbrev) {
156 unsigned int seen = 0; local
159 print_pollfd_exiting(&pfd[i], &seen, abbrev);
111 print_pollfd_exiting(const struct pollfd *const pfd, unsigned int *const seen, const unsigned int abbrev) argument
/external/tensorflow/tensorflow/core/common_runtime/
H A Ddevice_set.cc76 std::set<string> seen; local
79 if (seen.insert(t).second) {
/external/toybox/toys/posix/
H A Dprintf.c86 int seen = 0; local
110 seen = sprintf(to, "*.*%c", c);;
142 if (!seen || !*arg) break;
/external/elfutils/libdwfl/
H A Ddwfl_frame.c306 bool seen; local
316 if (! oa->seen && INTUSE(dwfl_thread_tid) (thread) == oa->tid)
318 oa->seen = true;
367 .arg = arg, .seen = false };
370 if (err == DWARF_CB_ABORT && oa.seen)
373 if (err == DWARF_CB_OK && ! oa.seen)
/external/perfetto/tools/ftrace_proto_gen/
H A Dftrace_proto_gen.cc154 std::set<std::string> seen; local
160 if (name == "" || seen.count(name))
162 seen.insert(name);
/external/python/cpython2/Lib/
H A Dpkgutil.py100 def seen(p, m={}): function in function:walk_packages
122 # don't traverse path items we've seen before
123 path = [p for p in path if not seen(p)]
/external/fio/
H A Dio_u.h87 unsigned int seen; member in union:io_u::__anon7170
/external/googletest/googlemock/src/
H A Dgmock-matchers.cc208 // 'seen' is used for path finding { 0: unseen, 1: seen }.
209 ::std::vector<char> seen; local
227 // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
228 seen.assign(graph_->RhsSize(), 0);
229 TryAugment(ilhs, &seen);
247 // flow was added to the network. The 'seen' vector elements correspond
259 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { argument
261 if ((*seen)[irhs])
266 (*seen)[irh
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DICUCurrencyMetaInfo.java180 private Set<T> seen = new HashSet<T>(); field in class:ICUCurrencyMetaInfo.UniqueList
188 if (!seen.contains(value)) {
190 seen.add(value);
/external/icu/icu4j/main/classes/currdata/src/com/ibm/icu/impl/
H A DICUCurrencyMetaInfo.java178 private Set<T> seen = new HashSet<T>(); field in class:ICUCurrencyMetaInfo.UniqueList
186 if (!seen.contains(value)) {
188 seen.add(value);
/external/llvm/lib/Transforms/Scalar/
H A DFloat2Int.cpp43 // If a non-mappable instruction is seen, this entire def-use graph is marked
140 ConstantRange Float2IntPass::seen(Instruction *I, ConstantRange R) { function in class:Float2IntPass
190 seen(I, badRange());
198 seen(I, validateRange(ConstantRange(Min, Max)));
207 seen(I, validateRange(ConstantRange(SMin, SMax)));
217 seen(I, unknownRange());
229 seen(I, badRange());
235 // Walk forwards down the list of seen instructions, so we visit defs before
297 "def not seen before use!");
317 seen(
[all...]
/external/python/cpython3/Lib/
H A Dpkgutil.py82 def seen(p, m={}): function in function:walk_packages
104 # don't traverse path items we've seen before
105 path = [p for p in path if not seen(p)]
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
H A Dgraphcycles_test.cc44 std::unordered_set<int> *seen) {
45 seen->insert(from); // we are investigating "from"; don't do it again
52 } else if (seen->find(edge->to) == seen->end() && // success via edge
53 IsReachable(edges, edge->to, to, seen)) {
99 std::unordered_set<int> seen; local
100 if (IsReachable(edges, a, b, &seen)) {
125 std::unordered_set<int> seen; local
128 seen.clear();
133 bool reachable = IsReachable(edges, a, b, &seen);
43 IsReachable(Edges *edges, int from, int to, std::unordered_set<int> *seen) argument
276 std::unordered_set<int> seen; local
305 std::unordered_set<int> seen; local
[all...]

Completed in 843 milliseconds

1234