Home
last modified time | relevance | path

Searched refs:InnerNode (Results 1 – 5 of 5) sorted by relevance

/third_party/boost/libs/intrusive/example/
Ddoc_function_hooks.cpp22 struct InnerNode struct
48 (get_parent_from_member<MyClass::InnerNode>(n, &MyClass::InnerNode::hook) in to_value_ptr() argument
55 (get_parent_from_member<MyClass::InnerNode>(n, &MyClass::InnerNode::hook) in to_value_ptr()
/third_party/boost/libs/intrusive/test/
Dfunction_hook_test.cpp27 struct InnerNode : public list_base_hook<>, public slist_base_hook<> struct
62 (get_parent_from_member<MyClass::InnerNode>(n, &MyClass::InnerNode::MEMBERNAME)\
69 (get_parent_from_member<MyClass::InnerNode>(n, &MyClass::InnerNode::MEMBERNAME)\
94 … return get_parent_from_member<MyClass>(static_cast<MyClass::InnerNode*>(n),&MyClass::inner);\
98 …return get_parent_from_member<MyClass>(static_cast<const MyClass::InnerNode*>(n),&MyClass::inner);\
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/
Dbtree.h246 class InnerNode : public BaseNode {
250 using alloc_type = typename value_allocator::template rebind<InnerNode>::other;
259 IndexRc Split(InnerNode *to, key_type *split_key);
263 explicit InnerNode(const value_allocator &alloc) : BaseNode::BaseNode(alloc), slotuse_(0) {} in InnerNode() function
265 ~InnerNode() = default;
338 IndexRc AllocateInner(InnerNode **p);
362 …IndexRc InnerInsertKeyChild(InnerNode *node, const key_type &key, BaseNode *ptr, key_type *split_k…
363 InnerNode **split_node);
365 inline BaseNode *FindBranch(InnerNode *inner, slot_type slot) const { in FindBranch()
Dbtree_impl.tpp23 typename BPlusTree<K, V, A, C, T>::IndexRc BPlusTree<K, V, A, C, T>::InnerNode::Sort() {
62 typename BPlusTree<K, V, A, C, T>::IndexRc BPlusTree<K, V, A, C, T>::InnerNode::Split(
63 BPlusTree<K, V, A, C, T>::InnerNode *to, key_type *split_key) {
89 typename BPlusTree<K, V, A, C, T>::IndexRc BPlusTree<K, V, A, C, T>::InnerNode::InsertIntoSlot(
216 BPlusTree<K, V, A, C, T>::InnerNode **p) {
220 typename InnerNode::alloc_type alloc(alloc_);
221 InnerNode *ptr = nullptr;
229 *p = new (ptr) InnerNode(alloc_);
290 …BPlusTree<K, V, A, C, T>::InnerNode *node, const key_type &key, BPlusTree<K, V, A, C, T>::BaseNode…
291 key_type *split_key, BPlusTree<K, V, A, C, T>::InnerNode **split_node) {
[all …]
/third_party/chromium/patch/
D0003-3.2-Beta3-1115.patch72714 + // if InnerNode is not the image , find image from fallback.
72715 + Node* inner_node = result.InnerNode();
72768 auto* html_element = DynamicTo<HTMLElement>(result.InnerNode());
72778 + result.InnerNode()->GetDocument().CompleteURL(background_url);
72783 } else if (IsA<HTMLObjectElement>(*result.InnerNode()) ||
72784 IsA<HTMLEmbedElement>(*result.InnerNode())) {