choco.kernel.solver.constraints.global.matching
Class AbstractBipartiteGraph.IntQueue
java.lang.Object
choco.kernel.solver.constraints.global.matching.AbstractBipartiteGraph.IntQueue
- Enclosing class:
- AbstractBipartiteGraph
protected static class AbstractBipartiteGraph.IntQueue
- extends Object
Method Summary |
int |
getSize()
|
void |
init()
Initializes the queue. |
boolean |
onceInQueue(int i)
|
int |
pop()
|
void |
push(int val)
Adds a value in the queue |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
AbstractBipartiteGraph.IntQueue
public AbstractBipartiteGraph.IntQueue(int n)
- Constructs a new queue with the specified maximal number of values.
- Parameters:
n
- Maximal size of the queue.
getSize
public int getSize()
- Returns:
- the size of the queue.
init
public void init()
- Initializes the queue.
push
public void push(int val)
- Adds a value in the queue
- Parameters:
val
-
pop
public int pop()
- Returns:
- the older value in the queue
onceInQueue
public boolean onceInQueue(int i)
- Parameters:
i
-
- Returns:
- true if i is in the queue
Copyright © 2012. All Rights Reserved.