Home
last modified time | relevance | path

Searched refs:raw_nodes (Results 1 – 14 of 14) sorted by relevance

/external/cronet/stable/net/cert/
Dct_log_response_parser_unittest.cc117 std::vector<std::string> raw_nodes; in TEST() local
118 raw_nodes.push_back(first); in TEST()
119 raw_nodes.push_back(second); in TEST()
120 raw_nodes.push_back(third); in TEST()
122 base::JSONReader::Read(CreateConsistencyProofJsonString(raw_nodes)); in TEST()
/external/cronet/tot/net/cert/
Dct_log_response_parser_unittest.cc117 std::vector<std::string> raw_nodes; in TEST() local
118 raw_nodes.push_back(first); in TEST()
119 raw_nodes.push_back(second); in TEST()
120 raw_nodes.push_back(third); in TEST()
122 base::JSONReader::Read(CreateConsistencyProofJsonString(raw_nodes)); in TEST()
/external/perfetto/src/trace_processor/importers/proto/
Dmemory_tracker_snapshot_parser.h62 RawMemoryNodeMap& raw_nodes,
66 std::unique_ptr<GlobalNodeGraph> GenerateGraph(RawMemoryNodeMap& raw_nodes);
Dmemory_tracker_snapshot_parser.cc79 RawMemoryNodeMap& raw_nodes, in ReadProtoSnapshot() argument
174 raw_nodes.insert(std::make_pair(pid, std::move(raw_node))); in ReadProtoSnapshot()
179 RawMemoryNodeMap& raw_nodes) { in GenerateGraph() argument
180 auto graph = GraphProcessor::CreateMemoryGraph(raw_nodes); in GenerateGraph()
/external/cronet/tot/net/test/
Dct_test_util.cc358 const std::vector<std::string>& raw_nodes) { in CreateConsistencyProofJsonString() argument
361 for (auto it = raw_nodes.begin(); it != raw_nodes.end(); ++it) { in CreateConsistencyProofJsonString()
365 if (it + 1 != raw_nodes.end()) in CreateConsistencyProofJsonString()
Dct_test_util.h110 const std::vector<std::string>& raw_nodes);
/external/cronet/stable/net/test/
Dct_test_util.cc358 const std::vector<std::string>& raw_nodes) { in CreateConsistencyProofJsonString() argument
361 for (auto it = raw_nodes.begin(); it != raw_nodes.end(); ++it) { in CreateConsistencyProofJsonString()
365 if (it + 1 != raw_nodes.end()) in CreateConsistencyProofJsonString()
Dct_test_util.h110 const std::vector<std::string>& raw_nodes);
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/stable_graph/
Dserialization.rs161 let nodes = &self.raw_nodes()[..self.node_bound()]; in into_serializable()
295 graph.raw_nodes().iter().map(|n| n.weight.as_ref().cloned()), in test_from_deserialized_with_holes()
Dmod.rs519 iter: enumerate(self.raw_nodes()), in node_indices()
749 iter: self.raw_nodes().iter().enumerate(), in externals()
923 for (i, node) in enumerate(self.raw_nodes()) { in filter_map()
985 fn raw_nodes(&self) -> &[Node<Option<N>, Ix>] { in raw_nodes() function
986 self.g.raw_nodes() in raw_nodes()
1110 debug_assert_eq!(self.node_count(), self.raw_nodes().len() - free_node_len); in check_free_lists()
1848 iter: enumerate(self.raw_nodes()), in node_references()
/external/rust/android-crates-io/crates/petgraph/tests/
Dquickcheck.rs147 let num_negs = g.raw_nodes().iter().filter(|n| n.weight < 0).count(); in graph_retain_nodes()
156 let num_negs_post = g.raw_nodes().iter().filter(|n| n.weight < 0).count(); in graph_retain_nodes()
157 let num_pos_post = g.raw_nodes().iter().filter(|n| n.weight >= 0).count(); in graph_retain_nodes()
Dgraph.rs1132 for node in gr.raw_nodes() { in test_weight_iterators()
/external/rust/android-crates-io/crates/petgraph/src/
Dgraphmap.rs620 for node in graph.raw_nodes() { in from_graph()
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/
Dmod.rs1064 pub fn raw_nodes(&self) -> &[Node<N, Ix>] { in raw_nodes() function