aboutsummaryrefslogtreecommitdiff
path: root/libbutl/string-table.hxx
diff options
context:
space:
mode:
authorBoris Kolpackov <boris@codesynthesis.com>2017-09-22 23:32:28 +0200
committerBoris Kolpackov <boris@codesynthesis.com>2017-09-22 23:32:28 +0200
commitc09cd7512491cee1e82c1ad8128ce9fd4bc3f79b (patch)
treea659ed768d849130ab5780a11b7f791a463a1a91 /libbutl/string-table.hxx
parent2a00871f07067f8f9e2de08bb9c8f50e1bf6a650 (diff)
Initial modularization with both Clang and VC hacks
Note: gave up on VC about half way though.
Diffstat (limited to 'libbutl/string-table.hxx')
-rw-r--r--libbutl/string-table.hxx98
1 files changed, 0 insertions, 98 deletions
diff --git a/libbutl/string-table.hxx b/libbutl/string-table.hxx
deleted file mode 100644
index 6898a52..0000000
--- a/libbutl/string-table.hxx
+++ /dev/null
@@ -1,98 +0,0 @@
-// file : libbutl/string-table.hxx -*- C++ -*-
-// copyright : Copyright (c) 2014-2017 Code Synthesis Ltd
-// license : MIT; see accompanying LICENSE file
-
-#ifndef LIBBUTL_STRING_TABLE_HXX
-#define LIBBUTL_STRING_TABLE_HXX
-
-#include <vector>
-#include <string>
-#include <unordered_map>
-
-#include <libbutl/export.hxx>
-
-#include <libbutl/multi-index.hxx>
-
-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 <libbutl/string-table.txx>
-
-#endif // LIBBUTL_STRING_TABLE_HXX