aboutsummaryrefslogtreecommitdiff
path: root/build/string-table
diff options
context:
space:
mode:
authorBoris Kolpackov <boris@codesynthesis.com>2015-06-18 14:47:24 +0200
committerBoris Kolpackov <boris@codesynthesis.com>2015-06-18 14:47:24 +0200
commit7817d08a8a3c9dee2a8c8da7aee1ad369ee1f12e (patch)
treecc420e7b4301cc8fbe07484bc4d0391eb16ae880 /build/string-table
parent63e7a4a77cb8ceed7b42561fe3202b0b48d86db6 (diff)
Move string-table from build2 to libbutl
Diffstat (limited to 'build/string-table')
-rw-r--r--build/string-table86
1 files changed, 0 insertions, 86 deletions
diff --git a/build/string-table b/build/string-table
deleted file mode 100644
index 0188c62..0000000
--- a/build/string-table
+++ /dev/null
@@ -1,86 +0,0 @@
-// file : build/string-table -*- C++ -*-
-// copyright : Copyright (c) 2014-2015 Code Synthesis Ltd
-// license : MIT; see accompanying LICENSE file
-
-#ifndef BUILD_STRING_TABLE
-#define BUILD_STRING_TABLE
-
-#include <vector>
-#include <string>
-#include <unordered_map>
-
-#include <butl/multi-index>
-
-namespace build
-{
- // 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;
- };
-
- template <typename D>
- struct string_table_traits;
-
- 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 ();}
-
- 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 <build/string-table.txx>
-
-#endif // BUILD_STRING_TABLE