1 // Copyright (c) 2012 The Bitcoin developers
2 // Distributed under the MIT/X11 software license, see the accompanying
3 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
4 #ifndef BITCOIN_MRUSET_H
5 #define BITCOIN_MRUSET_H
10 template <typename T> class mruset
15 typedef typename std::set<T>::iterator iterator;
16 typedef typename std::set<T>::const_iterator const_iterator;
17 typedef typename std::set<T>::size_type size_type;
25 mruset(size_type nMaxSizeIn = 0) { nMaxSize = nMaxSizeIn; }
26 iterator begin() const { return set.begin(); }
27 iterator end() const { return set.end(); }
28 size_type size() const { return set.size(); }
29 bool empty() const { return set.empty(); }
30 iterator find(const key_type& k) const { return set.find(k); }
31 size_type count(const key_type& k) const { return set.count(k); }
32 bool inline friend operator==(const mruset<T>& a, const mruset<T>& b) { return a.set == b.set; }
33 bool inline friend operator==(const mruset<T>& a, const std::set<T>& b) { return a.set == b; }
34 bool inline friend operator<(const mruset<T>& a, const mruset<T>& b) { return a.set < b.set; }
35 std::pair<iterator, bool> insert(const key_type& x)
37 std::pair<iterator, bool> ret = set.insert(x);
40 if (nMaxSize && queue.size() == nMaxSize)
42 set.erase(queue.front());
49 size_type max_size() const { return nMaxSize; }
50 size_type max_size(size_type s)
53 while (queue.size() >= s)
55 set.erase(queue.front());