Name	Size	Mode	Actions
algorithm.hpp	2880	0644	editdlrm
algo_type.hpp	1303	0644	editdlrm
any_node_and_algorithms.hpp	9467	0644	editdlrm
array_initializer.hpp	2235	0644	editdlrm
assert.hpp	1520	0644	editdlrm
avltree_node.hpp	6714	0644	editdlrm
bstree_algorithms_base.hpp	5523	0644	editdlrm
common_slist_algorithms.hpp	5974	0644	editdlrm
config_begin.hpp	2456	0644	editdlrm
config_end.hpp	496	0644	editdlrm
default_header_holder.hpp	2243	0644	editdlrm
ebo_functor_holder.hpp	8005	0644	editdlrm
empty_node_checker.hpp	1243	0644	editdlrm
equal_to_value.hpp	1217	0644	editdlrm
exception_disposer.hpp	2132	0644	editdlrm
function_detector.hpp	3456	0644	editdlrm
generic_hook.hpp	6588	0644	editdlrm
get_value_traits.hpp	7098	0644	editdlrm
hashtable_node.hpp	10234	0644	editdlrm
has_member_function_callable_with.hpp	18438	0644	editdlrm
hook_traits.hpp	8438	0644	editdlrm
iiterator.hpp	4446	0644	editdlrm
is_stateful_value_traits.hpp	2524	0644	editdlrm
iterator.hpp	7612	0644	editdlrm
key_nodeptr_comp.hpp	4882	0644	editdlrm
list_iterator.hpp	5230	0644	editdlrm
list_node.hpp	2152	0644	editdlrm
math.hpp	8059	0644	editdlrm
minimal_less_equal_header.hpp	932	0644	editdlrm
minimal_pair_header.hpp	904	0644	editdlrm
mpl.hpp	8592	0644	editdlrm
node_cloner_disposer.hpp	3973	0644	editdlrm
node_holder.hpp	883	0644	editdlrm
node_to_value.hpp	3994	0644	editdlrm
parent_from_member.hpp	4191	0644	editdlrm
rbtree_node.hpp	6952	0644	editdlrm
reverse_iterator.hpp	4644	0644	editdlrm
simple_disposers.hpp	1177	0644	editdlrm
size_holder.hpp	2261	0644	editdlrm
slist_iterator.hpp	4968	0644	editdlrm
slist_node.hpp	1907	0644	editdlrm
std_fwd.hpp	1226	0644	editdlrm
transform_iterator.hpp	5789	0644	editdlrm
tree_iterator.hpp	6605	0644	editdlrm
tree_node.hpp	2307	0644	editdlrm
tree_value_compare.hpp	7711	0644	editdlrm
uncast.hpp	1646	0644	editdlrm
workaround.hpp	2061	0644	editdlrm

///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Olaf Krzikalla 2004-2006. // (C) Copyright Ion Gaztanaga 2006-2013 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/intrusive for documentation. // ///////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTRUSIVE_LIST_NODE_HPP #define BOOST_INTRUSIVE_LIST_NODE_HPP #ifndef BOOST_CONFIG_HPP # include #endif #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include namespace boost { namespace intrusive { // list_node_traits can be used with circular_list_algorithms and supplies // a list_node holding the pointers needed for a double-linked list // it is used by list_derived_node and list_member_node template struct list_node { typedef typename pointer_rebind::type node_ptr; node_ptr next_; node_ptr prev_; }; template struct list_node_traits { typedef list_node node; typedef typename node::node_ptr node_ptr; typedef typename pointer_rebind::type const_node_ptr; BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous(const const_node_ptr & n) { return n->prev_; } BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous(const node_ptr & n) { return n->prev_; } BOOST_INTRUSIVE_FORCEINLINE static void set_previous(node_ptr n, node_ptr prev) { n->prev_ = prev; } BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) { return n->next_; } BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const node_ptr & n) { return n->next_; } BOOST_INTRUSIVE_FORCEINLINE static void set_next(node_ptr n, node_ptr next) { n->next_ = next; } }; } //namespace intrusive } //namespace boost #endif //BOOST_INTRUSIVE_LIST_NODE_HPP