|
template<typename T > |
void | adl_swap (T &x, T &y) |
|
| BOOST_STATIC_CONSTANT (std::size_t, sequenced_index_sort_max_fill=(std::size_t) std::numeric_limits< std::size_t >::digits+1) |
|
template<class Archive , typename Value , typename Allocator > |
void | load_construct_data (Archive &, boost::multi_index::detail::index_node_base< Value, Allocator > *, const unsigned int) |
|
template<typename F > |
scope_guard_impl0< F > | make_guard (F fun) |
|
template<typename F , typename P1 > |
scope_guard_impl1< F, P1 > | make_guard (F fun, P1 p1) |
|
template<typename F , typename P1 , typename P2 > |
scope_guard_impl2< F, P1, P2 > | make_guard (F fun, P1 p1, P2 p2) |
|
template<typename F , typename P1 , typename P2 , typename P3 > |
scope_guard_impl3< F, P1, P2, P3 > | make_guard (F fun, P1 p1, P2 p2, P3 p3) |
|
template<typename F , typename P1 , typename P2 , typename P3 , typename P4 > |
scope_guard_impl4< F, P1, P2, P3, P4 > | make_guard (F fun, P1 p1, P2 p2, P3 p3, P4 p4) |
|
template<typename C , typename F > |
null_guard_return< C::value, scope_guard_impl0< F > >::type | make_guard_if (F fun) |
|
template<typename C , typename F , typename P1 > |
null_guard_return< C::value, scope_guard_impl1< F, P1 > >::type | make_guard_if (F fun, P1 p1) |
|
template<typename C , typename F , typename P1 , typename P2 > |
null_guard_return< C::value, scope_guard_impl2< F, P1, P2 > >::type | make_guard_if (F fun, P1 p1, P2 p2) |
|
template<typename C , typename F , typename P1 , typename P2 , typename P3 > |
null_guard_return< C::value, scope_guard_impl3< F, P1, P2, P3 > >::type | make_guard_if (F fun, P1 p1, P2 p2, P3 p3) |
|
template<typename C , typename F , typename P1 , typename P2 , typename P3 , typename P4 > |
null_guard_return< C::value, scope_guard_impl4< F, P1, P2, P3, P4 > >::type | make_guard_if (F fun, P1 p1, P2 p2, P3 p3, P4 p4) |
|
template<bool cond, typename F > |
null_guard_return< cond, scope_guard_impl0< F > >::type | make_guard_if_c (F fun) |
|
template<bool cond, typename F , typename P1 > |
null_guard_return< cond, scope_guard_impl1< F, P1 > >::type | make_guard_if_c (F fun, P1 p1) |
|
template<bool cond, typename F , typename P1 , typename P2 > |
null_guard_return< cond, scope_guard_impl2< F, P1, P2 > >::type | make_guard_if_c (F fun, P1 p1, P2 p2) |
|
template<bool cond, typename F , typename P1 , typename P2 , typename P3 > |
null_guard_return< cond, scope_guard_impl3< F, P1, P2, P3 > >::type | make_guard_if_c (F fun, P1 p1, P2 p2, P3 p3) |
|
template<bool cond, typename F , typename P1 , typename P2 , typename P3 , typename P4 > |
null_guard_return< cond, scope_guard_impl4< F, P1, P2, P3, P4 > >::type | make_guard_if_c (F fun, P1 p1, P2 p2, P3 p3, P4 p4) |
|
template<class Obj , typename MemFun > |
obj_scope_guard_impl0< Obj, MemFun > | make_obj_guard (Obj &obj, MemFun mem_fun) |
|
template<class Obj , typename MemFun , typename P1 > |
obj_scope_guard_impl1< Obj, MemFun, P1 > | make_obj_guard (Obj &obj, MemFun mem_fun, P1 p1) |
|
template<class Obj , typename MemFun , typename P1 , typename P2 > |
obj_scope_guard_impl2< Obj, MemFun, P1, P2 > | make_obj_guard (Obj &obj, MemFun mem_fun, P1 p1, P2 p2) |
|
template<class Obj , typename MemFun , typename P1 , typename P2 , typename P3 > |
obj_scope_guard_impl3< Obj, MemFun, P1, P2, P3 > | make_obj_guard (Obj &obj, MemFun mem_fun, P1 p1, P2 p2, P3 p3) |
|
template<typename C , class Obj , typename MemFun > |
null_guard_return< C::value, obj_scope_guard_impl0< Obj, MemFun > >::type | make_obj_guard_if (Obj &obj, MemFun mem_fun) |
|
template<typename C , class Obj , typename MemFun , typename P1 > |
null_guard_return< C::value, obj_scope_guard_impl1< Obj, MemFun, P1 > >::type | make_obj_guard_if (Obj &obj, MemFun mem_fun, P1 p1) |
|
template<typename C , class Obj , typename MemFun , typename P1 , typename P2 > |
null_guard_return< C::value, obj_scope_guard_impl2< Obj, MemFun, P1, P2 > >::type | make_obj_guard_if (Obj &obj, MemFun mem_fun, P1 p1, P2 p2) |
|
template<typename C , class Obj , typename MemFun , typename P1 , typename P2 , typename P3 > |
null_guard_return< C::value, obj_scope_guard_impl3< Obj, MemFun, P1, P2, P3 > >::type | make_obj_guard_if (Obj &obj, MemFun mem_fun, P1 p1, P2 p2, P3 p3) |
|
template<bool cond, class Obj , typename MemFun > |
null_guard_return< cond, obj_scope_guard_impl0< Obj, MemFun > >::type | make_obj_guard_if_c (Obj &obj, MemFun mem_fun) |
|
template<bool cond, class Obj , typename MemFun , typename P1 > |
null_guard_return< cond, obj_scope_guard_impl1< Obj, MemFun, P1 > >::type | make_obj_guard_if_c (Obj &obj, MemFun mem_fun, P1 p1) |
|
template<bool cond, class Obj , typename MemFun , typename P1 , typename P2 > |
null_guard_return< cond, obj_scope_guard_impl2< Obj, MemFun, P1, P2 > >::type | make_obj_guard_if_c (Obj &obj, MemFun mem_fun, P1 p1, P2 p2) |
|
template<bool cond, class Obj , typename MemFun , typename P1 , typename P2 , typename P3 > |
null_guard_return< cond, obj_scope_guard_impl3< Obj, MemFun, P1, P2, P3 > >::type | make_obj_guard_if_c (Obj &obj, MemFun mem_fun, P1 p1, P2 p2, P3 p3) |
|
template<typename Node , typename Value > |
Node * | node_from_value (const Value *p) |
|
template<typename Node , typename Predicate > |
bool | operator!= (const duplicates_iterator< Node, Predicate > &x, const duplicates_iterator< Node, Predicate > &y) |
|
template<typename KeyFromValue1 , typename Compare1 , typename SuperMeta1 , typename TagList1 , typename Category1 , typename AugmentPolicy1 , typename KeyFromValue2 , typename Compare2 , typename SuperMeta2 , typename TagList2 , typename Category2 , typename AugmentPolicy2 > |
bool | operator!= (const ordered_index< KeyFromValue1, Compare1, SuperMeta1, TagList1, Category1, AugmentPolicy1 > &x, const ordered_index< KeyFromValue2, Compare2, SuperMeta2, TagList2, Category2, AugmentPolicy2 > &y) |
|
template<typename SuperMeta1 , typename TagList1 , typename SuperMeta2 , typename TagList2 > |
bool | operator!= (const sequenced_index< SuperMeta1, TagList1 > &x, const sequenced_index< SuperMeta2, TagList2 > &y) |
|
template<class Derived , class Base > |
random_access_iter_adaptor_base< Derived, Base >::difference_type | operator- (const random_access_iter_adaptor_base< Derived, Base > &x, const random_access_iter_adaptor_base< Derived, Base > &y) |
|
template<typename KeyFromValue1 , typename Compare1 , typename SuperMeta1 , typename TagList1 , typename Category1 , typename AugmentPolicy1 , typename KeyFromValue2 , typename Compare2 , typename SuperMeta2 , typename TagList2 , typename Category2 , typename AugmentPolicy2 > |
bool | operator< (const ordered_index< KeyFromValue1, Compare1, SuperMeta1, TagList1, Category1, AugmentPolicy1 > &x, const ordered_index< KeyFromValue2, Compare2, SuperMeta2, TagList2, Category2, AugmentPolicy2 > &y) |
|
template<class Derived , class Base > |
bool | operator< (const random_access_iter_adaptor_base< Derived, Base > &x, const random_access_iter_adaptor_base< Derived, Base > &y) |
|
template<typename SuperMeta1 , typename TagList1 , typename SuperMeta2 , typename TagList2 > |
bool | operator< (const sequenced_index< SuperMeta1, TagList1 > &x, const sequenced_index< SuperMeta2, TagList2 > &y) |
|
template<typename KeyFromValue1 , typename Compare1 , typename SuperMeta1 , typename TagList1 , typename Category1 , typename AugmentPolicy1 , typename KeyFromValue2 , typename Compare2 , typename SuperMeta2 , typename TagList2 , typename Category2 , typename AugmentPolicy2 > |
bool | operator<= (const ordered_index< KeyFromValue1, Compare1, SuperMeta1, TagList1, Category1, AugmentPolicy1 > &x, const ordered_index< KeyFromValue2, Compare2, SuperMeta2, TagList2, Category2, AugmentPolicy2 > &y) |
|
template<typename SuperMeta1 , typename TagList1 , typename SuperMeta2 , typename TagList2 > |
bool | operator<= (const sequenced_index< SuperMeta1, TagList1 > &x, const sequenced_index< SuperMeta2, TagList2 > &y) |
|
template<typename Node > |
bool | operator== (const bidir_node_iterator< Node > &x, const bidir_node_iterator< Node > &y) |
|
template<class Derived , class Base > |
bool | operator== (const bidirectional_iter_adaptor_base< Derived, Base > &x, const bidirectional_iter_adaptor_base< Derived, Base > &y) |
|
template<typename Node , typename Predicate > |
bool | operator== (const duplicates_iterator< Node, Predicate > &x, const duplicates_iterator< Node, Predicate > &y) |
|
template<class Derived , class Base > |
bool | operator== (const forward_iter_adaptor_base< Derived, Base > &x, const forward_iter_adaptor_base< Derived, Base > &y) |
|
template<typename KeyFromValue1 , typename Compare1 , typename SuperMeta1 , typename TagList1 , typename Category1 , typename AugmentPolicy1 , typename KeyFromValue2 , typename Compare2 , typename SuperMeta2 , typename TagList2 , typename Category2 , typename AugmentPolicy2 > |
bool | operator== (const ordered_index< KeyFromValue1, Compare1, SuperMeta1, TagList1, Category1, AugmentPolicy1 > &x, const ordered_index< KeyFromValue2, Compare2, SuperMeta2, TagList2, Category2, AugmentPolicy2 > &y) |
|
template<class Derived , class Base > |
bool | operator== (const random_access_iter_adaptor_base< Derived, Base > &x, const random_access_iter_adaptor_base< Derived, Base > &y) |
|
template<typename SuperMeta1 , typename TagList1 , typename SuperMeta2 , typename TagList2 > |
bool | operator== (const sequenced_index< SuperMeta1, TagList1 > &x, const sequenced_index< SuperMeta2, TagList2 > &y) |
|
template<typename KeyFromValue1 , typename Compare1 , typename SuperMeta1 , typename TagList1 , typename Category1 , typename AugmentPolicy1 , typename KeyFromValue2 , typename Compare2 , typename SuperMeta2 , typename TagList2 , typename Category2 , typename AugmentPolicy2 > |
bool | operator> (const ordered_index< KeyFromValue1, Compare1, SuperMeta1, TagList1, Category1, AugmentPolicy1 > &x, const ordered_index< KeyFromValue2, Compare2, SuperMeta2, TagList2, Category2, AugmentPolicy2 > &y) |
|
template<typename SuperMeta1 , typename TagList1 , typename SuperMeta2 , typename TagList2 > |
bool | operator> (const sequenced_index< SuperMeta1, TagList1 > &x, const sequenced_index< SuperMeta2, TagList2 > &y) |
|
template<typename KeyFromValue1 , typename Compare1 , typename SuperMeta1 , typename TagList1 , typename Category1 , typename AugmentPolicy1 , typename KeyFromValue2 , typename Compare2 , typename SuperMeta2 , typename TagList2 , typename Category2 , typename AugmentPolicy2 > |
bool | operator>= (const ordered_index< KeyFromValue1, Compare1, SuperMeta1, TagList1, Category1, AugmentPolicy1 > &x, const ordered_index< KeyFromValue2, Compare2, SuperMeta2, TagList2, Category2, AugmentPolicy2 > &y) |
|
template<typename SuperMeta1 , typename TagList1 , typename SuperMeta2 , typename TagList2 > |
bool | operator>= (const sequenced_index< SuperMeta1, TagList1 > &x, const sequenced_index< SuperMeta2, TagList2 > &y) |
|
template<typename Node , typename KeyFromValue , typename CompatibleCompare > |
std::pair< Node *, Node * > | ordered_index_equal_range (Node *top, Node *y, const KeyFromValue &key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type &x, const CompatibleCompare &comp, mpl::true_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
std::pair< Node *, Node * > | ordered_index_equal_range (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
std::pair< Node *, Node * > | ordered_index_equal_range (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp, mpl::false_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleCompare > |
Node * | ordered_index_find (Node *top, Node *y, const KeyFromValue &key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type &x, const CompatibleCompare &comp, mpl::true_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
Node * | ordered_index_find (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
Node * | ordered_index_find (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp, mpl::false_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleCompare > |
Node * | ordered_index_lower_bound (Node *top, Node *y, const KeyFromValue &key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type &x, const CompatibleCompare &comp, mpl::true_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
Node * | ordered_index_lower_bound (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
Node * | ordered_index_lower_bound (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp, mpl::false_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleCompare > |
Node * | ordered_index_upper_bound (Node *top, Node *y, const KeyFromValue &key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type &x, const CompatibleCompare &comp, mpl::true_) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
Node * | ordered_index_upper_bound (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp) |
|
template<typename Node , typename KeyFromValue , typename CompatibleKey , typename CompatibleCompare > |
Node * | ordered_index_upper_bound (Node *top, Node *y, const KeyFromValue &key, const CompatibleKey &x, const CompatibleCompare &comp, mpl::false_) |
|
template<typename RawPointer , typename Pointer > |
RawPointer | raw_ptr (Pointer const &p) |
|
template<typename RawPointer , typename Pointer > |
RawPointer | raw_ptr (Pointer const &p, mpl::false_) |
|
template<typename RawPointer > |
RawPointer | raw_ptr (RawPointer const &p, mpl::true_) |
|
template<typename Node , typename Compare > |
void | sequenced_index_collate (BOOST_DEDUCED_TYPENAME Node::impl_type *x, BOOST_DEDUCED_TYPENAME Node::impl_type *y, Compare comp) |
|
template<typename SequencedIndex , typename Compare > |
void | sequenced_index_merge (SequencedIndex &x, SequencedIndex &y, Compare comp) |
|
template<typename SequencedIndex , typename Predicate > |
void | sequenced_index_remove (SequencedIndex &x, Predicate pred) |
|
template<typename Node , typename Compare > |
void | sequenced_index_sort (Node *header, Compare comp) |
|
template<typename SequencedIndex , class BinaryPredicate > |
void | sequenced_index_unique (SequencedIndex &x, BinaryPredicate binary_pred) |
|
template<typename T , typename Allocator > |
void | swap (auto_space< T, Allocator > &x, auto_space< T, Allocator > &y) |
|
template<typename KeyFromValue , typename Compare , typename SuperMeta , typename TagList , typename Category , typename AugmentPolicy > |
void | swap (ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category, AugmentPolicy > &x, ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category, AugmentPolicy > &y) |
|
template<typename SuperMeta , typename TagList > |
void | swap (sequenced_index< SuperMeta, TagList > &x, sequenced_index< SuperMeta, TagList > &y) |
|
template<typename Value , typename... Args> |
Value * | vartempl_placement_new (Value *x, Args &&... args) |
|