/* * Copyright (c) 2019 German Mendez Bravo (Kronuz) * Copyright (c) 2013 Google Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * * A btree::set<> implements the STL unique sorted associative container * interface (a.k.a set<>) using a btree. See btree.h for details of the btree * implementation and caveats. */ #ifndef BTREE_SET_H__ #define BTREE_SET_H__ #include "btree.h" namespace btree { // The set class is needed mainly for its constructors. template , typename Alloc = std::allocator, int TargetNodeSize = 256> class set : public btree_unique_container< btree > > { typedef set self_type; typedef btree_set_params params_type; typedef btree btree_type; typedef btree_unique_container super_type; public: typedef typename btree_type::key_compare key_compare; typedef typename btree_type::allocator_type allocator_type; public: // Default constructor. set(const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type()) : super_type(comp, alloc) { } // Copy constructor. set(const self_type& x) : super_type(x) { } // Range constructor. template set(InputIterator b, InputIterator e, const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type()) : super_type(b, e, comp, alloc) { } }; } // namespace btree template bool operator==(const btree::set& lhs, const btree::set& rhs) { return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin()); } template bool operator<(const btree::set& lhs, const btree::set& rhs) { return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()); } template bool operator!=(const btree::set& lhs, const btree::set& rhs) { return !(lhs == rhs); } template bool operator>(const btree::set& lhs, const btree::set& rhs) { return rhs < lhs; } template bool operator>=(const btree::set& lhs, const btree::set& rhs) { return !(lhs < rhs); } template bool operator<=(const btree::set& lhs, const btree::set& rhs) { return !(rhs < lhs); } template inline void swap(btree::set& x, btree::set& y) { x.swap(y); } namespace btree { // The multiset class is needed mainly for its constructors. template , typename Alloc = std::allocator, int TargetNodeSize = 256> class multiset : public btree_multi_container< btree > > { typedef multiset self_type; typedef btree_set_params params_type; typedef btree btree_type; typedef btree_multi_container super_type; public: typedef typename btree_type::key_compare key_compare; typedef typename btree_type::allocator_type allocator_type; public: // Default constructor. multiset(const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type()) : super_type(comp, alloc) { } // Copy constructor. multiset(const self_type& x) : super_type(x) { } // Range constructor. template multiset(InputIterator b, InputIterator e, const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type()) : super_type(b, e, comp, alloc) { } }; } // namespace btree template bool operator==(const btree::multiset& lhs, const btree::multiset& rhs) { return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin()); } template bool operator<(const btree::multiset& lhs, const btree::multiset& rhs) { return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()); } template bool operator!=(const btree::multiset& lhs, const btree::multiset& rhs) { return !(lhs == rhs); } template bool operator>(const btree::multiset& lhs, const btree::multiset& rhs) { return rhs < lhs; } template bool operator>=(const btree::multiset& lhs, const btree::multiset& rhs) { return !(lhs < rhs); } template bool operator<=(const btree::multiset& lhs, const btree::multiset& rhs) { return !(rhs < lhs); } template inline void swap(btree::multiset& x, btree::multiset& y) { x.swap(y); } #endif // BTREE_SET_H__