Queue<T> Class

A first-in-first-out container of elements implemented as a List .

Putting an element to the end of the queue takes amortized constant time. Getting an element from the start of the queue is O(n) operation.

Template Parameters

T

Constraint

T  is  Semiregular

Member Functions

public inline nothrow void Clear()
public inline nothrow long Count() const
public inline nothrow const T& Front() const
public inline T Get()
public inline nothrow bool IsEmpty() const
public inline void Put(T&& item)
public inline void Put(const T& item)
public inline nothrow List<T>& Rep()

Typedefs

public typedef ValueType T

Member Variables

private List<T> items

Member Function Details

Clear Member Function

public inline nothrow void Clear()

Definition
Line 39 of System.Base/Queue.cm

Count Member Function

public inline nothrow long Count()

Definition
Line 19 of System.Base/Queue.cm

Front Member Function

public inline nothrow const T& Front()

Definition
Line 35 of System.Base/Queue.cm

Get Member Function

public inline T Get()

Definition
Line 31 of System.Base/Queue.cm

IsEmpty Member Function

public inline nothrow bool IsEmpty()

Definition
Line 15 of System.Base/Queue.cm

Put Member Function

public inline void Put(T&& item)

Definition
Line 27 of System.Base/Queue.cm

Put Member Function

public inline void Put(const T& item)

Definition
Line 23 of System.Base/Queue.cm

Rep Member Function

public inline nothrow List<T>& Rep()

Definition
Line 43 of System.Base/Queue.cm