https://github.com/nlohmann/fifo_map
a FIFO-ordered associative container for C++
https://github.com/nlohmann/fifo_map
associative-map container fifo ordered stl
Last synced: 2 months ago
JSON representation
a FIFO-ordered associative container for C++
- Host: GitHub
- URL: https://github.com/nlohmann/fifo_map
- Owner: nlohmann
- License: mit
- Created: 2015-08-15T16:12:43.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2023-06-15T18:45:13.000Z (about 2 years ago)
- Last Synced: 2025-04-02T11:06:33.597Z (3 months ago)
- Topics: associative-map, container, fifo, ordered, stl
- Language: C++
- Homepage:
- Size: 146 KB
- Stars: 190
- Watchers: 13
- Forks: 80
- Open Issues: 6
-
Metadata Files:
- Readme: README.md
- Funding: .github/FUNDING.yml
- License: LICENSE.MIT
Awesome Lists containing this project
README
[](https://travis-ci.org/nlohmann/fifo_map)
[](https://ci.appveyor.com/project/nlohmann/fifo-map)
[](https://coveralls.io/r/nlohmann/fifo_map)
[](http://melpon.org/wandbox/permlink/l2f2Qxhq95qVKRgE)
[](https://raw.githubusercontent.com/nlohmann/fifo_map/master/LICENSE.MIT)
[](https://github.com/nlohmann/fifo_map/releases)
[](http://github.com/nlohmann/fifo_map/issues)
# `fifo_map` – a FIFO-ordered associative container for C++
## Overview
C++ allows to defined associative containers such as `std::map`. The values are ordered according to their keys and an ordering relation. The `fifo_map` is an associative container which uses **the order in which keys were inserted to the container** as ordering relation.
As it has the same interface than `std::map`, it can be used as drop-in replacement. The code is header-only (see file [src/fifo_map.hpp](https://github.com/nlohmann/fifo_map/blob/master/src/fifo_map.hpp)) and only relies on the STL.
## Complexity
A `fifo_map` object has the space overhead of:
- one `std::unordered_map` object to store the key order,
- one pointer to this object in the `Compare` object.
Inserting a value (via `operator[]`, `insert`) and removing a value (`erase`) rely on `std::unordered_map::insert` and `std::unordered_map::erase` which have O(1) average complexity and O(n) worst-case complexity. All other methods have the same performance as the equivalent `std::map` options.
## Example
```cpp
#include "src/fifo_map.hpp"
// for convenience
using nlohmann::fifo_map;
int main() {
// create fifo_map with template arguments
fifo_map m;
// add elements
m[2] = "two";
m[3] = "three";
m[1] = "one";
// output the map; will print
// 2: two
// 3: three
// 1: one
for (auto x : m) {
std::cout << x.first << ": " << x.second << "\n";
}
// delete an element
m.erase(2);
// re-add element
m[2] = "zwei";
// output the map; will print
// 3: three
// 1: one
// 2: zwei
for (auto x : m) {
std::cout << x.first << ": " << x.second << "\n";
}
}
```
[Try this code online.](http://melpon.org/wandbox/permlink/l2f2Qxhq95qVKRgE)
## License
The code is licensed under the [MIT License](http://opensource.org/licenses/MIT):
Copyright © 2015-2017 [Niels Lohmann](http://nlohmann.me)
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
## Execute unit tests
To compile and run the tests, you need to execute
```sh
$ make
$ ./unit
===============================================================================
All tests passed (1286 assertions in 8 test cases)
```
For more information, have a look at the file [.travis.yml](https://github.com/nlohmann/fifo_map/blob/master/.travis.yml).