khasher

README

khasher

KHasher is a simple utility to create k number of hashes out of two hash functions only.

Which is an implementation of the hashing functions mentioned in this paper.

A similar algorithm was also mentioned in The Art of Computer Programing Vol.3 Sorting and Searching In the section of double hashing open adderssing.

Example

import (
    "fmt"

    "github.com/lafikl/khasher"
)
func main() {
    kh := khasher.NewKHasher(5)
    size_of_table := uint32(67)
    hashes, err := kh.Hash([]byte("Donald E.K"), size_of_table)
    if err != nil {
        panic(err)
    }
    fmt.Println(hashes)
}

Documentation

Index

• type KHasher
  • func NewKHasher(k int) *KHasher
  • func (k *KHasher) Hash(key []byte, m uint32) ([]uint32, error)

Types

type KHasher

type KHasher struct {
	// contains filtered or unexported fields
}

KHasher is an implementation of the hashing functions mentioned in the paper https://www.eecs.harvard.edu/~michaelm/postscripts/rsa2008.pdf A similar algorithm was mentioned in The Art of Computer Programing Vol.3 Sorting and Searching In the section of double hashing open adderssing.

func NewKHasher

func NewKHasher(k int) *KHasher

NewKHasher creates a new instance of the hasher

func (*KHasher) Hash

func (k *KHasher) Hash(key []byte, m uint32) ([]uint32, error)

Hash returns K number of hash values of the given key m is the size of the hash table