StacksQueues/Java/LinkedDeque - Revision history

Admin: /* Flags */

2017-09-09T17:05:41Z

Flags

← Older revision		Revision as of 17:05, 9 September 2017
Line 37:		Line 37:
	[[Category:Linked Lists]]		[[Category:Linked Lists]]
	[[Category:Queues]]		[[Category:Queues]]
			[[Category:Deques]]

Admin: /* Flags */

2017-09-09T17:05:23Z

Flags

← Older revision		Revision as of 17:05, 9 September 2017
Line 32:		Line 32:
	=Flags=		=Flags=

	{{~~DataStructuresFlag~~}}		{{StacksQueuesFlag}}

	[[Category:Java]]		[[Category:Java]]
	[[Category:Linked Lists]]		[[Category:Linked Lists]]
	[[Category:Queues]]		[[Category:Queues]]

Admin: /* Interface */

2017-06-04T06:06:19Z

Interface

← Older revision		Revision as of 06:06, 4 June 2017
Line 11:		Line 11:
	===Interface===		===Interface===

	(~~implementation details~~)		The [[Abstract Data Types#Deques]] page covers the methods that deques normally implement:
			* enqueueFront : add something to the front of the queue (will be the next thing to come out)
			* enqueueBack : add something to the back of the queue (normal order)
			* dequeueFront : remove something from the front of the queue (normal order)
			* dequeueBack : remove something from the back of the queue (cutting in line)
			* first : peek at first item
			* last : peek at last item
			* size : size of deque
			* isEmpty : is deque empty
			* rotate : rotate deque, move item from front to back

	===Test===		===Test===

Admin: /* Implementation notes */

2017-06-04T06:02:05Z

Implementation notes

← Older revision		Revision as of 06:02, 4 June 2017
Line 5:		Line 5:
	===Implementation notes===		===Implementation notes===

	~~This uses~~ a doubly-linked circular list.		To implement a double-ended queue with fast, O(1) addition and removal at the front and back of the data structure, use a doubly-linked list.

			To conserve memory overhead, use a circular doubly-linked list.

	===Interface===		===Interface===

Admin at 06:00, 4 June 2017

2017-06-04T06:00:36Z

← Older revision		Revision as of 06:00, 4 June 2017
Line 24:		Line 24:
	[[Category:Java]]		[[Category:Java]]
	[[Category:Linked Lists]]		[[Category:Linked Lists]]
	[[Category:~~Stacks~~]]		[[Category:Queues]]

Admin at 06:00, 4 June 2017

2017-06-04T06:00:17Z

← Older revision		Revision as of 06:00, 4 June 2017
Line 1:		Line 1:
	~~Implementation of~~ a ~~stack data structure~~ using a ~~circular~~ linked list.		LinkedDeque is a class that implements a double ended queue using a linked list data structure.

	==Code==		==Code==

			===Implementation notes===

			This uses a doubly-linked circular list.

	===Interface===		===Interface===

Admin: Created page with "Implementation of a stack data structure using a circular linked list. ==Code== ===Interface=== (implementation details) ===Test=== (code for a unit test) ===The Class==..."

2017-06-04T05:58:46Z

Created page with "Implementation of a stack data structure using a circular linked list. ==Code== ===Interface=== (implementation details) ===Test=== (code for a unit test) ===The Class==..."

New page

Implementation of a stack data structure using a circular linked list.

==Code==

===Interface===

(implementation details)

===Test===

(code for a unit test)

===The Class===

(code for the class)

=Flags=

{{DataStructuresFlag}}
[[Category:Java]]
[[Category:Linked Lists]]
[[Category:Stacks]]