stl源码剖析 详细学习笔记 hashset hashmap
//---------------------------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的更多相关文章
- stl源码剖析 详细学习笔记 hashtable
//---------------------------15/03/24---------------------------- //hashtable { /* 概述: sgi采用的是开链法完成h ...
- stl源码剖析 详细学习笔记 set map
// // set map.cpp // 笔记 // // Created by fam on 15/3/23. // // //---------------------------15/03 ...
- stl源码剖析 详细学习笔记 RB_tree (1)
// // RB_tree_STL.cpp // 笔记 // // Created by fam on 15/3/21. // // #include "RB_tree_STL.h&q ...
- stl源码剖析 详细学习笔记heap
// // heap.cpp // 笔记 // // Created by fam on 15/3/15. // // //---------------------------15/03/15 ...
- stl源码剖析 详细学习笔记 空间配置器
//---------------------------15/04/05---------------------------- /* 空间配置器概述: 1:new操作包含两个阶段操作 1>调 ...
- stl源码剖析 详细学习笔记 算法(1)
//---------------------------15/03/27---------------------------- //算法 { /* 质变算法:会改变操作对象之值 所有的stl算法都 ...
- stl源码剖析 详细学习笔记 算法总览
//****************************基本算法***************************** /* stl算法总览,不在stl标准规格的sgi专属算法,都以 *加以标 ...
- stl源码剖析 详细学习笔记 RB_tree (2)
//---------------------------15/03/22---------------------------- //一直好奇KeyOfValue是什么,查了下就是一个和仿函数差不多 ...
- stl源码剖析 详细学习笔记priority_queue slist
// // priority_queue.cpp // 笔记 // // Created by fam on 15/3/16. // // //------------------------- ...
随机推荐
- Oracle EBS OM 保留订单
DECLARE l_header_rec OE_ORDER_PUB.Header_Rec_Type; l_line_tbl OE_ORDER_PUB.Line_Tbl_Type; l_action_r ...
- iftop – 实时Linux网络带宽监控工具
在本文中,我们提出了另一个称为Interface TOP (IFTOP)的优秀程序, 它是一个基于实时控制台的网络带宽监控工具. 它将显示接口上网络活动的快速概览. Iftop 平均每 2,10 和4 ...
- mysql的“The user specified as a definer (”@’%') does not exist”问题 解决
2017-12-27,MYSQL的存储调用时出现了“The user specified as a definer (”test@’%') does not exist”的问题. 网上查过后,都是提示 ...
- unbuntu 安装python包提示E: Unable to locate package python-timeout
今天本想着在unbuntu环境下安装python的一个包,安装了几次都提示 E: Unable to locate package python-timeout 查阅了一些信息才知道,原来是一些软件源 ...
- Docker容器学习与分享08
Docker容器网络 Docker除了默认创建的三种网络外,还可以自定义网络. 首先创建一个bridge类型的网络,使用docker network create命令. [root@promote ~ ...
- October 25th, 2017 Week 43rd Wednesday
Perseverance is not a long race; it is many short races one after another. 坚持不是一个长跑,她是很多一个接一个的短跑. To ...
- 极限编程核心价值：简单（Simplicity）
写在前面 在编写 ASP.NET Core 项目时,深感项目设计的无力感,在软件设计方面我还有很长的路要走.我一直以来都把代码当作一种艺术的存在,认为自己是个"艺术家",其实就是个 ...
- Ubuntu集群 配置ntp服务
1.概述 NTP(Network Time Protocol)是用来使计算机时间同步化的一种协议,它可以使计算机对其服务器或时钟源(如石英钟,GPS等等)做同步化,它可以提供高精准度的时间校正(LAN ...
- TIOBE 11月编程语言榜：Go逆袭，Python势头很猛！
导读 离 TIOBE 宣布 2018 年的编程语言只有2个月了.目前来看,有 5 个候选对象,它们都是来自前五名的:Java.C.C++.Python.Visual Basic.NET.每年我们都希望 ...
- IO多路复用select/poll/epoll详解以及在Python中的应用
IO multiplexing(IO多路复用) IO多路复用,有些地方称之为event driven IO(事件驱动IO). 它的好处在于单个进程可以处理多个网络IO请求.select/epoll这两 ...