Module: Zadt
- Defined in:
- lib/zadt/AbstractDataTypes/StackQueue/StackQueue.rb,
lib/zadt.rb,
lib/zadt/version.rb,
lib/zadt/HelpModules/adt_help.rb,
lib/zadt/HelpModules/adt_graph_help.rb,
lib/zadt/AbstractDataTypes/Graph/graph.rb,
lib/zadt/HelpModules/adt_geometrics_help.rb,
lib/zadt/HelpModules/adt_linkedlist_help.rb,
lib/zadt/HelpModules/adt_stackqueue_help.rb,
lib/zadt/AbstractDataTypes/Graph/di_graph.rb,
lib/zadt/AbstractDataTypes/Graph/face_graph.rb,
lib/zadt/AbstractDataTypes/StackQueue/Queue.rb,
lib/zadt/AbstractDataTypes/StackQueue/Stack.rb,
lib/zadt/AbstractDataTypes/Geometrics/universe.rb,
lib/zadt/AbstractDataTypes/LinkedList/LinkedList.rb,
lib/zadt/AbstractDataTypes/StackQueue/MinMaxStack.rb,
lib/zadt/AbstractDataTypes/LinkedList/DoublyLinkedList.rb,
lib/zadt/AbstractDataTypes/StackQueue/MinMaxStackQueue.rb
Overview
A MinMaxStackQueue is a queue that allows for Min and Max to be found in constant time, unlike a queue or array that generally takes linear time. It does this because it’s based on a MinMaxStack, which has this ability.
Defined Under Namespace
Classes: ADT, DiGraph, DoublyLinkedListNode, FaceGraph, Graph, LinkedListNode, MinMaxStack, MinMaxStackQueue, Queue, Stack, StackQueue, Universe
Constant Summary collapse
- VERSION =
"1.1.4"