compact

Documentation

Index

• type Storage
  • func New(buffer storage.Storage, dest storage.Appender, merger storage.Merger, ...) *Storage
  • func (s *Storage) Append(key key.Key, value []byte, ttl time.Duration) error
  • func (s *Storage) Close() error
  • func (s *Storage) Compact(ctx context.Context) (interface{}, error)
  • func (s *Storage) Delete(keys ...key.Key) error
  • func (s *Storage) Range(seek, until key.Key, f func(key, value []byte) bool) error

Types

type Storage

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

Storage represents compactor storage.

func New

func New(buffer storage.Storage, dest storage.Appender, merger storage.Merger, monitor monitor.Monitor, interval time.Duration) *Storage

New creates a new storage implementation.

func (*Storage) Append

func (s *Storage) Append(key key.Key, value []byte, ttl time.Duration) error

Append adds an event into the buffer.

func (*Storage) Close

func (s *Storage) Close() error

Close is used to gracefully close storage.

func (*Storage) Compact

func (s *Storage) Compact(ctx context.Context) (interface{}, error)

Compact runs the compaction on the storage

func (*Storage) Delete

func (s *Storage) Delete(keys ...key.Key) error

Delete deletes a key from the buffer.

func (*Storage) Range

func (s *Storage) Range(seek, until key.Key, f func(key, value []byte) bool) error

Range performs a range query against the storage. It calls f sequentially for each key and value present in the store. If f returns false, range stops the iteration. The API is designed to be very similar to the concurrent map. The implementation must guarantee that the keys are lexigraphically sorted.