Get rid of C++ modules related code and rename *.mxx files to *.hxx

1 files changed, 0 insertions, 188 deletions

diff --git a/libbutl/prefix-map.mxx b/libbutl/prefix-map.mxx
deleted file mode 100644
index 634b8da..0000000
--- a/libbutl/prefix-map.mxx
+++ /dev/null
@@ -1,188 +0,0 @@
-// file      : libbutl/prefix-map.mxx -*- C++ -*-
-// license   : MIT; see accompanying LICENSE file
-
-#ifndef __cpp_modules_ts
-#pragma once
-#endif
-
-// C includes.
-
-#ifndef __cpp_lib_modules_ts
-#include <map>
-#include <string>
-#include <utility>   // move()
-#include <algorithm> // min()
-#endif
-
-// Other includes.
-
-#ifdef __cpp_modules_ts
-export module butl.prefix_map;
-#ifdef __cpp_lib_modules_ts
-import std.core;
-#endif
-#endif
-
-#include <libbutl/export.hxx>
-
-LIBBUTL_MODEXPORT namespace butl
-{
-  // A map of hierarchical "paths", e.g., 'foo.bar' or 'foo/bar' with the
-  // ability to retrieve a range of entries that have a specific prefix as
-  // well as finding the most qualified entry for specific path. The '.' and
-  // '/' above are the delimiter characters.
-  //
-  // Note that as a special rule, the default implementation of compare_prefix
-  // treats empty key as everyone's prefix even if the paths don't start with
-  // the delimiter (useful to represent a "root path").
-  //
-  // Implementation-wise, the idea is to pretend that each key ends with the
-  // delimiter. This way we automatically avoid matching 'foobar' as having a
-  // prefix 'foo'.
-  //
-  template <typename K>
-  struct compare_prefix;
-
-  template <typename C>
-  struct compare_prefix<std::basic_string<C>>
-  {
-    typedef std::basic_string<C> K;
-
-    typedef C delimiter_type;
-    typedef typename K::size_type size_type;
-    typedef typename K::traits_type traits_type;
-
-    explicit
-    compare_prefix (delimiter_type d): d_ (d) {}
-
-    bool
-    operator() (const K& x, const K& y) const
-    {
-      return compare (x.c_str (), x.size (), y.c_str (), y.size ()) < 0;
-    }
-
-    bool
-    prefix (const K& p, const K& k) const
-    {
-      size_type pn (p.size ()), kn (k.size ());
-      return pn == 0 || // Empty key is always a prefix.
-        (pn <= kn &&
-         compare (p.c_str (), pn, k.c_str (), pn == kn ? pn : pn + 1) == 0);
-    }
-
-    // If the key is not empty, convert the key to its prefix and return
-    // true. Return false otherwise.
-    //
-    bool
-    prefix (K& k) const
-    {
-      if (k.empty ())
-        return false;
-
-      size_type p (k.rfind (d_));
-      k.resize (p != K::npos ? p : 0);
-      return true;
-    }
-
-  protected:
-    int
-    compare (const C* x, size_type xn,
-             const C* y, size_type yn) const
-    {
-      size_type n (std::min (xn, yn));
-      int r (traits_type::compare (x, y, n));
-
-      if (r == 0)
-      {
-        // Pretend there is the delimiter characters at the end of the
-        // shorter string.
-        //
-        char xc (xn > n ? x[n] : (xn++, d_));
-        char yc (yn > n ? y[n] : (yn++, d_));
-        r = traits_type::compare (&xc, &yc, 1);
-
-        // If we are still equal, then compare the lengths.
-        //
-        if (r == 0)
-          r = (xn == yn ? 0 : (xn < yn ? -1 : 1));
-      }
-
-      return r;
-    }
-
-  private:
-    delimiter_type d_;
-  };
-
-  template <typename M>
-  struct prefix_map_common: M
-  {
-    typedef M map_type;
-    typedef typename map_type::key_type key_type;
-    typedef typename map_type::value_type value_type;
-    typedef typename map_type::key_compare compare_type;
-    typedef typename compare_type::delimiter_type delimiter_type;
-
-    typedef typename map_type::iterator iterator;
-    typedef typename map_type::const_iterator const_iterator;
-
-    explicit
-    prefix_map_common (delimiter_type d)
-        : map_type (compare_type (d)) {}
-
-    prefix_map_common (std::initializer_list<value_type> i, delimiter_type d)
-        : map_type (std::move (i), compare_type (d)) {}
-
-    // Find all the entries that are sub-prefixes of the specified prefix.
-    //
-    std::pair<iterator, iterator>
-    find_sub (const key_type&);
-
-    std::pair<const_iterator, const_iterator>
-    find_sub (const key_type&) const;
-
-    // Find the most qualified entry that is a super-prefix of the specified
-    // prefix.
-    //
-    iterator
-    find_sup (const key_type&);
-
-    const_iterator
-    find_sup (const key_type&) const;
-
-
-    // As above but additionally evaluate a predicate on each matching entry
-    // returning the one for which it returns true.
-    //
-    template <typename P>
-    iterator
-    find_sup_if (const key_type&, P);
-
-    template <typename P>
-    const_iterator
-    find_sup_if (const key_type&, P) const;
-  };
-
-  template <typename M, typename prefix_map_common<M>::delimiter_type D>
-  struct prefix_map_impl: prefix_map_common<M>
-  {
-    typedef typename prefix_map_common<M>::value_type value_type;
-
-    prefix_map_impl (): prefix_map_common<M> (D) {}
-    prefix_map_impl (std::initializer_list<value_type> i)
-        : prefix_map_common<M> (std::move (i), D) {}
-  };
-
-  template <typename K,
-            typename T,
-            typename compare_prefix<K>::delimiter_type D>
-  using prefix_map = prefix_map_impl<std::map<K, T, compare_prefix<K>>, D>;
-
-  template <typename K,
-            typename T,
-            typename compare_prefix<K>::delimiter_type D>
-  using prefix_multimap =
-    prefix_map_impl<std::multimap<K, T, compare_prefix<K>>, D>;
-}
-
-#include <libbutl/prefix-map.txx>