Hush Full Node software. We were censored from Github, this is where all development happens now.
https://hush.is
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
81 lines
3.3 KiB
81 lines
3.3 KiB
// Copyright (c) 2016-2024 The Hush developers
|
|
// Copyright (c) 2012-2015 The Bitcoin Core developers
|
|
// Distributed under the GPLv3 software license, see the accompanying
|
|
// file COPYING or https://www.gnu.org/licenses/gpl-3.0.en.html
|
|
|
|
/******************************************************************************
|
|
* Copyright © 2014-2019 The SuperNET Developers. *
|
|
* *
|
|
* See the AUTHORS, DEVELOPER-AGREEMENT and LICENSE files at *
|
|
* the top-level directory of this distribution for the individual copyright *
|
|
* holder information and the developer policies on copyright and licensing. *
|
|
* *
|
|
* Unless otherwise agreed in a custom licensing agreement, no part of the *
|
|
* SuperNET software, including this file may be copied, modified, propagated *
|
|
* or distributed except according to the terms contained in the LICENSE file *
|
|
* *
|
|
* Removal or modification of this copyright notice is prohibited. *
|
|
* *
|
|
******************************************************************************/
|
|
|
|
#ifndef HUSH_MRUSET_H
|
|
#define HUSH_MRUSET_H
|
|
|
|
#include <set>
|
|
#include <vector>
|
|
#include <utility>
|
|
|
|
/** STL-like set container that only keeps the most recent N elements. */
|
|
template <typename T>
|
|
class mruset
|
|
{
|
|
public:
|
|
typedef T key_type;
|
|
typedef T value_type;
|
|
typedef typename std::set<T>::iterator iterator;
|
|
typedef typename std::set<T>::const_iterator const_iterator;
|
|
typedef typename std::set<T>::size_type size_type;
|
|
|
|
protected:
|
|
std::set<T> set;
|
|
std::vector<iterator> order;
|
|
size_type first_used;
|
|
size_type first_unused;
|
|
const size_type nMaxSize;
|
|
|
|
public:
|
|
mruset(size_type nMaxSizeIn = 1) : nMaxSize(nMaxSizeIn) { clear(); }
|
|
iterator begin() const { return set.begin(); }
|
|
iterator end() const { return set.end(); }
|
|
size_type size() const { return set.size(); }
|
|
bool empty() const { return set.empty(); }
|
|
iterator find(const key_type& k) const { return set.find(k); }
|
|
size_type count(const key_type& k) const { return set.count(k); }
|
|
void clear()
|
|
{
|
|
set.clear();
|
|
order.assign(nMaxSize, set.end());
|
|
first_used = 0;
|
|
first_unused = 0;
|
|
}
|
|
bool inline friend operator==(const mruset<T>& a, const mruset<T>& b) { return a.set == b.set; }
|
|
bool inline friend operator==(const mruset<T>& a, const std::set<T>& b) { return a.set == b; }
|
|
bool inline friend operator<(const mruset<T>& a, const mruset<T>& b) { return a.set < b.set; }
|
|
std::pair<iterator, bool> insert(const key_type& x)
|
|
{
|
|
std::pair<iterator, bool> ret = set.insert(x);
|
|
if (ret.second) {
|
|
if (set.size() == nMaxSize + 1) {
|
|
set.erase(order[first_used]);
|
|
order[first_used] = set.end();
|
|
if (++first_used == nMaxSize) first_used = 0;
|
|
}
|
|
order[first_unused] = ret.first;
|
|
if (++first_unused == nMaxSize) first_unused = 0;
|
|
}
|
|
return ret;
|
|
}
|
|
size_type max_size() const { return nMaxSize; }
|
|
};
|
|
|
|
#endif // HUSH_MRUSET_H
|
|
|