absl::container_internal::btree_node< Params > Class Template Reference

#include <btree.h>

Inheritance diagram for absl::container_internal::btree_node< Params >:

Public Types
using	const_pointer = typename Params::const_pointer
using	const_pointer = typename Params::const_pointer
using	const_reference = typename Params::const_reference
using	const_reference = typename Params::const_reference
using	difference_type = typename Params::difference_type
using	difference_type = typename Params::difference_type
using	key_compare = typename Params::key_compare
using	key_compare = typename Params::key_compare
using	key_type = typename Params::key_type
using	key_type = typename Params::key_type
using	params_type = Params
using	params_type = Params
using	pointer = typename Params::pointer
using	pointer = typename Params::pointer
using	reference = typename Params::reference
using	reference = typename Params::reference
using	size_type = typename Params::size_type
using	size_type = typename Params::size_type
using	use_linear_search = std::integral_constant< bool, has_linear_node_search_preference< key_compare >::value ? prefers_linear_node_search< key_compare >::value :has_linear_node_search_preference< key_type >::value ? prefers_linear_node_search< key_type >::value :std::is_arithmetic< key_type >::value &&(std::is_same< std::less< key_type >, key_compare >::value||std::is_same< std::greater< key_type >, key_compare >::value)>
using	use_linear_search = std::integral_constant< bool, has_linear_node_search_preference< original_key_compare >::value ? prefers_linear_node_search< original_key_compare >::value :has_linear_node_search_preference< key_type >::value ? prefers_linear_node_search< key_type >::value :std::is_arithmetic< key_type >::value &&(std::is_same< std::less< key_type >, original_key_compare >::value||std::is_same< std::greater< key_type >, original_key_compare >::value)>
using	value_type = typename Params::value_type
using	value_type = typename Params::value_type

Public Member Functions
template<typename K , typename Compare >
SearchResult< int, btree_is_key_compare_to< Compare, key_type >::value >	binary_search (const K &k, const Compare &comp) const
template<typename K , typename Compare >
SearchResult< int, btree_is_key_compare_to< Compare, key_type >::value >	binary_search (const K &k, const Compare &comp) const
template<typename K , typename Compare >
SearchResult< int, false >	binary_search_impl (const K &k, int s, int e, const Compare &comp, std::false_type) const
template<typename K , typename Compare >
SearchResult< int, false >	binary_search_impl (const K &k, int s, int e, const Compare &comp, std::false_type) const
template<typename K , typename CompareTo >
SearchResult< int, true >	binary_search_impl (const K &k, int s, int e, const CompareTo &comp, std::true_type) const
template<typename K , typename CompareTo >
SearchResult< int, true >	binary_search_impl (const K &k, int s, int e, const CompareTo &comp, std::true_type) const
	btree_node (btree_node const &)=delete
	btree_node (btree_node const &)=delete
btree_node *	child (int i) const
btree_node *	child (int i) const
void	clear_child (int i)
void	clear_child (int i)
field_type	count () const
field_type	count () const
template<typename... Args>
void	emplace_value (size_type i, allocator_type *alloc, Args &&... args)
template<typename... Args>
void	emplace_value (size_type i, allocator_type *alloc, Args &&... args)
field_type	finish () const
field_type	finish () const
uint32_t	generation () const
uint32_t *	get_root_generation () const
void	init_child (int i, btree_node *c)
void	init_child (int i, btree_node *c)
void	init_internal (btree_node *parent)
void	init_internal (btree_node *parent)
void	init_leaf (btree_node *parent, int max_count)
void	init_leaf (int max_count, btree_node *parent)
bool	is_internal () const
bool	is_leaf () const
bool	is_root () const
bool	is_root () const
const key_type &	key (int i) const
const key_type &	key (int i) const
bool	leaf () const
template<typename K , typename Compare >
SearchResult< int, btree_is_key_compare_to< Compare, key_type >::value >	linear_search (const K &k, const Compare &comp) const
template<typename K , typename Compare >
SearchResult< int, btree_is_key_compare_to< Compare, key_type >::value >	linear_search (const K &k, const Compare &comp) const
template<typename K , typename Compare >
SearchResult< int, false >	linear_search_impl (const K &k, int s, const int e, const Compare &comp, std::false_type) const
template<typename K , typename Compare >
SearchResult< int, false >	linear_search_impl (const K &k, int s, const int e, const Compare &comp, std::false_type) const
template<typename K , typename Compare >
SearchResult< int, true >	linear_search_impl (const K &k, int s, const int e, const Compare &comp, std::true_type) const
template<typename K , typename Compare >
SearchResult< int, true >	linear_search_impl (const K &k, int s, const int e, const Compare &comp, std::true_type) const
template<typename K >
SearchResult< int, is_key_compare_to::value >	lower_bound (const K &k, const key_compare &comp) const
template<typename K >
SearchResult< int, is_key_compare_to::value >	lower_bound (const K &k, const key_compare &comp) const
void	make_root ()
void	make_root ()
field_type	max_count () const
field_type	max_count () const
void	merge (btree_node *src, allocator_type *alloc)
void	merge (btree_node *src, allocator_type *alloc)
btree_node *&	mutable_child (int i)
btree_node *&	mutable_child (int i)
void	next_generation ()
btree_node &	operator= (btree_node const &)=delete
btree_node &	operator= (btree_node const &)=delete
btree_node *	parent () const
btree_node *	parent () const
field_type	position () const
field_type	position () const
void	rebalance_left_to_right (int to_move, btree_node *right, allocator_type *alloc)
void	rebalance_left_to_right (int to_move, btree_node *right, allocator_type *alloc)
void	rebalance_right_to_left (int to_move, btree_node *right, allocator_type *alloc)
void	rebalance_right_to_left (int to_move, btree_node *right, allocator_type *alloc)
void	remove_values (field_type i, field_type to_erase, allocator_type *alloc)
void	remove_values (field_type i, field_type to_erase, allocator_type *alloc)
void	set_child (int i, btree_node *c)
void	set_child (int i, btree_node *c)
void	set_generation (uint32_t generation)
void	split (int insert_position, btree_node *dest, allocator_type *alloc)
void	split (int insert_position, btree_node *dest, allocator_type *alloc)
field_type	start () const
field_type	start () const
btree_node *	start_child () const
btree_node *	start_child () const
template<typename K >
int	upper_bound (const K &k, const key_compare &comp) const
template<typename K >
int	upper_bound (const K &k, const key_compare &comp) const
reference	value (int i)
reference	value (int i)
const_reference	value (int i) const
const_reference	value (int i) const
	~btree_node ()=default
	~btree_node ()=default

Static Public Member Functions
constexpr static size_type	Alignment ()
constexpr static size_type	Alignment ()
static void	clear_and_delete (btree_node *node, allocator_type *alloc)
static void	clear_and_delete (btree_node *node, allocator_type *alloc)
static void	deallocate (const size_type size, btree_node *node, allocator_type *alloc)
static void	deallocate (const size_type size, btree_node *node, allocator_type *alloc)

Protected Member Functions
	btree_node ()=default
	btree_node ()=default

Private Types
enum	{ kTargetNodeSize = params_type::kTargetNodeSize, kNodeTargetSlots = NodeTargetSlots(0, params_type::kTargetNodeSize), kMinNodeSlots = 4 }
enum	{ kTargetNodeSize = params_type::kTargetNodeSize, kNodeTargetSlots = NodeTargetSlots(0, params_type::kTargetNodeSize), kMinNodeSlots = 4 }
using	allocator_type = typename Params::allocator_type
using	allocator_type = typename Params::allocator_type
using	field_type = typename Params::node_count_type
using	field_type = typename Params::node_count_type
using	is_key_compare_to = typename Params::is_key_compare_to
using	is_key_compare_to = typename Params::is_key_compare_to
using	layout_type = absl::container_internal::Layout< btree_node *, field_type, slot_type, btree_node * >
using	layout_type = absl::container_internal::Layout< btree_node *, uint32_t, field_type, slot_type, btree_node * >
using	original_key_compare = typename Params::original_key_compare
using	slot_type = typename Params::slot_type
using	slot_type = typename Params::slot_type

Private Member Functions
slot_type *	finish_slot ()
slot_type *	finish_slot ()
template<size_type N>
layout_type::template ElementType< N > *	GetField ()
template<size_type N>
layout_type::template ElementType< N > *	GetField ()
template<size_type N>
const layout_type::template ElementType< N > *	GetField () const
template<size_type N>
const layout_type::template ElementType< N > *	GetField () const
field_type &	mutable_finish ()
field_type &	mutable_finish ()
void	set_finish (field_type v)
void	set_finish (field_type v)
void	set_max_count (field_type v)
void	set_max_count (field_type v)
void	set_parent (btree_node *p)
void	set_parent (btree_node *p)
void	set_position (field_type v)
void	set_position (field_type v)
void	set_start (field_type v)
void	set_start (field_type v)
slot_type *	slot (int i)
slot_type *	slot (int i)
const slot_type *	slot (int i) const
const slot_type *	slot (int i) const
slot_type *	start_slot ()
slot_type *	start_slot ()
void	transfer (const size_type dest_i, const size_type src_i, btree_node *src_node, allocator_type *alloc)
void	transfer (const size_type dest_i, const size_type src_i, btree_node *src_node, allocator_type *alloc)
void	transfer_n (const size_type n, const size_type dest_i, const size_type src_i, btree_node *src_node, allocator_type *alloc)
void	transfer_n (const size_type n, const size_type dest_i, const size_type src_i, btree_node *src_node, allocator_type *alloc)
void	transfer_n_backward (const size_type n, const size_type dest_i, const size_type src_i, btree_node *src_node, allocator_type *alloc)
void	transfer_n_backward (const size_type n, const size_type dest_i, const size_type src_i, btree_node *src_node, allocator_type *alloc)
void	value_destroy (const field_type i, allocator_type *alloc)
void	value_destroy (const field_type i, allocator_type *alloc)
void	value_destroy_n (const field_type i, const field_type n, allocator_type *alloc)
void	value_destroy_n (const field_type i, const field_type n, allocator_type *alloc)
template<typename... Args>
void	value_init (const field_type i, allocator_type *alloc, Args &&... args)
template<typename... Args>
void	value_init (const field_type i, allocator_type *alloc, Args &&... args)

Static Private Member Functions
constexpr static layout_type	InternalLayout ()
constexpr static layout_type	InternalLayout ()
constexpr static size_type	InternalSize ()
constexpr static size_type	InternalSize ()
constexpr static layout_type	LeafLayout (const int slot_count=kNodeSlots)
constexpr static layout_type	LeafLayout (const int slot_count=kNodeSlots)
constexpr static size_type	LeafSize (const int slot_count=kNodeSlots)
constexpr static size_type	LeafSize (const int slot_count=kNodeSlots)
constexpr static size_type	MinimumOverhead ()
constexpr static size_type	MinimumOverhead ()
constexpr static size_type	NodeTargetSlots (const int begin, const int end)
constexpr static size_type	NodeTargetSlots (const size_type begin, const size_type end)
constexpr static size_type	SizeWithNSlots (size_type n)
constexpr static size_type	SizeWithNSlots (size_type n)
static void	transfer (slot_type *dest, slot_type *src, allocator_type *alloc)
static void	transfer (slot_type *dest, slot_type *src, allocator_type *alloc)

Friends
template<typename P >
class	btree
template<typename P >
class	btree
struct	btree_access
template<typename N , typename R , typename P >
struct	btree_iterator
template<typename N , typename R , typename P >
class	btree_iterator
class	BtreeNodePeer

Detailed Description

template<typename Params>
class absl::container_internal::btree_node< Params >

Definition at line 514 of file abseil-cpp/absl/container/internal/btree.h.

Member Typedef Documentation

allocator_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::allocator_type = typename Params::allocator_type

private

Definition at line 454 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

allocator_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::allocator_type = typename Params::allocator_type

private

Definition at line 517 of file abseil-cpp/absl/container/internal/btree.h.

const_pointer [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::const_pointer = typename Params::const_pointer

Definition at line 462 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

const_pointer [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::const_pointer = typename Params::const_pointer

Definition at line 526 of file abseil-cpp/absl/container/internal/btree.h.

const_reference [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::const_reference = typename Params::const_reference

Definition at line 464 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

const_reference [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::const_reference = typename Params::const_reference

Definition at line 528 of file abseil-cpp/absl/container/internal/btree.h.

difference_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::difference_type = typename Params::difference_type

Definition at line 467 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

difference_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::difference_type = typename Params::difference_type

Definition at line 531 of file abseil-cpp/absl/container/internal/btree.h.

field_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::field_type = typename Params::node_count_type

private

Definition at line 453 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

field_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::field_type = typename Params::node_count_type

private

Definition at line 516 of file abseil-cpp/absl/container/internal/btree.h.

is_key_compare_to [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::is_key_compare_to = typename Params::is_key_compare_to

private

Definition at line 452 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

is_key_compare_to [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::is_key_compare_to = typename Params::is_key_compare_to

private

Definition at line 515 of file abseil-cpp/absl/container/internal/btree.h.

key_compare [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::key_compare = typename Params::key_compare

Definition at line 465 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

key_compare [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::key_compare = typename Params::key_compare

Definition at line 529 of file abseil-cpp/absl/container/internal/btree.h.

key_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::key_type = typename Params::key_type

Definition at line 459 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

key_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::key_type = typename Params::key_type

Definition at line 523 of file abseil-cpp/absl/container/internal/btree.h.

layout_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::layout_type = absl::container_internal::Layout<btree_node *, field_type, slot_type, btree_node *>

private

Definition at line 539 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

layout_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::layout_type = absl::container_internal::Layout<btree_node *, uint32_t, field_type, slot_type, btree_node *>

private

Definition at line 611 of file abseil-cpp/absl/container/internal/btree.h.

original_key_compare

template<typename Params >

using absl::container_internal::btree_node< Params >::original_key_compare = typename Params::original_key_compare

private

Definition at line 519 of file abseil-cpp/absl/container/internal/btree.h.

params_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::params_type = Params

Definition at line 458 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

params_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::params_type = Params

Definition at line 522 of file abseil-cpp/absl/container/internal/btree.h.

pointer [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::pointer = typename Params::pointer

Definition at line 461 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

pointer [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::pointer = typename Params::pointer

Definition at line 525 of file abseil-cpp/absl/container/internal/btree.h.

reference [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::reference = typename Params::reference

Definition at line 463 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

reference [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::reference = typename Params::reference

Definition at line 527 of file abseil-cpp/absl/container/internal/btree.h.

size_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::size_type = typename Params::size_type

Definition at line 466 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

size_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::size_type = typename Params::size_type

Definition at line 530 of file abseil-cpp/absl/container/internal/btree.h.

slot_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::slot_type = typename Params::slot_type

private

Definition at line 455 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

slot_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::slot_type = typename Params::slot_type

private

Definition at line 518 of file abseil-cpp/absl/container/internal/btree.h.

use_linear_search [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::use_linear_search = std::integral_constant< bool, has_linear_node_search_preference<key_compare>::value ? prefers_linear_node_search<key_compare>::value : has_linear_node_search_preference<key_type>::value ? prefers_linear_node_search<key_type>::value : std::is_arithmetic<key_type>::value && (std::is_same<std::less<key_type>, key_compare>::value || std::is_same<std::greater<key_type>, key_compare>::value)>

Definition at line 485 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

use_linear_search [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::use_linear_search = std::integral_constant< bool, has_linear_node_search_preference<original_key_compare>::value ? prefers_linear_node_search<original_key_compare>::value : has_linear_node_search_preference<key_type>::value ? prefers_linear_node_search<key_type>::value : std::is_arithmetic<key_type>::value && (std::is_same<std::less<key_type>, original_key_compare>::value || std::is_same<std::greater<key_type>, original_key_compare>::value)>

Definition at line 549 of file abseil-cpp/absl/container/internal/btree.h.

value_type [1/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::value_type = typename Params::value_type

Definition at line 460 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

value_type [2/2]

template<typename Params >

using absl::container_internal::btree_node< Params >::value_type = typename Params::value_type

Definition at line 524 of file abseil-cpp/absl/container/internal/btree.h.

Member Enumeration Documentation

anonymous enum

template<typename Params >

anonymous enum

private

Enumerator
kTargetNodeSize
kNodeTargetSlots
kMinNodeSlots

Definition at line 562 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

anonymous enum

template<typename Params >

anonymous enum

private

Enumerator
kTargetNodeSize
kNodeTargetSlots
kMinNodeSlots

Definition at line 637 of file abseil-cpp/absl/container/internal/btree.h.

Constructor & Destructor Documentation

~btree_node() [1/2]

template<typename Params >

absl::container_internal::btree_node< Params >::~btree_node ( )

default

btree_node() [1/4]

template<typename Params >

absl::container_internal::btree_node< Params >::btree_node ( btree_node< Params > const &  )

delete

btree_node() [2/4]

template<typename Params >

absl::container_internal::btree_node< Params >::btree_node ( )

protecteddefault

~btree_node() [2/2]

template<typename Params >

absl::container_internal::btree_node< Params >::~btree_node ( )

default

btree_node() [3/4]

template<typename Params >

absl::container_internal::btree_node< Params >::btree_node ( btree_node< Params > const &  )

delete

btree_node() [4/4]

template<typename Params >

absl::container_internal::btree_node< Params >::btree_node ( )

protecteddefault

Member Function Documentation

Alignment() [1/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::Alignment ( )

inlinestaticconstexpr

Definition at line 528 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

Alignment() [2/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::Alignment ( )

inlinestaticconstexpr

Definition at line 599 of file abseil-cpp/absl/container/internal/btree.h.

binary_search() [1/2]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, btree_is_key_compare_to<Compare, key_type>::value> absl::container_internal::btree_node< Params >::binary_search ( const K &  k, const Compare &  comp  ) const

inline

Definition at line 716 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

binary_search() [2/2]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, btree_is_key_compare_to<Compare, key_type>::value> absl::container_internal::btree_node< Params >::binary_search ( const K &  k, const Compare &  comp  ) const

inline

Definition at line 821 of file abseil-cpp/absl/container/internal/btree.h.

binary_search_impl() [1/4]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, false> absl::container_internal::btree_node< Params >::binary_search_impl ( const K &  k, int  s, int  e, const Compare &  comp, std::false_type    ) const

inline

Definition at line 757 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

binary_search_impl() [2/4]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, false> absl::container_internal::btree_node< Params >::binary_search_impl ( const K &  k, int  s, int  e, const Compare &  comp, std::false_type    ) const

inline

Definition at line 862 of file abseil-cpp/absl/container/internal/btree.h.

binary_search_impl() [3/4]

template<typename Params >

template<typename K , typename CompareTo >

SearchResult<int, true> absl::container_internal::btree_node< Params >::binary_search_impl ( const K &  k, int  s, int  e, const CompareTo &  comp, std::true_type    ) const

inline

Definition at line 774 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

binary_search_impl() [4/4]

template<typename Params >

template<typename K , typename CompareTo >

SearchResult<int, true> absl::container_internal::btree_node< Params >::binary_search_impl ( const K &  k, int  s, int  e, const CompareTo &  comp, std::true_type    ) const

inline

Definition at line 879 of file abseil-cpp/absl/container/internal/btree.h.

child() [1/2]

template<typename Params >

btree_node* absl::container_internal::btree_node< Params >::child ( int  i ) const

inline

Definition at line 676 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

child() [2/2]

template<typename Params >

btree_node* absl::container_internal::btree_node< Params >::child ( int  i ) const

inline

Definition at line 781 of file abseil-cpp/absl/container/internal/btree.h.

clear_and_delete() [1/2]

template<typename Params >

static void absl::container_internal::btree_node< Params >::clear_and_delete ( btree_node< Params > *  node, allocator_type *  alloc  )

static

clear_and_delete() [2/2]

template<typename P >

void absl::container_internal::btree_node< P >::clear_and_delete ( btree_node< Params > *  node, allocator_type *  alloc  )

static

Definition at line 1923 of file abseil-cpp/absl/container/internal/btree.h.

clear_child() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::clear_child ( int  i )

inline

Definition at line 679 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

clear_child() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::clear_child ( int  i )

inline

Definition at line 784 of file abseil-cpp/absl/container/internal/btree.h.

count() [1/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::count ( ) const

inline

Definition at line 646 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

count() [2/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::count ( ) const

inline

Definition at line 728 of file abseil-cpp/absl/container/internal/btree.h.

deallocate() [1/2]

template<typename Params >

static void absl::container_internal::btree_node< Params >::deallocate ( const size_type  size, btree_node< Params > *  node, allocator_type *  alloc  )

inlinestatic

Definition at line 853 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

deallocate() [2/2]

template<typename Params >

static void absl::container_internal::btree_node< Params >::deallocate ( const size_type  size, btree_node< Params > *  node, allocator_type *  alloc  )

inlinestatic

Definition at line 959 of file abseil-cpp/absl/container/internal/btree.h.

emplace_value() [1/2]

template<typename Params >

template<typename... Args>

void absl::container_internal::btree_node< Params >::emplace_value	(	size_type	i,
		allocator_type *	alloc,
		Args &&...	args
	)

emplace_value() [2/2]

template<typename P >

template<typename... Args>

void absl::container_internal::btree_node< P >::emplace_value ( size_type  i, allocator_type *  alloc, Args &&...  args  )

inline

Definition at line 1723 of file abseil-cpp/absl/container/internal/btree.h.

finish() [1/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::finish ( ) const

inline

Definition at line 643 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

finish() [2/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::finish ( ) const

inline

Definition at line 725 of file abseil-cpp/absl/container/internal/btree.h.

finish_slot() [1/2]

template<typename Params >

slot_type* absl::container_internal::btree_node< Params >::finish_slot ( )

inlineprivate

Definition at line 619 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

finish_slot() [2/2]

template<typename Params >

slot_type* absl::container_internal::btree_node< Params >::finish_slot ( )

inlineprivate

Definition at line 698 of file abseil-cpp/absl/container/internal/btree.h.

generation()

template<typename Params >

uint32_t absl::container_internal::btree_node< Params >::generation ( ) const

inline

Definition at line 762 of file abseil-cpp/absl/container/internal/btree.h.

get_root_generation()

template<typename Params >

uint32_t* absl::container_internal::btree_node< Params >::get_root_generation ( ) const

inline

Definition at line 754 of file abseil-cpp/absl/container/internal/btree.h.

GetField() [1/4]

template<typename Params >

template<size_type N>

layout_type::template ElementType<N>* absl::container_internal::btree_node< Params >::GetField ( )

inlineprivate

Definition at line 604 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

GetField() [2/4]

template<typename Params >

template<size_type N>

layout_type::template ElementType<N>* absl::container_internal::btree_node< Params >::GetField ( )

inlineprivate

Definition at line 683 of file abseil-cpp/absl/container/internal/btree.h.

GetField() [3/4]

template<typename Params >

template<size_type N>

const layout_type::template ElementType<N>* absl::container_internal::btree_node< Params >::GetField ( ) const

inlineprivate

Definition at line 610 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

GetField() [4/4]

template<typename Params >

template<size_type N>

const layout_type::template ElementType<N>* absl::container_internal::btree_node< Params >::GetField ( ) const

inlineprivate

Definition at line 689 of file abseil-cpp/absl/container/internal/btree.h.

init_child() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::init_child ( int  i, btree_node< Params > *  c  )

inline

Definition at line 687 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

init_child() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::init_child ( int  i, btree_node< Params > *  c  )

inline

Definition at line 792 of file abseil-cpp/absl/container/internal/btree.h.

init_internal() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::init_internal ( btree_node< Params > *  parent )

inline

Definition at line 844 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

init_internal() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::init_internal ( btree_node< Params > *  parent )

inline

Definition at line 950 of file abseil-cpp/absl/container/internal/btree.h.

init_leaf() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::init_leaf ( btree_node< Params > *  parent, int  max_count  )

inline

Definition at line 835 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

init_leaf() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::init_leaf ( int  max_count, btree_node< Params > *  parent  )

inline

Definition at line 940 of file abseil-cpp/absl/container/internal/btree.h.

InternalLayout() [1/2]

template<typename Params >

constexpr static layout_type absl::container_internal::btree_node< Params >::InternalLayout ( )

inlinestaticconstexprprivate

Definition at line 588 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

InternalLayout() [2/2]

template<typename Params >

constexpr static layout_type absl::container_internal::btree_node< Params >::InternalLayout ( )

inlinestaticconstexprprivate

Definition at line 665 of file abseil-cpp/absl/container/internal/btree.h.

InternalSize() [1/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::InternalSize ( )

inlinestaticconstexprprivate

Definition at line 597 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

InternalSize() [2/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::InternalSize ( )

inlinestaticconstexprprivate

Definition at line 676 of file abseil-cpp/absl/container/internal/btree.h.

is_internal()

template<typename Params >

bool absl::container_internal::btree_node< Params >::is_internal ( ) const

inline

Definition at line 712 of file abseil-cpp/absl/container/internal/btree.h.

is_leaf()

template<typename Params >

bool absl::container_internal::btree_node< Params >::is_leaf ( ) const

inline

Definition at line 709 of file abseil-cpp/absl/container/internal/btree.h.

is_root() [1/2]

template<typename Params >

bool absl::container_internal::btree_node< Params >::is_root ( ) const

inline

Definition at line 664 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

is_root() [2/2]

template<typename Params >

bool absl::container_internal::btree_node< Params >::is_root ( ) const

inline

Definition at line 746 of file abseil-cpp/absl/container/internal/btree.h.

key() [1/2]

template<typename Params >

const key_type& absl::container_internal::btree_node< Params >::key ( int  i ) const

inline

Definition at line 671 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

key() [2/2]

template<typename Params >

const key_type& absl::container_internal::btree_node< Params >::key ( int  i ) const

inline

Definition at line 776 of file abseil-cpp/absl/container/internal/btree.h.

leaf()

template<typename Params >

bool absl::container_internal::btree_node< Params >::leaf ( ) const

inline

Definition at line 630 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

LeafLayout() [1/2]

template<typename Params >

constexpr static layout_type absl::container_internal::btree_node< Params >::LeafLayout ( const int  slot_count = kNodeSlots )

inlinestaticconstexprprivate

Definition at line 582 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

LeafLayout() [2/2]

template<typename Params >

constexpr static layout_type absl::container_internal::btree_node< Params >::LeafLayout ( const int  slot_count = kNodeSlots )

inlinestaticconstexprprivate

Definition at line 657 of file abseil-cpp/absl/container/internal/btree.h.

LeafSize() [1/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::LeafSize ( const int  slot_count = kNodeSlots )

inlinestaticconstexprprivate

Definition at line 594 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

LeafSize() [2/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::LeafSize ( const int  slot_count = kNodeSlots )

inlinestaticconstexprprivate

Definition at line 673 of file abseil-cpp/absl/container/internal/btree.h.

linear_search() [1/2]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, btree_is_key_compare_to<Compare, key_type>::value> absl::container_internal::btree_node< Params >::linear_search ( const K &  k, const Compare &  comp  ) const

inline

Definition at line 709 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

linear_search() [2/2]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, btree_is_key_compare_to<Compare, key_type>::value> absl::container_internal::btree_node< Params >::linear_search ( const K &  k, const Compare &  comp  ) const

inline

Definition at line 814 of file abseil-cpp/absl/container/internal/btree.h.

linear_search_impl() [1/4]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, false> absl::container_internal::btree_node< Params >::linear_search_impl ( const K &  k, int  s, const int  e, const Compare &  comp, std::false_type    ) const

inline

Definition at line 724 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

linear_search_impl() [2/4]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, false> absl::container_internal::btree_node< Params >::linear_search_impl ( const K &  k, int  s, const int  e, const Compare &  comp, std::false_type    ) const

inline

Definition at line 829 of file abseil-cpp/absl/container/internal/btree.h.

linear_search_impl() [3/4]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, true> absl::container_internal::btree_node< Params >::linear_search_impl ( const K &  k, int  s, const int  e, const Compare &  comp, std::true_type    ) const

inline

Definition at line 739 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

linear_search_impl() [4/4]

template<typename Params >

template<typename K , typename Compare >

SearchResult<int, true> absl::container_internal::btree_node< Params >::linear_search_impl ( const K &  k, int  s, const int  e, const Compare &  comp, std::true_type    ) const

inline

Definition at line 844 of file abseil-cpp/absl/container/internal/btree.h.

lower_bound() [1/2]

template<typename Params >

template<typename K >

SearchResult<int, is_key_compare_to::value> absl::container_internal::btree_node< Params >::lower_bound ( const K &  k, const key_compare &  comp  ) const

inline

Definition at line 694 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

lower_bound() [2/2]

template<typename Params >

template<typename K >

SearchResult<int, is_key_compare_to::value> absl::container_internal::btree_node< Params >::lower_bound ( const K &  k, const key_compare &  comp  ) const

inline

Definition at line 799 of file abseil-cpp/absl/container/internal/btree.h.

make_root() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::make_root ( )

inline

Definition at line 665 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

make_root() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::make_root ( )

inline

Definition at line 747 of file abseil-cpp/absl/container/internal/btree.h.

max_count() [1/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::max_count ( ) const

inline

Definition at line 650 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

max_count() [2/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::max_count ( ) const

inline

Definition at line 732 of file abseil-cpp/absl/container/internal/btree.h.

merge() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::merge	(	btree_node< Params > *	src,
		allocator_type *	alloc
	)

merge() [2/2]

template<typename P >

void absl::container_internal::btree_node< P >::merge	(	btree_node< Params > *	src,
		allocator_type *	alloc
	)

Definition at line 1896 of file abseil-cpp/absl/container/internal/btree.h.

MinimumOverhead() [1/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::MinimumOverhead ( )

inlinestaticconstexprprivate

Definition at line 548 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

MinimumOverhead() [2/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::MinimumOverhead ( )

inlinestaticconstexprprivate

Definition at line 622 of file abseil-cpp/absl/container/internal/btree.h.

mutable_child() [1/2]

template<typename Params >

btree_node*& absl::container_internal::btree_node< Params >::mutable_child ( int  i )

inline

Definition at line 678 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

mutable_child() [2/2]

template<typename Params >

btree_node*& absl::container_internal::btree_node< Params >::mutable_child ( int  i )

inline

Definition at line 783 of file abseil-cpp/absl/container/internal/btree.h.

mutable_finish() [1/2]

template<typename Params >

field_type& absl::container_internal::btree_node< Params >::mutable_finish ( )

inlineprivate

Definition at line 616 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

mutable_finish() [2/2]

template<typename Params >

field_type& absl::container_internal::btree_node< Params >::mutable_finish ( )

inlineprivate

Definition at line 695 of file abseil-cpp/absl/container/internal/btree.h.

next_generation()

template<typename Params >

void absl::container_internal::btree_node< Params >::next_generation ( )

inline

Definition at line 771 of file abseil-cpp/absl/container/internal/btree.h.

NodeTargetSlots() [1/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::NodeTargetSlots ( const int  begin, const int  end  )

inlinestaticconstexprprivate

Definition at line 554 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

NodeTargetSlots() [2/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::NodeTargetSlots ( const size_type  begin, const size_type  end  )

inlinestaticconstexprprivate

Definition at line 628 of file abseil-cpp/absl/container/internal/btree.h.

operator=() [1/2]

template<typename Params >

btree_node& absl::container_internal::btree_node< Params >::operator= ( btree_node< Params > const &  )

delete

operator=() [2/2]

template<typename Params >

btree_node& absl::container_internal::btree_node< Params >::operator= ( btree_node< Params > const &  )

delete

parent() [1/2]

template<typename Params >

btree_node* absl::container_internal::btree_node< Params >::parent ( ) const

inline

Definition at line 660 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

parent() [2/2]

template<typename Params >

btree_node* absl::container_internal::btree_node< Params >::parent ( ) const

inline

Definition at line 742 of file abseil-cpp/absl/container/internal/btree.h.

position() [1/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::position ( ) const

inline

Definition at line 633 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

position() [2/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::position ( ) const

inline

Definition at line 715 of file abseil-cpp/absl/container/internal/btree.h.

rebalance_left_to_right() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::rebalance_left_to_right	(	int	to_move,
		btree_node< Params > *	right,
		allocator_type *	alloc
	)

rebalance_left_to_right() [2/2]

template<typename P >

void absl::container_internal::btree_node< P >::rebalance_left_to_right	(	int	to_move,
		btree_node< Params > *	right,
		allocator_type *	alloc
	)

Definition at line 1810 of file abseil-cpp/absl/container/internal/btree.h.

rebalance_right_to_left() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::rebalance_right_to_left	(	int	to_move,
		btree_node< Params > *	right,
		allocator_type *	alloc
	)

rebalance_right_to_left() [2/2]

template<typename P >

void absl::container_internal::btree_node< P >::rebalance_right_to_left	(	int	to_move,
		btree_node< Params > *	right,
		allocator_type *	alloc
	)

Definition at line 1770 of file abseil-cpp/absl/container/internal/btree.h.

remove_values() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::remove_values	(	field_type	i,
		field_type	to_erase,
		allocator_type *	alloc
	)

remove_values() [2/2]

template<typename P >

void absl::container_internal::btree_node< P >::remove_values ( field_type  i, field_type  to_erase, allocator_type *  alloc  )

inline

Definition at line 1746 of file abseil-cpp/absl/container/internal/btree.h.

set_child() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_child ( int  i, btree_node< Params > *  c  )

inline

Definition at line 682 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

set_child() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_child ( int  i, btree_node< Params > *  c  )

inline

Definition at line 787 of file abseil-cpp/absl/container/internal/btree.h.

set_finish() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_finish ( field_type  v )

inlineprivate

Definition at line 623 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

set_finish() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_finish ( field_type  v )

inlineprivate

Definition at line 702 of file abseil-cpp/absl/container/internal/btree.h.

set_generation()

template<typename Params >

void absl::container_internal::btree_node< Params >::set_generation ( uint32_t  generation )

inline

Definition at line 767 of file abseil-cpp/absl/container/internal/btree.h.

set_max_count() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_max_count ( field_type  v )

inlineprivate

Definition at line 625 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

set_max_count() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_max_count ( field_type  v )

inlineprivate

Definition at line 704 of file abseil-cpp/absl/container/internal/btree.h.

set_parent() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_parent ( btree_node< Params > *  p )

inlineprivate

Definition at line 615 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

set_parent() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_parent ( btree_node< Params > *  p )

inlineprivate

Definition at line 694 of file abseil-cpp/absl/container/internal/btree.h.

set_position() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_position ( field_type  v )

inlineprivate

Definition at line 621 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

set_position() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_position ( field_type  v )

inlineprivate

Definition at line 700 of file abseil-cpp/absl/container/internal/btree.h.

set_start() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_start ( field_type  v )

inlineprivate

Definition at line 622 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

set_start() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::set_start ( field_type  v )

inlineprivate

Definition at line 701 of file abseil-cpp/absl/container/internal/btree.h.

SizeWithNSlots() [1/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::SizeWithNSlots ( size_type  n )

inlinestaticconstexprprivate

Definition at line 540 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

SizeWithNSlots() [2/2]

template<typename Params >

constexpr static size_type absl::container_internal::btree_node< Params >::SizeWithNSlots ( size_type  n )

inlinestaticconstexprprivate

Definition at line 612 of file abseil-cpp/absl/container/internal/btree.h.

slot() [1/4]

template<typename Params >

slot_type* absl::container_internal::btree_node< Params >::slot ( int  i )

inlineprivate

Definition at line 617 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

slot() [2/4]

template<typename Params >

slot_type* absl::container_internal::btree_node< Params >::slot ( int  i )

inlineprivate

Definition at line 696 of file abseil-cpp/absl/container/internal/btree.h.

slot() [3/4]

template<typename Params >

const slot_type* absl::container_internal::btree_node< Params >::slot ( int  i ) const

inlineprivate

Definition at line 620 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

slot() [4/4]

template<typename Params >

const slot_type* absl::container_internal::btree_node< Params >::slot ( int  i ) const

inlineprivate

Definition at line 699 of file abseil-cpp/absl/container/internal/btree.h.

split() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::split	(	int	insert_position,
		btree_node< Params > *	dest,
		allocator_type *	alloc
	)

split() [2/2]

template<typename P >

void absl::container_internal::btree_node< P >::split	(	int	insert_position,
		btree_node< Params > *	dest,
		allocator_type *	alloc
	)

Definition at line 1857 of file abseil-cpp/absl/container/internal/btree.h.

start() [1/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::start ( ) const

inline

Definition at line 636 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

start() [2/2]

template<typename Params >

field_type absl::container_internal::btree_node< Params >::start ( ) const

inline

Definition at line 718 of file abseil-cpp/absl/container/internal/btree.h.

start_child() [1/2]

template<typename Params >

btree_node* absl::container_internal::btree_node< Params >::start_child ( ) const

inline

Definition at line 677 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

start_child() [2/2]

template<typename Params >

btree_node* absl::container_internal::btree_node< Params >::start_child ( ) const

inline

Definition at line 782 of file abseil-cpp/absl/container/internal/btree.h.

start_slot() [1/2]

template<typename Params >

slot_type* absl::container_internal::btree_node< Params >::start_slot ( )

inlineprivate

Definition at line 618 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

start_slot() [2/2]

template<typename Params >

slot_type* absl::container_internal::btree_node< Params >::start_slot ( )

inlineprivate

Definition at line 697 of file abseil-cpp/absl/container/internal/btree.h.

transfer() [1/4]

template<typename Params >

void absl::container_internal::btree_node< Params >::transfer ( const size_type  dest_i, const size_type  src_i, btree_node< Params > *  src_node, allocator_type *  alloc  )

inlineprivate

Definition at line 886 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

transfer() [2/4]

template<typename Params >

void absl::container_internal::btree_node< Params >::transfer ( const size_type  dest_i, const size_type  src_i, btree_node< Params > *  src_node, allocator_type *  alloc  )

inlineprivate

Definition at line 995 of file abseil-cpp/absl/container/internal/btree.h.

transfer() [3/4]

template<typename Params >

static void absl::container_internal::btree_node< Params >::transfer ( slot_type *  dest, slot_type *  src, allocator_type *  alloc  )

inlinestaticprivate

Definition at line 879 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

transfer() [4/4]

template<typename Params >

static void absl::container_internal::btree_node< Params >::transfer ( slot_type *  dest, slot_type *  src, allocator_type *  alloc  )

inlinestaticprivate

Definition at line 988 of file abseil-cpp/absl/container/internal/btree.h.

transfer_n() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::transfer_n ( const size_type  n, const size_type  dest_i, const size_type  src_i, btree_node< Params > *  src_node, allocator_type *  alloc  )

inlineprivate

Definition at line 893 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

transfer_n() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::transfer_n ( const size_type  n, const size_type  dest_i, const size_type  src_i, btree_node< Params > *  src_node, allocator_type *  alloc  )

inlineprivate

Definition at line 1003 of file abseil-cpp/absl/container/internal/btree.h.

transfer_n_backward() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::transfer_n_backward ( const size_type  n, const size_type  dest_i, const size_type  src_i, btree_node< Params > *  src_node, allocator_type *  alloc  )

inlineprivate

Definition at line 905 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

transfer_n_backward() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::transfer_n_backward ( const size_type  n, const size_type  dest_i, const size_type  src_i, btree_node< Params > *  src_node, allocator_type *  alloc  )

inlineprivate

Definition at line 1016 of file abseil-cpp/absl/container/internal/btree.h.

upper_bound() [1/2]

template<typename Params >

template<typename K >

int absl::container_internal::btree_node< Params >::upper_bound ( const K &  k, const key_compare &  comp  ) const

inline

Definition at line 701 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

upper_bound() [2/2]

template<typename Params >

template<typename K >

int absl::container_internal::btree_node< Params >::upper_bound ( const K &  k, const key_compare &  comp  ) const

inline

Definition at line 806 of file abseil-cpp/absl/container/internal/btree.h.

value() [1/4]

template<typename Params >

reference absl::container_internal::btree_node< Params >::value ( int  i )

inline

Definition at line 672 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

value() [2/4]

template<typename Params >

reference absl::container_internal::btree_node< Params >::value ( int  i )

inline

Definition at line 777 of file abseil-cpp/absl/container/internal/btree.h.

value() [3/4]

template<typename Params >

const_reference absl::container_internal::btree_node< Params >::value ( int  i ) const

inline

Definition at line 673 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

value() [4/4]

template<typename Params >

const_reference absl::container_internal::btree_node< Params >::value ( int  i ) const

inline

Definition at line 778 of file abseil-cpp/absl/container/internal/btree.h.

value_destroy() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::value_destroy ( const field_type  i, allocator_type *  alloc  )

inlineprivate

Definition at line 867 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

value_destroy() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::value_destroy ( const field_type  i, allocator_type *  alloc  )

inlineprivate

Definition at line 974 of file abseil-cpp/absl/container/internal/btree.h.

value_destroy_n() [1/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::value_destroy_n ( const field_type  i, const field_type  n, allocator_type *  alloc  )

inlineprivate

Definition at line 871 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

value_destroy_n() [2/2]

template<typename Params >

void absl::container_internal::btree_node< Params >::value_destroy_n ( const field_type  i, const field_type  n, allocator_type *  alloc  )

inlineprivate

Definition at line 979 of file abseil-cpp/absl/container/internal/btree.h.

value_init() [1/2]

template<typename Params >

template<typename... Args>

void absl::container_internal::btree_node< Params >::value_init ( const field_type  i, allocator_type *  alloc, Args &&...  args  )

inlineprivate

Definition at line 863 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

value_init() [2/2]

template<typename Params >

template<typename... Args>

void absl::container_internal::btree_node< Params >::value_init ( const field_type  i, allocator_type *  alloc, Args &&...  args  )

inlineprivate

Definition at line 969 of file abseil-cpp/absl/container/internal/btree.h.

Friends And Related Function Documentation

btree [1/2]

template<typename Params >

template<typename P >

class btree

friend

Definition at line 916 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

btree [2/2]

template<typename Params >

template<typename P >

friend class btree

friend

Definition at line 1028 of file abseil-cpp/absl/container/internal/btree.h.

btree_access

template<typename Params >

friend struct btree_access

friend

Definition at line 1032 of file abseil-cpp/absl/container/internal/btree.h.

btree_iterator [1/2]

template<typename Params >

template<typename N , typename R , typename P >

friend struct btree_iterator

friend

Definition at line 918 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree.h.

btree_iterator [2/2]

template<typename Params >

template<typename N , typename R , typename P >

friend class btree_iterator

friend

Definition at line 1030 of file abseil-cpp/absl/container/internal/btree.h.

BtreeNodePeer

template<typename Params >

BtreeNodePeer

friend

Definition at line 1031 of file abseil-cpp/absl/container/internal/btree.h.

---

The documentation for this class was generated from the following file:

• abseil-cpp/absl/container/internal/btree.h