fix: fix wrong heaps package and close TheAlgorithms#700

yanglbme · yanglbme · commit 46bbfaa0e811 · 2019-02-07T00:11:13.000+08:00
- Fix TheAlgorithms#700
diff --git a/DataStructures/Heaps/EmptyHeapException.java b/DataStructures/Heaps/EmptyHeapException.java
@@ -1,7 +1,7 @@
 /**
  *
  */
-package Heaps;
+package DataStructures.Heaps;
 
 /**
  * @author Nicolas Renard
diff --git a/DataStructures/Heaps/Heap.java b/DataStructures/Heaps/Heap.java
@@ -1,4 +1,4 @@
-package Heaps;
+package DataStructures.Heaps;
 
 /**
  * Interface common to heap data structures.<br>
diff --git a/DataStructures/Heaps/HeapElement.java b/DataStructures/Heaps/HeapElement.java
@@ -1,7 +1,7 @@
 /**
  *
  */
-package Heaps;
+package DataStructures.Heaps;
 
 import java.lang.Double;
 import java.lang.Object;
diff --git a/DataStructures/Heaps/MaxHeap.java b/DataStructures/Heaps/MaxHeap.java
@@ -1,4 +1,4 @@
-package Heaps;
+package DataStructures.Heaps;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/DataStructures/Heaps/MinHeap.java b/DataStructures/Heaps/MinHeap.java
@@ -1,7 +1,7 @@
 /**
  *
  */
-package Heaps;
+package DataStructures.Heaps;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/DataStructures/Heaps/MinPriorityQueue.java b/DataStructures/Heaps/MinPriorityQueue.java
@@ -1,4 +1,4 @@
-package Heaps;
+package DataStructures.Heaps;
 /* Minimum Priority Queue
  * It is a part of heap data structure
  * A heap is a specific tree based data structure

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`/**`
`2`	`2`	`*`
`3`	`3`	`*/`
`4`		`-package Heaps;`
	`4`	`+package DataStructures.Heaps;`
`5`	`5`
`6`	`6`	`/**`
`7`	`7`	`* @author Nicolas Renard`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package Heaps;`
	`1`	`+package DataStructures.Heaps;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* Interface common to heap data structures.<br>`