// Filename: hash_map
// Created by:  drose (12May00)
//
////////////////////////////////////////////////////////////////////
//
// PANDA 3D SOFTWARE
// Copyright (c) Carnegie Mellon University.  All rights reserved.
//
// All use of this software is subject to the terms of the revised BSD
// license.  You should have received a copy of this license along
// with this source code in a file named "LICENSE."
//
////////////////////////////////////////////////////////////////////

// This file, and all the other files in this directory, aren't
// intended to be compiled--they're just parsed by CPPParser (and
// interrogate) in lieu of the actual system headers, to generate the
// interrogate database.

#ifndef HASH_MAP_H
#define HASH_MAP_H

#include <stdtypedefs.h>
#include <stdcompare.h>
#include <pair>

namespace stdext {
  template<class key, class element, class compare = hash_compare<key, less<key> > >
  class hash_map {
  public:
    typedef key key_type;
    typedef element data_type;
    typedef element mapped_type;
    typedef pair<const key, element> value_type;
    typedef compare key_compare;

    typedef element *pointer;
    typedef const element *const_pointer;
    typedef element &reference;
    typedef const element &const_reference;

    class iterator;
    class const_iterator;
    class reverse_iterator;
    class const_reverse_iterator;
    typedef size_t size_type;
    class difference_type;
  };

  template<class key, class element, class compare = hash_compare<key, less<key> > >
  class hash_multimap : public hash_map<key, element, compare> {
  };
};

#endif