public class IntQueue extends cern.colt.list.IntArrayList implements IntSearchStructure
AnalysisBase representing an fifo queue for a breadth
 first search.| Constructor and Description | 
|---|
IntQueue()  | 
IntQueue(int initialCapacity)  | 
| Modifier and Type | Method and Description | 
|---|---|
int | 
get()  | 
add, beforeInsert, binarySearchFromTo, clone, copy, elements, elements, ensureCapacity, equals, forEach, get, getQuick, indexOfFromTo, lastIndexOfFromTo, partFromTo, removeAll, replaceFromToWithFrom, retainAll, reverse, set, setQuick, shuffleFromTo, sortFromTo, trimToSizeaddAllOf, addAllOfFromTo, beforeInsertAllOfFromTo, binarySearch, contains, delete, fillFromToWith, indexOf, lastIndexOf, mergeSortFromTo, mergeSortFromTo, quickSortFromTo, quickSortFromTo, removeFromTo, replaceFromToWithFromTo, replaceFromWith, size, times, toList, toStringaddAllOf, beforeInsertAllOf, clear, mergeSort, quickSort, remove, setSize, shuffle, sortgetClass, hashCode, notify, notifyAll, wait, wait, waitadd, isEmptypublic int get()
get in interface IntSearchStructureCopyright © 2007–2021. All rights reserved.