# HG changeset patch
# User Kazuma
# Date 1467564884 -32400
# Node ID 224f0f8b4f40062ad9bdc38f4bed062baeb8c233
# Parent  a3af05a061b443adeed3466f74e7d0b4998fb0b1
List delete test write.

diff -r a3af05a061b4 -r 224f0f8b4f40 src/main/csharp/jp.ac.u-ryukyu.ie.cr/jungle/data/treemap/TreeMap.cs
--- a/src/main/csharp/jp.ac.u-ryukyu.ie.cr/jungle/data/treemap/TreeMap.cs	Fri Jul 01 19:28:57 2016 +0900
+++ b/src/main/csharp/jp.ac.u-ryukyu.ie.cr/jungle/data/treemap/TreeMap.cs	Mon Jul 04 01:54:44 2016 +0900
@@ -19,7 +19,6 @@
 
 	public TreeMap(TreeMapNode<K, V> root) {
 		this.root = root;
-		//this.comparator = comparator;
 	}
 
 	public TreeMap(TreeMapNode<K, V> root, Comparer<K> comparator) {
diff -r a3af05a061b4 -r 224f0f8b4f40 src/main/csharp/jp.ac.u-ryukyu.ie.cr/jungle/data/treemap/TreeMapNode.cs
--- a/src/main/csharp/jp.ac.u-ryukyu.ie.cr/jungle/data/treemap/TreeMapNode.cs	Fri Jul 01 19:28:57 2016 +0900
+++ b/src/main/csharp/jp.ac.u-ryukyu.ie.cr/jungle/data/treemap/TreeMapNode.cs	Mon Jul 04 01:54:44 2016 +0900
@@ -9,6 +9,7 @@
 
 	protected  K key = default(K);
 	protected  V value = default(V);
+
 	public TreeMapNode<K,V> right;
 	public TreeMapNode<K,V> left;
 
@@ -35,12 +36,10 @@
 		
 
 	public int compare(K compareKey, Comparer<K> ctr)  {
-		int val = (int) ctr.Compare (compareKey, this.getKey ());
-		return val;
+		return ctr.Compare (compareKey, this.getKey ());
 	}
     
-	public V get (K key, Comparer<K> ctr)
- 	{
+	public V get (K key, Comparer<K> ctr){
  		TreeMapNode<K,V> cur = this;
 		while (cur.isNotEmpty ()) { // getでEmpty nodeを返している ? compareでKeyが０になっている
 			int result = cur.compare (key, ctr);
@@ -71,7 +70,6 @@
 		return value;
 	}
 
-	// may be to use Comparer??
 	public TreeMapNode<K,V> put (K k, V v,Comparer<K> ctr) {
 
 		if (!isNotEmpty ()) {