/
usr
/
include
/
boost
/
ptr_container
/
/usr/include/boost/ptr_container
mkdir
upload
Name
Size
Mode
Actions
detail/
-
0755
rm
clone_allocator.hpp
2152
0644
edit
dl
rm
exception.hpp
1326
0644
edit
dl
rm
indirect_fun.hpp
3693
0644
edit
dl
rm
nullable.hpp
2228
0644
edit
dl
rm
ptr_array.hpp
8447
0644
edit
dl
rm
ptr_circular_buffer.hpp
19479
0644
edit
dl
rm
ptr_container.hpp
958
0644
edit
dl
rm
ptr_deque.hpp
2327
0644
edit
dl
rm
ptr_inserter.hpp
8022
0644
edit
dl
rm
ptr_list.hpp
3672
0644
edit
dl
rm
ptr_map.hpp
5330
0644
edit
dl
rm
ptr_map_adapter.hpp
37286
0644
edit
dl
rm
ptr_sequence_adapter.hpp
26831
0644
edit
dl
rm
ptr_set.hpp
5375
0644
edit
dl
rm
ptr_set_adapter.hpp
29568
0644
edit
dl
rm
ptr_unordered_map.hpp
8618
0644
edit
dl
rm
ptr_unordered_set.hpp
8831
0644
edit
dl
rm
ptr_vector.hpp
2955
0644
edit
dl
rm
serialize_ptr_array.hpp
1399
0644
edit
dl
rm
serialize_ptr_circular_buffer.hpp
1408
0644
edit
dl
rm
serialize_ptr_container.hpp
806
0644
edit
dl
rm
serialize_ptr_deque.hpp
729
0644
edit
dl
rm
serialize_ptr_list.hpp
725
0644
edit
dl
rm
serialize_ptr_map.hpp
1012
0644
edit
dl
rm
serialize_ptr_set.hpp
932
0644
edit
dl
rm
serialize_ptr_unordered_map.hpp
1227
0644
edit
dl
rm
serialize_ptr_unordered_set.hpp
1195
0644
edit
dl
rm
serialize_ptr_vector.hpp
1217
0644
edit
dl
rm
Edit:
/usr/include/boost/ptr_container/ptr_unordered_set.hpp
(8831B)
// // Boost.Pointer Container // // Copyright Thorsten Ottosen 2008. Use, modification and // distribution is subject to 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) // // For more information, see http://www.boost.org/libs/ptr_container/ // #ifndef BOOST_PTR_CONTAINER_PTR_UNORDERED_SET_HPP #define BOOST_PTR_CONTAINER_PTR_UNORDERED_SET_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include <boost/ptr_container/indirect_fun.hpp> #include <boost/ptr_container/ptr_set_adapter.hpp> #include <boost/ptr_container/detail/ptr_container_disable_deprecated.hpp> #include <boost/unordered_set.hpp> #if defined(BOOST_PTR_CONTAINER_DISABLE_DEPRECATED) #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wdeprecated-declarations" #endif namespace boost { template < class Key, class Hash = boost::hash<Key>, class Pred = std::equal_to<Key>, class CloneAllocator = heap_clone_allocator, class Allocator = std::allocator< typename ptr_container_detail::void_ptr<Key>::type > > class ptr_unordered_set : public ptr_set_adapter< Key, boost::unordered_set< typename ptr_container_detail::void_ptr<Key>::type, void_ptr_indirect_fun<Hash,Key>, void_ptr_indirect_fun<Pred,Key>,Allocator>, CloneAllocator, false > { typedef ptr_set_adapter< Key, boost::unordered_set< typename ptr_container_detail::void_ptr<Key>::type, void_ptr_indirect_fun<Hash,Key>, void_ptr_indirect_fun<Pred,Key>,Allocator>, CloneAllocator, false > base_type; typedef ptr_unordered_set<Key,Hash,Pred,CloneAllocator,Allocator> this_type; public: typedef typename base_type::size_type size_type; private: using base_type::lower_bound; using base_type::upper_bound; using base_type::rbegin; using base_type::rend; using base_type::crbegin; using base_type::crend; using base_type::key_comp; using base_type::value_comp; using base_type::front; using base_type::back; public: using base_type::begin; using base_type::end; using base_type::cbegin; using base_type::cend; using base_type::bucket_count; using base_type::max_bucket_count; using base_type::bucket_size; using base_type::bucket; using base_type::load_factor; using base_type::max_load_factor; using base_type::rehash; using base_type::key_eq; using base_type::hash_function; public: ptr_unordered_set() {} explicit ptr_unordered_set( size_type n ) : base_type( n, ptr_container_detail::unordered_associative_container_tag() ) { } ptr_unordered_set( size_type n, const Hash& comp, const Pred& pred = Pred(), const Allocator& a = Allocator() ) : base_type( n, comp, pred, a ) { } template< typename InputIterator > ptr_unordered_set( InputIterator first, InputIterator last ) : base_type( first, last ) { } template< typename InputIterator > ptr_unordered_set( InputIterator first, InputIterator last, const Hash& comp, const Pred& pred = Pred(), const Allocator& a = Allocator() ) : base_type( first, last, comp, pred, a ) { } BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( ptr_unordered_set, base_type, this_type ) BOOST_PTR_CONTAINER_DEFINE_COPY_CONSTRUCTORS( ptr_unordered_set, base_type ) }; template < class Key, class Hash = boost::hash<Key>, class Pred = std::equal_to<Key>, class CloneAllocator = heap_clone_allocator, class Allocator = std::allocator<void*> > class ptr_unordered_multiset : public ptr_multiset_adapter< Key, boost::unordered_multiset<void*,void_ptr_indirect_fun<Hash,Key>, void_ptr_indirect_fun<Pred,Key>,Allocator>, CloneAllocator, false > { typedef ptr_multiset_adapter< Key, boost::unordered_multiset<void*,void_ptr_indirect_fun<Hash,Key>, void_ptr_indirect_fun<Pred,Key>,Allocator>, CloneAllocator, false > base_type; typedef ptr_unordered_multiset<Key,Hash,Pred,CloneAllocator,Allocator> this_type; public: typedef typename base_type::size_type size_type; private: using base_type::lower_bound; using base_type::upper_bound; using base_type::rbegin; using base_type::rend; using base_type::crbegin; using base_type::crend; using base_type::key_comp; using base_type::value_comp; using base_type::front; using base_type::back; public: using base_type::begin; using base_type::end; using base_type::cbegin; using base_type::cend; using base_type::bucket_count; using base_type::max_bucket_count; using base_type::bucket_size; using base_type::bucket; using base_type::load_factor; using base_type::max_load_factor; using base_type::rehash; using base_type::key_eq; using base_type::hash_function; public: ptr_unordered_multiset() { } explicit ptr_unordered_multiset( size_type n ) : base_type( n, ptr_container_detail::unordered_associative_container_tag() ) { } ptr_unordered_multiset( size_type n, const Hash& comp, const Pred& pred = Pred(), const Allocator& a = Allocator() ) : base_type( n, comp, pred, a ) { } template< typename InputIterator > ptr_unordered_multiset( InputIterator first, InputIterator last ) : base_type( first, last ) { } template< typename InputIterator > ptr_unordered_multiset( InputIterator first, InputIterator last, const Hash& comp, const Pred& pred = Pred(), const Allocator& a = Allocator() ) : base_type( first, last, comp, pred, a ) { } BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( ptr_unordered_multiset, base_type, this_type ) BOOST_PTR_CONTAINER_DEFINE_COPY_CONSTRUCTORS( ptr_unordered_multiset, base_type ) }; ///////////////////////////////////////////////////////////////////////// // clonability template< typename K, typename H, typename P, typename CA, typename A > inline ptr_unordered_set<K,H,P,CA,A>* new_clone( const ptr_unordered_set<K,H,P,CA,A>& r ) { return r.clone().release(); } template< typename K, typename H, typename P, typename CA, typename A > inline ptr_unordered_multiset<K,H,P,CA,A>* new_clone( const ptr_unordered_multiset<K,H,P,CA,A>& r ) { return r.clone().release(); } ///////////////////////////////////////////////////////////////////////// // swap template< typename K, typename H, typename P, typename CA, typename A > inline void swap( ptr_unordered_set<K,H,P,CA,A>& l, ptr_unordered_set<K,H,P,CA,A>& r ) { l.swap(r); } template< typename K, typename H, typename P, typename CA, typename A > inline void swap( ptr_unordered_multiset<K,H,P,CA,A>& l, ptr_unordered_multiset<K,H,P,CA,A>& r ) { l.swap(r); } } #if defined(BOOST_PTR_CONTAINER_DISABLE_DEPRECATED) #pragma GCC diagnostic pop #endif #endif
Save
cmd:
run