Home
last modified time | relevance | path

Searched refs:KeyPtrFromNodePtr (Results 1 – 8 of 8) sorted by relevance

/dports/lang/spidermonkey60/firefox-60.9.0/toolkit/components/protobuf/src/google/protobuf/
H A Dmap.h347 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
477 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
627 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
659 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
698 ->insert(KeyPtrFromNodePtr(node)) in InsertUniqueInTree()
767 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
839 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/lang/spidermonkey78/firefox-78.9.0/toolkit/components/protobuf/src/google/protobuf/
H A Dmap.h371 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
500 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
651 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
683 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
722 static_cast<Tree*>(table_[b])->insert(KeyPtrFromNodePtr(node)).first, in InsertUniqueInTree()
790 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
862 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/mail/thunderbird/thunderbird-91.8.0/toolkit/components/protobuf/src/google/protobuf/
H A Dmap.h371 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
500 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
651 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
683 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
722 static_cast<Tree*>(table_[b])->insert(KeyPtrFromNodePtr(node)).first, in InsertUniqueInTree()
790 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
862 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/protobuf/src/google/protobuf/
H A Dmap.h371 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
500 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
651 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
683 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
722 static_cast<Tree*>(table_[b])->insert(KeyPtrFromNodePtr(node)).first, in InsertUniqueInTree()
790 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
862 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/www/firefox/firefox-99.0/toolkit/components/protobuf/src/google/protobuf/
H A Dmap.h371 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
500 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
651 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
683 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
722 static_cast<Tree*>(table_[b])->insert(KeyPtrFromNodePtr(node)).first, in InsertUniqueInTree()
790 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
862 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/protobuf/src/google/protobuf/
H A Dmap.h371 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
500 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
651 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
683 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
722 static_cast<Tree*>(table_[b])->insert(KeyPtrFromNodePtr(node)).first, in InsertUniqueInTree()
790 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
862 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/graphics/opencv/opencv-4.5.3/3rdparty/protobuf/src/google/protobuf/
H A Dmap.h367 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
497 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
647 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
679 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
718 ->insert(KeyPtrFromNodePtr(node)) in InsertUniqueInTree()
787 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
859 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()
/dports/www/firefox-esr/firefox-91.8.0/toolkit/components/protobuf/src/google/protobuf/
H A Dmap.h371 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr() function
500 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_), it)); in revalidate_if_necessary()
651 if (IsMatch(*KeyPtrFromNodePtr(node), k)) { in FindHelper()
683 GOOGLE_DCHECK(find(*KeyPtrFromNodePtr(node)) == end()); in InsertUnique()
722 static_cast<Tree*>(table_[b])->insert(KeyPtrFromNodePtr(node)).first, in InsertUniqueInTree()
790 InsertUnique(BucketNumber(*KeyPtrFromNodePtr(node)), node); in TransferList()
862 tree->insert(KeyPtrFromNodePtr(node)); in CopyListToTree()