33e59a3836
The decoder basically works, though there's some quirks in the design I'll need to marinate one. For example, you can't have a tuple as an edge value. This is probably fine? Stringification of Graphs was added to aid in debugging the decoder, the format it outputs is not the final one. Most likely the (future) encoder will be used for that purpose. The decoder is not implemented in the nicest way; it fully reads in the LexerTokens first, and then processes. This made trying to wrap my head around the problem a lot easier because it left fewer failure cases, but it's not the most efficient thing to do. Now that v0 is done it's pretty plain to see that the decoder could work by only reading in the next N tokens that it needs at a time. But that will be left for a future version.
113 lines
2.8 KiB
Go
113 lines
2.8 KiB
Go
package gg
|
|
|
|
import (
|
|
"strconv"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
)
|
|
|
|
func TestEqual(t *testing.T) {
|
|
|
|
i := func(i int64) Value {
|
|
return Value{Number: &i}
|
|
}
|
|
|
|
n := func(n string) Value {
|
|
return Value{Name: &n}
|
|
}
|
|
|
|
tests := []struct {
|
|
a, b *Graph
|
|
exp bool
|
|
}{
|
|
{
|
|
a: ZeroGraph,
|
|
b: ZeroGraph,
|
|
exp: true,
|
|
},
|
|
{
|
|
a: ZeroGraph,
|
|
b: ZeroGraph.AddValueIn(ValueOut(n("in"), n("incr")), n("out")),
|
|
exp: false,
|
|
},
|
|
{
|
|
a: ZeroGraph.AddValueIn(ValueOut(n("in"), n("incr")), n("out")),
|
|
b: ZeroGraph.AddValueIn(ValueOut(n("in"), n("incr")), n("out")),
|
|
exp: true,
|
|
},
|
|
{
|
|
a: ZeroGraph.AddValueIn(ValueOut(n("in"), n("incr")), n("out")),
|
|
b: ZeroGraph.AddValueIn(TupleOut([]OpenEdge{
|
|
ValueOut(n("in"), n("ident")),
|
|
ValueOut(i(1), n("ident")),
|
|
}, n("add")), n("out")),
|
|
exp: false,
|
|
},
|
|
{
|
|
// tuples are different order
|
|
a: ZeroGraph.AddValueIn(TupleOut([]OpenEdge{
|
|
ValueOut(i(1), n("ident")),
|
|
ValueOut(n("in"), n("ident")),
|
|
}, n("add")), n("out")),
|
|
b: ZeroGraph.AddValueIn(TupleOut([]OpenEdge{
|
|
ValueOut(n("in"), n("ident")),
|
|
ValueOut(i(1), n("ident")),
|
|
}, n("add")), n("out")),
|
|
exp: false,
|
|
},
|
|
{
|
|
// tuple with no edge value and just a single input edge should be
|
|
// equivalent to just that edge.
|
|
a: ZeroGraph.AddValueIn(TupleOut([]OpenEdge{
|
|
ValueOut(i(1), n("ident")),
|
|
}, Value{}), n("out")),
|
|
b: ZeroGraph.AddValueIn(ValueOut(i(1), n("ident")), n("out")),
|
|
exp: true,
|
|
},
|
|
{
|
|
// tuple with an edge value and just a single input edge that has no
|
|
// edgeVal should be equivalent to just that edge with the tuple's
|
|
// edge value.
|
|
a: ZeroGraph.AddValueIn(TupleOut([]OpenEdge{
|
|
ValueOut(i(1), Value{}),
|
|
}, n("ident")), n("out")),
|
|
b: ZeroGraph.AddValueIn(ValueOut(i(1), n("ident")), n("out")),
|
|
exp: true,
|
|
},
|
|
{
|
|
a: ZeroGraph.
|
|
AddValueIn(ValueOut(n("in"), n("incr")), n("out")).
|
|
AddValueIn(ValueOut(n("in2"), n("incr2")), n("out2")),
|
|
b: ZeroGraph.
|
|
AddValueIn(ValueOut(n("in"), n("incr")), n("out")),
|
|
exp: false,
|
|
},
|
|
{
|
|
a: ZeroGraph.
|
|
AddValueIn(ValueOut(n("in"), n("incr")), n("out")).
|
|
AddValueIn(ValueOut(n("in2"), n("incr2")), n("out2")),
|
|
b: ZeroGraph.
|
|
AddValueIn(ValueOut(n("in"), n("incr")), n("out")).
|
|
AddValueIn(ValueOut(n("in2"), n("incr2")), n("out2")),
|
|
exp: true,
|
|
},
|
|
{
|
|
// order of value ins shouldn't matter
|
|
a: ZeroGraph.
|
|
AddValueIn(ValueOut(n("in"), n("incr")), n("out")).
|
|
AddValueIn(ValueOut(n("in2"), n("incr2")), n("out2")),
|
|
b: ZeroGraph.
|
|
AddValueIn(ValueOut(n("in2"), n("incr2")), n("out2")).
|
|
AddValueIn(ValueOut(n("in"), n("incr")), n("out")),
|
|
exp: true,
|
|
},
|
|
}
|
|
|
|
for i, test := range tests {
|
|
t.Run(strconv.Itoa(i), func(t *testing.T) {
|
|
assert.Equal(t, test.exp, Equal(test.a, test.b))
|
|
})
|
|
}
|
|
}
|