Searched refs:make_node (Results 1 – 10 of 10) sorted by relevance
/third_party/boost/libs/hana/example/misc/ |
D | tree.cpp | 32 constexpr auto make_node(X x, Subforest subforest) { in make_node() function 58 return make_node( in apply() 74 { return make_node(x, make_forest()); } in apply() 81 return make_node( in apply() 102 return make_node( in apply() 128 constexpr auto tree = make_node(1, make_forest( in main() 129 make_node(2, make_forest()), in main() 130 make_node(3, make_forest()), in main() 131 make_node(4, make_forest()) in main() 138 make_node(2, make_forest( in main() [all …]
|
/third_party/boost/boost/heap/detail/ |
D | stable_heap.hpp | 214 internal_type make_node(T const & val) in make_node() function 220 T && make_node(T && val) in make_node() function 228 internal_type make_node(Args && ... val) in make_node() function 385 internal_type make_node(T const & val) in make_node() function 395 internal_type make_node(Args&&... args) in make_node() function
|
/third_party/boost/boost/heap/ |
D | fibonacci_heap.hpp | 354 new(n) node(super_t::make_node(v)); in push() 378 new(n) node(super_t::make_node(std::forward<Args>(args)...)); in emplace() 424 handle.node_->value = super_t::make_node(v); in update_lazy() 471 handle.node_->value = super_t::make_node(v); in increase() 509 handle.node_->value = super_t::make_node(v); in decrease()
|
D | priority_queue.hpp | 246 q_.push_back(super_t::make_node(v)); in push() 260 q_.emplace_back(super_t::make_node(std::forward<Args>(args)...)); in emplace()
|
D | pairing_heap.hpp | 362 new(n) node(super_t::make_node(v)); in push() 385 new(n) node(super_t::make_node(std::forward<Args>(args)...)); in emplace() 416 handle.node_->value = super_t::make_node(v); in update()
|
D | skew_heap.hpp | 701 handle.node_->value = super_t::make_node(v); in increase() 741 handle.node_->value = super_t::make_node(v); in decrease() 803 new(n) node(super_t::make_node(v)); in push_internal() 816 new(n) node(super_t::make_node(std::forward<Args>(args)...)); in emplace_internal()
|
D | binomial_heap.hpp | 353 new(n) node_type(super_t::make_node(v)); in push() 376 new(n) node_type(super_t::make_node(std::forward<Args>(args)...)); in emplace() 476 handle.node_->value = super_t::make_node(v); in increase() 505 handle.node_->value = super_t::make_node(v); in decrease()
|
D | d_ary_heap.hpp | 216 q_.push_back(super_t::make_node(v)); in push() 225 q_.emplace_back(super_t::make_node(std::forward<Args>(args)...)); in emplace()
|
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/irpass/ |
D | merge_addn.h | 55 auto make_node = fg->NewCNode(args_); in operator() local 57 return fg->NewCNode({addn, make_node}); in operator()
|
/third_party/skia/modules/svg/src/ |
D | SkSVGDOM.cpp | 346 auto make_node = [](const ConstructionContext& ctx, const char* elem) -> sk_sp<SkSVGNode> { in construct_svg_node() local 367 auto node = make_node(ctx, elem); in construct_svg_node()
|