Function TestCompareTypedValues

graph/graphtest/graphtest.go:1061–1116

(t testing.TB, gen testutil.DatabaseFunc, conf *Config)

}

func TestCompareTypedValues(t testing.TB, gen testutil.DatabaseFunc, conf *Config) {
	if conf.UnTyped {
		t.SkipNow()
	}
	qs, opts, closer := gen(t)
	defer closer()

	w := testutil.MakeWriter(t, qs, opts)

	t1 := tzero
	t2 := t1.Add(time.Hour)
	t3 := t2.Add(time.Hour * 48)
	t4 := t1.Add(time.Hour * 24 * 365)

	quads := []quad.Quad{
		{quad.BNode("alice"), quad.BNode("bob"), quad.BNode("charlie"), quad.BNode("dani")},
		{quad.IRI("alice"), quad.IRI("bob"), quad.IRI("charlie"), quad.IRI("dani")},
		{quad.String("alice"), quad.String("bob"), quad.String("charlie"), quad.String("dani")},
		{quad.Int(100), quad.Int(112), quad.Int(110), quad.Int(20)},
		{quad.Time(t1), quad.Time(t2), quad.Time(t3), quad.Time(t4)},
		// test precision as well
		{quad.Int(math.MaxInt64), quad.Int(math.MaxInt64 - 1), quad.Int(math.MinInt64 + 1), quad.Int(math.MinInt64)},
	}

	err := w.AddQuadSet(quads)
	require.NoError(t, err)

	var vals []quad.Value
	for _, q := range quads {
		for _, d := range quad.Directions {
			if v := q.Get(d); v != nil {
				vals = append(vals, v)
			}
		}
	}
	ExpectIteratedValues(t, qs, qs.NodesAllIterator(), vals, true)

	for _, c := range casesCompare {
		//t.Log(c.op, c.val)
		it := iterator.NewComparison(qs.NodesAllIterator(), c.op, c.val, qs)
		ExpectIteratedValues(t, qs, it, c.expect, true)
	}

	for _, c := range casesCompare {
		s := shape.Compare(shape.AllNodes{}, c.op, c.val)
		ns, ok := shape.Optimize(s, qs)
		require.Equal(t, conf.OptimizesComparison, ok)
		if conf.OptimizesComparison {
			require.NotEqual(t, s, ns)
		} else {
			require.Equal(t, s, ns)
		}
		nit := shape.BuildIterator(qs, ns)
		ExpectIteratedValues(t, qs, nit, c.expect, true)
	}
}

func TestNodeDelete(t testing.TB, gen testutil.DatabaseFunc, conf *Config) {