package jp.ac.u_ryukyu.ie.cr.jungle.traverse;

import jp.ac.u_ryukyu.ie.cr.jungle.DefaultJungle;
import jp.ac.u_ryukyu.ie.cr.jungle.Jungle;
import jp.ac.u_ryukyu.ie.cr.jungle.persistent.NullJournal;
import jp.ac.u_ryukyu.ie.cr.jungle.query.traverser.InterfaceTraverser;
import jp.ac.u_ryukyu.ie.cr.jungle.store.nodepath.NodePath;
import jp.ac.u_ryukyu.ie.cr.jungle.store.nodepath.RedBlackTreeNodePath;
import jp.ac.u_ryukyu.ie.cr.jungle.transaction.editor.jungleTreeEditor.JungleTreeEditor;
import jp.ac.u_ryukyu.ie.cr.jungle.transaction.node.TreeNode;
import jp.ac.u_ryukyu.ie.cr.jungle.tree.JungleTree;
import jp.ac.u_ryukyu.ie.cr.jungle.util.Either;
import jp.ac.u_ryukyu.ie.cr.jungle.util.jungleError.Error;
import junit.framework.Assert;
import org.junit.Test;

import java.nio.ByteBuffer;
import java.util.Iterator;

public class RedBlackInterfaceTraverserTest {
    private String balanceKey = "key";

    @Test
    public void RedBlackInterfaceTraverserTests() {
        Jungle jungle = new DefaultJungle(new NullJournal(), "hoge");
        jungle.createNewRedBlackTree("RedBlackTree", balanceKey);
        JungleTree tree = jungle.getTreeByName("RedBlackTree");
        JungleTreeEditor editor = tree.getJungleTreeEditor();
        NodePath path = new RedBlackTreeNodePath();
        for (int nodeCount = 0; nodeCount < 100; nodeCount++) {
            ByteBuffer value = ByteBuffer.wrap(("value" + nodeCount).getBytes());
            Either<Error,JungleTreeEditor> either = editor.addNewChildAndPutAttribute(path, 0, balanceKey, value);
            Assert.assertFalse(either.isA());
            editor = either.b();
        }
        Either<Error,JungleTreeEditor> either = editor.success();
        Assert.assertFalse(either.isA());
        InterfaceTraverser traverser = tree.getTraverser(true);
        Iterator<TreeNode> iterator = traverser.find((TreeNode node) -> {
            return true;
        },balanceKey,"value5");
        Assert.assertTrue(iterator.hasNext());
    }
}