package jp.ac.u_ryukyu.ie.cr.jungle.store.nodepath;


import jp.ac.u_ryukyu.ie.cr.jungle.store.NulIterator;
import jp.ac.u_ryukyu.ie.cr.jungle.util.Pair;

import java.util.Iterator;

public class RedBlackTreeNodePath implements NodePath {

    private final String key;
    private final String value;

    private RedBlackTreeNodePath(String key,String value) {
        this.key = key;
        this.value = value;
    }


    @Override
    public String getKey() {
        return key;
    }

    @Override
    public String getValue() {
        return value;
    }

    //以下使わない
    @Override
    public Iterator<Integer> iterator() {
        return new NulIterator<>();
    }

    @Override
    public int get(int index) {
        return -2;
    }

    @Override
    public NodePath add(int pos) {
        return null;
    }

    @Override
    public NodePath addHead(int pos) {
        return null;
    }

    @Override
    public Pair<Integer, NodePath> pop() {
        return null;
    }

    @Override
    public Pair<Integer, NodePath> last() {
        return null;
    }

    @Override
    public String toString() {
        return key + value ;
    }

    @Override
    public int size() {
        return 0;
    }


    //PATHの一番後ろを取り除いたPATHを新しく作って返す
// EXAMPLE <0,0,3> → <0,0>
    @Override
    public NodePath tail() {
        return null;
    }

}