template class axl::sl::HandleTableBase

#include <axl_sl_HandleTable.h>

template <
    typename Key,
    typename Value,
    typename ValueArg = typename ArgType<Value>::Type
    >
class HandleTableBase: public axl::sl::HashTable
{
public:
    // construction

    HandleTableBase(Key seed = 1);

    // methods

    void
    reset(Key seed = 1);

    Key
    add(ValueArg value);

    Key
    add(
        Key key,
        ValueArg value
        );
};

Inherited Members

public:
    // typedefs

    typedef HashTableEntry<Key, Value> Entry;
    typedef sl::Iterator<Entry> Iterator;
    typedef sl::ConstIterator<Entry> ConstIterator;
    typedef Entry::Bucket Bucket;

    // enums

    enum Def;

    // methods

    Value&
    operator[](KeyArg key);

    void
    clear();

    bool
    isEmpty() const;

    Iterator
    getHead();

    ConstIterator
    getHead() const;

    Iterator
    getTail();

    ConstIterator
    getTail() const;

    size_t
    getCount() const;

    size_t
    getBucketCount() const;

    bool
    setBucketCount(size_t bucketCount);

    size_t
    getResizeThreshold() const;

    void
    setResizeThreshold(size_t resizeThreshold);

    Iterator
    find(KeyArg key);

    ConstIterator
    find(KeyArg key) const;

    Value
    findValue(
        KeyArg key,
        ValueArg undefinedValue
        ) const;

    Iterator
    visit(KeyArg key);

    Iterator
    add(
        KeyArg key,
        ValueArg value,
        bool* isNew = NULL
        );

    Iterator
    addIfNotExists(
        KeyArg key,
        ValueArg value
        );

    void
    erase(Iterator it);

    bool
    eraseKey(KeyArg key);

    bool
    sortByKey();

    template <typename Compare>
    bool
    sortByKey(Compare compare);

    bool
    sortByValue();

    template <typename Compare>
    bool
    sortByValue(Compare compare);