| 1 | diff /usr/include/boost/intrusive/circular_list_algorithms.hpp intrusive/circular_list_algorithms.hpp
|
|---|
| 2 | 66,67c66,67
|
|---|
| 3 | < NodeTraits::set_next(this_node, node_ptr(0));
|
|---|
| 4 | < NodeTraits::set_previous(this_node, node_ptr(0));
|
|---|
| 5 | ---
|
|---|
| 6 | > NodeTraits::set_next(this_node, node_ptr());
|
|---|
| 7 | > NodeTraits::set_previous(this_node, node_ptr());
|
|---|
| 8 | diff /usr/include/boost/intrusive/circular_slist_algorithms.hpp intrusive/circular_slist_algorithms.hpp
|
|---|
| 9 | 309c309
|
|---|
| 10 | < if(!n) return node_ptr(0);
|
|---|
| 11 | ---
|
|---|
| 12 | > if(!n) return node_ptr();
|
|---|
| 13 | 314c314
|
|---|
| 14 | < return node_ptr(0);
|
|---|
| 15 | ---
|
|---|
| 16 | > return node_ptr();
|
|---|
| 17 | 330c330
|
|---|
| 18 | < return node_ptr(0);
|
|---|
| 19 | ---
|
|---|
| 20 | > return node_ptr();
|
|---|
| 21 | 361c361
|
|---|
| 22 | < if(!n) return node_ptr(0);
|
|---|
| 23 | ---
|
|---|
| 24 | > if(!n) return node_ptr();
|
|---|
| 25 | 365c365
|
|---|
| 26 | < if(node_traits::get_next(first) == p) return node_ptr(0);
|
|---|
| 27 | ---
|
|---|
| 28 | > if(node_traits::get_next(first) == p) return node_ptr();
|
|---|
| 29 | 384c384
|
|---|
| 30 | < if(!new_before_last_pos) return node_ptr(0);
|
|---|
| 31 | ---
|
|---|
| 32 | > if(!new_before_last_pos) return node_ptr();
|
|---|
| 33 | Gemeinsame Unterverzeichnisse: /usr/include/boost/intrusive/detail und intrusive/detail.
|
|---|
| 34 | diff /usr/include/boost/intrusive/hashtable.hpp intrusive/hashtable.hpp
|
|---|
| 35 | 1220c1220
|
|---|
| 36 | < this->priv_insert_in_group(node_ptr(0), n, optimize_multikey_t());
|
|---|
| 37 | ---
|
|---|
| 38 | > this->priv_insert_in_group(node_ptr(), n, optimize_multikey_t());
|
|---|
| 39 | 2782c2782
|
|---|
| 40 | < dcast_bucket_ptr(it.pointed_node()) : node_ptr(0);
|
|---|
| 41 | ---
|
|---|
| 42 | > dcast_bucket_ptr(it.pointed_node()) : node_ptr();
|
|---|
| 43 | diff /usr/include/boost/intrusive/linear_slist_algorithms.hpp intrusive/linear_slist_algorithms.hpp
|
|---|
| 44 | 140c140
|
|---|
| 45 | < { NodeTraits::set_next(this_node, node_ptr(0)); }
|
|---|
| 46 | ---
|
|---|
| 47 | > { NodeTraits::set_next(this_node, node_ptr()); }
|
|---|
| 48 | 199c199
|
|---|
| 49 | < if(!p) return node_ptr(0);
|
|---|
| 50 | ---
|
|---|
| 51 | > if(!p) return node_ptr();
|
|---|
| 52 | 222c222
|
|---|
| 53 | < std::pair<node_ptr, node_ptr> ret(node_ptr(0), node_ptr(0));
|
|---|
| 54 | ---
|
|---|
| 55 | > std::pair<node_ptr, node_ptr> ret(node_ptr(), node_ptr());
|
|---|
| 56 | 256c256
|
|---|
| 57 | < old_last = base_t::get_previous_node(first, node_ptr(0));
|
|---|
| 58 | ---
|
|---|
| 59 | > old_last = base_t::get_previous_node(first, node_ptr());
|
|---|
| 60 | 261c261
|
|---|
| 61 | < NodeTraits::set_next(new_last, node_ptr(0));
|
|---|
| 62 | ---
|
|---|
| 63 | > NodeTraits::set_next(new_last, node_ptr());
|
|---|
| 64 | 277c277
|
|---|
| 65 | < std::pair<node_ptr, node_ptr> ret(node_ptr(0), node_ptr(0));
|
|---|
| 66 | ---
|
|---|
| 67 | > std::pair<node_ptr, node_ptr> ret(node_ptr(), node_ptr());
|
|---|
| 68 | 315c315
|
|---|
| 69 | < NodeTraits::set_next(new_last, node_ptr(0));
|
|---|
| 70 | ---
|
|---|
| 71 | > NodeTraits::set_next(new_last, node_ptr());
|
|---|
