hashset

package
v1.9.7 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Nov 5, 2024 License: BSD-3-Clause Imports: 3 Imported by: 2

Documentation

Overview

Package hashset This hashset is mainly in replacement for the bloom filter implementation in K4 Bloom filters are more compact yes, but they are not as efficient as a hashset BSD 3-Clause License

Copyright (c) 2024, Alex Gaetano Padula All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

  2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

  3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type HashSet

type HashSet struct {
	Buckets  [][]interface{} // Buckets to store elements
	Size     int             // Number of elements in the set
	Capacity int             // Capacity of the set
}

HashSet represents a hash set.

func Deserialize

func Deserialize(data []byte) (*HashSet, error)

Deserialize decodes the byte slice into a HashSet.

func NewHashSet

func NewHashSet() *HashSet

NewHashSet creates a new instance of HashSet.

func (*HashSet) Add

func (h *HashSet) Add(value []byte)

Add inserts a new element into the set.

func (*HashSet) Clear

func (h *HashSet) Clear()

Clear removes all elements from the set.

func (*HashSet) Contains

func (h *HashSet) Contains(value []byte) bool

Contains checks if an element is in the set.

func (*HashSet) Remove

func (h *HashSet) Remove(value []byte)

Remove deletes an element from the set.

func (*HashSet) Serialize

func (h *HashSet) Serialize() ([]byte, error)

Serialize encodes the HashSet into a byte slice.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL