| /external/cronet/stable/third_party/libc++/src/test/std/utilities/format/format.arguments/format.arg/ |
| D | visit.return_type.pass.cpp | 34 constexpr ExpectedResultType visited{true}; variable
43 return "visited"; in make_expected_result()
129 test<Context, bool, ExpectedResultType>(true, visited); in test()
130 test<Context, bool, ExpectedResultType>(false, visited); in test()
132 test<Context, bool, std::string>(true, "visited"); in test()
133 test<Context, bool, std::string>(false, "visited"); in test()
137 test<Context, CharT, ExpectedResultType, CharT>('a', visited); in test()
138 test<Context, CharT, ExpectedResultType, CharT>('z', visited); in test()
139 test<Context, CharT, ExpectedResultType, CharT>('0', visited); in test()
140 test<Context, CharT, ExpectedResultType, CharT>('9', visited); in test()
[all …]
|
| /external/cronet/tot/third_party/libc++/src/test/std/utilities/format/format.arguments/format.arg/ |
| D | visit.return_type.pass.cpp | 34 constexpr ExpectedResultType visited{true}; variable
43 return "visited"; in make_expected_result()
129 test<Context, bool, ExpectedResultType>(true, visited); in test()
130 test<Context, bool, ExpectedResultType>(false, visited); in test()
132 test<Context, bool, std::string>(true, "visited"); in test()
133 test<Context, bool, std::string>(false, "visited"); in test()
137 test<Context, CharT, ExpectedResultType, CharT>('a', visited); in test()
138 test<Context, CharT, ExpectedResultType, CharT>('z', visited); in test()
139 test<Context, CharT, ExpectedResultType, CharT>('0', visited); in test()
140 test<Context, CharT, ExpectedResultType, CharT>('9', visited); in test()
[all …]
|
| /external/ComputeLibrary/src/graph/algorithms/ |
| D | TopologicalSort.cpp | 39 /** Checks if all the input dependencies of a node have been visited
42 * @param[in] visited Vector that contains the visited information
44 * @return True if all inputs dependencies have been visited else false
46 inline bool all_inputs_are_visited(const INode *node, const std::vector<bool> &visited) in all_inputs_are_visited() argument
60 if(!visited[input_edge->producer_id()]) in all_inputs_are_visited()
76 // Created visited vector in bfs()
77 std::vector<bool> visited(g.nodes().size(), false); in bfs() local
82 // Push inputs and mark as visited in bfs()
87 visited[input] = true; in bfs()
92 // Push const nodes and mark as visited in bfs()
[all …]
|
| /external/nist-sip/java/gov/nist/javax/sip/header/ims/ |
| D | PVisitedNetworkIDHeader.java | 40 * P-Visited-Network-ID SIP Private Header: RFC 3455.
45 * particular visited network, is the existence of a roaming agreement between the home and
46 * the visited network. There is a need to indicate to the home network which one is the visited
50 * one or more proxies located in the visited network towards the home network
52 * . the visited network includes an identification that is known at the home network
57 * (e.g., different visited networks), a SIP proxy MAY insert a NEW P-Visited-Network-ID header
58 * if the request does not contain a P-Visited-Network-ID header with the same network
65 * P-Visited-Network-ID = "P-Visited-Network-ID" HCOLON
73 * eg: P-Visited-Network-ID: other.net, "Visited network number 1"
87 public final static String NAME = "P-Visited-Network-ID";
[all …]
|
| /external/kotlinx.coroutines/test-utils/jvm/src/ |
| D | FieldWalker.kt | 41 val visited = walkRefs(root, rootStatics) in <lambda>() constant
42 val actual = visited.keys.filter(predicate) in <lambda>()
44 val textDump = actual.joinToString("") { "\n\t" + showPath(it, visited) } in <lambda>()
57 val visited = IdentityHashMap<Any, Ref>() in <lambda>() constant
58 if (root == null) return visited in <lambda>()
59 visited[root] = Ref.RootRef in <lambda>()
66 visit(element, visited, stack, statics) in <lambda>()
69 error("Failed to visit element ${showPath(element, visited)}: $e") in <lambda>()
72 return visited in <lambda>()
75 private fun showPath(element: Any, visited: Map<Any, Ref>): String { in <lambda>()
[all …]
|
| /external/auto/factory/src/main/java/com/google/auto/factory/processor/ |
| D | TypeVariables.java | 51 public ImmutableSet<TypeVariable> visitArray(ArrayType t, Set<Element> visited) { in visitArray() argument
52 return t.getComponentType().accept(this, visited); in visitArray()
56 public ImmutableSet<TypeVariable> visitDeclared(DeclaredType t, Set<Element> visited) { in visitDeclared() argument
57 if (!visited.add(t.asElement())) { in visitDeclared()
62 typeVariables.addAll(typeArgument.accept(this, visited)); in visitDeclared()
68 public ImmutableSet<TypeVariable> visitTypeVariable(TypeVariable t, Set<Element> visited) { in visitTypeVariable() argument
69 if (!visited.add(t.asElement())) { in visitTypeVariable()
74 typeVariables.addAll(t.getLowerBound().accept(this, visited)); in visitTypeVariable()
75 typeVariables.addAll(t.getUpperBound().accept(this, visited)); in visitTypeVariable()
80 public ImmutableSet<TypeVariable> visitUnion(UnionType t, Set<Element> visited) { in visitUnion() argument
[all …]
|
| /external/stg/doc/ |
| D | scc.md | 4 types. Nodes can be visited more than once, and there can even be cycles.
56 simple: the user code must ensure it considers each node as definitively visited
58 means the SCC does not have to independently track "ever visited" status that
66 1. never visited before - the node should immediately transition to open and
77 #### Populate user visited state on open
82 2. visited + open
83 3. visited + not open
85 If a node has never been visited, it can be unconditionally opened. If it has
86 been visited, we must still check if it's open. This is a bit odd in the context
89 a visited node is open or not and then omitting to call `is_open` could upset
[all …]
|
| /external/python/cpython3/Tools/gdb/ |
| D | libpython.py | 33 visited so far in the traversal, to avoid infinite recursion due to cycles in
198 def write_field_repr(self, name, out, visited): argument
204 field_obj.write_repr(out, visited)
250 def proxyval(self, visited): argument
261 visited: a set of all gdb.Value pyobject pointers already visited
289 def write_repr(self, out, visited): argument
297 return out.write(repr(self.proxyval(visited)))
406 def _write_instance_repr(out, visited, name, pyop_attrdict, address): argument
421 out.write(pyop_arg.proxyval(visited))
423 pyop_val.write_repr(out, visited)
[all …]
|
| /external/linux-kselftest/tools/testing/selftests/bpf/map_tests/ |
| D | array_map_batch_ops.c | 40 static void map_batch_verify(int *visited, __u32 max_entries, int *keys, in map_batch_verify() argument
46 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
62 visited[i] = 1; in map_batch_verify()
65 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
72 int map_fd, *keys, *visited; in __test_map_lookup_and_update_batch() local
94 visited = calloc(max_entries, sizeof(*visited)); in __test_map_lookup_and_update_batch()
95 CHECK(!keys || !values || !visited, "malloc()", "error:%s\n", in __test_map_lookup_and_update_batch()
102 map_batch_verify(visited, max_entries, keys, values, is_pcpu); in __test_map_lookup_and_update_batch()
130 map_batch_verify(visited, max_entries, keys, values, is_pcpu); in __test_map_lookup_and_update_batch()
140 free(visited); in __test_map_lookup_and_update_batch()
|
| D | lpm_trie_map_batch_ops.c | 44 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument
51 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify()
58 visited[i] = 1; in map_batch_verify()
61 CHECK(visited[i] != 1, "visited checking", in map_batch_verify()
70 int map_fd, *values, *visited; in test_lpm_trie_map_batch_ops() local
88 visited = malloc(max_entries * sizeof(int)); in test_lpm_trie_map_batch_ops()
89 CHECK(!keys || !values || !visited, "malloc()", "error:%s\n", in test_lpm_trie_map_batch_ops()
95 map_batch_verify(visited, max_entries, keys, values); in test_lpm_trie_map_batch_ops()
120 map_batch_verify(visited, max_entries, keys, values); in test_lpm_trie_map_batch_ops()
153 free(visited); in test_lpm_trie_map_batch_ops()
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | algorithm.cc | 42 std::vector<bool> visited(g.num_node_ids(), false); in DFSFromHelper() local
53 if (visited[n->id()]) continue; in DFSFromHelper()
54 visited[n->id()] = true; in DFSFromHelper()
60 auto add_work = [&visited, &stack](Node* out) { in DFSFromHelper()
61 if (!visited[out->id()]) { in DFSFromHelper()
62 // Note; we must not mark as visited until we actually process it. in DFSFromHelper()
139 std::vector<bool> visited(g.num_node_ids(), false); in ReverseDFSFromHelper() local
150 if (visited[n->id()]) continue; in ReverseDFSFromHelper()
151 visited[n->id()] = true; in ReverseDFSFromHelper()
157 auto add_work = [&visited, &stack](T out) { in ReverseDFSFromHelper()
[all …]
|
| /external/eigen/Eigen/src/MetisSupport/ |
| D | MetisSupport.h | 37 IndexVector visited(m); in get_symmetrized_graph()
38 visited.setConstant(-1); in get_symmetrized_graph()
42 visited(j) = j; // Do not include the diagonal element in get_symmetrized_graph()
47 if (visited(idx) != j ) in get_symmetrized_graph()
49 visited(idx) = j; in get_symmetrized_graph()
57 if(visited(idx) != j) in get_symmetrized_graph()
59 visited(idx) = j; in get_symmetrized_graph()
69 visited.setConstant(-1); in get_symmetrized_graph()
75 visited(j) = j; // Do not include the diagonal element in get_symmetrized_graph()
80 if (visited(idx) != j ) in get_symmetrized_graph()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/linear/ |
| D | FieldVectorChangingVisitor.java | 23 * interface may alter the entries of the vector being visited.
31 * visited.
34 * @param start the index of the first entry to be visited
35 * @param end the index of the last entry to be visited (inclusive)
42 * @param index the index of the entry being visited
43 * @param value the value of the entry being visited
44 * @return the new value of the entry being visited
50 * visited.
|
| D | RealVectorChangingVisitor.java | 21 * interface may alter the entries of the vector being visited.
28 * visited.
31 * @param start the index of the first entry to be visited
32 * @param end the index of the last entry to be visited (inclusive)
39 * @param index the index of the entry being visited
40 * @param value the value of the entry being visited
41 * @return the new value of the entry being visited
47 * visited.
|
| D | FieldVectorPreservingVisitor.java | 23 * interface do not alter the entries of the vector being visited.
31 * visited.
34 * @param start the index of the first entry to be visited
35 * @param end the index of the last entry to be visited (inclusive)
42 * @param index the index of the entry being visited
43 * @param value the value of the entry being visited
49 * visited.
|
| D | RealVectorPreservingVisitor.java | 21 * interface do not alter the entries of the vector being visited.
28 * visited.
31 * @param start the index of the first entry to be visited
32 * @param end the index of the last entry to be visited (inclusive)
39 * @param index the index of the entry being visited
40 * @param value the value of the entry being visited
46 * visited.
|
| /external/harfbuzz_ng/src/OT/Var/VARC/ |
| D | VARC.hh | 50 hb_set_t *visited,
64 hb_set_t *visited, in get_path_at()
75 visited, edges_left, depth_left, cache); in get_path_at()
94 hb_set_t *visited = nullptr, in get_path_at()
99 if (visited == nullptr) in get_path_at()
100 visited = &stack_set; in get_path_at()
127 if (visited->has (glyph) || visited->in_error ()) in get_path_at()
129 visited->add (glyph); in get_path_at()
140 visited, edges_left, depth_left, in get_path_at()
145 visited->del (glyph); in get_path_at()
|
| /external/rust/android-crates-io/crates/petgraph/src/algo/ |
| D | simple_paths.rs | 60 // list of visited nodes in all_simple_paths()
61 let mut visited: IndexSet<G::NodeId> = IndexSet::from_iter(Some(from)); in all_simple_paths() localVariable
63 // last elem is list of childs of last visited node in all_simple_paths()
69 if visited.len() < max_length { in all_simple_paths()
71 if visited.len() >= min_length { in all_simple_paths()
72 let path = visited in all_simple_paths()
79 } else if !visited.contains(&child) { in all_simple_paths()
80 visited.insert(child); in all_simple_paths()
84 if (child == to || children.any(|v| v == to)) && visited.len() >= min_length { in all_simple_paths()
85 let path = visited in all_simple_paths()
[all …]
|
| /external/aws-sdk-java-v2/codegen/src/test/resources/software/amazon/awssdk/codegen/poet/eventstream/ |
| D | test-response-handler.java | 82 * Event being visited
93 * Event being visited
104 * Event being visited
115 * Event being visited
128 … * Callback to invoke when either an unknown event is visited or an unhandled event is visited.
142 * Callback to invoke when a {@link EventOne} is visited.
151 * Callback to invoke when a {@link EventTwo} is visited.
160 * Callback to invoke when a {@link EventOne} is visited.
169 * Callback to invoke when a {@link LegacyEventThree} is visited.
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | EndpointPairIterator.java | 69 * If the graph is directed, each ordered [source, target] pair will be visited once if there is
94 * visited twice if there is an edge connecting them. To avoid returning duplicate {@link
95 * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint
96 * pairs, we skip if the "other node" is in the visited set, as shown below:
104 * Visited Nodes = {}
107 * Visited Nodes = {N1}
110 * Visited Nodes = {N1, N2}
113 * Visited Nodes = {N1, N2, N3}
115 * Visited Nodes = {N1, N2, N3, N4}
143 // Add to visited set *after* processing neighbors so we still include self-loops. in computeNext()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | EndpointPairIterator.java | 69 * If the graph is directed, each ordered [source, target] pair will be visited once if there is
94 * visited twice if there is an edge connecting them. To avoid returning duplicate {@link
95 * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint
96 * pairs, we skip if the "other node" is in the visited set, as shown below:
104 * Visited Nodes = {}
107 * Visited Nodes = {N1}
110 * Visited Nodes = {N1, N2}
113 * Visited Nodes = {N1, N2, N3}
115 * Visited Nodes = {N1, N2, N3, N4}
143 // Add to visited set *after* processing neighbors so we still include self-loops. in computeNext()
|
| /external/jackson-databind/src/main/java/com/fasterxml/jackson/databind/jsonFormatVisitors/ |
| D | JsonFormatVisitorWrapper.java | 17 * @param type Declared type of visited property (or List element) in Java
22 * @param type Declared type of visited property (or List element) in Java
27 * @param type Declared type of visited property (or List element) in Java
32 * @param type Declared type of visited property (or List element) in Java
37 * @param type Declared type of visited property (or List element) in Java
42 * @param type Declared type of visited property (or List element) in Java
47 * @param type Declared type of visited property (or List element) in Java
52 * @param type Declared type of visited property (or List element) in Java
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | call_graph_test.cc | 376 // Visit the graph and verify nodes were visited in callee-before-caller in TEST_F()
378 std::vector<const HloComputation*> visited; in TEST_F() local
379 TF_ASSERT_OK(call_graph->VisitNodes([&visited](const CallGraphNode& node) { in TEST_F()
380 visited.push_back(node.computation()); in TEST_F()
383 EXPECT_EQ(visited.size(), 5); in TEST_F()
384 // All values in visited should be unique. in TEST_F()
386 absl::flat_hash_set<const HloComputation*>(visited.begin(), visited.end()) in TEST_F()
391 auto index_of = [&visited](const HloComputation* comp) { in TEST_F()
392 auto it = absl::c_find(visited, comp); in TEST_F()
393 EXPECT_NE(it, visited.end()); in TEST_F()
[all …]
|
| /external/libaom/tools/txfm_analyzer/ |
| D | txfm_gen_code.cc | 239 if (node->visited == 0) { in node_to_code_sse2()
240 node->visited = 1; in node_to_code_sse2()
249 partnerNode->visited = 1; in node_to_code_sse2()
257 partnerNode->visited = 1; in node_to_code_sse2()
264 int visited[65][65][2][2]; in gen_cospi_list_sse2() local
265 memset(visited, 0, sizeof(visited)); in gen_cospi_list_sse2()
276 if (node0->visited == 0) { in gen_cospi_list_sse2()
277 node0->visited = 1; in gen_cospi_list_sse2()
291 if (!visited[idx0][idx1][sgn0][sgn1]) { in gen_cospi_list_sse2()
292 visited[idx0][idx1][sgn0][sgn1] = 1; in gen_cospi_list_sse2()
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Analysis/ |
| D | CodeMetrics.cpp | 28 SmallPtrSetImpl<const Value *> &Visited, in appendSpeculatableOperands() argument
35 if (Visited.insert(Operand).second) in appendSpeculatableOperands()
41 static void completeEphemeralValues(SmallPtrSetImpl<const Value *> &Visited, in completeEphemeralValues() argument
54 assert(Visited.count(V) && in completeEphemeralValues()
55 "Failed to add a worklist entry to our visited set!"); in completeEphemeralValues()
65 appendSpeculatableOperands(V, Visited, Worklist); in completeEphemeralValues()
73 SmallPtrSet<const Value *, 32> Visited; in collectEphemeralValues() local
88 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
91 completeEphemeralValues(Visited, Worklist, EphValues); in collectEphemeralValues()
97 SmallPtrSet<const Value *, 32> Visited; in collectEphemeralValues() local
[all …]
|