private case

Author: justcoding121

src/Advanced.Algorithms/Binary/BaseConversion.cs

@@ -28,7 +28,7 @@ public static string Convert(string srcNumber,
                 var fraction = tmp[1].TrimStart();
 
                 return convertWhole(whole, srcBaseChars, dstBaseChars) +
-                   "." + ConvertFraction(fraction, srcBaseChars, dstBaseChars, precision);
+                   "." + convertFraction(fraction, srcBaseChars, dstBaseChars, precision);
             }
 
             return convertWhole(srcNumber, srcBaseChars, dstBaseChars);
@@ -86,7 +86,7 @@ private static string convertWhole(string srcNumber,
         /// <summary>
         /// Converts the fractional part of source number.
         /// </summary>
-        private static string ConvertFraction(string srcNumber,
+        private static string convertFraction(string srcNumber,
            string srcBaseChars,
            string dstBaseChars, int maxPrecision)
         {

src/Advanced.Algorithms/DataStructures/Heap/FibonacciHeap.cs

@@ -74,7 +74,7 @@ public T Extract()
             deleteNode(ref heapForestHead, minMaxNode);
 
             mergeForests(minMaxNode.ChildrenHead);
-            Meld();
+            meld();
 
             Count--;
 
@@ -167,7 +167,7 @@ public T Peek()
         /// <summary>
         /// Merge roots with same degrees in Forest.
         /// </summary>
-        private void Meld()
+        private void meld()
         {
 
             if (heapForestHead == null)

src/Advanced.Algorithms/DataStructures/Heap/d-aryHeap.cs

@@ -66,7 +66,7 @@ private void bulkInit(T[] initial)
 
             while (i >= 0)
             {
-                BulkInitRecursive(i, initial);
+                bulkInitRecursive(i, initial);
                 i--;
             }
 
@@ -76,7 +76,7 @@ private void bulkInit(T[] initial)
         /// <summary>
         /// Recursively load bulk init values.
         /// </summary>
-        private void BulkInitRecursive(int i, T[] initial)
+        private void bulkInitRecursive(int i, T[] initial)
         {
             while (true)
             {

src/Advanced.Algorithms/DataStructures/Set/DisJointSet.cs

@@ -54,7 +54,7 @@ public T FindSet(T member)
                 throw new Exception("No such set with given member.");
             }
 
-            return FindSet(set[member]).Data;
+            return findSet(set[member]).Data;
         }
 
         /// <summary>
@@ -63,14 +63,14 @@ public T FindSet(T member)
         /// Does path Compression on all visited members on way to root
         /// by pointing their parent to Root.
         /// </summary>
-        private DisJointSetNode<T> FindSet(DisJointSetNode<T> node)
+        private DisJointSetNode<T> findSet(DisJointSetNode<T> node)
         {
             var parent = node.Parent;
 
             if(node !=parent)
             {
                 //compress path by setting parent to Root
-                node.Parent = FindSet(node.Parent);
+                node.Parent = findSet(node.Parent);
                 return node.Parent;
             }
 

src/Advanced.Algorithms/DataStructures/Tree/BinaryTree.cs

@@ -33,7 +33,7 @@ public bool HasItem(T value)
         /// </summary>
         public int GetHeight()
         {
-            return GetHeight(root);
+            return getHeight(root);
         }
 
         /// <summary>
@@ -175,14 +175,14 @@ public IEnumerable<T> Children(T value)
             return null;
         }
 
-        private int GetHeight(BinaryTreeNode<T> node)
+        private int getHeight(BinaryTreeNode<T> node)
         {
             if (node == null)
             {
                 return -1;
             }
 
-            return Math.Max(GetHeight(node.Left), GetHeight(node.Right)) + 1;
+            return Math.Max(getHeight(node.Left), getHeight(node.Right)) + 1;
         }
 
         private BinaryTreeNode<T> find(T value)

src/Advanced.Algorithms/DataStructures/Tree/IntervalTree.cs

@@ -94,7 +94,7 @@ public void Delete(T[] start, T[] end)
                 allOverlaps.Add(overlap.NextDimensionIntervals);
             }
 
-            DeleteOverlaps(allOverlaps, start, end, 1);
+            deleteOverlaps(allOverlaps, start, end, 1);
             tree.Delete(new OneDimentionalInterval<T>(start[0], end[0], defaultValue));
 
             items.Remove(new Tuple<T[], T[]>(start, end));
@@ -104,7 +104,7 @@ public void Delete(T[] start, T[] end)
         /// <summary>
         /// Recursively delete values from overlaps in next dimension.
         /// </summary>
-        private void DeleteOverlaps(List<OneDimentionalIntervalTree<T>> currentTrees, T[] start, T[] end, int index)
+        private void deleteOverlaps(List<OneDimentionalIntervalTree<T>> currentTrees, T[] start, T[] end, int index)
         {
             //base case
             if (index == start.Length)
@@ -123,7 +123,7 @@ private void DeleteOverlaps(List<OneDimentionalIntervalTree<T>> currentTrees, T[
             }
 
             //dig in to next dimension to 
-            DeleteOverlaps(allOverlaps, start, end, ++index);
+            deleteOverlaps(allOverlaps, start, end, ++index);
 
             index--;
 

src/Advanced.Algorithms/DataStructures/Tree/SplayTree.cs

@@ -45,17 +45,17 @@ public bool HasItem(T value)
         /// </summary>
         internal int GetHeight()
         {
-            return GetHeight(Root);
+            return getHeight(Root);
         }
 
-        private int GetHeight(SplayTreeNode<T> node)
+        private int getHeight(SplayTreeNode<T> node)
         {
             if (node == null)
             {
                 return -1;
             }
 
-            return Math.Max(GetHeight(node.Left), GetHeight(node.Right)) + 1;
+            return Math.Max(getHeight(node.Left), getHeight(node.Right)) + 1;
         }
 
         /// <summary>
@@ -206,7 +206,7 @@ private void delete(SplayTreeNode<T> node, T value)
                     //and then delete the left max node
                     else
                     {
-                        var maxLeftNode = FindMax(node.Left);
+                        var maxLeftNode = findMax(node.Left);
 
                         node.Value = maxLeftNode.Value;
 
@@ -295,10 +295,10 @@ private void deleteLeftNode(SplayTreeNode<T> node)
         /// </summary>
         public T FindMax()
         {
-            return FindMax(Root).Value;
+            return findMax(Root).Value;
         }
 
-        private SplayTreeNode<T> FindMax(SplayTreeNode<T> node)
+        private SplayTreeNode<T> findMax(SplayTreeNode<T> node)
         {
             while (true)
             {

src/Advanced.Algorithms/Graph/Sort/DepthFirstTopSort.cs

@@ -1,5 +1,4 @@
 using Advanced.Algorithms.DataStructures.Graph;
-using Advanced.Algorithms.DataStructures.Graph.AdjacencyList;
 using System.Collections.Generic;
 
 namespace Advanced.Algorithms.Graph