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, trimToSize
addAllOf, addAllOfFromTo, beforeInsertAllOfFromTo, binarySearch, contains, delete, fillFromToWith, indexOf, lastIndexOf, mergeSortFromTo, mergeSortFromTo, quickSortFromTo, quickSortFromTo, removeFromTo, replaceFromToWithFromTo, replaceFromWith, size, times, toList, toString
addAllOf, beforeInsertAllOf, clear, mergeSort, quickSort, remove, setSize, shuffle, sort
getClass, hashCode, notify, notifyAll, wait, wait, wait
add, isEmpty
public int get()
get
in interface IntSearchStructure
Copyright © 2007–2021. All rights reserved.