Jay
e43ed4af55
`graphstore` package owns entire batch merge operation. Added tests for node and rel batching.
116 lines
3.5 KiB
Go
116 lines
3.5 KiB
Go
package graphstore
|
|
|
|
import (
|
|
"git.wisehodl.dev/jay/go-heartwood/graph"
|
|
"github.com/stretchr/testify/assert"
|
|
"testing"
|
|
)
|
|
|
|
func TestNodeBatchKey(t *testing.T) {
|
|
matchLabel := "Event"
|
|
labels := []string{"Event", "AddressableEvent"}
|
|
|
|
// labels should be batched by key generator
|
|
expectedKey := "Event:AddressableEvent,Event"
|
|
|
|
// Test Serialization
|
|
batchKey := createNodeBatchKey(matchLabel, labels)
|
|
assert.Equal(t, expectedKey, batchKey)
|
|
|
|
// Test Deserialization
|
|
returnedMatchLabel, returnedLabels, err := deserializeNodeBatchKey(batchKey)
|
|
assert.NoError(t, err)
|
|
assert.Equal(t, matchLabel, returnedMatchLabel)
|
|
assert.ElementsMatch(t, labels, returnedLabels)
|
|
}
|
|
|
|
func TestRelBatchKey(t *testing.T) {
|
|
rtype, startLabel, endLabel := "SIGNED", "User", "Event"
|
|
expectedKey := "SIGNED,User,Event"
|
|
|
|
// Test Serialization
|
|
batchKey := createRelBatchKey(rtype, startLabel, endLabel)
|
|
assert.Equal(t, expectedKey, batchKey)
|
|
|
|
// Test Deserialization
|
|
returnedRtype, returnedStartLabel, returnedEndLabel, err := deserializeRelBatchKey(batchKey)
|
|
assert.NoError(t, err)
|
|
assert.Equal(t, rtype, returnedRtype)
|
|
assert.Equal(t, startLabel, returnedStartLabel)
|
|
assert.Equal(t, endLabel, returnedEndLabel)
|
|
}
|
|
|
|
func TestBatchSubgraphAddNode(t *testing.T) {
|
|
matchKeys := graph.NewSimpleMatchKeys()
|
|
subgraph := NewBatchSubgraph(matchKeys)
|
|
node := graph.NewEventNode("abc123")
|
|
|
|
err := subgraph.AddNode(node)
|
|
|
|
assert.NoError(t, err)
|
|
assert.Equal(t, 1, subgraph.NodeCount())
|
|
assert.Equal(t, []*graph.Node{node}, subgraph.nodes["Event:Event"])
|
|
}
|
|
|
|
func TestBatchSubgraphAddNodeInvalid(t *testing.T) {
|
|
matchKeys := graph.NewSimpleMatchKeys()
|
|
subgraph := NewBatchSubgraph(matchKeys)
|
|
node := graph.NewNode("Event", graph.Properties{})
|
|
|
|
err := subgraph.AddNode(node)
|
|
|
|
assert.ErrorContains(t, err, "invalid node: missing property id")
|
|
assert.Equal(t, 0, subgraph.NodeCount())
|
|
}
|
|
|
|
func TestBatchSubgraphAddRel(t *testing.T) {
|
|
matchKeys := graph.NewSimpleMatchKeys()
|
|
subgraph := NewBatchSubgraph(matchKeys)
|
|
|
|
userNode := graph.NewUserNode("pubkey1")
|
|
eventNode := graph.NewEventNode("abc123")
|
|
rel := graph.NewSignedRel(userNode, eventNode, nil)
|
|
|
|
err := subgraph.AddRel(rel)
|
|
|
|
assert.NoError(t, err)
|
|
assert.Equal(t, 1, subgraph.RelCount())
|
|
assert.Equal(t, []*graph.Relationship{rel}, subgraph.rels["SIGNED,User,Event"])
|
|
}
|
|
|
|
func TestNodeBatches(t *testing.T) {
|
|
matchKeys := graph.NewSimpleMatchKeys()
|
|
subgraph := NewBatchSubgraph(matchKeys)
|
|
node := graph.NewEventNode("abc123")
|
|
subgraph.AddNode(node)
|
|
|
|
batches, err := subgraph.NodeBatches()
|
|
|
|
assert.NoError(t, err)
|
|
assert.Len(t, batches, 1)
|
|
assert.Equal(t, "Event", batches[0].MatchLabel)
|
|
assert.ElementsMatch(t, []string{"Event"}, batches[0].Labels)
|
|
assert.ElementsMatch(t, []string{"id"}, batches[0].MatchKeys)
|
|
assert.Equal(t, []*graph.Node{node}, batches[0].Nodes)
|
|
}
|
|
|
|
func TestRelBatches(t *testing.T) {
|
|
matchKeys := graph.NewSimpleMatchKeys()
|
|
subgraph := NewBatchSubgraph(matchKeys)
|
|
userNode := graph.NewUserNode("pubkey1")
|
|
eventNode := graph.NewEventNode("abc123")
|
|
rel := graph.NewSignedRel(userNode, eventNode, nil)
|
|
subgraph.AddRel(rel)
|
|
|
|
batches, err := subgraph.RelBatches()
|
|
|
|
assert.NoError(t, err)
|
|
assert.Len(t, batches, 1)
|
|
assert.Equal(t, "SIGNED", batches[0].Type)
|
|
assert.Equal(t, "User", batches[0].StartLabel)
|
|
assert.ElementsMatch(t, []string{"pubkey"}, batches[0].StartMatchKeys)
|
|
assert.Equal(t, "Event", batches[0].EndLabel)
|
|
assert.ElementsMatch(t, []string{"id"}, batches[0].EndMatchKeys)
|
|
assert.Equal(t, []*graph.Relationship{rel}, batches[0].Rels)
|
|
}
|