* A little code cleanup

Author: RobThree

KdTreeLib/HyperRect.cs

@@ -32,12 +32,13 @@ public T[] MaxPoint
 
 		public static HyperRect<T> Infinite(int dimensions, ITypeMath<T> math)
 		{
-			var rect = new HyperRect<T>();
+            var rect = new HyperRect<T>
+            {
+                MinPoint = new T[dimensions],
+                MaxPoint = new T[dimensions]
+            };
 
-			rect.MinPoint = new T[dimensions];
-			rect.MaxPoint = new T[dimensions];
-
-			for (var dimension = 0; dimension < dimensions; dimension++)
+            for (var dimension = 0; dimension < dimensions; dimension++)
 			{
 				rect.MinPoint[dimension] = math.NegativeInfinity;
 				rect.MaxPoint[dimension] = math.PositiveInfinity;
@@ -70,10 +71,12 @@ public T[] GetClosestPoint(T[] toPoint, ITypeMath<T> math)
 
 		public HyperRect<T> Clone()
 		{
-			var rect = new HyperRect<T>();
-			rect.MinPoint = MinPoint;
-			rect.MaxPoint = MaxPoint;
-			return rect;
+            var rect = new HyperRect<T>
+            {
+                MinPoint = MinPoint,
+                MaxPoint = MaxPoint
+            };
+            return rect;
 		}
 	}
 }

KdTreeLib/KdTree.cs

@@ -396,12 +396,11 @@ public bool TryFindValueAt(TKey[] point, out TValue value)
 
 		public TValue FindValueAt(TKey[] point)
 		{
-			TValue value;
-			if (TryFindValueAt(point, out value))
-				return value;
-			else
-				return default(TValue);
-		}
+            if (TryFindValueAt(point, out TValue value))
+                return value;
+            else
+                return default(TValue);
+        }
 
 		public bool TryFindValue(TValue value, out TKey[] point)
 		{
@@ -443,12 +442,11 @@ public bool TryFindValue(TValue value, out TKey[] point)
 
 		public TKey[] FindValue(TValue value)
 		{
-			TKey[] point;
-			if (TryFindValue(value, out point))
-				return point;
-			else
-				return null;
-		}
+            if (TryFindValue(value, out TKey[] point))
+                return point;
+            else
+                return null;
+        }
 
 		private void AddNodeToStringBuilder(KdTreeNode<TKey, TValue> node, StringBuilder sb, int depth)
 		{
@@ -598,21 +596,21 @@ public IEnumerator<KdTreeNode<TKey, TValue>> GetEnumerator()
             var left = new Stack<KdTreeNode<TKey, TValue>>();
             var right = new Stack<KdTreeNode<TKey, TValue>>();
 
-            Action<KdTreeNode<TKey, TValue>> addLeft = node =>
+            void addLeft(KdTreeNode<TKey, TValue> node)
             {
                 if (node.LeftChild != null)
                 {
                     left.Push(node.LeftChild);
                 }
-            };
+            }
 
-            Action<KdTreeNode<TKey, TValue>> addRight = node =>
+            void addRight(KdTreeNode<TKey, TValue> node)
             {
                 if (node.RightChild != null)
                 {
                     right.Push(node.RightChild);
                 }
-            };
+            }
 
             if (root != null)
             {