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 ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Data ¶
type Data struct {
// contains filtered or unexported fields
}
Data implements storage.Data.
func (*Data) DeletePets ¶
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().
Source Files
Click to show internal directories.
Click to hide internal directories.