hash_map.hh

Go to the documentation of this file.

/* -*- C++ -*-
 * $Id: hash_map.hh 957 2005-03-07 16:01:20Z sjoyeux $
 */
#ifndef UTILMM_HASH_MAP_HEADER
# define UTILMM_HASH_MAP_HEADER
#include "utilmm/config/config.h"

#include "utilmm/functional/utils.hh"

#include "utilmm/hash/bits/table.hh"

namespace utilmm {
  
  template< typename Key, typename Data, class Hash = hash<Key>, 
            class Equal = std::equal_to<Key> >
  class hash_map {
  public:
    typedef Key  key_type;
    typedef Data data_type;
    typedef std::pair<Key const, Data> value_type;

  private:
    typedef hash_toolbox::table<key_type, value_type, select_1st<value_type>,
                                Hash, Equal> container_type;
    typedef typename container_type::value_arg value_arg;
    typedef typename container_type::key_arg key_arg;

    container_type the_table;
    
  public:
    typedef typename container_type::iterator       iterator;
    typedef typename container_type::const_iterator const_iterator;

    void swap(hash_map &other) {
      the_table.swap(other.the_table);
    }

    size_t size() const {
      return the_table.size();
    }
    size_t max_size() const {
      return the_table.max_size();
    }
    
    bool empty() const {
      return the_table.empty();
    }

    iterator begin() {
      return the_table.begin();
    }
    iterator end() {
      return the_table.end();
    }
    const_iterator begin() const {
      return the_table.begin();
    }
    const_iterator end() const {
      return the_table.end();
    }
    
    iterator find(key_arg key) {
      return the_table.equal_range(key).first;
    }
    const_iterator find(key_arg key) const {
      return the_table.equal_range(key).first;
    }

    std::pair<iterator, bool> insert(value_arg val) {
      return the_table.insert_unique(val);
    }

    void erase(iterator const &first, iterator const &last) {
      the_table.erase(first, last);
    }
    void erase(iterator const &i) {
      if( end()!=i )
        erase(i, i+1);
    }
    void erase(key_arg key) {
      erase(find(key));
    }
    
    void clear() {
      the_table.clear();
    }
    
  }; // class utilmm::hash_map<>

} // namespace utilmm

#endif // UTILMM_HASH_MAP_HEADER