print · source · login   

FIFO-set

Description

A queue[WP_QUEUE] is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure.

A set[WP_SET] is an abstract data type that can store certain values, without any particular order, and no repeated values. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set.

A FIFO-set is a queue and set combined; it is a queue that contains only unique values.

Characteristic FIFO-set(n)

Benchmark NameInputs/OutputsRegistersConstantsStatesTransitionsSource
FIFO-set(n)2/3n0n+13n+1[AHKOV12][FISBJ12]