1 files changed, 0 insertions, 123 deletions
diff --git a/build2/rule-map.hxx b/build2/rule-map.hxx
deleted file mode 100644
index 52e4b9f..0000000
--- a/build2/rule-map.hxx
+++ /dev/null
@@ -1,123 +0,0 @@
-// file      : build2/rule-map.hxx -*- C++ -*-
-// copyright : Copyright (c) 2014-2019 Code Synthesis Ltd
-// license   : MIT; see accompanying LICENSE file
-
-#ifndef BUILD2_RULE_MAP_HXX
-#define BUILD2_RULE_MAP_HXX
-
-#include <map>
-
-#include <libbutl/prefix-map.mxx>
-
-#include <build2/types.hxx>
-#include <build2/utility.hxx>
-
-#include <build2/action.hxx>
-
-namespace build2
-{
-  class rule;
-
-  using hint_rule_map =
-    butl::prefix_map<string, reference_wrapper<const rule>, '.'>;
-
-  using target_type_rule_map = std::map<const target_type*, hint_rule_map>;
-
-  // This is an "indexed map" with operation_id being the index. Entry
-  // with id 0 is a wildcard.
-  //
-  // Note that while we may resize some vectors during non-serial load, this
-  // is MT-safe since we never cache any references to their elements.
-  //
-  class operation_rule_map
-  {
-  public:
-    template <typename T>
-    void
-    insert (operation_id oid, const char* hint, const rule& r)
-    {
-      // 3 is the number of builtin operations.
-      //
-      if (oid >= map_.size ())
-        map_.resize ((oid < 3 ? 3 : oid) + 1);
-
-      map_[oid][&T::static_type].emplace (hint, r);
-    }
-
-    // Return NULL if not found.
-    //
-    const target_type_rule_map*
-    operator[] (operation_id oid) const
-    {
-      return map_.size () > oid ? &map_[oid] : nullptr;
-    }
-
-    bool
-    empty () const {return map_.empty ();}
-
-  private:
-    vector<target_type_rule_map> map_;
-  };
-
-  // This is another indexed map but this time meta_operation_id is the
-  // index. The implementation is different, however: here we use a linked
-  // list with the first, statically-allocated node corresponding to the
-  // perform meta-operation. The idea is to try and get away with a dynamic
-  // allocation for the common cases since most rules will be registered
-  // for perform, at least on non-root scopes.
-  //
-  // @@ Redo using small_vector?
-  //
-  class rule_map
-  {
-  public:
-
-    template <typename T>
-    void
-    insert (action_id a, const char* hint, const rule& r)
-    {
-      insert<T> (a >> 4, a & 0x0F, hint, r);
-    }
-
-    // 0 oid is a wildcard.
-    //
-    template <typename T>
-    void
-    insert (meta_operation_id mid,
-            operation_id oid,
-            const char* hint,
-            const rule& r)
-    {
-      if (mid_ == mid)
-        map_.insert<T> (oid, hint, r);
-      else
-      {
-        if (next_ == nullptr)
-          next_.reset (new rule_map (mid));
-
-        next_->insert<T> (mid, oid, hint, r);
-      }
-    }
-
-    // Return NULL if not found.
-    //
-    const operation_rule_map*
-    operator[] (meta_operation_id mid) const
-    {
-      return mid == mid_ ? &map_ : next_ == nullptr ? nullptr : (*next_)[mid];
-    }
-
-    explicit
-    rule_map (meta_operation_id mid = perform_id): mid_ (mid) {}
-
-    bool
-    empty () const {return map_.empty () && next_ == nullptr;}
-
-  private:
-    meta_operation_id mid_;
-    operation_rule_map map_;
-    unique_ptr<rule_map> next_;
-  };
-}
-
-#endif // BUILD2_RULE_MAP_HXX