Home
last modified time | relevance | path

Searched refs:num_edges (Results 1 – 21 of 21) sorted by relevance

/external/cronet/base/substring_set_matcher/
Dsubstring_set_matcher.cc263 for (unsigned edge_idx = 0; edge_idx < root->num_edges(); ++edge_idx) { in CreateFailureAndOutputEdges()
283 for (unsigned edge_idx = 0; edge_idx < current_node->num_edges(); in CreateFailureAndOutputEdges()
387 for (unsigned edge_idx = 0; edge_idx < num_edges(); edge_idx += 4) { in GetEdgeNoInline()
407 for (unsigned edge_idx = 0; edge_idx < num_edges(); ++edge_idx) { in GetEdgeNoInline()
422 for (unsigned edge_idx = 0; edge_idx < num_edges(); ++edge_idx) { in SetEdge()
429 edges_.inline_edges[num_edges()] = AhoCorasickEdge{label, node}; in SetEdge()
436 edges_.inline_edges[0] = edges_.inline_edges[num_edges()]; in SetEdge()
437 edges_.inline_edges[num_edges()] = temp; in SetEdge()
468 edges_.edges[num_edges()] = AhoCorasickEdge{label, node}; in SetEdge()
471 std::swap(edges_.edges[0], edges_.edges[num_edges()]); in SetEdge()
Dsubstring_set_matcher.h234 size_t num_edges() const { in num_edges() function
/external/google-fruit/include/fruit/impl/data_structures/
Dsemistatic_graph.templates.h85 std::size_t num_edges = 0; in SemistaticGraph() local
93 ++num_edges; in SemistaticGraph()
117 edges_storage = FixedSizeVector<InternalNodeId>(num_edges + 1); in SemistaticGraph()
/external/freetype/src/autofit/
Dafhints.c209 if ( axis->num_edges < AF_EDGES_EMBEDDED ) in af_axis_hints_new_edge()
217 else if ( axis->num_edges >= axis->max_edges ) in af_axis_hints_new_edge()
251 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
268 axis->num_edges++; in af_axis_hints_new_edge()
682 AF_Edge limit = edges + axis->num_edges; in af_glyph_hints_dump_edges()
703 if ( axis->num_edges ) in af_glyph_hints_dump_edges()
825 axis->num_edges = 0; in af_glyph_hints_done()
877 hints->axis[0].num_edges = 0; in af_glyph_hints_reload()
879 hints->axis[1].num_edges = 0; in af_glyph_hints_reload()
1396 AF_Edge edge_limit = FT_OFFSET( edges, axis->num_edges ); in af_glyph_hints_align_strong_points()
Dafcjk.c1017 axis->num_edges = 0; in af_cjk_hints_compute_edges()
1053 for ( ee = 0; ee < axis->num_edges; ee++ ) in af_cjk_hints_compute_edges()
1158 AF_Edge edge_limit = FT_OFFSET( edges, axis->num_edges ); in af_cjk_hints_compute_edges()
1296 AF_Edge edge_limit = FT_OFFSET( edge, axis->num_edges ); in af_cjk_hints_compute_blue_edges()
1805 AF_Edge edge_limit = FT_OFFSET( edges, axis->num_edges ); in af_cjk_hint_edges()
2184 AF_Edge edge_limit = FT_OFFSET( edges, axis->num_edges ); in af_cjk_align_edge_points()
Dafhints.h315 FT_UInt num_edges; /* number of used edges */ member
Dafloader.c429 if ( axis->num_edges > 1 && AF_HINTS_DO_ADVANCE( hints ) ) in af_loader_load_glyph()
433 axis->num_edges - 1; /* rightmost edge */ in af_loader_load_glyph()
Daflatin.c2149 axis->num_edges = 0; in af_latin_hints_compute_edges()
2223 for ( ee = 0; ee < axis->num_edges; ee++ ) in af_latin_hints_compute_edges()
2287 for ( ee = 0; ee < axis->num_edges; ee++ ) in af_latin_hints_compute_edges()
2336 AF_Edge edge_limit = FT_OFFSET( edges, axis->num_edges ); in af_latin_hints_compute_edges()
2503 AF_Edge edge_limit = FT_OFFSET( edge, axis->num_edges ); in af_latin_hints_compute_blue_edges()
2997 AF_Edge edge_limit = FT_OFFSET( edges, axis->num_edges ); in af_latin_hint_edges()
/external/rappor/analysis/cpp/
Dfind_cliques.cc457 int num_edges = 0; in ParseGraph() local
464 log("Read %d edges", num_edges); in ParseGraph()
491 num_edges++; in ParseGraph()
/external/deqp-deps/SPIRV-Tools/source/val/
Dvalidate_cfg.cpp89 size_t num_edges = num_in_ops / 2; in ValidatePhi() local
90 if (num_edges != pred_ids.size()) { in ValidatePhi()
92 << "OpPhi's number of incoming blocks (" << num_edges in ValidatePhi()
/external/tensorflow/tensorflow/core/common_runtime/
Dgraph_constructor_test.cc937 EXPECT_EQ(1, graph_.num_edges()); in TEST_F()
981 EXPECT_EQ(9, graph_.num_edges()); in TEST_F()
1013 EXPECT_EQ(17, graph_.num_edges()); in TEST_F()
2450 EXPECT_EQ(3, graph_.num_edges()); in TEST_F()
2464 EXPECT_EQ(3, graph_.num_edges()); \ in TEST_F()
Dfunction_utils.cc79 << g->num_edges(); in DumpGraph()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dmeta_optimizer.cc84 int64_t num_edges = 0; in NumEdges() local
86 num_edges += node.input_size(); in NumEdges()
88 return num_edges; in NumEdges()
/external/angle/third_party/vulkan-deps/spirv-tools/src/source/val/
Dvalidate_cfg.cpp87 size_t num_edges = num_in_ops / 2; in ValidatePhi() local
88 if (num_edges != pred_ids.size()) { in ValidatePhi()
90 << "OpPhi's number of incoming blocks (" << num_edges in ValidatePhi()
/external/swiftshader/third_party/SPIRV-Tools/source/val/
Dvalidate_cfg.cpp90 size_t num_edges = num_in_ops / 2; in ValidatePhi() local
91 if (num_edges != pred_ids.size()) { in ValidatePhi()
93 << "OpPhi's number of incoming blocks (" << num_edges in ValidatePhi()
/external/freetype/src/sdf/
Dftsdf.c1389 FT_UInt num_edges = 0; in sdf_shape_dump() local
1403 FT_TRACE5(( " %3d: ", num_edges )); in sdf_shape_dump()
1436 num_edges++; in sdf_shape_dump()
/external/tensorflow/tensorflow/core/graph/
Dgraph.h635 int num_edges() const { return num_edges_; } in num_edges() function
Dgraph_test.cc85 EXPECT_EQ(edges, graph_.num_edges()); in VerifyGraphStats()
Dgraph.cc480 edges_.reserve(src.num_edges()); in Copy()
/external/freetype/docs/oldlogs/
DChangeLog.2107440 after checking `axis->num_edges > 1'. `edge1 != NULL' can be assumed.
DChangeLog.21773 <FT_GLYPH_FORMAT_OUTLINE>: Assure axis->num_edges > 1. This fixes