Overview | Package | Class | Tree | Deprecated | Index | Help
| ContactCenters V. 0.9.9.
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | DETAIL: ENUM CONSTANTS | FIELD | METHOD

## umontreal.iro.lecuyer.contactcenters.router
Enum WaitingQueueStructure

    java.lang.Object
      java.lang.Enum<WaitingQueueStructure>
          umontreal.iro.lecuyer.contactcenters.router.WaitingQueueStructure

All Implemented Interfaces:
  Serializable, Comparable<WaitingQueueStructure>

    public enum WaitingQueueStructure

extends Enum<WaitingQueueStructure>

Possible data structures for waiting queues.

Enum Constant Summary
`LIST` Queued contacts are placed in an ordinary list, in the order they enter the queue.
`PRIORITY` Queued contacts are put into a priority queue, usually implemented using a heap.
`SORTEDSET` Queued contacts are put into a sorted set, usually implemented by a binary tree.

Method Summary
`static WaitingQueueStructure` | `valueOf(String name)` Returns the enum constant of this type with the specified name.
`static WaitingQueueStructure[]` | `values()` Returns an array containing the constants of this enum type, in the order they are declared.

Methods inherited from class java.lang.Enum
`clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf`

Methods inherited from class java.lang.Object
`getClass, notify, notifyAll, wait, wait, wait`

Enum Constant Detail

### LIST

    public static final WaitingQueueStructure LIST

  Queued contacts are placed in an ordinary list, in the order they enter the queue. When an agent becomes free, the first contact is usually removed from the queue. This structure therefore implements a FIFO queue. This is the most common, the fastest and is the default structure.

### PRIORITY

    public static final WaitingQueueStructure PRIORITY

  Queued contacts are put into a priority queue, usually implemented using a heap. A comparator is used to sort contacts by priority. A free agent removes the contacts with the highest priority first. However, if a priority queue is scanned, the order of the contacts might not be the order imposed by the comparator. The structure used only guarantees that the first contact is the ``smallest'' with respect to the comparator given.

### SORTEDSET

    public static final WaitingQueueStructure SORTEDSET

  Queued contacts are put into a sorted set, usually implemented by a binary tree. This is similar to `PRIORITY`, but the contacts in queue can be enumerated in the correct order at any time. However, sorted sets are slower than priority queues.

Method Detail

### values

    public static WaitingQueueStructure[] values()

  Returns an array containing the constants of this enum type, in the order they are declared. This method may be used to iterate over the constants as follows:

      for (WaitingQueueStructure c : WaitingQueueStructure.values())
          System.out.println(c);

  Returns:
    an array containing the constants of this enum type, in the order they are declared

### valueOf

    public static WaitingQueueStructure valueOf(String name)

  Returns the enum constant of this type with the specified name. The string must match exactly an identifier used to declare an enum constant in this type. (Extraneous whitespace characters are not permitted.)

  Parameters:
    `name` - the name of the enum constant to be returned.
  Returns:
    the enum constant with the specified name
  Throws:
    `IllegalArgumentException` - if this enum type has no constant with the specified name
    `NullPointerException` - if the argument is null

Overview | Package | Class | Tree | Deprecated | Index | Help
| ContactCenters V. 0.9.9.
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | DETAIL: ENUM CONSTANTS | FIELD | METHOD

To submit a bug or ask questions, send an e-mail to Richard Simard.