//---------------------------15/03/26----------------------------

//hash_set

{

/*

hash_set概述：

1:这是一个hash版本的set，RB_tree版本的set有自动排序功能，

而hash_set没有这个功能。

2:hash_set的使用方式，与set完全相同。

*/

//class

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

class EqualKey = equal_to<Value>,
class Alloc=alloc>

class hash_set

{

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;        
//hashtable中: typedef HashFcn hasher

typedef typename ht::key_equel key_equel;

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_equel key_eq()
const { return rep.key_eq(); }

public:

//各种构造函数 ,不给定大小的话默认值为100,实际上找到的质数为193

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

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

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

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

: rep(n, hf, eql) {}

template< class InputIterator>

hash_set(InputIterator f, InputIterator l)

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

template< class InputIterator>

hash_set(InputIterator f, InputIterator l, size_type n)

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

template< class InputIterator>

hash_set(InputIterator f, InputIterator l, size_type n,
const hasher& hf)

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

template< class InputIterator>

hash_set(InputIterator f, InputIterator l, size_type n,
const hasher& hf

const key_equel& eql)

: rep(, hf, eql) { rep.insert_unique(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(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);

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

}

template<class InputIterator>

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

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

//相等的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 elems_in_bucket(size_type n)
const

{
return rep.elems_in_bucket(n); }

//class

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 has1.rep == has2.rep;

}

};

}

//hash_map

{

/*

hash_map概述：

hash_map之于map就像hash_set之于set一样。

*/

//class

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

class EqualKey = equal_to<Value>,
class Alloc=alloc>

class hash_map

{

private:

typedef hashtable<pair<const Key, T>, Key, HashFcn,

select1st<pair<const Key, T>, EqualKey, Alloc> ht;

ht rep;

public:

typedef typename ht::key_type key_type;

typedef T data_type;

typedef T mapped_type;

typedef typename ht::value_type value_type;

typedef typename ht::hasher hasher;        
//hashtable中: typedef HashFcn hasher

typedef typename ht::key_equel key_equel;

typedef typename ht::size_type size_type;

typedef typename ht::difference_type difference_type;

typedef typename ht::pointer pointer;

typedef typename ht::const_pointer const_pointer;

typedef typename ht::reference reference;

typedef typename ht::const_reference const_reference;

typedef typename ht::iterator iterator;

typedef typename ht::const_iterator const_iterator;

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

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

public:

//各种构造函数 ,不给定大小的话默认值为100,实际上找到的质数为193

hash_map() : rep(, hasher(), key_equel()){}

explicit hash_map(size_type n) : rep(n, hasher(), key_equel()) {}

hash_map(size_type n,
const hasher& hf) : rep(n, hf, key_equel()) {}

hash_map(size_type n,
const hasher& hf,
const key_equel& eql)

: rep(n, hf, eql) {}

template< class InputIterator>

hash_map(InputIterator f, InputIterator l)

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

template< class InputIterator>

hash_map(InputIterator f, InputIterator l, size_type n)

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

template< class InputIterator>

hash_map(InputIterator f, InputIterator l, size_type n,
const hasher& hf)

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

template< class InputIterator>

hash_map(InputIterator f, InputIterator l, size_type n,
const hasher& hf

const key_equel& eql)

: rep(, hf, eql) { rep.insert_unique(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(hash_map& hs) { rep.swap(hs.rep); }

friend bool
operator== __STL_NULL_TMPL_ARGS (const hash_map&,
const hash_map&);

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

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

public:

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

{

//之前在set中就想过
为什么不直接返回 在map中看到时直接返回了，

//不是像set中一样还要先申请一个临时变量
再返回临时变量

//经过一番努力，发现：set的iterator是const_iterator，因为set不能更改值嘛

//所以需要进行转化，所以set那里会复杂一些

return rep.insert_unique(obj);

}

template<class InputIterator>

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

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

{

return  rep.insert_unique_noresize(obj);

}

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

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

T&
operator[](const key_type& key)

{

return rep.find_or_insert(value_type(key, T())).second;

}

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

//相等的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 elems_in_bucket(size_type n)
const

{
return rep.elems_in_bucket(n); }

//class

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

inline bool
operator==(const hash_map<Value, HashFcn, EqualKey, Alloc>& hm1,

const hash_map<Value, HashFcn, EqualKey, Alloc>& hm2)

{

return has1.rep == has2.rep;

}

};

}

//hash_multiset

{

/*

hash_multiset概述：

同上

*/

//class

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

class EqualKey = equal_to<Value>,
class Alloc=alloc>

class hash_multiset

{

private:

typedef hash_multiset<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;        
//hashtable中: typedef HashFcn hasher

typedef typename ht::key_equel key_equel;

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_equel key_eq()
const { return rep.key_eq(); }

public:

//各种构造函数 ,不给定大小的话默认值为100,实际上找到的质数为193

hash_multiset() : rep(100,hasher(), key_equel()){}

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

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

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

: rep(n, hf, eql) {}

template< class InputIterator>

hash_multiset(InputIterator f, InputIterator l)

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

template< class InputIterator>

hash_multiset(InputIterator f, InputIterator l, size_type n)

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

template< class InputIterator>

hash_multiset(InputIterator f, InputIterator l, size_type n,
const hasher& hf)

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

template< class InputIterator>

hash_multiset(InputIterator f, InputIterator l, size_type n,
const hasher& hf

const key_equel& eql)

: rep(, 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(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);

}

template<class InputIterator>

void insert(InputIterator f, InputIterator 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)
const { return rep.find(key); }

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

//相等的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 elems_in_bucket(size_type n)
const

{
return rep.elems_in_bucket(n); }

//class

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

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

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

{

return has1.rep == has2.rep;

}

};

}

//hash_multimap

{

/*

hash_multimap概述：

同上

*/

//class

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

class EqualKey = equal_to<Value>,
class Alloc=alloc>

class hash_multimap

{

private:

typedef hashtable<pair<const Key, T>, Key, HashFcn,

select1st<pair<const Key, T>, EqualKey, Alloc> ht;

ht rep;

public:

typedef typename ht::key_type key_type;

typedef T data_type;

typedef T mapped_type;

typedef typename ht::value_type value_type;

typedef typename ht::hasher hasher;        
//hashtable中: typedef HashFcn hasher

typedef typename ht::key_equel key_equel;

typedef typename ht::size_type size_type;

typedef typename ht::difference_type difference_type;

typedef typename ht::pointer pointer;

typedef typename ht::const_pointer const_pointer;

typedef typename ht::reference reference;

typedef typename ht::const_reference const_reference;

typedef typename ht::iterator iterator;

typedef typename ht::const_iterator const_iterator;

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

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

public:

//各种构造函数 ,不给定大小的话默认值为100,实际上找到的质数为193

hash_multimap() : rep(, hasher(), key_equel()){}

explicit hash_multimap(size_type n) : rep(n, hasher(), key_equel()) {}

hash_multimap(size_type n,
const hasher& hf) : rep(n, hf, key_equel()) {}

hash_multimap(size_type n,
const hasher& hf,
const key_equel& eql)

: rep(n, hf, eql) {}

template< class InputIterator>

hash_multimap(InputIterator f, InputIterator l)

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

template< class InputIterator>

hash_multimap(InputIterator f, InputIterator l, size_type n)

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

template< class InputIterator>

hash_multimap(InputIterator f, InputIterator l, size_type n,
const hasher& hf)

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

template< class InputIterator>

hash_multimap(InputIterator f, InputIterator l, size_type n,
const hasher& hf

const key_equel& eql)

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

friend bool
operator== __STL_NULL_TMPL_ARGS (const hash_multimap&,
const hash_multimap&);

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

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

public:

iterator insert(const value_type& obj)

{

return rep.insert_equal(obj);

}

template<class InputIterator>

void insert(InputIterator f, InputIterator 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)
const { 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); }

//相等的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 elems_in_bucket(size_type n)
const

{
return rep.elems_in_bucket(n); }

//class

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

inline bool
operator==(const hash_multimap<Value, HashFcn, EqualKey, Alloc>& hm1,

const hash_multimap<Value, HashFcn, EqualKey, Alloc>& hm2)

{

return has1.rep == has2.rep;

}

};

}

stl源码剖析 详细学习笔记 hashset hashmap的更多相关文章

  1. stl源码剖析 详细学习笔记 hashtable

    //---------------------------15/03/24---------------------------- //hashtable { /* 概述: sgi采用的是开链法完成h ...

  2. stl源码剖析 详细学习笔记 set map

    // //  set map.cpp //  笔记 // //  Created by fam on 15/3/23. // // //---------------------------15/03 ...

  3. stl源码剖析 详细学习笔记 RB_tree (1)

    // //  RB_tree_STL.cpp //  笔记 // //  Created by fam on 15/3/21. // // #include "RB_tree_STL.h&q ...

  4. stl源码剖析 详细学习笔记heap

    // //  heap.cpp //  笔记 // //  Created by fam on 15/3/15. // // //---------------------------15/03/15 ...

  5. stl源码剖析 详细学习笔记 空间配置器

    //---------------------------15/04/05---------------------------- /* 空间配置器概述: 1:new操作包含两个阶段操作 1>调 ...

  6. stl源码剖析 详细学习笔记 算法(1)

    //---------------------------15/03/27---------------------------- //算法 { /* 质变算法:会改变操作对象之值 所有的stl算法都 ...

  7. stl源码剖析 详细学习笔记 算法总览

    //****************************基本算法***************************** /* stl算法总览,不在stl标准规格的sgi专属算法,都以 *加以标 ...

  8. stl源码剖析 详细学习笔记 RB_tree (2)

    //---------------------------15/03/22---------------------------- //一直好奇KeyOfValue是什么,查了下就是一个和仿函数差不多 ...

  9. stl源码剖析 详细学习笔记priority_queue slist

    // //  priority_queue.cpp //  笔记 // //  Created by fam on 15/3/16. // // //------------------------- ...

随机推荐

  1. Prometheus Node_exporter 之 Memory Detail Meminfo /proc/meminfo

    1. Memory Active / Inactive type: GraphUnit: bytesLabel: BytesInactive - 最近使用较少的内存, 优先被回收利用 /proc/me ...

  2. jboss eap6.1（4）(部署应用)

    1.添加应用war包 手动部署,添加war包到standalone\deployments下,手工创建一个文件,如war包名称是a.war,创建一个a.war.deployed文件,内容随意. 2.  ...

  3. 阿里云朱照远: AI打开新视界 8K时代已来!

    2018年4月11-12日,2018亚太CDN峰会在北京隆重召开,大会由亚太CDN领袖论坛.电视云论坛.短视频论坛.视频云论坛.新技术论坛.运营商论坛.国际云论坛等7大部分组成.在亚太CDN领袖峰会上 ...

  4. SQL SERVER解析Json

    外包的项目,有很多信息存储在JSON中,无论是查询还是修改信息都十分麻烦.找了一些实用的SQL Function去解析,并附修改例子. 使用过程: 1. 需要在SQL新建自定义类型 table: Hi ...

  5. COM动态添加删除成员,类似JavaScript中调用的对象

    在JavaScript中调用对象时,可动态添加删除成员如: var obj=new Object; obj.member1='aaaaa'; obj.fun1=function() { alert(' ...

  6. [python]python官方原版编码规范路径

    1.进入python官方主页:https://www.python.org/ 2.按如下图进入PEP Index ​ 3.选择第8个,即为python的规范 ​

  7. webstorm 2017 激活

    参考:https://blog.csdn.net/wangyingwing/article/details/79119592

  8. Codeforces Round #503 Div. 2

    时间相对来说还是比较合适的,正好放假就可以打一打啦. A. New Building for SIS:http://codeforces.com/contest/1020/problem/A 题意概述 ...

  9. 环境搭建（Python）

    Python 开发环境搭建 Windows篇   一. Python安装 资源获取 登录Python官网的Windows下载页面https://www.python.org/downloads/win ...

  10. java读写properties配置文件方法

    1.Properties类 Properties类表示了一个持久的属性集.Properties可保存在流中或从流中加载,属性列表中的key和value必须是字符串. 虽然Properties类继承了j ...