123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220 |
- /*
- * Frozen
- * Copyright 2016 QuarksLab
- *
- * Licensed to the Apache Software Foundation (ASF) under one
- * or more contributor license agreements. See the NOTICE file
- * distributed with this work for additional information
- * regarding copyright ownership. The ASF licenses this file
- * to you 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.
- */
-
- #ifndef FROZEN_SET_H
- #define FROZEN_SET_H
-
- #include "frozen/bits/algorithms.h"
- #include "frozen/bits/basic_types.h"
- #include "frozen/bits/constexpr_assert.h"
- #include "frozen/bits/version.h"
-
- #include <utility>
-
- namespace frozen {
-
- template <class Key, std::size_t N, class Compare = std::less<Key>> class set {
- using container_type = bits::carray<Key, N>;
- Compare less_than_;
- container_type keys_;
-
- public:
- /* container typedefs*/
- using key_type = Key;
- using value_type = Key;
- using size_type = typename container_type::size_type;
- using difference_type = typename container_type::size_type;
- using key_compare = Compare;
- using value_compare = Compare;
- using reference = typename container_type::const_reference;
- using const_reference = reference;
- using pointer = typename container_type::const_pointer;
- using const_pointer = pointer;
- using iterator = typename container_type::const_iterator;
- using reverse_iterator = typename container_type::const_reverse_iterator;
- using const_iterator = iterator;
- using const_reverse_iterator = reverse_iterator;
-
- public:
- /* constructors */
- constexpr set(const set &other) = default;
-
- constexpr set(container_type keys, Compare const & comp)
- : less_than_{comp}
- , keys_(bits::quicksort(keys, less_than_)) {
- }
-
- explicit constexpr set(container_type keys)
- : set{keys, Compare{}} {}
-
- constexpr set(std::initializer_list<Key> keys, Compare const & comp)
- : set{container_type{keys}, comp} {
- constexpr_assert(keys.size() == N, "Inconsistent initializer_list size and type size argument");
- }
-
- constexpr set(std::initializer_list<Key> keys)
- : set{keys, Compare{}} {}
-
- /* capacity */
- constexpr bool empty() const { return !N; }
- constexpr size_type size() const { return N; }
- constexpr size_type max_size() const { return N; }
-
- /* lookup */
- constexpr std::size_t count(Key const &key) const {
- return bits::binary_search<N>(keys_.begin(), key, less_than_);
- }
-
- constexpr const_iterator find(Key const &key) const {
- const_iterator where = lower_bound(key);
- if ((where != end()) && !less_than_(key, *where))
- return where;
- else
- return end();
- }
-
- constexpr std::pair<const_iterator, const_iterator> equal_range(Key const &key) const {
- auto const lower = lower_bound(key);
- if (lower == end())
- return {lower, lower};
- else
- return {lower, lower + 1};
- }
-
- constexpr const_iterator lower_bound(Key const &key) const {
- auto const where = bits::lower_bound<N>(keys_.begin(), key, less_than_);
- if ((where != end()) && !less_than_(key, *where))
- return where;
- else
- return end();
- }
-
- constexpr const_iterator upper_bound(Key const &key) const {
- auto const where = bits::lower_bound<N>(keys_.begin(), key, less_than_);
- if ((where != end()) && !less_than_(key, *where))
- return where + 1;
- else
- return end();
- }
-
- /* observers */
- constexpr key_compare key_comp() const { return less_than_; }
- constexpr key_compare value_comp() const { return less_than_; }
-
- /* iterators */
- constexpr const_iterator begin() const { return keys_.begin(); }
- constexpr const_iterator cbegin() const { return keys_.cbegin(); }
- constexpr const_iterator end() const { return keys_.end(); }
- constexpr const_iterator cend() const { return keys_.cend(); }
-
- constexpr const_reverse_iterator rbegin() const { return keys_.rbegin(); }
- constexpr const_reverse_iterator crbegin() const { return keys_.crbegin(); }
- constexpr const_reverse_iterator rend() const { return keys_.rend(); }
- constexpr const_reverse_iterator crend() const { return keys_.crend(); }
-
- /* comparison */
- constexpr bool operator==(set const& rhs) const { return bits::equal(begin(), end(), rhs.begin()); }
- constexpr bool operator!=(set const& rhs) const { return !(*this == rhs); }
- constexpr bool operator<(set const& rhs) const { return bits::lexicographical_compare(begin(), end(), rhs.begin(), rhs.end()); }
- constexpr bool operator<=(set const& rhs) const { return (*this < rhs) || (*this == rhs); }
- constexpr bool operator>(set const& rhs) const { return bits::lexicographical_compare(rhs.begin(), rhs.end(), begin(), end()); }
- constexpr bool operator>=(set const& rhs) const { return (*this > rhs) || (*this == rhs); }
- };
-
- template <class Key, class Compare> class set<Key, 0, Compare> {
- using container_type = bits::carray<Key, 0>; // just for the type definitions
- Compare less_than_;
-
- public:
- /* container typedefs*/
- using key_type = Key;
- using value_type = Key;
- using size_type = typename container_type::size_type;
- using difference_type = typename container_type::size_type;
- using key_compare = Compare;
- using value_compare = Compare;
- using reference = typename container_type::const_reference;
- using const_reference = reference;
- using pointer = typename container_type::const_pointer;
- using const_pointer = pointer;
- using iterator = pointer;
- using reverse_iterator = pointer;
- using const_iterator = const_pointer;
- using const_reverse_iterator = const_pointer;
-
- public:
- /* constructors */
- constexpr set(const set &other) = default;
- constexpr set(bits::carray<Key, 0>, Compare const &) {}
- explicit constexpr set(bits::carray<Key, 0>) {}
-
- constexpr set(std::initializer_list<Key>, Compare const &comp)
- : less_than_{comp} {}
- constexpr set(std::initializer_list<Key> keys) : set{keys, Compare{}} {}
-
- /* capacity */
- constexpr bool empty() const { return true; }
- constexpr size_type size() const { return 0; }
- constexpr size_type max_size() const { return 0; }
-
- /* lookup */
- constexpr std::size_t count(Key const &) const { return 0; }
-
- constexpr const_iterator find(Key const &) const { return end(); }
-
- constexpr std::pair<const_iterator, const_iterator>
- equal_range(Key const &) const { return {end(), end()}; }
-
- constexpr const_iterator lower_bound(Key const &) const { return end(); }
-
- constexpr const_iterator upper_bound(Key const &) const { return end(); }
-
- /* observers */
- constexpr key_compare key_comp() const { return less_than_; }
- constexpr key_compare value_comp() const { return less_than_; }
-
- /* iterators */
- constexpr const_iterator begin() const { return nullptr; }
- constexpr const_iterator cbegin() const { return nullptr; }
- constexpr const_iterator end() const { return nullptr; }
- constexpr const_iterator cend() const { return nullptr; }
-
- constexpr const_reverse_iterator rbegin() const { return nullptr; }
- constexpr const_reverse_iterator crbegin() const { return nullptr; }
- constexpr const_reverse_iterator rend() const { return nullptr; }
- constexpr const_reverse_iterator crend() const { return nullptr; }
- };
-
- template <typename T>
- constexpr auto make_set(bits::ignored_arg = {}/* for consistency with the initializer below for N = 0*/) {
- return set<T, 0>{};
- }
-
- template <typename T, std::size_t N>
- constexpr auto make_set(const T (&args)[N]) {
- return set<T, N>(args);
- }
-
-
- } // namespace frozen
-
- #endif
|