refactor

justcoding121 · justcoding121 · commit ea76220e26d1 · 2018-11-09T12:00:38.000-05:00
diff --git a/src/Advanced.Algorithms/DataStructures/Heap/BHeap.cs b/src/Advanced.Algorithms/DataStructures/Heap/BHeap.cs
@@ -55,7 +55,7 @@ public BHeap(SortDirection sortDirection, IEnumerable<T> initial, IComparer<T> c
                     i++;
                 }
 
-                BulkInit(initArray);
+                bulkInit(initArray);
                 Count = initArray.Length;
             }
             else
@@ -64,7 +64,7 @@ public BHeap(SortDirection sortDirection, IEnumerable<T> initial, IComparer<T> c
             }
         }
 
-        private void BulkInit(T[] initial)
+        private void bulkInit(T[] initial)
         {
             var i = (initial.Length - 1) / 2;
 
@@ -86,7 +86,8 @@ private void bulkInitRecursive(int i, T[] initial)
                 var left = 2 * i + 1;
                 var right = 2 * i + 2;
 
-                var minMax = left < initial.Length && right < initial.Length ? comparer.Compare(initial[left], initial[right]) < 0 ? left : right
+                var minMax = left < initial.Length && right < initial.Length ? 
+                    comparer.Compare(initial[left], initial[right]) < 0 ? left : right
                     : left < initial.Length ? left
                     : right < initial.Length ? right : -1;
 
diff --git a/src/Advanced.Algorithms/DataStructures/Heap/d-aryHeap.cs b/src/Advanced.Algorithms/DataStructures/Heap/d-aryHeap.cs
@@ -47,7 +47,7 @@ public DaryHeap(int k, SortDirection sortDirection = SortDirection.Ascending, IE
                 }
 
                 Count = initArray.Length;
-                BulkInit(initArray);
+                bulkInit(initArray);
               
             }
             else
@@ -60,7 +60,7 @@ public DaryHeap(int k, SortDirection sortDirection = SortDirection.Ascending, IE
         /// Initialize with given input.
         /// Time complexity: O(n).
         /// </summary>
-        private void BulkInit(T[] initial)
+        private void bulkInit(T[] initial)
         {
             var i = (initial.Length - 1) / k;
 

Original file line number	Diff line number	Diff line change
`@@ -55,7 +55,7 @@ public BHeap(SortDirection sortDirection, IEnumerable<T> initial, IComparer<T> c`
`55`	`55`	`i++;`
`56`	`56`	`}`
`57`	`57`
`58`		`- BulkInit(initArray);`
	`58`	`+ bulkInit(initArray);`
`59`	`59`	`Count = initArray.Length;`
`60`	`60`	`}`
`61`	`61`	`else`
`@@ -64,7 +64,7 @@ public BHeap(SortDirection sortDirection, IEnumerable<T> initial, IComparer<T> c`
`64`	`64`	`}`
`65`	`65`	`}`
`66`	`66`
`67`		`- private void BulkInit(T[] initial)`
	`67`	`+ private void bulkInit(T[] initial)`
`68`	`68`	`{`
`69`	`69`	`var i = (initial.Length - 1) / 2;`
`70`	`70`
`@@ -86,7 +86,8 @@ private void bulkInitRecursive(int i, T[] initial)`
`86`	`86`	`var left = 2 * i + 1;`
`87`	`87`	`var right = 2 * i + 2;`
`88`	`88`
`89`		`- var minMax = left < initial.Length && right < initial.Length ? comparer.Compare(initial[left], initial[right]) < 0 ? left : right`
	`89`	`+ var minMax = left < initial.Length && right < initial.Length ?`
	`90`	`+ comparer.Compare(initial[left], initial[right]) < 0 ? left : right`
`90`	`91`	`: left < initial.Length ? left`
`91`	`92`	`: right < initial.Length ? right : -1;`
`92`	`93`
Original file line number	Diff line number	Diff line change
`@@ -47,7 +47,7 @@ public DaryHeap(int k, SortDirection sortDirection = SortDirection.Ascending, IE`
`47`	`47`	`}`
`48`	`48`
`49`	`49`	`Count = initArray.Length;`
`50`		`- BulkInit(initArray);`
	`50`	`+ bulkInit(initArray);`
`51`	`51`
`52`	`52`	`}`
`53`	`53`	`else`
`@@ -60,7 +60,7 @@ public DaryHeap(int k, SortDirection sortDirection = SortDirection.Ascending, IE`
`60`	`60`	`/// Initialize with given input.`
`61`	`61`	`/// Time complexity: O(n).`
`62`	`62`	`/// </summary>`
`63`		`- private void BulkInit(T[] initial)`
	`63`	`+ private void bulkInit(T[] initial)`
`64`	`64`	`{`
`65`	`65`	`var i = (initial.Length - 1) / k;`
`66`	`66`