Lines Matching refs:comp
257 (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z) in transfer_unique() argument
260 … bool const transferable = bstree_algo::insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
272 (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z) in transfer_equal() argument
275 splay_down(header1, z, comp); in transfer_equal()
276 bstree_algo::insert_equal_upper_bound_check(header1, z, comp, commit_data); in transfer_equal()
296 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in count() argument
298 std::pair<node_ptr, node_ptr> ret = equal_range(header, key, comp); in count()
311 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in count() argument
312 { return bstree_algo::count(header, key, comp); } in count()
318 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in lower_bound() argument
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
321 node_ptr y = bstree_algo::lower_bound(header, key, comp); in lower_bound()
330 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in lower_bound() argument
331 { return bstree_algo::lower_bound(header, key, comp); } in lower_bound()
337 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in upper_bound() argument
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
340 node_ptr y = bstree_algo::upper_bound(header, key, comp); in upper_bound()
349 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in upper_bound() argument
350 { return bstree_algo::upper_bound(header, key, comp); } in upper_bound()
356 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in find() argument
358 splay_down(detail::uncast(header), key, comp); in find()
359 return bstree_algo::find(header, key, comp); in find()
366 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in find() argument
367 { return bstree_algo::find(header, key, comp); } in find()
373 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in equal_range() argument
375 splay_down(detail::uncast(header), key, comp); in equal_range()
376 std::pair<node_ptr, node_ptr> ret = bstree_algo::equal_range(header, key, comp); in equal_range()
385 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in equal_range() argument
386 { return bstree_algo::equal_range(header, key, comp); } in equal_range()
392 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in lower_bound_range() argument
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
395 std::pair<node_ptr, node_ptr> ret = bstree_algo::lower_bound_range(header, key, comp); in lower_bound_range()
404 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in lower_bound_range() argument
405 { return bstree_algo::lower_bound_range(header, key, comp); } in lower_bound_range()
411 (node_ptr header, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp in bounded_range() argument
414 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
416 bstree_algo::bounded_range(header, lower_key, upper_key, comp, left_closed, right_closed); in bounded_range()
425 … (const_node_ptr header, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp in bounded_range() argument
427 …{ return bstree_algo::bounded_range(header, lower_key, upper_key, comp, left_closed, right_closed… in bounded_range()
433 (node_ptr header, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound() argument
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
436 return bstree_algo::insert_equal_upper_bound(header, new_node, comp); in insert_equal_upper_bound()
443 (node_ptr header, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound() argument
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
446 return bstree_algo::insert_equal_lower_bound(header, new_node, comp); in insert_equal_lower_bound()
453 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal() argument
455 splay_down(header, new_node, comp); in insert_equal()
456 return bstree_algo::insert_equal(header, hint, new_node, comp); in insert_equal()
490 ,KeyNodePtrCompare comp, insert_commit_data &commit_data) in insert_unique_check() argument
492 splay_down(header, key, comp); in insert_unique_check()
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
503 splay_down(header, key, comp); in insert_unique_check()
504 return bstree_algo::insert_unique_check(header, hint, key, comp, commit_data); in insert_unique_check()
529 …static node_ptr splay_down(node_ptr header, const KeyType &key, KeyNodePtrCompare comp, bool *pfou… in splay_down() argument
530 { return priv_splay_down<true>(header, key, comp, pfound); } in splay_down()
575 …static node_ptr priv_splay_down(node_ptr header, const KeyType &key, KeyNodePtrCompare comp, bool … in priv_splay_down() argument
592 *pfound = old_root && !comp(key, old_root) && !comp(old_root, key); in priv_splay_down()
606 if(comp(key, commit.t_)){ in priv_splay_down()
610 if(comp(key, t_left)){ in priv_splay_down()
619 if(!SimpleSplay && comp(t_left, key)){ in priv_splay_down()
626 else if(comp(commit.t_, key)){ in priv_splay_down()
631 if(comp(t_right, key)){ in priv_splay_down()
640 if(!SimpleSplay && comp(key, t_right)){ in priv_splay_down()