Function TestSplitLength

posting/list_test.go:1707–1744

(t *testing.T)

}

func TestSplitLength(t *testing.T) {
	defer setMaxListSize(maxListSize)
	maxListSize = mb / 2

	// Create a list that should be split recursively.
	size := uint64(1e5)
	key := x.DataKey(x.AttrInRootNamespace(uuid.New().String()), 1333)
	ol, err := readPostingListFromDisk(key, ps, math.MaxUint64)
	require.NoError(t, err)
	commits := 0
	for i := uint64(1); i <= size; i++ {
		commits++
		edge := &pb.DirectedEdge{
			ValueId: i,
		}
		edge.Facets = []*api.Facet{{Key: fmt.Sprintf("%d", i)}}

		txn := Txn{StartTs: i}
		addMutationHelper(t, ol, edge, Set, &txn)
		require.NoError(t, ol.commitMutation(i, i+1))

		// Do not roll-up the list here to ensure the final list should
		// be split more than once.
	}

	// Rollup the list. The final output should have more than two parts.
	kvs, err := ol.Rollup(nil, math.MaxUint64)
	require.NoError(t, err)
	require.NoError(t, writePostingListToDisk(kvs))
	ol, err = readPostingListFromDisk(key, ps, math.MaxUint64)
	require.NoError(t, err)
	require.True(t, len(ol.plist.Splits) > 2)

	ol.RLock()
	require.Equal(t, int(size), ol.GetLength(size+10))
	ol.RUnlock()

}

func TestRecursiveSplits(t *testing.T) {
	// For testing, set the max list size to a lower threshold.