diff options
author | Karen Arutyunov <karen@codesynthesis.com> | 2017-05-01 16:08:43 +0300 |
---|---|---|
committer | Karen Arutyunov <karen@codesynthesis.com> | 2017-05-01 16:59:24 +0300 |
commit | 61377c582e0f2675baa5f5e6e30a35d1a4164b33 (patch) | |
tree | 11cdca992834d7f7f197f72856712fbcb3020e3d /butl/string-table | |
parent | 442c1a6790e52baa0c081f310d4d9e9b6f1ff638 (diff) |
Add hxx extension for headers and lib prefix for library dir
Diffstat (limited to 'butl/string-table')
-rw-r--r-- | butl/string-table | 98 |
1 files changed, 0 insertions, 98 deletions
diff --git a/butl/string-table b/butl/string-table deleted file mode 100644 index a1d60c3..0000000 --- a/butl/string-table +++ /dev/null @@ -1,98 +0,0 @@ -// file : butl/string-table -*- C++ -*- -// copyright : Copyright (c) 2014-2017 Code Synthesis Ltd -// license : MIT; see accompanying LICENSE file - -#ifndef BUTL_STRING_TABLE -#define BUTL_STRING_TABLE - -#include <vector> -#include <string> -#include <unordered_map> - -#include <butl/export> - -#include <butl/multi-index> - -namespace butl -{ - // A pool of strings and, optionally, other accompanying data in which - // each entry is assigned an individual index (or id) of type I (e.g., - // uint8_t, uint16_t, etc., depending on how many entries are expected). - // Index value 0 is reserved to indicate the "no entry" condition. - // - template <typename I, typename D> - struct string_table_element - { - const I i; - const D d; - }; - - template <typename I> - struct string_table_element<I, std::string> - { - const I i; - const std::string d; - }; - - // For custom data the options are to call the data member 'key' or to - // specialize this traits. - // - template <typename D> - struct string_table_traits - { - static const std::string& - key (const D& d) {return d.key;} - }; - - template <> - struct string_table_traits<std::string> - { - static const std::string& - key (const std::string& d) {return d;} - }; - - template <typename I, typename D = std::string> - struct string_table - { - // Insert new entry unless one already exists. - // - I - insert (const D&); - - // Find existing. - // - I - find (const std::string& k) const - { - auto i (map_.find (key_type (&k))); - return i != map_.end () ? i->second.i : 0; - } - - // Reverse lookup. - // - const D& - operator[] (I i) const {assert (i > 0); return vec_[i - 1]->second.d;} - - I - size () const {return static_cast<I> (vec_.size ());} - - bool - empty () const {return vec_.empty ();} - - void - clear () {vec_.clear (); map_.clear ();} - - private: - using key_type = butl::map_key<std::string>; - using value_type = string_table_element<I, D>; - using map_type = std::unordered_map<key_type, value_type>; - using traits = string_table_traits<D>; - - map_type map_; - std::vector<typename map_type::const_iterator> vec_; - }; -} - -#include <butl/string-table.txx> - -#endif // BUTL_STRING_TABLE |