diff /usr/include/boost/intrusive/circular_list_algorithms.hpp intrusive/circular_list_algorithms.hpp
66,67c66,67
<       NodeTraits::set_next(this_node, node_ptr(0));
<       NodeTraits::set_previous(this_node, node_ptr(0));
---
>       NodeTraits::set_next(this_node, node_ptr());
>       NodeTraits::set_previous(this_node, node_ptr());
diff /usr/include/boost/intrusive/circular_slist_algorithms.hpp intrusive/circular_slist_algorithms.hpp
309c309
<       if(!n) return node_ptr(0);
---
>       if(!n) return node_ptr();
314c314
<          return node_ptr(0);
---
>          return node_ptr();
330c330
<                return node_ptr(0);
---
>                return node_ptr();
361c361
<       if(!n) return node_ptr(0);
---
>       if(!n) return node_ptr();
365c365
<       if(node_traits::get_next(first) == p) return node_ptr(0);
---
>       if(node_traits::get_next(first) == p) return node_ptr();
384c384
<          if(!new_before_last_pos)   return node_ptr(0);
---
>          if(!new_before_last_pos)   return node_ptr();
Gemeinsame Unterverzeichnisse: /usr/include/boost/intrusive/detail und intrusive/detail.
diff /usr/include/boost/intrusive/hashtable.hpp intrusive/hashtable.hpp
1220c1220
<       this->priv_insert_in_group(node_ptr(0), n, optimize_multikey_t());
---
>       this->priv_insert_in_group(node_ptr(), n, optimize_multikey_t());
2782c2782
<             dcast_bucket_ptr(it.pointed_node()) : node_ptr(0);
---
>             dcast_bucket_ptr(it.pointed_node()) : node_ptr();
diff /usr/include/boost/intrusive/linear_slist_algorithms.hpp intrusive/linear_slist_algorithms.hpp
140c140
<    {  NodeTraits::set_next(this_node, node_ptr(0));  }
---
>    {  NodeTraits::set_next(this_node, node_ptr());  }
199c199
<       if(!p) return node_ptr(0);
---
>       if(!p) return node_ptr();
222c222
<       std::pair<node_ptr, node_ptr> ret(node_ptr(0), node_ptr(0));
---
>       std::pair<node_ptr, node_ptr> ret(node_ptr(), node_ptr());
256c256
<          old_last = base_t::get_previous_node(first, node_ptr(0));
---
>          old_last = base_t::get_previous_node(first, node_ptr());
261c261
<       NodeTraits::set_next(new_last, node_ptr(0));
---
>       NodeTraits::set_next(new_last, node_ptr());
277c277
<       std::pair<node_ptr, node_ptr> ret(node_ptr(0), node_ptr(0));
---
>       std::pair<node_ptr, node_ptr> ret(node_ptr(), node_ptr());
315c315
<       NodeTraits::set_next(new_last, node_ptr(0));
---
>       NodeTraits::set_next(new_last, node_ptr());