Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
zhhf96
C-Plus-Plus-TheAlgorithms
提交
7d3adb00
C
C-Plus-Plus-TheAlgorithms
项目概览
zhhf96
/
C-Plus-Plus-TheAlgorithms
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
C-Plus-Plus-TheAlgorithms
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
未验证
提交
7d3adb00
编写于
7月 29, 2020
作者:
K
Krishna Vedala
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
updated program docs
上级
c7dd883b
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
53 addition
and
22 deletion
+53
-22
hashing/linear_probing_hash_table.cpp
hashing/linear_probing_hash_table.cpp
+53
-22
未找到文件。
hashing/linear_probing_hash_table.cpp
浏览文件 @
7d3adb00
...
...
@@ -2,7 +2,9 @@
* @file
* @author [achance6](https://github.com/achance6)
* @author [Krishna Vedala](https://github.com/kvedala)
* @brief
* @brief Storage mechanism using [linear probing
* hash](https://en.wikipedia.org/wiki/Linear_probing) keys.
* @note The implementation can be optimized by using OOP style.
*/
#include <iostream>
#include <string>
...
...
@@ -16,13 +18,18 @@ using std::string;
namespace
{
// keep the code local to this file by assigning them to an unnamed
// namespace
/** Node object that holds key */
struct
Entry
{
explicit
Entry
(
int
key
=
notPresent
)
:
key
(
key
)
{}
///< constructor
int
key
;
///< key value
};
// fwd declarations
using
Entry
=
struct
Entry
;
bool
putProber
(
Entry
entry
,
int
key
);
bool
searchingProber
(
Entry
entry
,
int
key
);
void
add
(
int
key
);
// globals
//
Undocumented
globals
int
notPresent
;
std
::
vector
<
Entry
>
table
;
int
totalSize
;
...
...
@@ -30,19 +37,21 @@ int tomb = -1;
int
size
;
bool
rehashing
;
// Node that holds key
struct
Entry
{
explicit
Entry
(
int
key
=
notPresent
)
:
key
(
key
)
{}
int
key
;
};
// Hash a key
/**
* @brief Hash a key. Uses the STL library's `std::hash()` function.
*
* @param key value to hash
* @return hash value of the key
*/
size_t
hashFxn
(
int
key
)
{
std
::
hash
<
int
>
hash
;
return
hash
(
key
);
}
// Performs linear probing to resolve collisions
/** Performs linear probing to resolve collisions
* @param key key value to hash
* @return hash value of the key
*/
int
linearProbe
(
int
key
,
bool
searching
)
{
int
hash
=
static_cast
<
int
>
(
hashFxn
(
key
));
int
i
=
0
;
...
...
@@ -80,23 +89,33 @@ int linearProbe(int key, bool searching) {
return
notPresent
;
}
// Finds empty spot
bool
putProber
(
Entry
entry
,
int
key
)
{
/** Finds empty spot
* @param entry instance to check in
* @param key key value to hash
* @return hash value of the key
*/
bool
putProber
(
const
Entry
&
entry
,
int
key
)
{
if
(
entry
.
key
==
notPresent
||
entry
.
key
==
tomb
)
{
return
true
;
}
return
false
;
}
// Looks for a matching key
bool
searchingProber
(
Entry
entry
,
int
key
)
{
/** Looks for a matching key
* @param entry instance to check in
* @param key key value to hash
* @return hash value of the key
*/
bool
searchingProber
(
const
Entry
&
entry
,
int
key
)
{
if
(
entry
.
key
==
key
)
{
return
true
;
}
return
false
;
}
// Displays the table
/** Function to displays the table
* @returns none
*/
void
display
()
{
for
(
int
i
=
0
;
i
<
totalSize
;
i
++
)
{
if
(
table
[
i
].
key
==
notPresent
)
{
...
...
@@ -112,7 +131,9 @@ void display() {
cout
<<
endl
;
}
// Rehashes the table into a bigger table
/** Rehashes the table into a bigger table
* @returns None
*/
void
rehash
()
{
// Necessary so wall of add info isn't printed all at once
rehashing
=
true
;
...
...
@@ -133,7 +154,9 @@ void rehash() {
cout
<<
"Table was rehashed, new size is: "
<<
totalSize
<<
endl
;
}
// Adds entry using linear probing. Checks for load factor here
/** Adds entry using linear probing. Checks for load factor here
* @param key key value to hash and add
*/
void
add
(
int
key
)
{
int
index
=
linearProbe
(
key
,
false
);
table
[
index
].
key
=
key
;
...
...
@@ -143,7 +166,9 @@ void add(int key) {
}
}
// Removes key. Leaves tombstone upon removal.
/** Removes key. Leaves tombstone upon removal.
* @param key key value to hash and remove
*/
void
remove
(
int
key
)
{
int
index
=
linearProbe
(
key
,
true
);
if
(
index
==
notPresent
)
{
...
...
@@ -154,7 +179,9 @@ void remove(int key) {
size
--
;
}
// Information about the adding process
/** Information about the adding process
* @param key key value to hash and add
*/
void
addInfo
(
int
key
)
{
cout
<<
"Initial table: "
;
display
();
...
...
@@ -167,7 +194,9 @@ void addInfo(int key) {
display
();
}
// Information about removal process
/** Information about removal process
* @param key key value to hash and remove
*/
void
removalInfo
(
int
key
)
{
cout
<<
"Initial table: "
;
display
();
...
...
@@ -181,7 +210,9 @@ void removalInfo(int key) {
}
}
// namespace
// I/O
/** Main function
* @returns 0 on success
*/
int
main
()
{
int
cmd
=
0
,
hash
=
0
,
key
=
0
;
cout
<<
"Enter the initial size of Hash Table. = "
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录