Class IntQueue
- java.lang.Object
-
- com.actelion.research.chem.descriptor.flexophore.calculator.IntQueue
-
public final class IntQueue extends java.lang.ObjectImplementation for a FIFO of int. This class is particularly useful for the implementation of BFS algorithm- Author:
- freyssj
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidclear()intget(int ind)intgetBegin()intgetEnd()intgetSize()intindexOf(int ind)booleanisEmpty()intpeek()Peek the first element of the Queue (do not increment the queue index)intpop()Pop the first element of the Queuevoidpush(int i)Push an element on top of the queue
-
-
-
Method Detail
-
get
public final int get(int ind)
-
getBegin
public final int getBegin()
-
getEnd
public final int getEnd()
-
isEmpty
public final boolean isEmpty()
-
clear
public final void clear()
-
getSize
public final int getSize()
-
pop
public final int pop()
Pop the first element of the Queue- Returns:
-
peek
public final int peek()
Peek the first element of the Queue (do not increment the queue index)- Returns:
-
push
public void push(int i)
Push an element on top of the queue- Parameters:
i-
-
indexOf
public int indexOf(int ind)
-
-