X-Git-Url: https://git.giacomolli.uk/onechat/blobdiff_plain/000ae97acb21a1c0c90e9278177a74411ba6eab2..e86df5fad9aa2f280aad845adeefd239b0e944ae:/tree_test.go diff --git a/tree_test.go b/tree_test.go index f2cec17..37ecc94 100644 --- a/tree_test.go +++ b/tree_test.go @@ -61,6 +61,36 @@ func TestTreeBuildsEachNodeOnce(t *testing.T) { require.Equal(t, "user: a", treeReadNode(t, tree, 0, 0).Text) } +func TestTreeMissingNodeHasNoErrorAfterWrapping(t *testing.T) { + tree, err := openTree(t.Context(), t.TempDir(), 0, newTestClock().Now) + require.NoError(t, err) + + t.Cleanup(func() { + require.NoError(t, tree.Close()) + }) + + _, built, err := tree.Node(0, 0) + require.NoError(t, err) + require.False(t, built) +} + +func TestTreeReadFailureKeepsItsCause(t *testing.T) { + tree, err := openTree(t.Context(), t.TempDir(), 1, newTestClock().Now) + require.NoError(t, err) + t.Cleanup(func() { + require.NoError(t, tree.Close()) + }) + + require.NoError(t, tree.Add(treeTestNode(0, 0, "user: a"))) + require.NoError(t, tree.levels[0].Close()) + + _, built, err := tree.Node(0, 0) + delete(tree.levels, 0) + require.ErrorIs(t, err, os.ErrClosed) + require.False(t, built) + require.ErrorContains(t, err, "find node position") +} + func TestTreeReopenLoadsTheSameNodes(t *testing.T) { root := t.TempDir() clock := newTestClock() @@ -72,6 +102,7 @@ func TestTreeReopenLoadsTheSameNodes(t *testing.T) { treeTestNode(0, 0, "user: a"), treeTestNode(1, 0, "user: a\nreply: b"), } + for _, node := range nodes { require.NoError(t, tree.Add(node)) } @@ -90,6 +121,7 @@ func TestTreeReopenLoadsTheSameNodes(t *testing.T) { }() require.Equal(t, len(nodes), tree.Count()) + for _, node := range nodes { require.Equal(t, node, treeReadNode(t, tree, node.Level, node.Index)) } @@ -106,6 +138,7 @@ func TestTreeBuildsAMissingIndexAgain(t *testing.T) { treeTestNode(0, 0, "user: a"), treeTestNode(1, 0, "user: a\nreply: b"), } + for _, node := range nodes { require.NoError(t, tree.Add(node)) } @@ -125,6 +158,7 @@ func TestTreeBuildsAMissingIndexAgain(t *testing.T) { }() require.Equal(t, len(nodes), tree.Count()) + for _, node := range nodes { require.Equal(t, node, treeReadNode(t, tree, node.Level, node.Index)) }