StacksQueues/Java/ArrayQueue - Revision history

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

2019-10-09T03:53:51Z

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

← Older revision		Revision as of 03:53, 9 October 2019
Line 11:		Line 11:
	==code==		==code==

	Link to the code on git.charlesreid1.com: https://charlesreid1.com~~:3000~~/cs/java/src/master/stacks-queues-deques/queues/ArrayQueue.java		Link to the code on git.charlesreid1.com: https://git.charlesreid1.com/cs/java/src/master/stacks-queues-deques/queues/ArrayQueue.java

	A fixed size implementation: https://charlesreid1.com~~:3000~~/cs/java/src/master/stacks-queues-deques/queues/ArrayQueueFS.java		A fixed size implementation: https://git.charlesreid1.com/cs/java/src/master/stacks-queues-deques/queues/ArrayQueueFS.java

	==interface==		==interface==

Admin: /* code */

2017-06-03T21:26:18Z

code

← Older revision		Revision as of 21:26, 3 June 2017
Line 12:		Line 12:

	Link to the code on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/stacks-queues-deques/queues/ArrayQueue.java		Link to the code on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/stacks-queues-deques/queues/ArrayQueue.java

			A fixed size implementation: https://charlesreid1.com:3000/cs/java/src/master/stacks-queues-deques/queues/ArrayQueueFS.java

	==interface==		==interface==

Admin at 21:23, 3 June 2017

2017-06-03T21:23:23Z

Show changes

Admin: /* implementation */

2017-06-03T20:52:28Z

implementation

← Older revision		Revision as of 20:52, 3 June 2017
Line 198:		Line 198:
	}		}
	}		}

			</pre>

	=Flags=		=Flags=

Admin: /* interface */

2017-06-03T20:52:01Z

interface

Show changes

Admin: /* Flags */

2017-06-03T20:47:54Z

Flags

← Older revision		Revision as of 20:47, 3 June 2017
Line 32:		Line 32:
	[[Category:Queue]]		[[Category:Queue]]
	[[Category:Arrays]]		[[Category:Arrays]]
	[[~~Ccategory~~:Java]]		[[Category:Java]]
	{{DataStructuresFlag}}		{{DataStructuresFlag}}

Admin at 09:27, 3 June 2017

2017-06-03T09:27:29Z

← Older revision		Revision as of 09:27, 3 June 2017
Line 8:		Line 8:
	* would then need to check if head floated too far.		* would then need to check if head floated too far.
	* can have variable size array, or fixed size array.		* can have variable size array, or fixed size array.

			==code==

			Link to the code on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/stacks-queues-deques/queues/ArrayQueue.java

	==interface==		==interface==

Admin: Created page with "=Notes= array-based queue object. implementation details: * one option is to have an array that is re-sized and shifted each time the front is removed. * a better option is..."

2017-06-03T09:24:06Z

Created page with "=Notes= array-based queue object. implementation details: * one option is to have an array that is re-sized and shifted each time the front is removed. * a better option is..."

New page

=Notes=

array-based queue object.

implementation details:
* one option is to have an array that is re-sized and shifted each time the front is removed.
* a better option is to have floating head and tail index variables.
* would then need to check if head floated too far.
* can have variable size array, or fixed size array.

==interface==

The methods implemented for a queue object are:
* size() - get the number of elements in the queue
* isEmpty() - returns true if queue is empty
* add() - add the element to the back of the queue
* remove() - remove and return the element at the front of the queue
* peek() - return a reference to the first item in the queue, but do not remove it

Implementing these for an array based queue requires us to do the following:
* size - keep track of the size (tail - head)
* add method - when things are added and we are at capacity, copy new items into new array (from head cycling through to tail, in order.)
* remove - to remove an item from the queue we remove it and increment head by 1 (much better than the O(n) scooting everything up)
* resize - allocates a new array, and copies from old to new from head to tail, resetting index values.

=Flags=

[[Category:Queue]]
[[Category:Arrays]]
[[Ccategory:Java]]
{{DataStructuresFlag}}