hashmap

Documentation

Index

• Constants
• Variables
• type HashMap
• type IntHashMap
  • func NewIntHashMap(hasNull bool, ibucket, nbucket uint64, m *mpool.MPool) (*IntHashMap, error)
  • func (m *IntHashMap) AddGroup()
  • func (m *IntHashMap) AddGroups(rows uint64)
  • func (m *IntHashMap) Cardinality() uint64
  • func (m *IntHashMap) Free()
  • func (m *IntHashMap) GroupCount() uint64
  • func (m *IntHashMap) HasNull() bool
  • func (m *IntHashMap) NewIterator() *intHashMapIterator
• type Iterator
• type JoinMap
  • func NewJoinMap(sels [][]int64, expr *plan.Expr, mp *StrHashMap, hasNull bool, ...) *JoinMap
  • func (jm *JoinMap) Dup() *JoinMap
  • func (jm *JoinMap) Expr() *plan.Expr
  • func (jm *JoinMap) Free()
  • func (jm *JoinMap) HasNull() bool
  • func (jm *JoinMap) IncRef(ref int64)
  • func (jm *JoinMap) Index() *index.LowCardinalityIndex
  • func (jm *JoinMap) Map() *StrHashMap
  • func (jm *JoinMap) Sels() [][]int64
• type StrHashMap
  • func NewStrMap(hasNull bool, ibucket, nbucket uint64, m *mpool.MPool) (*StrHashMap, error)
  • func (m *StrHashMap) AddGroup()
  • func (m *StrHashMap) AddGroups(rows uint64)
  • func (m *StrHashMap) Cardinality() uint64
  • func (m *StrHashMap) Free()
  • func (m *StrHashMap) GroupCount() uint64
  • func (m *StrHashMap) HasNull() bool
  • func (m *StrHashMap) Insert(vecs []*vector.Vector, row int) (bool, error)
  • func (m *StrHashMap) InsertValue(val any) (bool, error)
  • func (m *StrHashMap) NewIterator() Iterator

Constants

const (
	UnitLimit = 256
)

Variables

var (
	OneUInt8s []uint8
	OneInt64s []int64
)

Types

type HashMap

type HashMap interface {
	// HasNull returns whether the hash map considers the null values.
	HasNull() bool
	// Free method frees the hash map.
	Free()
	// AddGroup adds 1 to the row count of hash map.
	AddGroup()
	// AddGroups adds N to the row count of hash map.
	AddGroups(uint64)
	// GroupCount returns the hash map's row count.
	GroupCount() uint64
}

HashMap is the encapsulated hash table interface exposed to the outside

type IntHashMap

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

IntHashMap key is int64, value is an uint64 (start from 1) before you use the IntHashMap, the user should make sure that sum of vectors' length equal to 8

func NewIntHashMap

func NewIntHashMap(hasNull bool, ibucket, nbucket uint64, m *mpool.MPool) (*IntHashMap, error)

func (*IntHashMap) AddGroup

func (m *IntHashMap) AddGroup()

func (*IntHashMap) AddGroups

func (m *IntHashMap) AddGroups(rows uint64)

func (*IntHashMap) Cardinality

func (m *IntHashMap) Cardinality() uint64

func (*IntHashMap) Free

func (m *IntHashMap) Free()

func (*IntHashMap) GroupCount

func (m *IntHashMap) GroupCount() uint64

func (*IntHashMap) HasNull

func (m *IntHashMap) HasNull() bool

func (*IntHashMap) NewIterator

func (m *IntHashMap) NewIterator() *intHashMapIterator

type Iterator

type Iterator interface {
	// Insert vecs[start, start+count) into hashmap
	// vs  : the number of rows corresponding to each value in the hash table (start with 1)
	// zvs : if zvs[i] is 0 indicates the presence null, 1 indicates the absence of a null.
	Insert(start, count int, vecs []*vector.Vector) (vs []uint64, zvs []int64, err error)

	// Find vecs[start, start+count) in hashmap
	// vs  : the number of rows corresponding to each value in the hash table (start with 1, and 0 means not found.)
	// zvs : if zvs[i] is 0 indicates the presence null, 1 indicates the absence of a null.
	Find(start, count int, vecs []*vector.Vector, inBuckets []uint8) (vs []uint64, zvs []int64)
}

Iterator allows users to do insert or find operations on hash tables in bulk.

type JoinMap

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

JoinMap is used for join

func NewJoinMap

func NewJoinMap(sels [][]int64, expr *plan.Expr, mp *StrHashMap, hasNull bool, idx *index.LowCardinalityIndex) *JoinMap

func (*JoinMap) Dup

func (jm *JoinMap) Dup() *JoinMap

func (*JoinMap) Expr

func (jm *JoinMap) Expr() *plan.Expr

func (*JoinMap) Free

func (jm *JoinMap) Free()

func (*JoinMap) HasNull

func (jm *JoinMap) HasNull() bool

func (*JoinMap) IncRef

func (jm *JoinMap) IncRef(ref int64)

func (*JoinMap) Index

func (jm *JoinMap) Index() *index.LowCardinalityIndex

func (*JoinMap) Map

func (jm *JoinMap) Map() *StrHashMap

func (*JoinMap) Sels

func (jm *JoinMap) Sels() [][]int64

type StrHashMap

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

StrHashMap key is []byte, value is an uint64 value (starting from 1)

each time a new key is inserted, the hashtable returns a last-value+1 or, if the old key is inserted, the value corresponding to that key

func NewStrMap

func NewStrMap(hasNull bool, ibucket, nbucket uint64, m *mpool.MPool) (*StrHashMap, error)

func (*StrHashMap) AddGroup

func (m *StrHashMap) AddGroup()

func (*StrHashMap) AddGroups

func (m *StrHashMap) AddGroups(rows uint64)

func (*StrHashMap) Cardinality

func (m *StrHashMap) Cardinality() uint64

func (*StrHashMap) Free

func (m *StrHashMap) Free()

func (*StrHashMap) GroupCount

func (m *StrHashMap) GroupCount() uint64

func (*StrHashMap) HasNull

func (m *StrHashMap) HasNull() bool

func (*StrHashMap) Insert

func (m *StrHashMap) Insert(vecs []*vector.Vector, row int) (bool, error)

Insert a row from multiple columns into the hashmap, return true if it is new, otherwise false

func (*StrHashMap) InsertValue

func (m *StrHashMap) InsertValue(val any) (bool, error)

InsertValue insert a value, return true if it is new, otherwise false never handle null

func (*StrHashMap) NewIterator

func (m *StrHashMap) NewIterator() Iterator