vcl_hash_map.h

来自「DTMK软件开发包,此为开源软件,是一款很好的医学图像开发资源.」· C头文件 代码 · 共 403 行 · 第 1/2 页

  typedef typename ht::const_pointer const_pointer;

  hasher hash_funct() const { return rep.hash_funct(); }
  key_equal key_eq() const { return rep.key_eq(); }
private:
  ht rep;

public:
  vcl_hash_multimap() : rep(100, hasher(), key_equal()) {}
  vcl_hash_multimap(size_type n) : rep(n, hasher(), key_equal()) {}
  vcl_hash_multimap(size_type n, const hasher& hf) : rep(n, hf, key_equal()) {}
  vcl_hash_multimap(size_type n, const hasher& hf, const key_equal& eql)
    : rep(n, hf, eql) {}

  vcl_hash_multimap(const value_type* f, const value_type* l)
    : rep(100, hasher(), key_equal()) { rep.insert_equal(f, l); }
  vcl_hash_multimap(const value_type* f, const value_type* l, size_type n)
    : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }
  vcl_hash_multimap(const value_type* f, const value_type* l, size_type n,
                    const hasher& hf)
    : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }
  vcl_hash_multimap(const value_type* f, const value_type* l, size_type n,
                    const hasher& hf, const key_equal& eql)
    : rep(n, hf, eql) { rep.insert_equal(f, l); }

  vcl_hash_multimap(const_iterator f, const_iterator l)
    : rep(100, hasher(), key_equal()) { rep.insert_equal(f, l); }
  vcl_hash_multimap(const_iterator f, const_iterator l, size_type n)
    : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }
  vcl_hash_multimap(const_iterator f, const_iterator l, size_type n,
                    const hasher& hf)
    : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }
  vcl_hash_multimap(const_iterator f, const_iterator l, size_type n,
                    const hasher& hf, const key_equal& eql)
    : rep(n, hf, eql) { rep.insert_equal(f, l); }

public:
  size_type size() const { return rep.size(); }
  size_type max_size() const { return rep.max_size(); }
  bool empty() const { return rep.empty(); }
  void swap(self& hs) { rep.swap(hs.rep); }
  friend bool operator==(const vcl_hash_multimap<Key,T,HashFcn,EqualKey,Alloc>&,
                         const vcl_hash_multimap<Key,T,HashFcn,EqualKey,Alloc>&);

  iterator begin() { return rep.begin(); }
  iterator end() { return rep.end(); }
  const_iterator begin() const { return rep.begin(); }
  const_iterator end() const { return rep.end(); }

public:
  iterator insert(const value_type& obj) { return rep.insert_equal(obj); }
  void insert(const value_type* f, const value_type* l) { rep.insert_equal(f,l); }
  void insert(const_iterator f, const_iterator l) { rep.insert_equal(f, l); }
  iterator insert_noresize(const value_type& obj)
    { return rep.insert_equal_noresize(obj); }

  iterator find(const key_type& key) { return rep.find(key); }
  const_iterator find(const key_type& key) const { return rep.find(key); }

  size_type count(const key_type& key) const { return rep.count(key); }

  vcl_pair<iterator, iterator> equal_range(const key_type& key)
    { return rep.equal_range(key); }
  vcl_pair<const_iterator, const_iterator> equal_range(const key_type& key) const
    { return rep.equal_range(key); }

  size_type erase(const key_type& key) {return rep.erase(key); }
  void erase(iterator it) { rep.erase(it); }
  void erase(iterator f, iterator l) { rep.erase(f, l); }
  void clear() { rep.clear(); }

public:
  void resize(size_type hint) { rep.resize(hint); }
  size_type bucket_count() const { return rep.bucket_count(); }
  size_type max_bucket_count() const { return rep.max_bucket_count(); }
  size_type elems_in_bucket(size_type n) const
    { return rep.elems_in_bucket(n); }
};

template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
inline bool operator==(const vcl_hash_map<Key, T, HashFcn, EqualKey, Alloc>& hm1,
                       const vcl_hash_map<Key, T, HashFcn, EqualKey, Alloc>& hm2)
{
  return hm1.rep == hm2.rep;
}

template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
inline bool operator==(const vcl_hash_multimap<Key, T, HashFcn, EqualKey, Alloc>& hm1,
                       const vcl_hash_multimap<Key, T, HashFcn, EqualKey, Alloc>& hm2)
{
  return hm1.rep == hm2.rep;
}

// do a cleanup
# undef vcl_hash_map
# undef vcl_hash_multimap

# if defined (__STL_CLASS_PARTIAL_SPECIALIZATION )
template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
inline void swap(VCL_hash_map__<Key, T, HashFcn, EqualKey, Alloc>& a,
                 VCL_hash_map__<Key, T, HashFcn, EqualKey, Alloc>& b) { a.swap(b); }
template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
inline void swap(VCL_hash_multimap__<Key, T, HashFcn, EqualKey, Alloc>& a,
                 VCL_hash_multimap__<Key, T, HashFcn, EqualKey, Alloc>& b) { a.swap(b); }
# endif

# ifndef __STL_DEFAULT_TYPE_PARAM

// provide a "default" vcl_hash_map adaptor
template <class Key, class T, class HashFcn, class EqualKey >
class vcl_hash_map : public VCL_hash_map__<Key, T, HashFcn, EqualKey, vcl_alloc >
{
  typedef vcl_hash_map<Key, T, HashFcn, EqualKey> self;
public:
//rick  typedef typename VCL_hash_map__<Key, T, HashFcn, EqualKey, vcl_alloc> super;
  typedef VCL_hash_map__<Key, T, HashFcn, EqualKey, vcl_alloc> super;
  VCL_IMPORT_CONTAINER_TYPEDEFS(super)
  typedef typename super::key_type key_type;
  typedef typename super::hasher hasher;
  typedef typename super::key_equal key_equal;
  //rick  typedef typename T data_type;
  typedef T data_type;
  typedef typename super::pointer pointer;
  typedef typename super::const_pointer const_pointer;
  vcl_hash_map() {}
  vcl_hash_map(size_type n) : super(n) {}
  vcl_hash_map(size_type n, const hasher& hf) : super(n, hf) {}
  vcl_hash_map(size_type n, const hasher& hf, const key_equal& eql): super(n, hf, eql) {}
  vcl_hash_map(const value_type* f, const value_type* l) : super(f,l) {}
  vcl_hash_map(const value_type* f, const value_type* l, size_type n): super(f,l,n) {}
  vcl_hash_map(const value_type* f, const value_type* l, size_type n,
               const hasher& hf) : super(f,l,n,hf) {}
  vcl_hash_map(const value_type* f, const value_type* l, size_type n,
               const hasher& hf, const key_equal& eql) : super(f,l,n,hf, eql) {}
  vcl_hash_map(const_iterator f, const_iterator l) : super(f,l) { }
  vcl_hash_map(const_iterator f, const_iterator l, size_type n) : super(f,l,n) { }
  vcl_hash_map(const_iterator f, const_iterator l, size_type n,
               const hasher& hf) : super(f, l, n, hf) { }
  vcl_hash_map(const_iterator f, const_iterator l, size_type n,
               const hasher& hf, const key_equal& eql) : super(f, l, n, hf, eql) { }
  friend inline bool operator==(const self& hm1, const self& hm2);
};


template <class Key, class T, class HashFcn, class EqualKey >
inline bool operator==(const vcl_hash_map<Key, T, HashFcn,EqualKey>& hm1,
                       const vcl_hash_map<Key, T, HashFcn,EqualKey>& hm2)
{
    typedef vcl_hash_map<Key, T, HashFcn,EqualKey>::super super;
    return (const super&)hm1 == (const super&)hm2;
}

// provide a "default" vcl_hash_multimap adaptor
template <class Key, class T, class HashFcn, class EqualKey >
class vcl_hash_multimap : public VCL_hash_multimap__<Key, T, HashFcn, EqualKey, vcl_alloc>
{
  typedef vcl_hash_multimap<Key, T, HashFcn, EqualKey> self;
public:
  typedef VCL_hash_multimap__<Key, T, HashFcn, EqualKey, vcl_alloc> super;
  VCL_IMPORT_CONTAINER_TYPEDEFS(super)
  typedef typename super::key_type key_type;
  typedef typename super::hasher hasher;
  typedef typename super::key_equal key_equal;
  typedef T data_type;
  typedef typename super::pointer pointer;
  typedef typename super::const_pointer const_pointer;
  vcl_hash_multimap() {}
  vcl_hash_multimap(size_type n) : super(n) {}
  vcl_hash_multimap(size_type n, const hasher& hf) : super(n, hf) {}
  vcl_hash_multimap(size_type n, const hasher& hf, const key_equal& eql): super(n, hf, eql) {}
  vcl_hash_multimap(const value_type* f, const value_type* l) : super(f,l) {}
  vcl_hash_multimap(const value_type* f, const value_type* l, size_type n): super(f,l,n) {}
  vcl_hash_multimap(const value_type* f, const value_type* l, size_type n,
                    const hasher& hf) : super(f,l,n,hf) {}
  vcl_hash_multimap(const value_type* f, const value_type* l, size_type n,
                    const hasher& hf, const key_equal& eql) : super(f,l,n,hf, eql) {}

  vcl_hash_multimap(const_iterator f, const_iterator l) : super(f,l) { }
  vcl_hash_multimap(const_iterator f, const_iterator l, size_type n) : super(f,l,n) { }
  vcl_hash_multimap(const_iterator f, const_iterator l, size_type n,
                    const hasher& hf) : super(f, l, n, hf) { }
  vcl_hash_multimap(const_iterator f, const_iterator l, size_type n,
                    const hasher& hf, const key_equal& eql) : super(f, l, n, hf, eql) { }
  friend inline bool operator==(const self& hm1, const self& hm2);
};

template <class Key, class T, class HashFcn, class EqualKey >
inline bool operator==(const vcl_hash_multimap<Key, T, HashFcn,EqualKey>& hm1,
                       const vcl_hash_multimap<Key, T, HashFcn,EqualKey>& hm2)
{
    typedef vcl_hash_multimap<Key, T, HashFcn,EqualKey>::super super;
    return (const super&)hm1 == (const super&)hm2;
}

# endif /* VCL_STL_DEFAULT_TYPE_PARAM */

#define VCL_HASH_MAP_INSTANTIATE \
extern "please include emulation/vcl_hash_map.txx instead"

#endif // vcl_emulation_hash_map_h