dimension

Documentation

Index

• type Dimension
  • func Deserialize(r io.Reader) (*Dimension, error)
  • func FromBytes(p []byte) (*Dimension, error)
  • func New() *Dimension
  • func (s *Dimension) Bytes() ([]byte, error)
  • func (d *Dimension) Delete(key Key)
  • func (d *Dimension) Insert(key Key)
  • func (s *Dimension) Serialize(w io.Writer) error
• type Key
  • func AndNot(a, b *Dimension) []Key
  • func Intersection(input ...*Dimension) []Key
  • func Union(input ...*Dimension) []Key

Types

type Dimension

type Dimension struct {

	// keys are sorted
	Keys []Key
	// contains filtered or unexported fields
}

func Deserialize

func Deserialize(r io.Reader) (*Dimension, error)

func FromBytes

func FromBytes(p []byte) (*Dimension, error)

func New

func New() *Dimension

func (*Dimension) Bytes

func (s *Dimension) Bytes() ([]byte, error)

func (*Dimension) Delete

func (d *Dimension) Delete(key Key)

func (*Dimension) Insert

func (d *Dimension) Insert(key Key)

func (*Dimension) Serialize

func (s *Dimension) Serialize(w io.Writer) error

type Key

type Key []byte

func AndNot

func AndNot(a, b *Dimension) []Key

TODO: rework

func Intersection

func Intersection(input ...*Dimension) []Key

finds keys that are present in all dimensions

func Union

func Union(input ...*Dimension) []Key

TODO: we need to take advantage of the fact that these are sorted arrays Current implementation might be taking too much memory