Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## cc.mallet.util.search
Interface QueueElement

All Known Implementing Classes:
  AStarNode, SearchNode

    public interface QueueElement

Created by IntelliJ IDEA. User: pereira Date: Jun 18, 2005 Time: 7:31:08 PM Queue elements have a priority, and a queue position. Lower-priority elements are closer to the front of the queue. The queue position is set by the queue implementation, and should not be changed outside the queue implementation.

Method Summary
`int` | `getPosition()` Get the queue position of this element.
`double` | `getPriority()` Get this element's priority.
`void` | `setPosition(int pos)` Set the current queue position for this element.
`void` | `setPriority(double priority)` Set the priority of this element.

Method Detail

### getPriority

    double getPriority()

  Get this element's priority.

  Returns:
    the priority

### setPriority

    void setPriority(double priority)

  Set the priority of this element.

  Parameters:
    `priority` - the element's new priority

### getPosition

    int getPosition()

  Get the queue position of this element. If the element is not in a queue, the returned value is meaningless.

  Returns:
    the current position

### setPosition

    void setPosition(int pos)

  Set the current queue position for this element. This should only be called by a queue implementation.

  Parameters:
    `pos` - the new position for the element

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD