lmdb/badger: stop sorting tags in-place when creating indexes. it is not necessary and was messing up things.

This commit is contained in:
fiatjaf
2024-01-18 17:55:08 -03:00
parent 35322df272
commit f5d23a3b51
3 changed files with 0 additions and 17 deletions

View File

@@ -86,7 +86,6 @@ func getIndexKeysForEvent(evt *nostr.Event, idx []byte) [][]byte {
}
// ~ by tagvalue+date
slices.SortFunc(evt.Tags, eventstore.TagSorter)
for i, tag := range evt.Tags {
if len(tag) < 2 || len(tag[0]) != 1 || len(tag[1]) == 0 || len(tag[1]) > 100 {
// not indexable

View File

@@ -79,7 +79,6 @@ func (b *LMDBBackend) getIndexKeysForEvent(evt *nostr.Event) []key {
}
// ~ by tagvalue+date
slices.SortFunc(evt.Tags, eventstore.TagSorter)
for i, tag := range evt.Tags {
if len(tag) < 2 || len(tag[0]) != 1 || len(tag[1]) == 0 || len(tag[1]) > 100 {
// not indexable

View File

@@ -4,8 +4,6 @@ import (
"encoding/hex"
"strconv"
"strings"
"github.com/nbd-wtf/go-nostr"
)
func GetAddrTagElements(tagValue string) (kind uint16, pkb []byte, d string) {
@@ -19,16 +17,3 @@ func GetAddrTagElements(tagValue string) (kind uint16, pkb []byte, d string) {
}
return 0, nil, ""
}
func TagSorter(a, b nostr.Tag) int {
if len(a) < 2 {
if len(b) < 2 {
return 0
}
return -1
}
if len(b) < 2 {
return 1
}
return strings.Compare(a[1], b[1])
}