yystopf
/
xiuos
1
0
Fork 1
Code Issues Pull Requests 1 Actions Packages Projects Releases Wiki Activity

firstCommit

This commit is contained in:
JhonLi 2023-09-25 00:28:13 -07:00
parent a1df906d16
commit ee6552bb8a
13 changed files with 134 additions and 239 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
APP_Framework/Applications/app_test/test_hash/01.png Executable file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 60 KiB

BIN
APP_Framework/Applications/app_test/test_hash/02.png Executable file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 54 KiB

BIN
APP_Framework/Applications/app_test/test_hash/03.png Executable file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 143 KiB

BIN
APP_Framework/Applications/app_test/test_hash/04.png Executable file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 121 KiB

BIN
APP_Framework/Applications/app_test/test_hash/05.png Executable file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 164 KiB

BIN
APP_Framework/Applications/app_test/test_hash/06.png Executable file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 146 KiB

BIN
APP_Framework/Applications/app_test/test_hash/CompileSuccess.png
View File

Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 75 KiB

BIN
APP_Framework/Applications/app_test/test_hash/ConfigOpen.png
View File

Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 102 KiB

34
APP_Framework/Applications/app_test/test_hash/README.md Normal file → Executable file
View File

@ -1,19 +1,14 @@
# 基于cortex-m3-emulator实现哈希表并测试验证## # 基于cortex-m3-emulator实现哈希表并测试验证
## 1. 简介 ## 1. 简介
利用c语言实现了哈希表（HashMap），包括添加键值对(Put)，获取键对应的值(Get), 删除健（Delete），清空哈希表(Clear)， 迭代遍历哈希表(hashMapIterator)等功能 利用c语言实现了哈希表（HashMap），包括添加键值对(Put)，获取键对应的值(Get), 删除健（Delete），清空哈希表(Clear)等功能。参考了比赛提供的示例代码，通过使用与比赛截然不同的方法——线性探测法来解决哈希冲突。
操作。
利用数组（Entry）作为存储空间，利用链表(*next)解决冲突。当哈希表的大小超过数组大小后，为避免发生冲突过多的情况，可以对哈希表扩容。
## 2. 数据结构设计说明 ## 2. 数据结构设计说明
键值对结构 键值对结构
typedef struct entry { typedef struct entry {
void * key; // 键 void * key; // 键
void * value; // 值 void * value; // 值
struct entry * next; // 冲突链表
}*Entry; }*Entry;
哈希结构 哈希结构
typedef struct hashMap { typedef struct hashMap {
int size; // 当前大小 int size; // 当前大小
@ -28,7 +23,6 @@ typedef struct hashMap {
Exists exists; // 判断键是否存在 Exists exists; // 判断键是否存在
Boolean autoAssign; // 设定是否根据当前数据量动态调整内存大小，默认开启 Boolean autoAssign; // 设定是否根据当前数据量动态调整内存大小，默认开启
}*HashMap; }*HashMap;
包括以下函数功能，分别为： 包括以下函数功能，分别为：
`createHashMap`：创建一个哈希结构 `createHashMap`：创建一个哈希结构
`defaultPut`：添加键值对 `defaultPut`：添加键值对
@ -38,21 +32,19 @@ typedef struct hashMap {
`defaultClear`：清空Map的函数类型 `defaultClear`：清空Map的函数类型
`resetHashMap`：重新构建哈希表 `resetHashMap`：重新构建哈希表
## 3. 测试程序说明 ## 3. 测试程序说明
测试了哈希表的插入键值对(Put)，判断键是否存在(Exist)，获取键对应的值(Get)， 删除健（Delete），迭代遍历哈希表(hashMapIterator)，清空哈希表(Clear)等操作。 测试了哈希表的插入键值对(Put)，判断键是否存在(Exist)，获取键对应的值(Get)， 删除健（Delete）等操作。
并展示了利用链地址法解决哈希冲突的示例, 两个不同的人(Bob和Li Ming)的hashcode相同。
## 4. 运行结果（##需结合运行测试截图按步骤说明##） ## 4. 运行结果（##需结合运行测试截图按步骤说明##）
![image](ConfigOpen.png) 4.1打开menuconfig之后，将test_hash_map开启(y)，保存后退出。
打开menuconfig之后，将test_hash_map开启(y)，保存后退出 ![image](01.png)
![image](02.png)
![image](03.png)
![image](04.png)
![image](CompileSuccess.png) 4.2编译XiZi-cortex-m3-emulator.elf成功。
编译XiZi-cortex-m3-emulator.elf成功 ![image](05.png)
![image](ShellCommand.png)
启动qemu模拟Xiuos操作系统，验证TestHash注册Shell命令
![image](TestHash.png)
执行TestHash命令，打印测试结果。
4.3启动qemu模拟Xiuos操作系统，验证TestHash注册Shell命令。执行TestHash命令，打印测试结果。
![image](06.png)

BIN
APP_Framework/Applications/app_test/test_hash/ShellCommand.png
View File

Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 94 KiB

BIN
APP_Framework/Applications/app_test/test_hash/TestHash.png
View File

Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 95 KiB

306
APP_Framework/Applications/app_test/test_hash/test_hash.c Normal file → Executable file
View File

@ -2,12 +2,11 @@
/** /**
* @file: test_hash.c * @file: test_hash.c
* @brief: a application of test hash function * @brief: a application of test hash function
* @version: 3.0 * @version: 1.0
* @author: Yao wenying * @author: Li chunji And Li zihao
* @date: 2023/05/26 * @date: 2023/09/15
*/ */
#include <transform.h>
#include"test_hash.h" #include"test_hash.h"
int defaultHashCode(HashMap hashMap, let key) { int defaultHashCode(HashMap hashMap, let key) {
@ -34,17 +33,13 @@ void resetHashMap(HashMap hashMap, int listSize) {
// 键值对临时存储空间 // 键值对临时存储空间
Entry tempList = newEntryList(hashMap->size); Entry tempList = newEntryList(hashMap->size);
HashMapIterator iterator = createHashMapIterator(hashMap);
int length = hashMap->size; int length = hashMap->size;
for (int index = 0; hasNextHashMapIterator(iterator); index++) { for(int index=0;index<hashMap->listSize;index++)
// 迭代取出所有键值对 {
iterator = nextHashMapIterator(iterator); tempList[index].key = hashMap->list[index].key;
tempList[index].key = iterator->entry->key; tempList[index].value = hashMap->list[index].value;
tempList[index].value = iterator->entry->value;
tempList[index].next = NULL;
} }
freeHashMapIterator(&iterator);
// 清除原有键值对数据 // 清除原有键值对数据
hashMap->size = 0; hashMap->size = 0;
@ -52,13 +47,6 @@ void resetHashMap(HashMap hashMap, int listSize) {
Entry current = &hashMap->list[i]; Entry current = &hashMap->list[i];
current->key = NULL; current->key = NULL;
current->value = NULL; current->value = NULL;
if (current->next != NULL) {
while (current->next != NULL) {
Entry temp = current->next->next;
free(current->next);
current->next = temp;
}
}
} }
// 更改内存大小 // 更改内存大小
@ -73,7 +61,6 @@ void resetHashMap(HashMap hashMap, int listSize) {
for (int i = 0; i < hashMap->listSize; i++) { for (int i = 0; i < hashMap->listSize; i++) {
hashMap->list[i].key = NULL; hashMap->list[i].key = NULL;
hashMap->list[i].value = NULL; hashMap->list[i].value = NULL;
hashMap->list[i].next = NULL;
} }
// 将所有键值对重新写入内存 // 将所有键值对重新写入内存
@ -84,60 +71,46 @@ void resetHashMap(HashMap hashMap, int listSize) {
} }
void defaultPut(HashMap hashMap, let key, let value) { void defaultPut(HashMap hashMap, let key, let value) {
// 获取哈希值 // 获取哈希值
int index = hashMap->hashCode(hashMap, key); int index = hashMap->hashCode(hashMap, key);
if (hashMap->list[index].key == NULL) { if (hashMap->list[index].key == NULL) {
hashMap->size++; hashMap->size++;
// 该地址为空时直接存储 // 该地址为空时直接存储
hashMap->list[index].key = key; hashMap->list[index].key = key;
hashMap->list[index].value = value; hashMap->list[index].value = value;
} }
else { else {
Entry current = &hashMap->list[index]; int cur = (index+1) % hashMap->listSize;
while (current != NULL) { while(hashMap->list[cur].key != NULL)
if (hashMap->equal(key, current->key)) { {
// 对于键值已经存在的直接覆盖 cur = (cur + 1) % hashMap->listSize;
current->value = value; }
return;
}
current = current->next;
};
// 发生冲突则创建节点挂到相应位置的next上 hashMap->size++;
Entry entry = newEntry(); hashMap->list[index].key = key;
entry->key = key; hashMap->list[index].value = value;
entry->value = value; }
entry->next = hashMap->list[index].next;
hashMap->list[index].next = entry;
hashMap->size++;
}
if (hashMap->autoAssign && hashMap->size >= hashMap->listSize) { if (hashMap->autoAssign && hashMap->size >= hashMap->listSize) {
resetHashMap(hashMap, hashMap->listSize * 2);
// 内存扩充至原来的两倍 }
// *注: 扩充时考虑的是当前存储元素数量与存储空间的大小关系，而不是存储空间是否已经存满，
// 例如: 存储空间为10，存入了10个键值对，但是全部冲突了，所以存储空间空着9个，其余的全部挂在一个上面，
// 这样检索的时候和遍历查询没有什么区别了，可以简单这样理解，当我存入第11个键值对的时候一定会发生冲突，
// 这是由哈希函数本身的特性(取模)决定的，冲突就会导致检索变慢，所以这时候扩充存储空间，对原有键值对进行
// 再次散列，会把冲突的数据再次分散开，加快索引定位速度。
resetHashMap(hashMap, hashMap->listSize * 2);
}
} }
let defaultGet(HashMap hashMap, let key) { let defaultGet(HashMap hashMap, let key) {
if (hashMap->exists(hashMap, key)) { if (hashMap->exists(hashMap, key)) {
int index = hashMap->hashCode(hashMap, key); int index = hashMap->hashCode(hashMap, key);
Entry entry = &hashMap->list[index]; Entry entry = &hashMap->list[index];
while (entry != NULL) { while (entry != NULL) {
if (hashMap->equal(entry->key, key)) { if (hashMap->equal(entry->key, key)) {
return entry->value; return entry->value;
} }
entry = entry->next; index++;
} entry = &hashMap->list[index % hashMap->listSize];
} }
return NULL; }
return NULL;
} }
let defaultRemove(HashMap hashMap, let key) { let defaultRemove(HashMap hashMap, let key) {
@ -146,37 +119,29 @@ let defaultRemove(HashMap hashMap, let key) {
if (entry->key == NULL) { if (entry->key == NULL) {
return NULL; return NULL;
} }
let entryKey = entry->key; let entryKey = key;
Boolean result = False; Boolean result = False;
if (hashMap->equal(entry->key, key)) { if (hashMap->equal(entry->key, key)) {
hashMap->size--; hashMap->size--;
if (entry->next != NULL) { entry->key = NULL;
Entry temp = entry->next; entry->value = NULL;
entry->key = temp->key;
entry->value = temp->value;
entry->next = temp->next;
free(temp);
}
else {
entry->key = NULL;
entry->value = NULL;
}
result = True; result = True;
} }
else { else {
Entry p = entry; Entry p = entry;
entry = entry->next; Entry entry = &hashMap->list[(index+1)%hashMap->listSize];
while (entry != NULL) { while (entry != NULL) {
if (hashMap->equal(entry->key, key)) { if (hashMap->equal(entry->key, key)) {
hashMap->size--; hashMap->size--;
p->next = entry->next; entry->key = NULL;
free(entry); entry->value = NULL;
result = True; result = True;
break; break;
} }
p = entry; index++;
entry = entry->next; entry = &hashMap->list[index % hashMap->listSize];
}; }
} }
// 如果空间占用不足一半，则释放多余内存 // 如果空间占用不足一半，则释放多余内存
@ -187,107 +152,61 @@ let defaultRemove(HashMap hashMap, let key) {
} }
Boolean defaultExists(HashMap hashMap, let key) { Boolean defaultExists(HashMap hashMap, let key) {
int index = hashMap->hashCode(hashMap, key); int index = hashMap->hashCode(hashMap, key);
Entry entry = &hashMap->list[index]; Entry entry = &hashMap->list[index];
if (entry->key == NULL) { if (entry->key == NULL) {
return False; return False;
} }
else { else {
while (entry != NULL) {
if (hashMap->equal(entry->key, key)) { while (entry != NULL) {
return True; if (hashMap->equal(entry->key, key)) {
} return True;
entry = entry->next; }
} index++;
return False; entry = &hashMap->list[index % hashMap->listSize];
} }
return False;
}
} }
void defaultClear(HashMap hashMap) { void defaultClear(HashMap hashMap) {
for (int i = 0; i < hashMap->listSize; i++) {
// 释放冲突值内存 // 释放存储空间
Entry entry = hashMap->list[i].next; free(hashMap->list);
while (entry != NULL) { hashMap->list = NULL;
Entry next = entry->next; hashMap->size = -1;
free(entry); hashMap->listSize = 0;
entry = next;
}
hashMap->list[i].next = NULL;
}
// 释放存储空间
free(hashMap->list);
hashMap->list = NULL;
hashMap->size = -1;
hashMap->listSize = 0;
} }
HashMap createHashMap(HashCode hashCode, Equal equal) { HashMap createHashMap(HashCode hashCode, Equal equal) {
HashMap hashMap = newHashMap(); HashMap hashMap = newHashMap();
if (hashMap == NULL) { if (hashMap == NULL) {
return NULL; return NULL;
} }
hashMap->size = 0; hashMap->size = 0;
hashMap->listSize = 8; hashMap->listSize = 8;
hashMap->hashCode = hashCode == NULL ? defaultHashCode : hashCode; hashMap->hashCode = hashCode == NULL ? defaultHashCode : hashCode;
hashMap->equal = equal == NULL ? defaultEqual : equal; hashMap->equal = equal == NULL ? defaultEqual : equal;
hashMap->exists = defaultExists; hashMap->exists = defaultExists;
hashMap->get = defaultGet; hashMap->get = defaultGet;
hashMap->put = defaultPut; hashMap->put = defaultPut;
hashMap->remove = defaultRemove; hashMap->remove = defaultRemove;
hashMap->clear = defaultClear; hashMap->clear = defaultClear;
hashMap->autoAssign = True; hashMap->autoAssign = True;
// 起始分配8个内存空间，溢出时会自动扩充 // 起始分配8个内存空间，溢出时会自动扩充
hashMap->list = newEntryList(hashMap->listSize); hashMap->list = newEntryList(hashMap->listSize);
if (hashMap->list == NULL) { if (hashMap->list == NULL) {
return NULL; return NULL;
} }
Entry p = hashMap->list; Entry p = hashMap->list;
for (int i = 0; i < hashMap->listSize; i++) { for (int i = 0; i < hashMap->listSize; i++) {
p[i].key = p[i].value = p[i].next = NULL; p[i].key = p[i].value = NULL;
} }
return hashMap; return hashMap;
} }
HashMapIterator createHashMapIterator(HashMap hashMap) {
HashMapIterator iterator = newHashMapIterator();
if (iterator == NULL) {
return NULL;
}
iterator->hashMap = hashMap;
iterator->count = 0;
iterator->hashCode = -1;
iterator->entry = NULL;
return iterator;
}
Boolean hasNextHashMapIterator(HashMapIterator iterator) {
return iterator->count < iterator->hashMap->size ? True : False;
}
HashMapIterator nextHashMapIterator(HashMapIterator iterator) {
if (hasNextHashMapIterator(iterator)) {
if (iterator->entry != NULL && iterator->entry->next != NULL) {
iterator->count++;
iterator->entry = iterator->entry->next;
return iterator;
}
while (++iterator->hashCode < iterator->hashMap->listSize) {
Entry entry = &iterator->hashMap->list[iterator->hashCode];
if (entry->key != NULL) {
iterator->count++;
iterator->entry = entry;
break;
}
}
}
return iterator;
}
void freeHashMapIterator(HashMapIterator * iterator) {
free(*iterator);
*iterator = NULL;
}
#define Put(map, key, value) map->put(map, (void *)key, (void *)value); #define Put(map, key, value) map->put(map, (void *)key, (void *)value);
#define Get(map, key) (char *)map->get(map, (void *)key) #define Get(map, key) (char *)map->get(map, (void *)key)
@ -305,19 +224,20 @@ void TestHash() {
Put(map, "000852", "Janne"); Put(map, "000852", "Janne");
printf("print the key-values in hashmap:\n"); printf("print the key-values in hashmap:\n");
HashMapIterator iterator = createHashMapIterator(map); for(int index=0;index<map->listSize;index++)
while (hasNextHashMapIterator(iterator)) { {
iterator = nextHashMapIterator(iterator); if(defaultExists(map, map->list[index].key))
printf("{ key: %s, key: %s, hashcode: %d }\n", {
(char *)iterator->entry->key, (char *)iterator->entry->value, iterator->hashCode); printf("{ key: %s, key: %s, hashcode: %d }\n",
} (char *)map->list[index].key, (char *)map->list[index].value, map->hashCode);
}
}
printf("key: 000852, exists: %s\n", Existe(map, "000852") ? "true" : "false"); printf("key: 000852, exists: %s\n", Existe(map, "000852") ? "true" : "false");
printf("000852: %s\n", Get(map, "000852")); printf("000852: %s\n", Get(map, "000852"));
printf("remove 000852 %s\n", Remove(map, "000852") ? "true" : "false"); printf("remove 000852 %s\n", Remove(map, "000852") ? "true" : "false");
printf("key: 000852, exists: %s\n", Existe(map, "000852") ? "true" : "false"); printf("key: 000852, exists: %s\n", Existe(map, "000852") ? "true" : "false");
map->clear(map); map->clear(map);
freeHashMapIterator(&iterator); }
}
PRIV_SHELL_CMD_FUNCTION(TestHash, Implement hash_map, PRIV_SHELL_CMD_MAIN_ATTR);

33
APP_Framework/Applications/app_test/test_hash/test_hash.h Normal file → Executable file
View File

@ -1,13 +1,14 @@
/** /**
* @file: test_hash.h * @file: test_hash.c
* @brief: a application of test hash function * @brief: an application of test hash function
* @version: 3.0 * @version: 1.0
* @author: Yao wenying * @author: Li chunji And Li zihao
* @date: 2023/05/26 * @date: 2023/9/15
*/ */
#ifndef __HASHMAP_H__ #ifndef __HASHMAP_H__
#define __HASHMAP_H__ #define __HASHMAP_H__
@ -31,7 +32,6 @@ typedef enum _Boolean Boolean;
typedef struct entry { typedef struct entry {
let key; // 键 let key; // 键
let value; // 值 let value; // 值
struct entry * next; // 冲突链表
}*Entry; }*Entry;
#define newEntry() NEW(struct entry) #define newEntry() NEW(struct entry)
@ -77,15 +77,9 @@ typedef struct hashMap {
Boolean autoAssign; // 设定是否根据当前数据量动态调整内存大小，默认开启 Boolean autoAssign; // 设定是否根据当前数据量动态调整内存大小，默认开启
}*HashMap; }*HashMap;
// 迭代器结构
typedef struct hashMapIterator {
Entry entry; // 迭代器当前指向
int count; // 迭代次数
int hashCode; // 键值对的哈希值
HashMap hashMap;
}*HashMapIterator;
#define newHashMapIterator() NEW(struct hashMapIterator)
// 默认哈希函数 // 默认哈希函数
static int defaultHashCode(HashMap hashMap, let key); static int defaultHashCode(HashMap hashMap, let key);
@ -114,16 +108,5 @@ static void resetHashMap(HashMap hashMap, int listSize);
// 创建一个哈希结构 // 创建一个哈希结构
HashMap createHashMap(HashCode hashCode, Equal equal); HashMap createHashMap(HashCode hashCode, Equal equal);
// 创建哈希结构迭代器
HashMapIterator createHashMapIterator(HashMap hashMap);
// 迭代器是否有下一个
Boolean hasNextHashMapIterator(HashMapIterator iterator);
// 迭代到下一次
HashMapIterator nextHashMapIterator(HashMapIterator iterator);
// 释放迭代器内存
void freeHashMapIterator(HashMapIterator * iterator);
#endif // !__HASHMAP_H__ #endif // !__HASHMAP_H__