| /third_party/boost/libs/ptr_container/test/ |
| D | incomplete_type_test.cpp | 27 Composite* new_clone( const Composite& );
72 elements_.push_back( new_clone( c ) ); in add()
122 Composite* new_clone( const Composite& c ) in new_clone() function
161 c.add( new_clone( c ) ); // add c to itself in test_incomplete()
|
| D | tut1.cpp | 86 animal* new_clone( const animal& a ) in new_clone() function
|
| D | test_data.hpp | 116 inline Base* new_clone( const Base& b ) in new_clone() function
|
| D | ptr_unordered_map.cpp | 56 inline abstract_base* new_clone( const abstract_base& r ) in new_clone() function
|
| D | ptr_map.cpp | 56 inline abstract_base* new_clone( const abstract_base& r ) in new_clone() function
|
| /third_party/boost/boost/ptr_container/ |
| D | clone_allocator.hpp | 26 inline T* new_clone( const T& r ) in new_clone() function
57 return new_clone( r ); in allocate_clone()
|
| D | ptr_set.hpp | 136 inline ptr_set<K,C,CA,A>* new_clone( const ptr_set<K,C,CA,A>& r ) in new_clone() function
142 inline ptr_multiset<K,C,CA,A>* new_clone( const ptr_multiset<K,C,CA,A>& r ) in new_clone() function
|
| D | ptr_map.hpp | 144 inline ptr_map<K,T,C,CA,A>* new_clone( const ptr_map<K,T,C,CA,A>& r ) in new_clone() function
150 inline ptr_multimap<K,T,C,CA,A>* new_clone( const ptr_multimap<K,T,C,CA,A>& r ) in new_clone() function
|
| D | ptr_unordered_set.hpp | 217 new_clone( const ptr_unordered_set<K,H,P,CA,A>& r ) in new_clone() function
224 new_clone( const ptr_unordered_multiset<K,H,P,CA,A>& r ) in new_clone() function
|
| D | ptr_deque.hpp | 60 inline ptr_deque<T,CA,A>* new_clone( const ptr_deque<T,CA,A>& r ) in new_clone() function
|
| D | ptr_unordered_map.hpp | 225 new_clone( const ptr_unordered_map<K,T,H,P,CA,A>& r ) in new_clone() function
232 new_clone( const ptr_unordered_multimap<K,T,H,P,CA,A>& r ) in new_clone() function
|
| D | ptr_vector.hpp | 80 inline ptr_vector<T,CA,A>* new_clone( const ptr_vector<T,CA,A>& r ) in new_clone() function
|
| D | ptr_list.hpp | 101 inline ptr_list<T,CA,A>* new_clone( const ptr_list<T,CA,A>& r ) in new_clone() function
|
| D | ptr_array.hpp | 279 inline ptr_array<T,size,CA>* new_clone( const ptr_array<T,size,CA>& r ) in new_clone() function
|
| D | ptr_circular_buffer.hpp | 559 inline ptr_circular_buffer<T,CA,A>* new_clone( const ptr_circular_buffer<T,CA,A>& r ) in new_clone() function
|
| /third_party/boost/libs/ptr_container/doc/ |
| D | reference.rst | 102 …new_clone(a);`` ``T*`` Allocate a new object that can be …
118 inline T* new_clone( const T& t )
137 ``new_clone()`` and ``delete_clone()``. This means that one does not need to overload or specialize
202 return new_clone( r );
214 schemes by relying on ``new_clone()`` and ``delete_clone()``.
|
| D | examples.rst | 73 X* new_clone( const X& x )
93 list.push_back( new_clone( x ) ); // insert a clone
|
| D | headers.rst | 15 … and functions ``new_clone()`` and ``delete_clone()``
|
| D | faq.rst | 46 new_clone( const Foo& ) { ... }
|
| D | reversible_ptr_container.rst | 148 new_clone( const reversible_ptr_container<T,CA,VPC>& r );
459 new_clone( const reversible_ptr_container<T,CA,VPC>& r );``
|
| D | tutorial.rst | 254 done by defining a free-standing function, ``new_clone()``,
258 inline animal* new_clone( const animal& a )
|