forked from bakerstu/openmrn
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Adds a new data structure for maintaining the registry of eevent ids:…
… a sorted list-based map. This structure shows bad insertion characteristics, but is a lot more memory efficient than a RB tree while using the same cost for lookups. The insertion cost is offset a bit by lazy sorting.
- Loading branch information
1 parent
c209cc5
commit c774724
Showing
3 changed files
with
153 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,130 @@ | ||
| /** \copyright | ||
| * Copyright (c) 2015, Balazs Racz | ||
| * All rights reserved. | ||
| * | ||
| * Redistribution and use in source and binary forms, with or without | ||
| * modification, are permitted provided that the following conditions are met: | ||
| * | ||
| * - Redistributions of source code must retain the above copyright notice, | ||
| * this list of conditions and the following disclaimer. | ||
| * | ||
| * - Redistributions in binary form must reproduce the above copyright notice, | ||
| * this list of conditions and the following disclaimer in the documentation | ||
| * and/or other materials provided with the distribution. | ||
| * | ||
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | ||
| * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
| * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE | ||
| * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | ||
| * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | ||
| * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | ||
| * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | ||
| * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | ||
| * POSSIBILITY OF SUCH DAMAGE. | ||
| * | ||
| * \file SortedListMap.hxx | ||
| * Template class for maintaining a mapping by using a sorted list. | ||
| * | ||
| * @author Balazs Racz | ||
| * @date 30 August 2015 | ||
| */ | ||
|
|
||
| #ifndef _UTILS_SORTEDLISTMAP_HXX_ | ||
| #define _UTILS_SORTEDLISTMAP_HXX_ | ||
|
|
||
| #include <vector> | ||
| #include <algorithm> | ||
|
|
||
| template <class K, class V> class SortedListMap | ||
| { | ||
| public: | ||
| typedef K key_type; | ||
| typedef V value_type; | ||
| typedef std::pair<key_type, value_type> data_type; | ||
|
|
||
| private: | ||
| typedef std::vector<data_type> container_type; | ||
|
|
||
| public: | ||
| typedef typename container_type::iterator iterator; | ||
| typedef typename container_type::const_iterator const_iterator; | ||
|
|
||
| SortedListMap() | ||
| { | ||
| } | ||
|
|
||
| iterator begin() | ||
| { | ||
| lazy_init(); | ||
| return container_.begin(); | ||
| } | ||
|
|
||
| iterator end() | ||
| { | ||
| return container_.begin() + sortedCount_; | ||
| } | ||
|
|
||
| struct cmpop | ||
| { | ||
| bool operator()(const data_type &d, const key_type &k) | ||
| { | ||
| return d.first < k; | ||
| } | ||
| bool operator()(const key_type &k, const data_type &d) | ||
| { | ||
| return k < d.first; | ||
| } | ||
| }; | ||
|
|
||
| iterator lower_bound(key_type key) | ||
| { | ||
| lazy_init(); | ||
| return std::lower_bound(container_.begin(), container_.end(), key, | ||
| cmpop()); | ||
| } | ||
|
|
||
| iterator upper_bound(key_type key) | ||
| { | ||
| lazy_init(); | ||
| return std::upper_bound(container_.begin(), container_.end(), key, | ||
| cmpop()); | ||
| } | ||
|
|
||
| pair<iterator, iterator> equal_range(key_type key) | ||
| { | ||
| lazy_init(); | ||
| return std::equal_range(container_.begin(), container_.end(), key, | ||
| cmpop()); | ||
| } | ||
|
|
||
| void insert(data_type &&d) | ||
| { | ||
| container_.push_back(d); | ||
| } | ||
|
|
||
| void erase(const iterator &it) | ||
| { | ||
| container_.erase(it); | ||
| } | ||
|
|
||
| private: | ||
| /// Reestablishes sorted order in case anything was inserted or removed. | ||
| void lazy_init() | ||
| { | ||
| if (sortedCount_ != container_.size()) | ||
| { | ||
| sort(container_.begin(), container_.end()); | ||
| sortedCount_ = container_.size(); | ||
| } | ||
| } | ||
|
|
||
| /// Holds the actual data elements. | ||
| container_type container_; | ||
|
|
||
| /// The first this many elements in the container are already sorted. | ||
| size_t sortedCount_; | ||
| }; | ||
|
|
||
| #endif // _UTILS_SORTEDLISTMAP_HXX_ |