avl_map

Go to the documentation of this file.

// vi:set ft=cpp: -*- Mode: C++ -*-
/*
 * (c) 2008-2009 Alexander Warg <warg@os.inf.tu-dresden.de>
 *     economic rights: Technische Universität Dresden (Germany)
 *
 * License: see LICENSE.spdx (in this directory or the directories above)
 */
 
#pragma once
 
#include <l4/cxx/std_alloc>
#include <l4/cxx/std_ops>
#include <l4/cxx/pair>
#include <l4/cxx/avl_set>
 
namespace cxx {
namespace Bits {

template<typename KEY_TYPE>
struct Avl_map_get_key
{
  typedef KEY_TYPE Key_type;
  template<typename NODE>
  static Key_type const &key_of(NODE const *n)
  { return n->item.first; }
};
}

template< typename KEY_TYPE, typename DATA_TYPE,
  template<typename A> class COMPARE = Lt_functor,
  template<typename B> class ALLOC = New_allocator >
class Avl_map :
  public Bits::Base_avl_set<Pair<KEY_TYPE, DATA_TYPE>,
                            COMPARE<KEY_TYPE>, ALLOC,
                            Bits::Avl_map_get_key<KEY_TYPE> >
{
private:
  typedef Pair<KEY_TYPE, DATA_TYPE> Local_item_type;
  typedef Bits::Base_avl_set<Local_item_type, COMPARE<KEY_TYPE>, ALLOC,
                             Bits::Avl_map_get_key<KEY_TYPE> > Base_type;
 
public:
  typedef COMPARE<KEY_TYPE> Key_compare;
  typedef KEY_TYPE Key_type;
  typedef DATA_TYPE Data_type;
  typedef typename Base_type::Node Node;
  typedef typename Base_type::Node_allocator Node_allocator;
 
  typedef typename Base_type::Iterator Iterator;
  typedef typename Base_type::Iterator iterator;
  typedef typename Base_type::Const_iterator Const_iterator;
  typedef typename Base_type::Const_iterator const_iterator;
  typedef typename Base_type::Rev_iterator Rev_iterator;
  typedef typename Base_type::Rev_iterator reverse_iterator;
  typedef typename Base_type::Const_rev_iterator Const_rev_iterator;
  typedef typename Base_type::Const_rev_iterator const_reverse_iterator;

  Avl_map(Node_allocator const &alloc = Node_allocator())
    : Base_type(alloc)
  {}

  cxx::Pair<Iterator, int> insert(Key_type const &key, Data_type const &data)
  { return Base_type::insert(Pair<Key_type, Data_type>(key, data)); }
 
  template<typename... Args>
  cxx::Pair<Iterator, int> emplace(Args &&...args)
  { return Base_type::emplace(cxx::forward<Args>(args)...); }

  Data_type const &operator [] (Key_type const &key) const
  { return this->find_node(key)->second; }

  Data_type &operator [] (Key_type const &key)
  {
    Node n = this->find_node(key);
    if (n)
      return const_cast<Data_type&>(n->second);
    else
      return insert(key, Data_type()).first->second;
  }
};
 
}