stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node Struct Reference

Extended structure of a inner node in-memory. More...

List of all members.

Public Types
typedef _Alloc::template rebind< inner_node >::other	alloc_type
	Define an related allocator for the inner_node structs.
Public Member Functions
void	initialize (const unsigned short l)
	Set variables to initial values.
bool	isfull () const
	True if the node's slots are full.
bool	isfew () const
	True if few used entries, less than half full.
bool	isunderflow () const
	True if node has too few entries.
Public Attributes
key_type	slotkey [innerslotmax]
	Keys of children or data pointers.
node *	childid [innerslotmax+1]
	Pointers to children.

---

Detailed Description

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
struct stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node

Extended structure of a inner node in-memory.

Contains only keys and no data items.

Definition at line 250 of file btree.h.

---

Member Typedef Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

typedef _Alloc::template rebind<inner_node>::other stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::alloc_type

Define an related allocator for the inner_node structs.

Definition at line 253 of file btree.h.

---

Member Function Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

void stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::initialize

(

const unsigned short

l

)

[inline]

Set variables to initial values.

Reimplemented from stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node.

Definition at line 262 of file btree.h.

Referenced by stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::allocate_inner().

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::isfew

(

)

const [inline]

True if few used entries, less than half full.

Definition at line 274 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::mininnerslots, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse.

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::isfull

(

)

const [inline]

True if the node's slots are full.

Definition at line 268 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::innerslotmax, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse.

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::isunderflow

(

)

const [inline]

True if node has too few entries.

Definition at line 280 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::mininnerslots, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse.

---

Member Data Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

node* stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::childid[innerslotmax+1]

Pointers to children.

Definition at line 259 of file btree.h.

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

key_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::slotkey[innerslotmax]

Keys of children or data pointers.

Definition at line 256 of file btree.h.

---

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

• stx/btree.h