Update array_hash_map

This commit is contained in:
krahets
2023-03-15 03:11:43 +08:00
parent 669388128f
commit d5afd93571
10 changed files with 98 additions and 98 deletions

View File

@ -14,14 +14,14 @@ type entry struct {
/* 基于数组简易实现的哈希表 */
type arrayHashMap struct {
bucket []*entry
buckets []*entry
}
/* 初始化哈希表 */
func newArrayHashMap() *arrayHashMap {
// 初始化一个长度为 100 的桶(数组)
bucket := make([]*entry, 100)
return &arrayHashMap{bucket: bucket}
buckets := make([]*entry, 100)
return &arrayHashMap{buckets: buckets}
}
/* 哈希函数 */
@ -33,7 +33,7 @@ func (a *arrayHashMap) hashFunc(key int) int {
/* 查询操作 */
func (a *arrayHashMap) get(key int) string {
index := a.hashFunc(key)
pair := a.bucket[index]
pair := a.buckets[index]
if pair == nil {
return "Not Found"
}
@ -44,20 +44,20 @@ func (a *arrayHashMap) get(key int) string {
func (a *arrayHashMap) put(key int, val string) {
pair := &entry{key: key, val: val}
index := a.hashFunc(key)
a.bucket[index] = pair
a.buckets[index] = pair
}
/* 删除操作 */
func (a *arrayHashMap) remove(key int) {
index := a.hashFunc(key)
// 置为 nil ,代表删除
a.bucket[index] = nil
a.buckets[index] = nil
}
/* 获取所有键对 */
func (a *arrayHashMap) entrySet() []*entry {
var pairs []*entry
for _, pair := range a.bucket {
for _, pair := range a.buckets {
if pair != nil {
pairs = append(pairs, pair)
}
@ -68,7 +68,7 @@ func (a *arrayHashMap) entrySet() []*entry {
/* 获取所有键 */
func (a *arrayHashMap) keySet() []int {
var keys []int
for _, pair := range a.bucket {
for _, pair := range a.buckets {
if pair != nil {
keys = append(keys, pair.key)
}
@ -79,7 +79,7 @@ func (a *arrayHashMap) keySet() []int {
/* 获取所有值 */
func (a *arrayHashMap) valueSet() []string {
var values []string
for _, pair := range a.bucket {
for _, pair := range a.buckets {
if pair != nil {
values = append(values, pair.val)
}
@ -89,7 +89,7 @@ func (a *arrayHashMap) valueSet() []string {
/* 打印哈希表 */
func (a *arrayHashMap) print() {
for _, pair := range a.bucket {
for _, pair := range a.buckets {
if pair != nil {
fmt.Println(pair.key, "->", pair.val)
}