152 lines
3.2 KiB
Go
152 lines
3.2 KiB
Go
package slicestore
|
|
|
|
import (
|
|
"bytes"
|
|
"cmp"
|
|
"fmt"
|
|
"iter"
|
|
"sync"
|
|
|
|
"fiatjaf.com/nostr"
|
|
"fiatjaf.com/nostr/eventstore"
|
|
"fiatjaf.com/nostr/eventstore/internal"
|
|
"golang.org/x/exp/slices"
|
|
)
|
|
|
|
var _ eventstore.Store = (*SliceStore)(nil)
|
|
|
|
type SliceStore struct {
|
|
sync.Mutex
|
|
internal []nostr.Event
|
|
|
|
MaxLimit int
|
|
}
|
|
|
|
func (b *SliceStore) Init() error {
|
|
b.internal = make([]nostr.Event, 0, 5000)
|
|
if b.MaxLimit == 0 {
|
|
b.MaxLimit = 500
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (b *SliceStore) Close() {}
|
|
|
|
func (b *SliceStore) QueryEvents(filter nostr.Filter) iter.Seq[nostr.Event] {
|
|
return func(yield func(nostr.Event) bool) {
|
|
if filter.Limit > b.MaxLimit || (filter.Limit == 0 && !filter.LimitZero) {
|
|
filter.Limit = b.MaxLimit
|
|
}
|
|
|
|
// efficiently determine where to start and end
|
|
start := 0
|
|
end := len(b.internal)
|
|
if filter.Until != nil {
|
|
start, _ = slices.BinarySearchFunc(b.internal, *filter.Until, eventTimestampComparator)
|
|
}
|
|
if filter.Since != nil {
|
|
end, _ = slices.BinarySearchFunc(b.internal, *filter.Since, eventTimestampComparator)
|
|
}
|
|
|
|
// ham
|
|
if end < start {
|
|
return
|
|
}
|
|
|
|
count := 0
|
|
for _, event := range b.internal[start:end] {
|
|
if count == filter.Limit {
|
|
break
|
|
}
|
|
|
|
if filter.Matches(event) {
|
|
if !yield(event) {
|
|
return
|
|
}
|
|
count++
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func (b *SliceStore) CountEvents(filter nostr.Filter) (int64, error) {
|
|
var val int64
|
|
for _, event := range b.internal {
|
|
if filter.Matches(event) {
|
|
val++
|
|
}
|
|
}
|
|
return val, nil
|
|
}
|
|
|
|
func (b *SliceStore) SaveEvent(evt nostr.Event) error {
|
|
idx, found := slices.BinarySearchFunc(b.internal, evt, eventComparator)
|
|
if found {
|
|
return eventstore.ErrDupEvent
|
|
}
|
|
// let's insert at the correct place in the array
|
|
b.internal = append(b.internal, evt) // bogus
|
|
copy(b.internal[idx+1:], b.internal[idx:])
|
|
b.internal[idx] = evt
|
|
|
|
return nil
|
|
}
|
|
|
|
func (b *SliceStore) DeleteEvent(id nostr.ID) error {
|
|
idx, found := slices.BinarySearchFunc(b.internal, id, eventIDComparator)
|
|
if !found {
|
|
// we don't have this event
|
|
return nil
|
|
}
|
|
|
|
// we have it
|
|
copy(b.internal[idx:], b.internal[idx+1:])
|
|
b.internal = b.internal[0 : len(b.internal)-1]
|
|
return nil
|
|
}
|
|
|
|
func (b *SliceStore) ReplaceEvent(evt nostr.Event) error {
|
|
b.Lock()
|
|
defer b.Unlock()
|
|
|
|
filter := nostr.Filter{Limit: 1, Kinds: []uint16{evt.Kind}, Authors: []nostr.PubKey{evt.PubKey}}
|
|
if nostr.IsAddressableKind(evt.Kind) {
|
|
filter.Tags = nostr.TagMap{"d": []string{evt.Tags.GetD()}}
|
|
}
|
|
|
|
shouldStore := true
|
|
for previous := range b.QueryEvents(filter) {
|
|
if internal.IsOlder(previous, evt) {
|
|
if err := b.DeleteEvent(previous.ID); err != nil {
|
|
return fmt.Errorf("failed to delete event for replacing: %w", err)
|
|
}
|
|
} else {
|
|
shouldStore = false
|
|
}
|
|
}
|
|
|
|
if shouldStore {
|
|
if err := b.SaveEvent(evt); err != nil && err != eventstore.ErrDupEvent {
|
|
return fmt.Errorf("failed to save: %w", err)
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func eventTimestampComparator(e nostr.Event, t nostr.Timestamp) int {
|
|
return int(t) - int(e.CreatedAt)
|
|
}
|
|
|
|
func eventIDComparator(e nostr.Event, i nostr.ID) int {
|
|
return bytes.Compare(i[:], e.ID[:])
|
|
}
|
|
|
|
func eventComparator(a nostr.Event, b nostr.Event) int {
|
|
c := cmp.Compare(b.CreatedAt, a.CreatedAt)
|
|
if c != 0 {
|
|
return c
|
|
}
|
|
return bytes.Compare(b.ID[:], a.ID[:])
|
|
}
|