| /third_party/typescript/tests/baselines/reference/ |
| D | exportAlreadySeen.errors.txt | 1 tests/cases/compiler/exportAlreadySeen.ts(2,12): error TS1030: 'export' modifier already seen.
2 tests/cases/compiler/exportAlreadySeen.ts(3,12): error TS1030: 'export' modifier already seen.
3 tests/cases/compiler/exportAlreadySeen.ts(5,12): error TS1030: 'export' modifier already seen.
4 tests/cases/compiler/exportAlreadySeen.ts(6,16): error TS1030: 'export' modifier already seen.
5 tests/cases/compiler/exportAlreadySeen.ts(7,16): error TS1030: 'export' modifier already seen.
6 tests/cases/compiler/exportAlreadySeen.ts(12,12): error TS1030: 'export' modifier already seen.
7 tests/cases/compiler/exportAlreadySeen.ts(13,12): error TS1030: 'export' modifier already seen.
8 tests/cases/compiler/exportAlreadySeen.ts(15,12): error TS1030: 'export' modifier already seen.
9 tests/cases/compiler/exportAlreadySeen.ts(16,16): error TS1030: 'export' modifier already seen.
10 tests/cases/compiler/exportAlreadySeen.ts(17,16): error TS1030: 'export' modifier already seen.
[all …]
|
| D | multipleClassPropertyModifiersErrors.errors.txt | 1 …er/multipleClassPropertyModifiersErrors.ts(2,9): error TS1028: Accessibility modifier already seen.
2 …r/multipleClassPropertyModifiersErrors.ts(3,10): error TS1028: Accessibility modifier already seen.
3 …ompiler/multipleClassPropertyModifiersErrors.ts(4,9): error TS1030: 'static' modifier already seen.
4 …er/multipleClassPropertyModifiersErrors.ts(5,9): error TS1028: Accessibility modifier already seen.
5 …r/multipleClassPropertyModifiersErrors.ts(6,10): error TS1028: Accessibility modifier already seen.
12 !!! error TS1028: Accessibility modifier already seen.
15 !!! error TS1028: Accessibility modifier already seen.
18 !!! error TS1030: 'static' modifier already seen.
21 !!! error TS1028: Accessibility modifier already seen.
24 !!! error TS1028: Accessibility modifier already seen.
|
| D | declareAlreadySeen.errors.txt | 1 tests/cases/compiler/declareAlreadySeen.ts(2,13): error TS1030: 'declare' modifier already seen.
2 tests/cases/compiler/declareAlreadySeen.ts(3,13): error TS1030: 'declare' modifier already seen.
3 tests/cases/compiler/declareAlreadySeen.ts(5,13): error TS1030: 'declare' modifier already seen.
4 tests/cases/compiler/declareAlreadySeen.ts(7,13): error TS1030: 'declare' modifier already seen.
11 !!! error TS1030: 'declare' modifier already seen.
14 !!! error TS1030: 'declare' modifier already seen.
18 !!! error TS1030: 'declare' modifier already seen.
22 !!! error TS1030: 'declare' modifier already seen.
|
| /third_party/spirv-tools/source/opt/ |
| D | types.cpp | 188 size_t Type::ComputeHashValue(size_t hash, SeenTypes* seen) const { in ComputeHashValue()
193 if (std::find(seen->begin(), seen->end(), this) != seen->end()) { in ComputeHashValue()
197 seen->push_back(this); in ComputeHashValue()
207 hash = As##type()->ComputeExtraStateHash(hash, seen); \ in ComputeHashValue()
241 seen->pop_back(); in ComputeHashValue()
246 SeenTypes seen; in HashValue() local
247 return ComputeHashValue(0, &seen); in HashValue()
315 bool Vector::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
319 element_type_->IsSameImpl(vt->element_type_, seen) && in IsSameImpl()
329 size_t Vector::ComputeExtraStateHash(size_t hash, SeenTypes* seen) const { in ComputeExtraStateHash()
[all …]
|
| D | fix_storage_class.cpp | 30 std::set<uint32_t> seen; in Process() local
41 &seen); in Process()
42 assert(seen.empty() && "Seen was not properly reset."); in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
45 assert(seen.empty() && "Seen was not properly reset."); in Process()
54 std::set<uint32_t>* seen) { in PropagateStorageClass() argument
61 if (!seen->insert(inst->result_id()).second) { in PropagateStorageClass()
71 modified |= PropagateStorageClass(use, storage_class, seen); in PropagateStorageClass()
75 seen->erase(inst->result_id()); in PropagateStorageClass()
87 FixInstructionStorageClass(inst, storage_class, seen); in PropagateStorageClass()
[all …]
|
| D | types.h | 121 IsSameCache seen; in IsSame() local
122 return IsSameImpl(that, &seen); in IsSame()
128 virtual bool IsSameImpl(const Type* that, IsSameCache* seen) const = 0;
161 size_t ComputeHashValue(size_t hash, SeenTypes* seen) const;
203 virtual size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const = 0;
233 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
253 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
273 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
294 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
324 size_t ComputeExtraStateHash(size_t hash, SeenTypes* seen) const override;
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | types.cpp | 186 std::unordered_set<const Type*>* seen) const { in GetHashWords()
187 if (!seen->insert(this).second) { in GetHashWords()
201 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
235 seen->erase(this); in GetHashWords()
288 bool Vector::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
292 element_type_->IsSameImpl(vt->element_type_, seen) && in IsSameImpl()
303 std::unordered_set<const Type*>* seen) const { in GetExtraHashWords()
304 element_type_->GetHashWords(words, seen); in GetExtraHashWords()
313 bool Matrix::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
317 element_type_->IsSameImpl(mt->element_type_, seen) && in IsSameImpl()
[all …]
|
| D | fix_storage_class.cpp | 30 std::set<uint32_t> seen; in Process() local
41 &seen); in Process()
42 assert(seen.empty() && "Seen was not properly reset."); in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
45 assert(seen.empty() && "Seen was not properly reset."); in Process()
54 std::set<uint32_t>* seen) { in PropagateStorageClass() argument
61 if (!seen->insert(inst->result_id()).second) { in PropagateStorageClass()
71 modified |= PropagateStorageClass(use, storage_class, seen); in PropagateStorageClass()
75 seen->erase(inst->result_id()); in PropagateStorageClass()
87 FixInstructionStorageClass(inst, storage_class, seen); in PropagateStorageClass()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | types.cpp | 186 std::unordered_set<const Type*>* seen) const { in GetHashWords()
187 if (!seen->insert(this).second) { in GetHashWords()
201 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
235 seen->erase(this); in GetHashWords()
288 bool Vector::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
292 element_type_->IsSameImpl(vt->element_type_, seen) && in IsSameImpl()
303 std::unordered_set<const Type*>* seen) const { in GetExtraHashWords()
304 element_type_->GetHashWords(words, seen); in GetExtraHashWords()
313 bool Matrix::IsSameImpl(const Type* that, IsSameCache* seen) const { in IsSameImpl()
317 element_type_->IsSameImpl(mt->element_type_, seen) && in IsSameImpl()
[all …]
|
| D | fix_storage_class.cpp | 30 std::set<uint32_t> seen; in Process() local
41 &seen); in Process()
42 assert(seen.empty() && "Seen was not properly reset."); in Process()
44 PropagateType(use.first, inst->type_id(), use.second, &seen); in Process()
45 assert(seen.empty() && "Seen was not properly reset."); in Process()
54 std::set<uint32_t>* seen) { in PropagateStorageClass() argument
61 if (!seen->insert(inst->result_id()).second) { in PropagateStorageClass()
71 modified |= PropagateStorageClass(use, storage_class, seen); in PropagateStorageClass()
75 seen->erase(inst->result_id()); in PropagateStorageClass()
87 FixInstructionStorageClass(inst, storage_class, seen); in PropagateStorageClass()
[all …]
|
| /third_party/node/deps/npm/lib/install/ |
| D | is-only-dev.js | 12 function isOnlyDev (node, seen) { argument
13 if (!seen) seen = new Set()
14 return node.requiredBy.length && node.requiredBy.every(andIsOnlyDev(moduleName(node), seen))
23 function andIsOnlyDev (name, seen) { argument
30 if (seen.has(req)) return true
31 seen.add(req)
32 const result = isOnlyDev(req, seen)
33 seen.delete(req)
|
| D | is-only-optional.js | 7 function isOptional (node, seen) { argument
8 if (!seen) seen = new Set()
11 if (seen.has(node) || node.requiredBy.length === 0) {
14 seen.add(node)
18 return isOptDep(req, moduleName(node)) || isOptional(req, seen)
20 seen.delete(node)
|
| D | mutate-into-logical-tree.js | 16 function isDisconnectedCycle (tree, seen) { argument
17 if (!seen) seen = {}
20 } else if (seen[tree.path]) {
23 seen[tree.path] = true
25 return isDisconnectedCycle(node, Object.create(seen))
76 function translateTree_ (tree, seen) { argument
78 if (seen.has(tree)) return pkg
79 seen.add(tree)
84 const dep = pkg.dependencies[moduleName(child)] = translateTree_(child, seen)
|
| /third_party/node/test/fixtures/wpt/url/ |
| D | urlsearchparams-foreach.any.js | 37 const seen = [];
42 seen.push(param);
45 assert_array_equals(seen[0], ["param0", "0"]);
46 assert_array_equals(seen[1], ["param2", "2"]);
52 const seen = [];
58 seen.push(param);
62 assert_array_equals(seen[0], ["param2", "2"]);
68 const seen = [];
70 seen.push(param[0]);
74 assert_array_equals(seen, ["param0", "param2"], "param1 should not have been seen by the loop");
|
| /third_party/selinux/libsepol/src/ |
| D | module.c | 474 unsigned i, seen = 0; in sepol_module_package_read() local
508 if (seen & SEEN_FC) { in sepol_module_package_read()
532 seen |= SEEN_FC; in sepol_module_package_read()
535 if (seen & SEEN_SEUSER) { in sepol_module_package_read()
555 seen |= SEEN_SEUSER; in sepol_module_package_read()
558 if (seen & SEEN_USER_EXTRA) { in sepol_module_package_read()
580 seen |= SEEN_USER_EXTRA; in sepol_module_package_read()
583 if (seen & SEEN_NETFILTER) { in sepol_module_package_read()
607 seen |= SEEN_NETFILTER; in sepol_module_package_read()
610 if (seen & SEEN_MOD) { in sepol_module_package_read()
[all …]
|
| /third_party/jsframework/runtime/main/reactivity/ |
| D | watcher.js | 191 function traverse (val, seen) { argument
193 if (!seen) {
194 seen = seenObjects;
195 seen.clear();
202 if (seen.has(depId)) {
205 seen.add(depId);
210 while (i--) traverse(val[i], seen);
214 while (i--) traverse(val[keys[i]], seen);
|
| /third_party/mesa3d/src/compiler/spirv/ |
| D | spirv_info_c.py | 39 seen = set()
42 if x["value"] not in seen:
43 seen.add(x["value"])
49 seen = set()
54 if x["opcode"] in seen:
60 seen.add(opcode)
|
| /third_party/node/deps/npm/lib/ |
| D | dedupe.js | 118 function remove_ (child, diff, seen, done) { argument
119 if (seen.has(child)) return done()
120 seen.add(child)
124 remove_(child, diff, seen, next)
132 function hoistChildren_ (tree, diff, seen, next) { argument
134 if (seen.has(tree)) return next()
135 seen.add(tree)
137 …rent || child.fromBundle || child.package._inBundle) return hoistChildren_(child, diff, seen, done)
150 [hoistChildren_, child, diff, seen],
|
| D | rebuild.js | 44 function filter (data, args, set, seen) { argument
46 if (!seen) seen = new Set()
48 if (seen.has(data)) return set
49 seen.add(data)
75 filter(dep, args, set, seen)
|
| /third_party/python/Lib/test/ |
| D | audit-tests.py | 23 self.seen = []
38 return [i[0] for i in self.seen]
43 self.seen.append((event, args))
85 assertEqual(hook.seen[0][0], "test_event")
86 assertEqual(hook.seen[0][1], (1, 2, 3))
126 actual = [(a[0], a[1]) for e, a in hook.seen if e == "marshal.dumps"]
129 actual = [a[0] for e, a in hook.seen if e == "marshal.loads"]
132 actual = [e for e, a in hook.seen if e == "marshal.load"]
183 actual = [(a[0], a[1]) for e, a in hook.seen if e == "object.__setattr__"]
213 actual_mode = [(a[0], a[1]) for e, a in hook.seen if e == "open" and a[1]]
[all …]
|
| /third_party/mesa3d/src/util/ |
| D | dag.c | 130 struct set *seen; member
140 if (_mesa_set_search(state->seen, node)) in dag_traverse_bottom_up_node()
157 if (!_mesa_set_search(state->seen, edge->child)) { in dag_traverse_bottom_up_node()
174 _mesa_set_add(state->seen, node); in dag_traverse_bottom_up_node()
183 } while (_mesa_set_search(state->seen, node)); in dag_traverse_bottom_up_node()
198 .seen = _mesa_pointer_set_create(NULL), in dag_traverse_bottom_up()
206 ralloc_free(state.seen); in dag_traverse_bottom_up()
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/scripts/ |
| D | extdependency.py | 60 seen = set()
66 seen.add(node)
68 if x not in seen:
69 seen.add(x)
74 assert x in seen
78 if y not in seen:
79 seen.add(y)
|
| /third_party/python/Lib/importlib/metadata/ |
| D | _itertools.py | 8 seen = set()
9 seen_add = seen.add
11 for element in filterfalse(seen.__contains__, iterable):
17 if k not in seen:
|
| /third_party/ffmpeg/tests/ref/fate/ |
| D | fifo-muxer-tst | 2 pts seen nr: 15
3 pts seen: 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14
7 pts seen nr: 15
8 pts seen: 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 51 std::unordered_set<int> *seen) { in IsReachable() argument
52 seen->insert(from); // we are investigating "from"; don't do it again in IsReachable()
58 } else if (seen->find(edge.to) == seen->end() && // success via edge in IsReachable()
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
93 std::unordered_set<int> seen; in PrintTransitiveClosure() local
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
117 std::unordered_set<int> seen; in CheckTransitiveClosure() local
120 seen.clear(); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
259 std::unordered_set<int> seen; in TEST() local
[all …]
|