Bounded monotonous priority queue

General information

Representation invariant: Identical to Bounded prority queue

Method

Name: insert

Identical to Bounded prority queue

Method

Name: extract minimum

Identical to Bounded prority queue

Method

Name: find minimum

Identical to Bounded prority queue

Method

Name: decrease key

Identical to Bounded prority queue except for:

Precondition:

1. All preconditions of that method in Bounded prority queue
2. The value of [math]\displaystyle{ x }[/math] is not smaller than the current minimum value.

Method

Name: number

Identical to Bounded prority queue

Known implementations

1. All implementations of Bounded priority queue
2. Dial implementation

Remark

As the known implementations show, Bounded priority queue should be derived Bounded monotonous priority queue rather than the other way round, to avoid a violation of the Liskov substitution principle.