package alice.jungle.core;

import java.util.Iterator;
import java.util.concurrent.ConcurrentHashMap;

import alice.jungle.transaction.NetworkDefaultJungleTree;

import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.persistent.ChangeList;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.persistent.Journal;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.persistent.NullJournal;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.ChangeSet;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.TreeEditor;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.operations.TreeOperation;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultChangeSet;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeContext;
import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode;
import jungle.test.codesegment.persistence.AliceJournal;
import fj.data.List;

public class NetworkDefaultJungle implements Jungle {
	private Journal journal;
	private ConcurrentHashMap<String,JungleTree> trees;
	private String uuid;
	private TreeEditor editor;
	
	public NetworkDefaultJungle(Journal _journal,String _uuid,TreeEditor _editor)
	{
//		journal = new AliceJournal();
		journal = new NullJournal();		
		trees = new ConcurrentHashMap<String,JungleTree>();
		uuid = _uuid;
		editor = _editor;
	}

	@Override
	public JungleTree getTreeByName(String _name)
	{
		return trees.get(_name);
	}

	@Override
	public JungleTree createNewTree(String _name)
	{
		ChangeList list = new ChangeList(){
			@Override
			public Iterator<TreeOperation> iterator() {
				List<TreeOperation> nil = List.nil();
				return nil.iterator();
			}
		};
		DefaultTreeNode root = new DefaultTreeNode();
		ChangeSet set = new DefaultChangeSet(root.getAsNode(),null,list,uuid,0);
		DefaultTreeContext<DefaultTreeNode> tc = new DefaultTreeContext<DefaultTreeNode>(root,set);
		JungleTree newTree = new NetworkDefaultJungleTree<DefaultTreeNode>(tc,uuid,journal.getWriter(),editor);
		if(trees.putIfAbsent(_name,newTree) != null){
			return null;
		}
		return newTree;
	}
}