| /third_party/boost/boost/intrusive/ |
| D | treap_algorithms.hpp | 313 insert_commit_data commit_data; in insert_equal_upper_bound() local
314 bstree_algo::insert_equal_upper_bound_check(h, new_node, comp, commit_data); in insert_equal_upper_bound()
315 rebalance_check_and_commit(h, new_node, pcomp, commit_data); in insert_equal_upper_bound()
338 insert_commit_data commit_data; in insert_equal_lower_bound() local
339 bstree_algo::insert_equal_lower_bound_check(h, new_node, comp, commit_data); in insert_equal_lower_bound()
340 rebalance_check_and_commit(h, new_node, pcomp, commit_data); in insert_equal_lower_bound()
366 insert_commit_data commit_data; in insert_equal() local
367 bstree_algo::insert_equal_check(h, hint, new_node, comp, commit_data); in insert_equal()
368 rebalance_check_and_commit(h, new_node, pcomp, commit_data); in insert_equal()
394 insert_commit_data commit_data; in insert_before() local
[all …]
|
| D | bstree_algorithms.hpp | 959 (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) in insert_unique_commit() argument
960 { return insert_commit(header, new_value, commit_data); } in insert_unique_commit()
999 ,KeyNodePtrCompare comp, insert_commit_data &commit_data in insert_unique_check() argument
1028 commit_data.link_left = left_child; in insert_unique_check()
1029 commit_data.node = y; in insert_unique_check()
1076 ,KeyNodePtrCompare comp, insert_commit_data &commit_data in insert_unique_check() argument
1087 commit_data.link_left = unique(header) || !NodeTraits::get_left(hint); in insert_unique_check()
1088 commit_data.node = commit_data.link_left ? hint : prev; in insert_unique_check()
1090 *pdepth = commit_data.node == header ? 0 : depth(commit_data.node) + 1; in insert_unique_check()
1096 return insert_unique_check(header, key, comp, commit_data, pdepth); in insert_unique_check()
[all …]
|
| D | sgtree_algorithms.hpp | 265 ,KeyNodePtrCompare comp, insert_commit_data &commit_data) in insert_unique_check() argument
269 bstree_algo::insert_unique_check(header, key, comp, commit_data, &depth); in insert_unique_check()
270 commit_data.depth = depth; in insert_unique_check()
278 ,KeyNodePtrCompare comp, insert_commit_data &commit_data) in insert_unique_check() argument
283 (header, hint, key, comp, commit_data, &depth); in insert_unique_check()
284 commit_data.depth = depth; in insert_unique_check()
291 (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data in insert_unique_commit() argument
293 { return insert_commit(header, new_value, commit_data, tree_size, h_alpha, max_tree_size); } in insert_unique_commit()
302 insert_commit_data commit_data; in transfer_unique() local
303 bool const transferable = insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
[all …]
|
| D | treap.hpp | 516 insert_commit_data commit_data; in insert_unique() local
517 …l> ret = this->insert_unique_check(key_of_value()(value), priority_of_value()(value), commit_data); in insert_unique()
520 return std::pair<iterator, bool> (this->insert_unique_commit(value, commit_data), true); in insert_unique()
540 insert_commit_data commit_data; in insert_unique() local
541 … = this->insert_unique_check(hint, key_of_value()(value), priority_of_value()(value), commit_data); in insert_unique()
544 return this->insert_unique_commit(value, commit_data); in insert_unique()
602 ( const key_type &key, const priority_type &prio, insert_commit_data &commit_data) in insert_unique_check() argument
603 …{ return this->insert_unique_check(key, this->key_comp(), prio, this->priv_pcomp(), commit_data);… in insert_unique_check()
634 …nst_iterator hint, const key_type &key, const priority_type &prio, insert_commit_data &commit_data) in insert_unique_check() argument
635 …rn this->insert_unique_check(hint, key, this->key_comp(), prio, this->priv_pcomp(), commit_data); } in insert_unique_check()
[all …]
|
| D | sgtree.hpp | 488 insert_commit_data commit_data; in insert_unique() local
490 (key_of_value()(value), this->key_comp(), commit_data); in insert_unique()
493 return std::pair<iterator, bool> (this->insert_unique_commit(value, commit_data), true); in insert_unique()
499 insert_commit_data commit_data; in insert_unique() local
501 (hint, key_of_value()(value), this->key_comp(), commit_data); in insert_unique()
504 return this->insert_unique_commit(value, commit_data); in insert_unique()
514 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in BOOST_INTRUSIVE_DOC1ST()
518 (this->tree_type::header_ptr(), key, this->key_node_comp(comp), commit_data); in BOOST_INTRUSIVE_DOC1ST()
526 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_unique_check() argument
530 … (this->tree_type::header_ptr(), hint.pointed_node(), key, this->key_node_comp(comp), commit_data); in insert_unique_check()
[all …]
|
| D | splaytree_algorithms.hpp | 259 typename bstree_algo::insert_commit_data commit_data; in transfer_unique() local
260 … bool const transferable = bstree_algo::insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
263 bstree_algo::insert_commit(header1, z, commit_data); in transfer_unique()
274 insert_commit_data commit_data; in transfer_equal() local
276 bstree_algo::insert_equal_upper_bound_check(header1, z, comp, commit_data); in transfer_equal()
278 bstree_algo::insert_commit(header1, z, commit_data); in transfer_equal()
490 ,KeyNodePtrCompare comp, insert_commit_data &commit_data) in insert_unique_check() argument
493 return bstree_algo::insert_unique_check(header, key, comp, commit_data); in insert_unique_check()
501 ,KeyNodePtrCompare comp, insert_commit_data &commit_data) in insert_unique_check() argument
504 return bstree_algo::insert_unique_check(header, hint, key, comp, commit_data); in insert_unique_check()
[all …]
|
| D | bstree.hpp | 483 (const key_type &key, insert_commit_data &commit_data) in insert_unique_check()
484 { return this->insert_unique_check(key, this->key_comp(), commit_data); } in insert_unique_check()
487 (const_iterator hint, const key_type &key, insert_commit_data &commit_data) in insert_unique_check()
488 { return this->insert_unique_check(hint, key, this->key_comp(), commit_data); } in insert_unique_check()
496 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in BOOST_INTRUSIVE_DOC1ST()
500 (this->header_ptr(), key, this->key_node_comp(comp), commit_data)); in BOOST_INTRUSIVE_DOC1ST()
506 … (const_iterator hint, const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_unique_check()
510 (this->header_ptr(), hint.pointed_node(), key, this->key_node_comp(comp), commit_data)); in insert_unique_check()
1134 insert_commit_data commit_data; in insert_unique() local
1137 … (this->header_ptr(), key_of_value()(value), this->key_node_comp(this->key_comp()), commit_data)); in insert_unique()
[all …]
|
| D | set.hpp | 219 (const key_type &key, insert_commit_data &commit_data) in insert_check() argument
220 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
225 ,insert_commit_data &commit_data) in insert_check() argument
226 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
231 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
232 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
238 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
239 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
247 iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
248 { return tree_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | bs_set.hpp | 216 (const key_type &key, insert_commit_data &commit_data) in insert_check() argument
217 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
222 ,insert_commit_data &commit_data) in insert_check() argument
223 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
228 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
229 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
235 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
236 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
244 iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
245 { return tree_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | avl_set.hpp | 219 (const key_type &key, insert_commit_data &commit_data) in insert_check() argument
220 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
225 ,insert_commit_data &commit_data) in insert_check() argument
226 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
231 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
232 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
238 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
239 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
247 iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
248 { return tree_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | splay_set.hpp | 217 (const key_type &key, insert_commit_data &commit_data) in insert_check() argument
218 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
223 ,insert_commit_data &commit_data) in insert_check() argument
224 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
229 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
230 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
236 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
237 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
245 iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
246 { return tree_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | treap_set.hpp | 248 …ool> insert_check( const key_type &key, const priority_type &prio, insert_commit_data &commit_data) in insert_check() argument
249 { return tree_type::insert_unique_check(key, prio, commit_data); } in insert_check()
253 …nst_iterator hint, const key_type &key, const priority_type &prio, insert_commit_data &commit_data) in insert_check() argument
254 { return tree_type::insert_unique_check(hint, key, prio, commit_data); } in insert_check()
260 , insert_commit_data &commit_data) in insert_check() argument
261 { return tree_type::insert_unique_check(key, comp, prio, pcomp, commit_data); } in insert_check()
269 , insert_commit_data &commit_data) in insert_check() argument
270 { return tree_type::insert_unique_check(hint, key, comp, prio, pcomp, commit_data); } in insert_check()
278 iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
279 { return tree_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | sg_set.hpp | 217 (const key_type &key, insert_commit_data &commit_data) in insert_check() argument
218 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
223 ,insert_commit_data &commit_data) in insert_check() argument
224 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
229 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
230 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
236 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data) in insert_check() argument
237 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
245 iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
246 { return tree_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | rbtree.hpp | 267 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
273 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
277 (const key_type &key, insert_commit_data &commit_data);
281 (const_iterator hint, const key_type &key, insert_commit_data &commit_data);
284 iterator insert_unique_commit(reference value, const insert_commit_data &commit_data);
|
| D | avltree.hpp | 264 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
270 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
274 (const key_type &key, insert_commit_data &commit_data);
278 (const_iterator hint, const key_type &key, insert_commit_data &commit_data);
281 iterator insert_unique_commit(reference value, const insert_commit_data &commit_data);
|
| D | splaytree.hpp | 258 (const key_type &key, insert_commit_data &commit_data);
262 (const_iterator hint, const key_type &key, insert_commit_data &commit_data);
267 (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
273 ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
276 iterator insert_unique_commit(reference value, const insert_commit_data &commit_data);
|
| D | unordered_set.hpp | 212 …INLINE std::pair<iterator, bool> insert_check(const key_type &key, insert_commit_data &commit_data) in insert_check() argument
213 { return table_type::insert_unique_check(key, commit_data); } in insert_check()
218 … (const KeyType &key, KeyHasher hasher, KeyEqual key_value_equal, insert_commit_data &commit_data) in insert_check() argument
219 { return table_type::insert_unique_check(key, hasher, key_value_equal, commit_data); } in insert_check()
222 …NTRUSIVE_FORCEINLINE iterator insert_commit(reference value, const insert_commit_data &commit_data) in insert_commit() argument
223 { return table_type::insert_unique_commit(value, commit_data); } in insert_commit()
|
| D | rbtree_algorithms.hpp | 420 ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
426 ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
431 (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) in insert_unique_commit() argument
433 bstree_algo::insert_unique_commit(header, new_value, commit_data); in insert_unique_commit()
|
| D | avltree_algorithms.hpp | 405 ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
411 ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
416 (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) in insert_unique_commit() argument
418 bstree_algo::insert_unique_commit(header, new_value, commit_data); in insert_unique_commit()
|
| D | hashtable.hpp | 2140 insert_commit_data commit_data; in insert_unique() local
2141 std::pair<iterator, bool> ret = this->insert_unique_check(key_of_value()(value), commit_data); in insert_unique()
2143 ret.first = this->insert_unique_commit(value, commit_data); in insert_unique()
2207 , insert_commit_data &commit_data) in insert_unique_check() argument
2211 …siterator const pos = this->priv_find(key, hash_func, equal_func, bucket_num, commit_data.hash, pr… in insert_unique_check()
2245 ( const key_type &key, insert_commit_data &commit_data) in insert_unique_check() argument
2246 … { return this->insert_unique_check(key, this->priv_hasher(), this->priv_equal(), commit_data); } in insert_unique_check()
2267 iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) in insert_unique_commit() argument
2269 size_type bucket_num = this->priv_hash_to_bucket(commit_data.hash); in insert_unique_commit()
2274 node_functions_t::store_hash(n, commit_data.hash, store_hash_t()); in insert_unique_commit()
|
| /third_party/grpc/tools/github/ |
| D | pr_latency.py | 179 commit_data = get_commits_data(pr_data['number'])
183 if commit_data['num_commits'] > 1:
184 base_timestamp = commit_data['most_recent_date']
|
| /third_party/boost/boost/interprocess/indexes/ |
| D | iunordered_set_index.hpp | 335 (const intrusive_compare_key_type &key, insert_commit_data &commit_data) in insert_check() argument
336 { return index_type::insert_check(key, hash_function(), equal_function(), commit_data); } in insert_check()
338 iterator insert_commit(value_type &val, insert_commit_data &commit_data) in insert_commit() argument
340 iterator it = index_type::insert_commit(val, commit_data); in insert_commit()
|
| D | iset_index.hpp | 137 (const intrusive_compare_key_type &key, insert_commit_data &commit_data) in insert_check() argument
138 { return index_type::insert_check(key, intrusive_key_value_less(), commit_data); } in insert_check()
|
| /third_party/boost/boost/container/detail/ |
| D | flat_tree.hpp | 1456 (const_iterator b, const_iterator e, const key_type& k, insert_commit_data &commit_data) in priv_insert_unique_prepare() argument
1459 commit_data.position = this->priv_lower_bound(b, e, k); in priv_insert_unique_prepare()
1460 return commit_data.position == e || key_cmp(k, KeyOfValue()(*commit_data.position)); in priv_insert_unique_prepare()
1464 (const key_type& k, insert_commit_data &commit_data) in priv_insert_unique_prepare() argument
1465 { return this->priv_insert_unique_prepare(this->cbegin(), this->cend(), k, commit_data); } in priv_insert_unique_prepare()
1468 (const_iterator pos, const key_type& k, insert_commit_data &commit_data) in priv_insert_unique_prepare() argument
1485 commit_data.position = pos; in priv_insert_unique_prepare()
1495 commit_data.position = prev; in priv_insert_unique_prepare()
1500 return this->priv_insert_unique_prepare(cbeg, prev, k, commit_data); in priv_insert_unique_prepare()
1506 return this->priv_insert_unique_prepare(pos, cend_it, k, commit_data); in priv_insert_unique_prepare()
[all …]
|
| /third_party/boost/libs/intrusive/test/ |
| D | unordered_test.hpp | 162 typename unordered_set_type::insert_commit_data commit_data; in test_insert() local
163 BOOST_TEST ((!testset.insert_check(key_of_value()(values[2]), commit_data).second)); in test_insert()
164 BOOST_TEST (( testset.insert_check(key_of_value()(values[0]), commit_data).second)); in test_insert()
|