stl_hash_set.h

// Filename:    stl_hash_set.h

// Comment By:  凝霜

// E-mail:      mdl2009@vip.qq.com

// Blog:        http://blog.csdn.net/mdl13412

// hash_set和hash_multiset是对hashtable的简单包装, 很容易理解

/*

 * Copyright (c) 1996

 * Silicon Graphics Computer Systems, Inc.

 *

 * Permission to use, copy, modify, distribute and sell this software

 * and its documentation for any purpose is hereby granted without fee,

 * provided that the above copyright notice appear in all copies and

 * that both that copyright notice and this permission notice appear

 * in supporting documentation.  Silicon Graphics makes no

 * representations about the suitability of this software for any

 * purpose.  It is provided "as is" without express or implied warranty.

 *

 *

 * Copyright (c) 1994

 * Hewlett-Packard Company

 *

 * Permission to use, copy, modify, distribute and sell this software

 * and its documentation for any purpose is hereby granted without fee,

 * provided that the above copyright notice appear in all copies and

 * that both that copyright notice and this permission notice appear

 * in supporting documentation.  Hewlett-Packard Company makes no

 * representations about the suitability of this software for any

 * purpose.  It is provided "as is" without express or implied warranty.

 *

 */

/* NOTE: This is an internal header file, included by other STL headers.

 *   You should not attempt to use it directly.

 */

#ifndef __SGI_STL_INTERNAL_HASH_SET_H

#define __SGI_STL_INTERNAL_HASH_SET_H

__STL_BEGIN_NAMESPACE

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)

#pragma set woff 1174

#endif

// 如果编译器不能根据前面模板参数推导出后面使用的默认参数类型,

// 那么就需要手工指定, 并且对于基本的数据类型, 在<stl_hash_fun.h>

// 中都提供hash函数

#ifndef __STL_LIMITED_DEFAULT_TEMPLATES

template <class Value, class HashFcn = hash<Value>,

          class EqualKey = equal_to<Value>,

          class Alloc = alloc>

#else

template <class Value, class HashFcn, class EqualKey, class Alloc = alloc>

#endif

class hash_set

{

private:

  // identity<Value>用于析出Value

  typedef hashtable<Value, Value, HashFcn, identity<Value>,

                    EqualKey, Alloc> ht;

  ht rep;       // 其实hash_set就是hashtable的简单封装

public:

  typedef typename ht::key_type key_type;

  typedef typename ht::value_type value_type;

  typedef typename ht::hasher hasher;

  typedef typename ht::key_equal key_equal;

  // 注意: reference, pointer, iterator都为const, 因为不能修改hashtable

  // 内部的元素, 否则会导致hashtable失效

  typedef typename ht::size_type size_type;

  typedef typename ht::difference_type difference_type;

  typedef typename ht::const_pointer pointer;

  typedef typename ht::const_pointer const_pointer;

  typedef typename ht::const_reference reference;

  typedef typename ht::const_reference const_reference;

  typedef typename ht::const_iterator iterator;

  typedef typename ht::const_iterator const_iterator;

  // 返回hash相关函数

  hasher hash_funct() const { return rep.hash_funct(); }

  key_equal key_eq() const { return rep.key_eq(); }

public:

  hash_set() : rep(, hasher(), key_equal()) {}

  explicit hash_set(size_type n) : rep(n, hasher(), key_equal()) {}

  hash_set(size_type n, const hasher& hf) : rep(n, hf, key_equal()) {}

  hash_set(size_type n, const hasher& hf, const key_equal& eql)

    : rep(n, hf, eql) {}

#ifdef __STL_MEMBER_TEMPLATES

  template <class InputIterator>

  hash_set(InputIterator f, InputIterator l)

    : rep(, hasher(), key_equal()) { rep.insert_unique(f, l); }

  template <class InputIterator>

  hash_set(InputIterator f, InputIterator l, size_type n)

    : rep(n, hasher(), key_equal()) { rep.insert_unique(f, l); }

  template <class InputIterator>

  hash_set(InputIterator f, InputIterator l, size_type n,

           const hasher& hf)

    : rep(n, hf, key_equal()) { rep.insert_unique(f, l); }

  template <class InputIterator>

  hash_set(InputIterator f, InputIterator l, size_type n,

           const hasher& hf, const key_equal& eql)

    : rep(n, hf, eql) { rep.insert_unique(f, l); }

#else

  hash_set(const value_type* f, const value_type* l)

    : rep(, hasher(), key_equal()) { rep.insert_unique(f, l); }

  hash_set(const value_type* f, const value_type* l, size_type n)

    : rep(n, hasher(), key_equal()) { rep.insert_unique(f, l); }

  hash_set(const value_type* f, const value_type* l, size_type n,

           const hasher& hf)

    : rep(n, hf, key_equal()) { rep.insert_unique(f, l); }

  hash_set(const value_type* f, const value_type* l, size_type n,

           const hasher& hf, const key_equal& eql)

    : rep(n, hf, eql) { rep.insert_unique(f, l); }

  hash_set(const_iterator f, const_iterator l)

    : rep(, hasher(), key_equal()) { rep.insert_unique(f, l); }

  hash_set(const_iterator f, const_iterator l, size_type n)

    : rep(n, hasher(), key_equal()) { rep.insert_unique(f, l); }

  hash_set(const_iterator f, const_iterator l, size_type n,

           const hasher& hf)

    : rep(n, hf, key_equal()) { rep.insert_unique(f, l); }

  hash_set(const_iterator f, const_iterator l, size_type n,

           const hasher& hf, const key_equal& eql)

    : rep(n, hf, eql) { rep.insert_unique(f, l); }

#endif /*__STL_MEMBER_TEMPLATES */

public:

  // 下面都是对hashtable的简单封装, 见<stl_hashtable.h>

  size_type size() const { return rep.size(); }

  size_type max_size() const { return rep.max_size(); }

  bool empty() const { return rep.empty(); }

  void swap(hash_set& hs) { rep.swap(hs.rep); }

  friend bool operator== __STL_NULL_TMPL_ARGS (const hash_set&,

                                               const hash_set&);

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

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

public:

  pair<iterator, bool> insert(const value_type& obj)

    {

      pair<typename ht::iterator, bool> p = rep.insert_unique(obj);

      r

      eturn pair<iterator, bool>(p.first, p.second);

    }

#ifdef __STL_MEMBER_TEMPLATES

  template <class InputIterator>

  void insert(InputIterator f, InputIterator l) { rep.insert_unique(f,l); }

#else

  void insert(const value_type* f, const value_type* l) {

    rep.insert_unique(f,l);

  }

  void insert(const_iterator f, const_iterator l) {rep.insert_unique(f, l); }

#endif /*__STL_MEMBER_TEMPLATES */

  // hash_set和set一样, 都不允许key重复

  pair<iterator, bool> insert_noresize(const value_type& obj)

  {

    pair<typename ht::iterator, bool> p = rep.insert_unique_noresize(obj);

    return pair<iterator, bool>(p.first, p.second);

  }

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

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

  pair<iterator, 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 Value, class HashFcn, class EqualKey, class Alloc>

inline bool operator==(const hash_set<Value, HashFcn, EqualKey, Alloc>& hs1,

                       const hash_set<Value, HashFcn, EqualKey, Alloc>& hs2)

{

  return hs1.rep == hs2.rep;

}

// 如果编译器支持模板函数特化优先级

// 那么将全局的swap实现为使用hash_set私有的swap以提高效率

#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER

template <class Val, class HashFcn, class EqualKey, class Alloc>

inline void swap(hash_set<Val, HashFcn, EqualKey, Alloc>& hs1,

                 hash_set<Val, HashFcn, EqualKey, Alloc>& hs2)

{

  hs1.swap(hs2);

}

#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */

// hash_multiset和hash_set除去允许key重复外, 其余性质一致

#ifndef __STL_LIMITED_DEFAULT_TEMPLATES

template <class Value, class HashFcn = hash<Value>,

          class EqualKey = equal_to<Value>,

          class Alloc = alloc>

#else

template <class Value, class HashFcn, class EqualKey, class Alloc = alloc>

#endif

class hash_multiset

{

private:

  typedef hashtable<Value, Value, HashFcn, identity<Value>,

                    EqualKey, Alloc> ht;

  ht rep;

public:

  typedef typename ht::key_type key_type;

  typedef typename ht::value_type value_type;

  typedef typename ht::hasher hasher;

  typedef typename ht::key_equal key_equal;

  typedef typename ht::size_type size_type;

  typedef typename ht::difference_type difference_type;

  typedef typename ht::const_pointer pointer;

  typedef typename ht::const_pointer const_pointer;

  typedef typename ht::const_reference reference;

  typedef typename ht::const_reference const_reference;

  typedef typename ht::const_iterator iterator;

  typedef typename ht::const_iterator const_iterator;

  hasher hash_funct() const { return rep.hash_funct(); }

  key_equal key_eq() const { return rep.key_eq(); }

public:

  hash_multiset() : rep(, hasher(), key_equal()) {}

  explicit hash_multiset(size_type n) : rep(n, hasher(), key_equal()) {}

  hash_multiset(size_type n, const hasher& hf) : rep(n, hf, key_equal()) {}

  hash_multiset(size_type n, const hasher& hf, const key_equal& eql)

    : rep(n, hf, eql) {}

#ifdef __STL_MEMBER_TEMPLATES

  template <class InputIterator>

  hash_multiset(InputIterator f, InputIterator l)

    : rep(, hasher(), key_equal()) { rep.insert_equal(f, l); }

  template <class InputIterator>

  hash_multiset(InputIterator f, InputIterator l, size_type n)

    : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }

  template <class InputIterator>

  hash_multiset(InputIterator f, InputIterator l, size_type n,

                const hasher& hf)

    : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }

  template <class InputIterator>

  hash_multiset(InputIterator f, InputIterator l, size_type n,

                const hasher& hf, const key_equal& eql)

    : rep(n, hf, eql) { rep.insert_equal(f, l); }

#else

  hash_multiset(const value_type* f, const value_type* l)

    : rep(, hasher(), key_equal()) { rep.insert_equal(f, l); }

  hash_multiset(const value_type* f, const value_type* l, size_type n)

    : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }

  hash_multiset(const value_type* f, const value_type* l, size_type n,

                const hasher& hf)

    : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }

  hash_multiset(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); }

  hash_multiset(const_iterator f, const_iterator l)

    : rep(, hasher(), key_equal()) { rep.insert_equal(f, l); }

  hash_multiset(const_iterator f, const_iterator l, size_type n)

    : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }

  hash_multiset(const_iterator f, const_iterator l, size_type n,

                const hasher& hf)

    : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }

  hash_multiset(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); }

#endif /*__STL_MEMBER_TEMPLATES */

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(hash_multiset& hs) { rep.swap(hs.rep); }

  friend bool operator== __STL_NULL_TMPL_ARGS (const hash_multiset&,

                                               const hash_multiset&);

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

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

public:

  iterator insert(const value_type& obj) { return rep.insert_equal(obj); }

#ifdef __STL_MEMBER_TEMPLATES

  template <class InputIterator>

  void insert(InputIterator f, InputIterator l) { rep.insert_equal(f,l); }

#else

  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); }

#endif /*__STL_MEMBER_TEMPLATES */

  iterator insert_noresize(const value_type& obj)

    { return rep.insert_equal_noresize(obj); }

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

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

  pair<iterator, 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 Val, class HashFcn, class EqualKey, class Alloc>

inline bool operator==(const hash_multiset<Val, HashFcn, EqualKey, Alloc>& hs1,

                       const hash_multiset<Val, HashFcn, EqualKey, Alloc>& hs2)

{

  return hs1.rep == hs2.rep;

}

// 如果编译器支持模板函数特化优先级

// 那么将全局的swap实现为使用hash_multiset私有的swap以提高效率

#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER

template <class Val, class HashFcn, class EqualKey, class Alloc>

inline void swap(hash_multiset<Val, HashFcn, EqualKey, Alloc>& hs1,

                 hash_multiset<Val, HashFcn, EqualKey, Alloc>& hs2)

{

  hs1.swap(hs2);

}

#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)

#pragma reset woff 1174

#endif

__STL_END_NAMESPACE

#endif /* __SGI_STL_INTERNAL_HASH_SET_H */

// Local Variables:

// mode:C++

// End:

stl_hash_set.h的更多相关文章

  1. 《STL源代码剖析》---stl_hash_set.h阅读笔记

    STL仅仅规定接口和复杂度,对于详细实现不作要求.set大多以红黑树实现,但STL在标准规格之外提供了一个所谓的hash_set,以hash table实现.hash_set的接口,hash_tabl ...

  2. C++ STL源码剖析

    stl_config.h defalloc.h stl_alloc.h memory.cpp stl_construct.h stl_uninitialized.h stl_iterator.h ty ...

  3. APUE中fcntl.h的使用及O_SYNC在Mac与Ubuntu下的测试

    此部分测试涉及到APUE V3中,第三章的图3-12到图3-14. 通过fcntl.h提供的功能,修改fd的文件属性,本处增加O_SYNC功能,并测试其效果. 本文涉及代码: tree ch3 ch3 ...

  4. 关于apue.3e中apue.h的使用

    关于apue.3e中apue.h的使用 近来要学一遍APUE第三版,并于此开博做为记录. 先下载源文件: # url: http://http//www.apuebook.com/code3e.htm ...

  5. YYModel 源码解读（二）之NSObject+YYModel.h (1)

    本篇文章主要介绍 _YYModelPropertyMeta 前边的内容 首先先解释一下前边的辅助函数和枚举变量,在写一个功能的时候,这些辅助的东西可能不是一开始就能想出来的,应该是在后续的编码过程中 ...

  6. YYModel 源码解读（一）之YYModel.h

    #if __has_include(<YYModel/YYModel.h>) FOUNDATION_EXPORT double YYModelVersionNumber; FOUNDATI ...

  7. error RC1015: cannot open include file 'afxres.h' 解决办法

    在为WindowsPhone8程序添加本地化的过程中遇到这个问题: 问题原因就是afxres.h文件缺失,下载它,放到VS安装目录下的VS\include目录下就可以了(选择目录的时候注意对应对版本) ...

  8. afxcomctl32.h与afxcomctl32.inl报错

    afxcomctl32.h与afxcomctl32.inl报错 编译公司一个几年前的老项目,是从VC6.0升级到VS2005的. 1.编译时报缺少头文件,于是附件包含目录,于是出现了以下报错: 1&g ...

  9. C标准头文件<math.h>

    定义域错误可以理解为超出了函数的适用范围,如果发生了定义域错误,设errno为EDOM 如果结果不能表示为double值,则发生值域错误,如果结果上溢,则函数返回HUGE_VAL的值,设errno为E ...

随机推荐

  1. Python基础（17）_面向对象程序设计（抽象类、继承原理、封装、多态，绑定方法）

    一.抽象类 抽象类是一个特殊的类,它的特殊之处在于只能被继承,不能被实例化 1.在python中实现抽象类 import abc #利用abc模块实现抽象类 class All_file(metacl ...

  2. 03 Spring框架 bean的属性以及bean前处理和bean后处理

    整理了一下之前学习spring框架时候的一点笔记.如有错误欢迎指正,不喜勿喷. 上一节我们给出了三个小demo,具体的流程是这样的: 1.首先在aplicationContext.xml中添加< ...

  3. SourceTree的基本使用---基本介绍/本地开发

    转载自https://www.cnblogs.com/tian-xie/p/6264104.html 1. SourceTree是什么 拥有可视化界面的项目版本控制软件,适用于git项目管理 wind ...

  4. linux systemctl 指令 —— 阮一峰

    Systemd 指令 原文链接如果有效,请点击原文链接查看.原文:http://www.ruanyifeng.com/blog/2016/03/systemd-tutorial-commands.ht ...

  5. jQuery滑动杆打分插件

    在线演示 本地下载

  6. awk遇到windows 的^M

    windows在编辑的文档,在linux中显示会在行尾出现一个^M window下编辑的文档:末尾带^M$ linux下编辑的文档:末尾带$ awk中如果存在^M,则会限制print的输出列数(只能输 ...

  7. 20145231《Java程序设计》第三次实验报告

    实验三 敏捷开发与XP实现 实验内容 XP基础 XP核心实践 相关工具 实验要求 了解敏捷开发的基本方法以及XP软件开发的相关准则:了解代码编写的标准和原则:体会结对编程的好处: 实践体会版本控制的方 ...

  8. how to use composer in fiddler

    https://www.cnblogs.com/youxin/p/3570310.html http://docs.telerik.com/fiddler/generate-traffic/tasks ...

  9. EntityFramework 学习 一 Validate Entity

    可以为实体实现自定义验证,重写DBContext中的个ValidateEntity方法 protected override System.Data.Entity.Validation.DbEntit ...

  10. Flume之核心架构深入解析

    我们一起来了解Source.Channel和Sink的全链路过程. 一.Flume架构分析 这个图中核心的组件是: Source,ChannelProcessor,Channel,Sink.他们的关系 ...