mem

Documentation

Overview

Package mem contains an in-memory storage implementation of storage.Data. This is great for unit tests and demos. Our implementation uses a left-leaning red black tree for storage of entries by birthdays and maps for all other indexes. Filtering is done by searching all indexes for matches by each filter and if all matches succeed we stream the entry found.

Index

• type Data
  • func New() *Data
  • func (d *Data) AddPets(ctx context.Context, pets []*pb.Pet) error
  • func (d *Data) DeletePets(ctx context.Context, ids []string) error
  • func (d *Data) SearchPets(ctx context.Context, filter *pb.SearchPetsReq) chan storage.SearchItem
  • func (d *Data) UpdatePets(ctx context.Context, pets []*pb.Pet) error

Types

type Data

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

Data implements storage.Data.

func New

func New() *Data

New is the constructor for Data.

func (*Data) AddPets

func (d *Data) AddPets(ctx context.Context, pets []*pb.Pet) error

AddPets implements storage.Data.AddPets().

func (*Data) DeletePets

func (d *Data) DeletePets(ctx context.Context, ids []string) error

DeletePets implements stroage.Data.DeletePets().

func (*Data) SearchPets

func (d *Data) SearchPets(ctx context.Context, filter *pb.SearchPetsReq) chan storage.SearchItem

SearchPets implements storage.Data.SearchPets().

func (*Data) UpdatePets

func (d *Data) UpdatePets(ctx context.Context, pets []*pb.Pet) error

UpdatePets implements storage.Data.AddPets().