Add PeerFinder::Checker for testing endpoints

src/ripple/validators/impl/Tuning.h

@@ -153,94 +153,6 @@ private:
     Info m_back_info;
 };
 
-//------------------------------------------------------------------------------
-
-/** Cycled set of unique keys. */
-template <class Key,
-          class Hash = typename Key::hasher,
-          class KeyEqual = std::equal_to <Key>,
-          class Allocator = std::allocator <Key> >
-class CycledSet
-{
-private:
-    typedef boost::unordered_set <
-        Key, Hash, KeyEqual, Allocator>                     ContainerType;
-    typedef typename ContainerType::iterator                iterator;
-
-public:
-    typedef typename ContainerType::key_type                key_type;
-    typedef typename ContainerType::value_type              value_type;
-    typedef typename ContainerType::size_type               size_type;
-    typedef typename ContainerType::difference_type         difference_type;
-    typedef typename ContainerType::hasher                  hasher;
-    typedef typename ContainerType::key_equal               key_equal;
-    typedef typename ContainerType::allocator_type          allocator_type;
-    typedef typename ContainerType::reference               reference;
-    typedef typename ContainerType::const_reference         const_reference;
-    typedef typename ContainerType::pointer                 pointer;
-    typedef typename ContainerType::const_pointer           const_pointer;
-
-    explicit CycledSet (
-        size_type item_max,
-        Hash hash = Hash(),
-        KeyEqual equal = KeyEqual(),
-        Allocator alloc = Allocator())
-        : m_max (item_max)
-        , m_hash (hash)
-        , m_equal (equal)
-        , m_alloc (alloc)
-        , m_front (m_max, hash, equal, alloc)
-        , m_back (m_max, hash, equal, alloc)
-    {
-    }
-
-    // Returns `true` if the next real insert would swap
-    bool full() const
-    {
-        return m_front.size() >= m_max;
-    }
-
-    // Adds the key to the front if its not in either map
-    bool insert (key_type const& key)
-    {
-        if (full())
-            cycle ();
-        if (m_back.find (key) != m_back.end())
-            return false;
-        std::pair <iterator, bool> result (
-            m_front.insert (key));
-        if (result.second)
-            return true;
-        return false;
-    }
-
-#if 0
-    bool find (key_type const& key)
-    {
-        if (m_front.find (key) != m_front.end())
-            return true;
-        return m_back.find (key) != m_back.end();
-    }
-#endif
-
-    void cycle ()
-    {
-        std::swap (m_front, m_back);
-        m_front.clear ();
-#if BOOST_VERSION > 105400
-        m_front.reserve (m_max);
-#endif
-    }
-
-private:
-    size_type m_max;
-    hasher m_hash;
-    key_equal m_equal;
-    allocator_type m_alloc;
-    ContainerType m_front;
-    ContainerType m_back;
-};
-
 }
 }