Priority Queues/Java - Revision history

Admin: Replacing charlesreid1.com:3000 with git.charlesreid1.com

2019-10-09T03:44:30Z

Replacing charlesreid1.com:3000 with git.charlesreid1.com

← Older revision		Revision as of 03:44, 9 October 2019
Line 3:		Line 3:
	==My Priority Queue API==		==My Priority Queue API==

	Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com: https://charlesreid1.com~~:3000~~/cs/java/src/master/priority-queues/PriorityQueueBase.java		Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com: https://git.charlesreid1.com/cs/java/src/master/priority-queues/PriorityQueueBase.java

	==Java Collections Priority Queue==		==Java Collections Priority Queue==
Line 17:		Line 17:
	==Priority Queue Base Class==		==Priority Queue Base Class==

	AbstractPriorityQueue class: https://charlesreid1.com~~:3000~~/cs/java/src/master/priority-queues/AbstractPriorityQueue.java		AbstractPriorityQueue class: https://git.charlesreid1.com/cs/java/src/master/priority-queues/AbstractPriorityQueue.java

	This base class is an abstract class that defines a key-value item utility class, defines a few concrete methods, and defines several abstract methods.		This base class is an abstract class that defines a key-value item utility class, defines a few concrete methods, and defines several abstract methods.
Line 25:		Line 25:
	==Sorted Priority Queue==		==Sorted Priority Queue==

	SortedPQ class: https://charlesreid1.com~~:3000~~/cs/java/src/master/priority-queues/SortedPQ.java		SortedPQ class: https://git.charlesreid1.com/cs/java/src/master/priority-queues/SortedPQ.java

	This class implements a sorted priority queue using an O(N) insertion sort for each add operation (start from the back, swap your way toward the front) and a built-in Java Collections API Linked List (a doubly-linked list).		This class implements a sorted priority queue using an O(N) insertion sort for each add operation (start from the back, swap your way toward the front) and a built-in Java Collections API Linked List (a doubly-linked list).
Line 33:		Line 33:
	==Unsorted Priority Queue==		==Unsorted Priority Queue==

	UnsortedPQ class: https://charlesreid1.com~~:3000~~/cs/java/src/master/priority-queues/UnsortedPQ.java		UnsortedPQ class: https://git.charlesreid1.com/cs/java/src/master/priority-queues/UnsortedPQ.java

	This class implements an unsorted priority queue that does not keep track of the minimum element and must perform an O(N) sequential search for each removal operation.		This class implements an unsorted priority queue that does not keep track of the minimum element and must perform an O(N) sequential search for each removal operation.

Admin: /* Flags */

2017-06-25T00:50:47Z

Flags

← Older revision		Revision as of 00:50, 25 June 2017
Line 41:		Line 41:
	=Flags=		=Flags=

	{{~~StacksQueuesFlag~~}}		{{PriorityQueuesFlag}}
	[[Category:Queues]]		[[Category:Queues]]
	[[Category:Priority Queues]]		[[Category:Priority Queues]]

Admin: /* Code */

2017-06-23T10:13:41Z

Code

← Older revision		Revision as of 10:13, 23 June 2017
Line 25:		Line 25:
	==Sorted Priority Queue==		==Sorted Priority Queue==

	~~SortedPriorityQueue~~ class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/~~SortedPriorityQueue~~.java		SortedPQ class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/SortedPQ.java

	This class implements a sorted priority queue using an O(N) insertion sort for each add operation (start from the back, swap your way toward the front) and a built-in Java Collections API Linked List (a doubly-linked list).		This class implements a sorted priority queue using an O(N) insertion sort for each add operation (start from the back, swap your way toward the front) and a built-in Java Collections API Linked List (a doubly-linked list).
Line 33:		Line 33:
	==Unsorted Priority Queue==		==Unsorted Priority Queue==

	~~UnsortedPriorityQueue~~ class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/~~UnsortedPriorityQueue~~.java		UnsortedPQ class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/UnsortedPQ.java

	This class implements an unsorted priority queue that does not keep track of the minimum element and must perform an O(N) sequential search for each removal operation.		This class implements an unsorted priority queue that does not keep track of the minimum element and must perform an O(N) sequential search for each removal operation.

Admin: /* Priority Queue Base Class */

2017-06-23T05:03:46Z

Priority Queue Base Class

← Older revision		Revision as of 05:03, 23 June 2017
Line 17:		Line 17:
	==Priority Queue Base Class==		==Priority Queue Base Class==

	~~PriorityQueueBase~~ class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/~~PriorityQueueBase~~.java		AbstractPriorityQueue class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/AbstractPriorityQueue.java

	This base class is an abstract class that defines a key-value item utility class, defines a few ~~simple~~ methods, and ~~requires base classes to implement~~ several ~~other~~ methods.		This base class is an abstract class that defines a key-value item utility class, defines a few concrete methods, and defines several abstract methods.

			See [[Priority Queues/ADT]] for more code.

	==Sorted Priority Queue==		==Sorted Priority Queue==

Admin at 04:08, 22 June 2017

2017-06-22T04:08:43Z

← Older revision		Revision as of 04:08, 22 June 2017
Line 1:		Line 1:
	==Links==		=Links=

	===My Priority Queue API===		==My Priority Queue API==

	Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/PriorityQueueBase.java		Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/PriorityQueueBase.java

	===Java Collections Priority Queue===		==Java Collections Priority Queue==

	You can also find an implementation of a Priority Queue in the Java Collections API.		You can also find an implementation of a Priority Queue in the Java Collections API.
Line 12:		Line 12:

	Link: http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html		Link: http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html

			=Code=

	==Priority Queue Base Class==		==Priority Queue Base Class==
Line 35:		Line 37:
	Fast add, slow remove.		Fast add, slow remove.

	==Flags==		=Flags=

	{{StacksQueuesFlag}}		{{StacksQueuesFlag}}

Admin at 04:08, 22 June 2017

2017-06-22T04:08:05Z

← Older revision		Revision as of 04:08, 22 June 2017
Line 1:		Line 1:
	~~Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com.~~		==Links==

	~~You can also find the Java Collections implementation of the~~ Priority Queue ~~class here: http://hg.openjdk.java.net/jdk8/jdk8/jdk/file/ff6c76f7733e/src/share/classes/java/util/PriorityQueue.java~~		===My Priority Queue API===

			Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/PriorityQueueBase.java

			===Java Collections Priority Queue===

			You can also find an implementation of a Priority Queue in the Java Collections API.

			Source: http://hg.openjdk.java.net/jdk8/jdk8/jdk/file/ff6c76f7733e/src/share/classes/java/util/PriorityQueue.java

			Link: http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html

	==Priority Queue Base Class==		==Priority Queue Base Class==

Admin at 05:10, 21 June 2017

2017-06-21T05:10:36Z

← Older revision		Revision as of 05:10, 21 June 2017
Line 1:		Line 1:
	Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com.		Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com.

	You can also find the Java Collections implementation of the Priority Queue class here: [http://hg.openjdk.java.net/jdk8/jdk8/jdk/file/ff6c76f7733e/src/share/classes/java/util/PriorityQueue.java ~~link]~~		You can also find the Java Collections implementation of the Priority Queue class here: http://hg.openjdk.java.net/jdk8/jdk8/jdk/file/ff6c76f7733e/src/share/classes/java/util/PriorityQueue.java

Admin at 05:10, 21 June 2017

2017-06-21T05:10:23Z

← Older revision		Revision as of 05:10, 21 June 2017
Line 1:		Line 1:
	Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com:		Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com.

			You can also find the Java Collections implementation of the Priority Queue class here: [http://hg.openjdk.java.net/jdk8/jdk8/jdk/file/ff6c76f7733e/src/share/classes/java/util/PriorityQueue.java link]


	==Priority Queue Base Class==		==Priority Queue Base Class==

Admin at 07:16, 19 June 2017

2017-06-19T07:16:26Z

← Older revision		Revision as of 07:16, 19 June 2017
Line 22:		Line 22:

	Fast add, slow remove.		Fast add, slow remove.

			==Flags==

			{{StacksQueuesFlag}}
			[[Category:Queues]]
			[[Category:Priority Queues]]
			[[Category:Java]]
			[[Category:CS]]
			[[Category:Data Structures]]
			[[Category:Sorting]]

Admin at 07:15, 19 June 2017

2017-06-19T07:15:37Z

← Older revision		Revision as of 07:15, 19 June 2017
Line 1:		Line 1:
	Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com:		Two concrete priority queue classes and one abstract priority queue class implemented in Java. These classes can be found at git.charlesreid1.com:

			==Priority Queue Base Class==

			PriorityQueueBase class: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/PriorityQueueBase.java

			This base class is an abstract class that defines a key-value item utility class, defines a few simple methods, and requires base classes to implement several other methods.

	==Sorted Priority Queue==		==Sorted Priority Queue==