| /third_party/boost/boost/icl/type_traits/ |
| D | succ_pred.hpp | 44 struct predecessor<DomainT, true> struct
46 typedef predecessor type;
47 inline static DomainT apply(DomainT value){ return --value; } in apply()
51 struct predecessor<DomainT, false> struct
53 typedef predecessor type;
54 inline static DomainT apply(DomainT value){ return ++value; } in apply()
70 struct predecessor struct
72 inline static DomainT apply(DomainT value) in apply()
|
| /third_party/boost/boost/graph/distributed/ |
| D | delta_stepping_shortest_paths.hpp | 135 PredecessorMap predecessor; member in boost::graph::distributed::delta_stepping_impl
168 PredecessorMap predecessor, in delta_stepping_impl()
188 PredecessorMap predecessor, in delta_stepping_impl()
472 PredecessorMap predecessor, DistanceMap distance, EdgeWeightMap weight, in delta_stepping_shortest_paths()
495 PredecessorMap predecessor, DistanceMap distance, EdgeWeightMap weight) in delta_stepping_shortest_paths()
|
| D | eager_dijkstra_shortest_paths.hpp | 346 PredecessorMap predecessor, DistanceMap distance, in eager_dijkstra_shortest_paths()
398 PredecessorMap predecessor, DistanceMap distance, in eager_dijkstra_shortest_paths()
424 PredecessorMap predecessor, DistanceMap distance, in eager_dijkstra_shortest_paths()
|
| D | crauser_et_al_shortest_paths.hpp | 538 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in crauser_et_al_shortest_paths()
618 PredecessorMap predecessor, DistanceMap distance, WeightMap weight) in crauser_et_al_shortest_paths()
641 PredecessorMap predecessor, DistanceMap distance) in crauser_et_al_shortest_paths()
|
| D | dijkstra_shortest_paths.hpp | 174 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| D | transformation_replace_opselect_with_conditional_branch.cpp | 88 auto predecessor = ir_context->get_instr_block(pred_id); in IsApplicable() local
107 auto predecessor = in Apply() local
|
| D | fuzzer_pass_replace_opselects_with_conditional_branches.cpp | 163 auto predecessor = GetIRContext()->get_instr_block( in InstructionNeedsSplitBefore() local
|
| /third_party/spirv-tools/source/fuzz/ |
| D | transformation_replace_opselect_with_conditional_branch.cpp | 88 auto predecessor = ir_context->get_instr_block(pred_id); in IsApplicable() local
107 auto predecessor = in Apply() local
|
| D | fuzzer_pass_replace_opselects_with_conditional_branches.cpp | 162 auto predecessor = GetIRContext()->get_instr_block( in InstructionNeedsSplitBefore() local
|
| D | fuzzer_pass_add_opphi_synonyms.cpp | 277 auto predecessor = fuzzerutil::MaybeFindBlock(GetIRContext(), pred_id); in GetSuitableIds() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | transformation_replace_opselect_with_conditional_branch.cpp | 88 auto predecessor = ir_context->get_instr_block(pred_id); in IsApplicable() local
107 auto predecessor = in Apply() local
|
| D | fuzzer_pass_replace_opselects_with_conditional_branches.cpp | 163 auto predecessor = GetIRContext()->get_instr_block( in InstructionNeedsSplitBefore() local
|
| /third_party/boost/boost/graph/ |
| D | dijkstra_shortest_paths.hpp | 330 SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, in dijkstra_shortest_paths_no_init()
348 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths_no_init()
361 SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, in dijkstra_shortest_paths_no_init()
396 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths_no_init()
410 SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, in dijkstra_shortest_paths()
428 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths()
444 SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, in dijkstra_shortest_paths()
474 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths()
487 SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, in dijkstra_shortest_paths()
501 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths()
|
| D | prim_minimum_spanning_tree.hpp | 52 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in prim_minimum_spanning_tree()
|
| D | astar_search.hpp | 256 AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, in astar_search_no_init()
295 AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, in astar_search_no_init_tree()
357 AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, in astar_search()
388 AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, in astar_search_tree()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | if_conversion.cpp | 215 uint32_t predecessor) { in GetIncomingBlock()
221 uint32_t predecessor) { in GetIncomingValue()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | if_conversion.cpp | 215 uint32_t predecessor) { in GetIncomingBlock()
221 uint32_t predecessor) { in GetIncomingValue()
|
| /third_party/spirv-tools/source/opt/ |
| D | if_conversion.cpp | 214 uint32_t predecessor) { in GetIncomingBlock()
220 uint32_t predecessor) { in GetIncomingValue()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | NFRule.java | 133 NFRule predecessor, in makeRules()
416 NFRule predecessor) { in extractSubstitutions()
462 NFRule predecessor) { in extractSubstitution()
|
| D | NFRuleSet.java | 167 NFRule predecessor = null; in parseRules() local
185 this, predecessor, owner, tempRules); in parseRules() local
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | NFRule.java | 134 NFRule predecessor, in makeRules()
417 NFRule predecessor) { in extractSubstitutions()
463 NFRule predecessor) { in extractSubstitution()
|
| D | NFRuleSet.java | 168 NFRule predecessor = null; in parseRules() local
186 this, predecessor, owner, tempRules); in parseRules() local
|
| /third_party/boost/libs/graph/test/ |
| D | max_flow_algorithms_bundled_properties_and_named_params.cpp | 22 traits::edge_descriptor predecessor; member
|
| D | find_flow_cost_bundled_properties_and_named_params_test.cpp | 21 traits::edge_descriptor predecessor; member
|
| /third_party/mesa3d/src/freedreno/ir3/ |
| D | ir3_legalize.c | 101 struct ir3_block *predecessor = block->predecessors[i]; in legalize_block() local
644 struct ir3_block *predecessor = block->predecessors[i]; in mark_xvergence_points() local
|