哈希链表

Catalogue

1. 1. 简介
2. 2. @源码
3. 3. @Set 更新该key值
4. 4. @Get 获取该key值对应的value
5. 5. @Insert 新增一个key-value
6. 6. @Remove 移除该key
7. 7. @Equal 判断是否相等

简介

基于链表桶的hash算法，hashcode 采用 map底层的hashcode方式生成

@源码

package hash

import (
	"github.com/brewlin/go-stl/list/list"
)

type HashList struct {
	capacity int
	b        uint8 //bit
	buckets  []*list.List
}

func NewHashList(capacity int) *HashList {
	var hash HashList
	hash.b = uint8(capacity)
	hash.capacity = capacity << (hash.b - 1)
	bs := make([]*list.List, hash.capacity)
	for i := 0; i < hash.capacity; i++ {
		bs[i] = list.NewList(equal)
	}
	hash.buckets = bs
	return &hash
}

func equal(a, b interface{}) bool {
	return a.(string) == b.(string)
}
func (h HashList) hashCode(key string) int {
	hashcode := Strhash(key)
	m := uintptr(1)<<h.b - 1
	return int(hashcode & m)
}

func (h HashList) Get(key string) interface{} {
	list := h.buckets[h.hashCode(key)]
	return list.Find(key)
}
func (h HashList) Set(key string, value interface{}) {
	list := h.buckets[h.hashCode(key)]
	list.Update(key, value)
}
func (h *HashList) Insert(key string, value interface{}) {
	list := h.buckets[h.hashCode(key)]
	list.Insert(key, value)
}
func (h *HashList) Remove(key string) {
	list := h.buckets[h.hashCode(key)]
	list.Delete(key)
}
``
## @NewHashList 新建一个哈希链表
传入的容量为hash桶默认数量
```go
func NewHashList(capacity int) *HashList {

@Set 更新该key值

@Get 获取该key值对应的value

@Insert 新增一个key-value

@Remove 移除该key

@Equal 判断是否相等