sharing_map.h

Go to the documentation of this file.

/*******************************************************************\
 
Module: Sharing map
 
Author: Daniel Poetzl
 
\*******************************************************************/
 
 
#ifndef CPROVER_UTIL_SHARING_MAP_H
#define CPROVER_UTIL_SHARING_MAP_H
 
#ifdef SM_DEBUG
#  include <iostream>
#endif
 
#include "as_const.h"
#include "irep.h"
#include "sharing_node.h"
#include "threeval.h"
 
#include <functional>
#include <map>
#include <memory>
#include <optional>
#include <set>
#include <stack>
#include <stdexcept>
#include <string>
#include <tuple>
#include <type_traits>
#include <vector>
 
#ifdef SM_INTERNAL_CHECKS
#  define SM_ASSERT(b) INVARIANT(b, "Sharing map internal invariant")
#else
#  define SM_ASSERT(b)
#endif
 
// clang-format off
 
#define SHARING_MAPT(type) \
  template < \
    typename keyT, \
    typename valueT, \
    bool fail_if_equal, \
    typename hashT, \
    typename equalT> \
  type sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>
#define SHARING_MAPT(type) \ …
 
#define SHARING_MAPTV(return_type, V) \
  template < \
    typename keyT, \
    typename valueT, \
    bool fail_if_equal, \
    typename hashT, \
    typename equalT> \
  template <class V> \
  return_type sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>
#define SHARING_MAPTV(return_type, V) \ …
 
#define SHARING_MAPT2(cv_qualifiers, return_type) \
  template < \
    typename keyT, \
    typename valueT, \
    bool fail_if_equal, \
    typename hashT, \
    typename equalT> \
  cv_qualifiers typename \
    sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>::return_type \
    sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>
#define SHARING_MAPT2(cv_qualifiers, return_type) \ …
 
#define SHARING_MAPT3(template_parameter, cv_qualifiers, return_type) \
  template < \
    typename keyT, \
    typename valueT, \
    bool fail_if_equal, \
    typename hashT, \
    typename equalT> \
  template <class template_parameter> \
  cv_qualifiers typename \
    sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>::return_type \
    sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>
#define SHARING_MAPT3(template_parameter, cv_qualifiers, return_type) \ …
 
#define SHARING_MAPT4(template_parameter, return_type) \
  template < \
    typename keyT, \
    typename valueT, \
    bool fail_if_equal, \
    typename hashT, \
    typename equalT> \
  template <class template_parameter> \
  return_type sharing_mapt<keyT, valueT, fail_if_equal, hashT, equalT>
#define SHARING_MAPT4(template_parameter, return_type) \ …
// clang-format on
 
template <
  typename keyT,
  typename valueT,
  bool fail_if_equal = false,
  typename hashT = std::hash<keyT>,
  typename equalT = std::equal_to<keyT>>
class sharing_mapt
{
public:
  ~sharing_mapt()
  {
  }
  ~sharing_mapt() {…}
 
  typedef keyT key_type;
  typedef valueT mapped_type;
 
  typedef hashT hash;
  typedef equalT key_equal;
 
  typedef std::size_t size_type;
 
  typedef std::vector<key_type> keyst;
 
protected:
  typedef sharing_nodet<key_type, mapped_type> nodet;
 
  typedef typename nodet::to_mapt to_mapt;
  typedef typename nodet::leaf_listt leaf_listt;
 
  struct falset
  {
    bool operator()(const mapped_type &lhs, const mapped_type &rhs)
    {
      return false;
    }
    bool operator()(const mapped_type &lhs, const mapped_type &rhs) {…}
  };
  struct falset {…};
 
  typedef
    typename std::conditional<fail_if_equal, std::equal_to<valueT>, falset>::
      type value_equalt;
 
  struct noop_value_comparatort
  {
    explicit noop_value_comparatort(const mapped_type &)
    {
    }
    explicit noop_value_comparatort(const mapped_type &) {…}
 
    bool operator()(const mapped_type &)
    {
      return false;
    }
    bool operator()(const mapped_type &) {…}
  };
  struct noop_value_comparatort {…};
 
  struct real_value_comparatort
  {
    mapped_type old_value;
    explicit real_value_comparatort(const mapped_type &old_value)
      : old_value(old_value)
    {
    }
    explicit real_value_comparatort(const mapped_type &old_value) {…}
 
    bool operator()(const mapped_type &new_value)
    {
      return old_value == new_value;
    }
    bool operator()(const mapped_type &new_value) {…}
  };
  struct real_value_comparatort {…};
 
  typedef typename std::conditional<
    fail_if_equal,
    real_value_comparatort,
    noop_value_comparatort>::type value_comparatort;
 
public:
  // interface
 
  void erase(const key_type &k);
 
  void erase_if_exists(const key_type &k)
  {
    if(has_key(k))
      erase(k);
  }
  void erase_if_exists(const key_type &k) {…}
 
  template <class valueU>
  void insert(const key_type &k, valueU &&m);
 
  template <class valueU>
  void insert_or_replace(const key_type &k, valueU &&m)
  {
    if(has_key(k))
    {
      replace(k, std::forward<valueU>(m));
    }
    else
    {
      insert(k, std::forward<valueU>(m));
    }
  }
  void insert_or_replace(const key_type &k, valueU &&m) {…}
 
  template <class valueU>
  void replace(const key_type &k, valueU &&m);
 
  void update(const key_type &k, std::function<void(mapped_type &)> mutator);
 
  std::optional<std::reference_wrapper<const mapped_type>>
  find(const key_type &k) const;
 
  void swap(sharing_mapt &other)
  {
    map.swap(other.map);
 
    std::size_t tmp = num;
    num = other.num;
    other.num = tmp;
  }
  void swap(sharing_mapt &other) {…}
 
  size_type size() const
  {
    return num;
  }
  size_type size() const {…}
 
  bool empty() const
  {
    return num == 0;
  }
  bool empty() const {…}
 
  void clear()
  {
    map.clear();
    num = 0;
  }
  void clear() {…}
 
  bool has_key(const key_type &k) const
  {
    return get_leaf_node(k) != nullptr;
  }
  bool has_key(const key_type &k) const {…}
 
  // views
 
  typedef std::pair<const key_type &, const mapped_type &> view_itemt;
 
  typedef std::vector<view_itemt> viewt;
  typedef std::set<view_itemt> sorted_viewt;
 
  static void insert_view_item(viewt &v, view_itemt &&vi)
  {
    v.push_back(vi);
  }
  static void insert_view_item(viewt &v, view_itemt &&vi) {…}
 
  static void insert_view_item(sorted_viewt &v, view_itemt &&vi)
  {
    v.insert(vi);
  }
  static void insert_view_item(sorted_viewt &v, view_itemt &&vi) {…}
 
  class delta_view_itemt
  {
  public:
    delta_view_itemt(
      const key_type &k,
      const mapped_type &m,
      const mapped_type &other_m)
      : k(k), m(m), other_m(&other_m)
    {
    }
    delta_view_itemt( {…}
 
    delta_view_itemt(const key_type &k, const mapped_type &m)
      : k(k), m(m), other_m(nullptr)
    {
    }
    delta_view_itemt(const key_type &k, const mapped_type &m) {…}
 
    const key_type &k;
 
    const mapped_type &m;
 
    bool is_in_both_maps() const
    {
      return other_m != nullptr;
    }
    bool is_in_both_maps() const {…}
 
    const mapped_type &get_other_map_value() const
    {
      PRECONDITION(is_in_both_maps());
      return *other_m;
    }
    const mapped_type &get_other_map_value() const {…}
 
  private:
    const mapped_type *other_m;
  };
  class delta_view_itemt {…};
 
  typedef std::vector<delta_view_itemt> delta_viewt;
 
  template <class V>
  void get_view(V &view) const;
  viewt get_view() const
  {
    viewt result;
    get_view(result);
    return result;
  }
  viewt get_view() const {…}
  sorted_viewt get_sorted_view() const
  {
    sorted_viewt result;
    get_view(result);
    return result;
  }
  sorted_viewt get_sorted_view() const {…}
 
  void get_delta_view(
    const sharing_mapt &other,
    delta_viewt &delta_view,
    const bool only_common = true) const;
 
  delta_viewt get_delta_view(
    const sharing_mapt &other,
    const bool only_common = true) const;
 
  void
  iterate(std::function<void(const key_type &k, const mapped_type &m)> f) const
  {
    if(empty())
      return;
 
    iterate(map, f);
  }
  iterate(std::function<void(const key_type &k, const mapped_type &m)> f) const {…}
 
#if !defined(_MSC_VER)
  struct sharing_map_statst
  {
    std::size_t num_nodes = 0;
    std::size_t num_unique_nodes = 0;
    std::size_t num_leafs = 0;
    std::size_t num_unique_leafs = 0;
  };
  struct sharing_map_statst {…};
 
  template <class Iterator>
  static sharing_map_statst get_sharing_stats(
    Iterator begin,
    Iterator end,
    std::function<sharing_mapt &(const Iterator)> f =
      [](const Iterator it) -> sharing_mapt & { return *it; });
 
  template <class Iterator>
  static sharing_map_statst get_sharing_stats_map(Iterator begin, Iterator end);
#endif
 
protected:
  // helpers
 
  nodet &get_leaf_node(const key_type &k);
  const nodet *get_leaf_node(const key_type &k) const;
 
  template <class valueU>
  void migrate(
    const std::size_t starting_level,
    const std::size_t key_suffix,
    const std::size_t bit_last,
    nodet &inner,
    const key_type &k,
    valueU &&m);
 
  void iterate(
    const nodet &n,
    std::function<void(const key_type &k, const mapped_type &m)> f) const;
 
  void add_item_if_not_shared(
    const nodet &leaf,
    const nodet &inner,
    const std::size_t level,
    delta_viewt &delta_view,
    const bool only_common) const;
 
  void gather_all(const nodet &n, delta_viewt &delta_view) const;
 
  std::size_t count_unmarked_nodes(
    bool leafs_only,
    std::set<const void *> &marked,
    bool mark = true) const;
 
  static const std::size_t dummy_level;
 
  // config
  static const std::size_t bits;
  static const std::size_t chunk;
 
  // derived config
  static const std::size_t mask;
  static const std::size_t levels;
 
  // key-value map
  nodet map;
 
  // number of elements in the map
  size_type num = 0;
};
 
SHARING_MAPT(void)
::iterate(
  const nodet &n,
  std::function<void(const key_type &k, const mapped_type &m)> f) const
{
  SM_ASSERT(!n.empty());
 
  std::stack<const nodet *> stack;
  stack.push(&n);
 
  do
  {
    const nodet *ip = stack.top();
    stack.pop();
 
    SM_ASSERT(!ip->empty());
 
    if(ip->is_internal())
    {
      const to_mapt &m = ip->get_to_map();
      SM_ASSERT(!m.empty());
 
      for(const auto item : m)
      {
        stack.push(&item.second);
      }
    }
    else if(ip->is_leaf())
    {
      f(ip->get_key(), ip->get_value());
    }
    else
    {
      SM_ASSERT(ip->is_defined_container());
 
      const leaf_listt &ll = ip->get_container();
      SM_ASSERT(!ll.empty());
 
      for(const auto &l : ll)
      {
        f(l.get_key(), l.get_value());
      }
    }
  } while(!stack.empty());
}
::iterate( {…}
 
SHARING_MAPT(std::size_t)
::count_unmarked_nodes(
  bool leafs_only,
  std::set<const void *> &marked,
  bool mark) const
{
  if(empty())
    return 0;
 
  unsigned count = 0;
 
  std::stack<const nodet *> stack;
  stack.push(&map);
 
  do
  {
    const nodet *ip = stack.top();
    SM_ASSERT(!ip->empty());
    stack.pop();
 
    const unsigned use_count = ip->use_count();
 
    const void *raw_ptr =
      ip->is_internal() ? (const void *)&ip->read_internal()
                        : ip->is_leaf() ? (const void *)&ip->read_leaf()
                                        : (const void *)&ip->read_container();
 
    if(use_count >= 2)
    {
      if(marked.find(raw_ptr) != marked.end())
      {
        continue;
      }
 
      if(mark)
      {
        marked.insert(raw_ptr);
      }
    }
 
    if(ip->is_internal())
    {
      if(!leafs_only)
      {
        count++;
      }
 
      const to_mapt &m = ip->get_to_map();
      SM_ASSERT(!m.empty());
 
      for(const auto item : m)
      {
        stack.push(&item.second);
      }
    }
    else if(ip->is_leaf())
    {
      count++;
    }
    else
    {
      SM_ASSERT(ip->is_defined_container());
 
      if(!leafs_only)
      {
        count++;
      }
 
      const leaf_listt &ll = ip->get_container();
      SM_ASSERT(!ll.empty());
 
      for(const auto &l : ll)
      {
        stack.push(&l);
      }
    }
  } while(!stack.empty());
 
  return count;
}
::count_unmarked_nodes( {…}
  std::size_t count_unmarked_nodes( {…}
 
#if !defined(_MSC_VER)
SHARING_MAPT3(Iterator, , sharing_map_statst)
::get_sharing_stats(
  Iterator begin,
  Iterator end,
  std::function<sharing_mapt &(const Iterator)> f)
{
  std::set<const void *> marked;
  sharing_map_statst sms;
 
  // We do a separate pass over the tree for each statistic. This is not very
  // efficient but the function is intended only for diagnosis purposes anyways.
 
  // number of nodes
  for(Iterator it = begin; it != end; it++)
  {
    sms.num_nodes += f(it).count_unmarked_nodes(false, marked, false);
  }
 
  SM_ASSERT(marked.empty());
 
  // number of unique nodes
  for(Iterator it = begin; it != end; it++)
  {
    sms.num_unique_nodes += f(it).count_unmarked_nodes(false, marked, true);
  }
 
  marked.clear();
 
  // number of leafs
  for(Iterator it = begin; it != end; it++)
  {
    sms.num_leafs += f(it).count_unmarked_nodes(true, marked, false);
  }
 
  SM_ASSERT(marked.empty());
 
  // number of unique leafs
  for(Iterator it = begin; it != end; it++)
  {
    sms.num_unique_leafs += f(it).count_unmarked_nodes(true, marked, true);
  }
 
  return sms;
}
::get_sharing_stats( {…}
 
SHARING_MAPT3(Iterator, , sharing_map_statst)
::get_sharing_stats_map(Iterator begin, Iterator end)
{
  return get_sharing_stats<Iterator>(
    begin, end, [](const Iterator it) -> sharing_mapt & { return it->second; });
}
::get_sharing_stats_map(Iterator begin, Iterator end) {…}
#endif
 
SHARING_MAPTV(void, view_type)::get_view(view_type &view) const
{
  SM_ASSERT(view.empty());
 
  if(empty())
    return;
 
  auto f = [&view](const key_type &k, const mapped_type &m) {
    insert_view_item(view, view_itemt(k, m));
  };
 
  iterate(map, f);
}
SHARING_MAPTV(void, view_type)::get_view(view_type &view) const {…}
 
SHARING_MAPT(void)
::gather_all(const nodet &n, delta_viewt &delta_view) const
{
  auto f = [&delta_view](const key_type &k, const mapped_type &m) {
    delta_view.push_back(delta_view_itemt(k, m));
  };
 
  iterate(n, f);
}
::gather_all(const nodet &n, delta_viewt &delta_view) const {…}
  void gather_all(const nodet &n, delta_viewt &delta_view) const; {…}
 
SHARING_MAPT(void)::add_item_if_not_shared(
  const nodet &leaf,
  const nodet &inner,
  const std::size_t level,
  delta_viewt &delta_view,
  const bool only_common) const
{
  const auto &k = leaf.get_key();
  std::size_t key = hash()(k);
 
  key >>= level * chunk;
 
  const nodet *ip = &inner;
  SM_ASSERT(ip->is_defined_internal());
 
  while(true)
  {
    std::size_t bit = key & mask;
 
    ip = ip->find_child(bit);
 
    // only in first map
    if(ip == nullptr)
    {
      if(!only_common)
      {
        delta_view.push_back({k, leaf.get_value()});
      }
 
      return;
    }
 
    SM_ASSERT(!ip->empty());
 
    // potentially in both maps
    if(ip->is_container())
    {
      for(const auto &l2 : ip->get_container())
      {
        if(leaf.shares_with(l2))
          return;
 
        if(leaf.get_key() == l2.get_key())
        {
          delta_view.push_back({k, leaf.get_value(), l2.get_value()});
          return;
        }
      }
 
      if(!only_common)
      {
        delta_view.push_back({k, leaf.get_value()});
      }
 
      return;
    }
 
    if(ip->is_leaf())
    {
      if(ip->shares_with(leaf))
        return;
 
      if(equalT()(leaf.get_key(), ip->get_key()))
      {
        delta_view.push_back({k, leaf.get_value(), ip->get_value()});
      }
      else if(!only_common)
      {
        delta_view.push_back({k, leaf.get_value()});
      }
 
      return;
    }
 
    key >>= chunk;
  }
}
SHARING_MAPT(void)::add_item_if_not_shared( {…}
  void add_item_if_not_shared( {…}
 
SHARING_MAPT(void)
::get_delta_view(
  const sharing_mapt &other,
  delta_viewt &delta_view,
  const bool only_common) const
{
  SM_ASSERT(delta_view.empty());
 
  if(empty())
    return;
 
  if(other.empty())
  {
    if(!only_common)
    {
      gather_all(map, delta_view);
    }
 
    return;
  }
 
  typedef std::pair<const nodet *, const nodet *> stack_itemt;
  std::stack<stack_itemt> stack;
 
  std::stack<std::size_t> level_stack;
 
  // We do a DFS "in lockstep" simultaneously on both maps. For
  // corresponding nodes we check whether they are shared between the
  // maps, and if not, we recurse into the corresponding subtrees.
 
  // The stack contains the children of already visited nodes that we
  // still have to visit during the traversal.
 
  if(map.shares_with(other.map))
    return;
 
  stack.push(stack_itemt(&map, &other.map));
  level_stack.push(0);
 
  do
  {
    const stack_itemt &si = stack.top();
 
    const nodet *ip1 = si.first;
    const nodet *ip2 = si.second;
 
    SM_ASSERT(!ip1->shares_with(*ip2));
 
    stack.pop();
 
    const std::size_t level = level_stack.top();
    level_stack.pop();
 
    SM_ASSERT(!ip1->empty());
    SM_ASSERT(!ip2->empty());
 
    if(ip1->is_internal())
    {
      SM_ASSERT(!ip2->is_container());
 
      if(ip2->is_internal())
      {
        for(const auto item : ip1->get_to_map())
        {
          const nodet &child = item.second;
 
          const nodet *p;
          p = ip2->find_child(item.first);
 
          if(p == nullptr)
          {
            if(!only_common)
            {
              gather_all(child, delta_view);
            }
          }
          else if(!child.shares_with(*p))
          {
            stack.push(stack_itemt(&child, p));
            level_stack.push(level + 1);
          }
        }
      }
      else
      {
        SM_ASSERT(ip2->is_leaf());
 
        for(const auto item : ip1->get_to_map())
        {
          const nodet &child = item.second;
 
          if(!child.shares_with(*ip2))
          {
            stack.push(stack_itemt(&child, ip2));
 
            // The level is not needed when the node of the left map is an
            // internal node, and the node of the right map is a leaf node,
            // hence we just push a dummy element
            level_stack.push(dummy_level);
          }
        }
      }
    }
    else if(ip1->is_leaf())
    {
      SM_ASSERT(!ip2->is_container());
 
      if(ip2->is_internal())
      {
        SM_ASSERT(level != dummy_level);
 
        add_item_if_not_shared(*ip1, *ip2, level, delta_view, only_common);
      }
      else
      {
        SM_ASSERT(ip2->is_leaf());
 
        if(equalT()(ip1->get_key(), ip2->get_key()))
        {
          delta_view.push_back(
            {ip1->get_key(), ip1->get_value(), ip2->get_value()});
        }
        else if(!only_common)
        {
          delta_view.push_back({ip1->get_key(), ip1->get_value()});
        }
      }
    }
    else
    {
      SM_ASSERT(ip1->is_container());
      SM_ASSERT(!ip2->is_internal());
 
      if(ip2->is_leaf())
      {
        for(const auto &l1 : ip1->get_container())
        {
          if(l1.shares_with(*ip2))
          {
            continue;
          }
 
          const key_type &k1 = l1.get_key();
 
          if(equalT()(k1, ip2->get_key()))
          {
            delta_view.push_back({k1, l1.get_value(), ip2->get_value()});
          }
          else if(!only_common)
          {
            delta_view.push_back({k1, l1.get_value()});
          }
        }
      }
      else
      {
        SM_ASSERT(ip2->is_container());
 
        for(const auto &l1 : ip1->get_container())
        {
          const key_type &k1 = l1.get_key();
          const nodet *p;
 
          p = ip2->find_leaf(k1);
 
          if(p != nullptr)
          {
            if(!l1.shares_with(*p))
            {
              SM_ASSERT(other.has_key(k1));
              delta_view.push_back({k1, l1.get_value(), p->get_value()});
            }
          }
          else if(!only_common)
          {
            SM_ASSERT(!other.has_key(k1));
            delta_view.push_back({k1, l1.get_value()});
          }
        }
      }
    }
  } while(!stack.empty());
}
::get_delta_view( {…}
 
SHARING_MAPT2(, delta_viewt)::get_delta_view(
  const sharing_mapt &other,
  const bool only_common) const
{
  delta_viewt delta_view;
  get_delta_view(other, delta_view, only_common);
  return delta_view;
}
SHARING_MAPT2(, delta_viewt)::get_delta_view( {…}
 
SHARING_MAPT2(, nodet &)::get_leaf_node(const key_type &k)
{
  SM_ASSERT(has_key(k));
 
  std::size_t key = hash()(k);
  nodet *ip = &map;
  SM_ASSERT(ip->is_defined_internal());
 
  while(true)
  {
    std::size_t bit = key & mask;
 
    ip = &ip->add_child(bit);
    PRECONDITION(!ip->empty()); // since the key must exist in the map
 
    if(ip->is_internal())
    {
      key >>= chunk;
      continue;
    }
    else if(ip->is_leaf())
    {
      return *ip;
    }
    else
    {
      SM_ASSERT(ip->is_defined_container());
      return *ip->find_leaf(k);
    }
  }
}
SHARING_MAPT2(, nodet &)::get_leaf_node(const key_type &k) {…}
 
SHARING_MAPT2(const, nodet *)::get_leaf_node(const key_type &k) const
{
  if(empty())
    return nullptr;
 
  std::size_t key = hash()(k);
  const nodet *ip = &map;
  SM_ASSERT(ip->is_defined_internal());
 
  while(true)
  {
    std::size_t bit = key & mask;
 
    ip = ip->find_child(bit);
 
    if(ip == nullptr)
      return nullptr;
 
    SM_ASSERT(!ip->empty());
 
    if(ip->is_internal())
    {
      key >>= chunk;
      continue;
    }
    else if(ip->is_leaf())
    {
      return equalT()(ip->get_key(), k) ? ip : nullptr;
    }
    else
    {
      SM_ASSERT(ip->is_defined_container());
      return ip->find_leaf(k); // returns nullptr if leaf is not found
    }
  }
 
  UNREACHABLE;
  return nullptr;
}
SHARING_MAPT2(const, nodet *)::get_leaf_node(const key_type &k) const {…}
 
SHARING_MAPT(void)::erase(const key_type &k)
{
  SM_ASSERT(has_key(k));
 
  nodet *del = nullptr;
  std::size_t del_bit = 0;
 
  std::size_t key = hash()(k);
  nodet *ip = &map;
 
  while(true)
  {
    std::size_t bit = key & mask;
 
    const to_mapt &m = as_const_ptr(ip)->get_to_map();
 
    if(m.size() > 1 || del == nullptr)
    {
      del = ip;
      del_bit = bit;
    }
 
    ip = &ip->add_child(bit);
 
    PRECONDITION(!ip->empty());
 
    if(ip->is_internal())
    {
      key >>= chunk;
      continue;
    }
    else if(ip->is_leaf())
    {
      PRECONDITION(equalT()(ip->get_key(), k));
      del->remove_child(del_bit);
 
      num--;
 
      return;
    }
    else
    {
      SM_ASSERT(ip->is_defined_container());
      const leaf_listt &ll = as_const_ptr(ip)->get_container();
      PRECONDITION(!ll.empty());
 
      // forward list has one element
      if(std::next(ll.begin()) == ll.end())
      {
        PRECONDITION(equalT()(ll.front().get_key(), k));
        del->remove_child(del_bit);
      }
      else
      {
        ip->remove_leaf(k);
      }
 
      num--;
 
      return;
    }
  }
 
  UNREACHABLE;
}
SHARING_MAPT(void)::erase(const key_type &k) {…}
 
SHARING_MAPT4(valueU, void)
::migrate(
  const std::size_t starting_level,
  const std::size_t key_suffix,
  const std::size_t bit_last,
  nodet &inner,
  const key_type &k,
  valueU &&m)
{
  SM_ASSERT(starting_level < levels - 1);
  SM_ASSERT(inner.is_defined_internal());
 
  nodet &leaf = inner.add_child(bit_last);
  SM_ASSERT(leaf.is_defined_leaf());
 
  std::size_t key_existing = hash()(leaf.get_key());
  key_existing >>= chunk * starting_level;
 
  nodet leaf_kept;
  leaf_kept.swap(leaf);
 
  nodet *ip = &leaf;
  SM_ASSERT(ip->empty());
 
  // Find place for both elements
 
  std::size_t level = starting_level + 1;
  std::size_t key = key_suffix;
 
  key_existing >>= chunk;
  key >>= chunk;
 
  SM_ASSERT(level < levels);
 
  do
  {
    SM_ASSERT(ip->empty());
 
    std::size_t bit_existing = key_existing & mask;
    std::size_t bit = key & mask;
 
    if(bit != bit_existing)
    {
      // Place found
 
      nodet &l1 = ip->add_child(bit_existing);
      SM_ASSERT(l1.empty());
      l1.swap(leaf_kept);
 
      nodet &l2 = ip->add_child(bit);
      SM_ASSERT(l2.empty());
      l2.make_leaf(k, std::forward<valueU>(m));
 
      return;
    }
 
    SM_ASSERT(bit == bit_existing);
    ip = &ip->add_child(bit);
 
    key >>= chunk;
    key_existing >>= chunk;
 
    level++;
  } while(level < levels);
 
  // Hash collision, create container and add both elements to it
 
  PRECONDITION(!equalT()(k, leaf_kept.get_key()));
 
  SM_ASSERT(ip->empty());
  // Make container and add existing leaf
  ip->get_container().push_front(leaf_kept);
 
  SM_ASSERT(ip->is_defined_container());
  // Insert new element in same container
  ip->place_leaf(k, std::forward<valueU>(m));
}
::migrate( {…}
 
SHARING_MAPT4(valueU, void)
::insert(const key_type &k, valueU &&m)
{
  SM_ASSERT(!has_key(k));
 
  std::size_t key = hash()(k);
  nodet *ip = &map;
 
  // The root must be an internal node
  SM_ASSERT(ip->is_internal());
 
  std::size_t level = 0;
 
  while(true)
  {
    std::size_t bit = key & mask;
 
    SM_ASSERT(ip != nullptr);
    SM_ASSERT(ip->is_internal());
    SM_ASSERT(level == 0 || !ip->empty());
 
    nodet &child = ip->add_child(bit);
 
    // Place is unoccupied
    if(child.empty())
    {
      if(level < levels - 1)
      {
        // Create leaf
        child.make_leaf(k, m);
      }
      else
      {
        SM_ASSERT(level == levels - 1);
 
        // Create container and insert leaf
        child.place_leaf(k, std::forward<valueU>(m));
 
        SM_ASSERT(child.is_defined_container());
      }
 
      num++;
 
      return;
    }
    else if(child.is_internal())
    {
      ip = &child;
      key >>= chunk;
      level++;
 
      continue;
    }
    else if(child.is_leaf())
    {
      // migrate leaf downwards
      migrate(level, key, bit, *ip, k, std::forward<valueU>(m));
 
      num++;
 
      return;
    }
    else
    {
      SM_ASSERT(child.is_defined_container());
      SM_ASSERT(level == levels - 1);
 
      // Add to the container
      child.place_leaf(k, std::forward<valueU>(m));
 
      num++;
 
      return;
    }
  }
}
::insert(const key_type &k, valueU &&m) {…}
 
SHARING_MAPT4(valueU, void)
::replace(const key_type &k, valueU &&m)
{
  nodet &lp = get_leaf_node(k);
 
  INVARIANT(
    !value_equalt()(lp.get_value(), m),
    "values should not be replaced with equal values to maximize sharing");
 
  lp.set_value(std::forward<valueU>(m));
}
::replace(const key_type &k, valueU &&m) {…}
 
SHARING_MAPT(void)
::update(const key_type &k, std::function<void(mapped_type &)> mutator)
{
  nodet &lp = get_leaf_node(k);
 
  value_comparatort comparator(lp.get_value());
 
  lp.mutate_value(mutator);
 
  INVARIANT(
    !comparator(lp.get_value()),
    "sharing_mapt::update should make some change. Consider using read-only "
    "method to check if an update is needed beforehand");
}
::update(const key_type &k, std::function<void(mapped_type &)> mutator) {…}
 
SHARING_MAPT2(std::optional<std::reference_wrapper<const, mapped_type>>)::find(
  const key_type &k) const
{
  const nodet *lp = get_leaf_node(k);
 
  if(lp == nullptr)
    return std::nullopt;
 
  return std::optional<std::reference_wrapper<const mapped_type>>(
    lp->get_value());
}
SHARING_MAPT2(std::optional<std::reference_wrapper<const, mapped_type>>)::find( {…}
 
// static constants
 
SHARING_MAPT(const std::size_t)::dummy_level = 0xff;
 
SHARING_MAPT(const std::size_t)::bits = 30;
SHARING_MAPT(const std::size_t)::chunk = 3;
 
SHARING_MAPT(const std::size_t)::mask = 0xffff >> (16 - chunk);
SHARING_MAPT(const std::size_t)::levels = bits / chunk;
 
#endif
  void iterate( {…}
  void migrate( {…}
  const nodet *get_leaf_node(const key_type &k) const; {…}
  nodet &get_leaf_node(const key_type &k); {…}
  static sharing_map_statst get_sharing_stats_map(Iterator begin, Iterator end); {…}
  static sharing_map_statst get_sharing_stats( {…}
  delta_viewt get_delta_view( {…}
  void get_delta_view( {…}
  find(const key_type &k) const; {…}
  void update(const key_type &k, std::function<void(mapped_type &)> mutator); {…}
  void replace(const key_type &k, valueU &&m); {…}
  void insert(const key_type &k, valueU &&m); {…}
  void erase(const key_type &k); {…}
class sharing_mapt {…};