The hash-map offered in the unordered_map container has a fairly complex construction interface, and Hash is an attempt to simplify this part of its interface. In practice, hashing uses a textual key, which may be std::string or char * based, and the keys may be used either case sensitively or case insensitively. Hash merely requires its users to specify the map's value type, while the key may be a char const * or std::string, used case sensitively or case insensitively.
All variants define value_type as the corresponding unordered_map value_type. In practice a value_type defines a std::pair<Key, Value>, where Key represents the hash's key-type and Value represents the hash's value type.
Variants of the FBB::Hash container are available for char const * or std::string keys, used case sensitively or case insensitively.
All variants support default and move construction (as well as move assignment), support construction from initializer lists. and support construction from iterators defining a half-open range of value_type values.
The following variants are available (showing their default constructors). Value refers to the value type stored in the hash table.
#include <iostream>
#include <bobcat/hash>
using namespace std;
using namespace FBB;
pair<char const *, size_t> ap[] =
{
pair<char const *, size_t>("one", 1),
pair<char const *, size_t>("two", 2),
};
int main()
{
HashCharPtr<size_t> hcp;
HashCharPtr<size_t> hcp2(ap, ap + 2);
HashCharPtr<size_t> hcp3(hcp2);
hcp = hcp2;
cout << hcp2["one"] << endl;
}
Debian Bobcat project files: