C# 클래스 Bless.Util.Deque

Double-ended queue data structure

상속: IEnumerable

공개 메소드들

메소드	설명
AddEnd ( o ) : void
AddFront ( o ) : void	Add an object to the front of the queue
Clear ( ) : void
Deque ( ) : System
GetEnumerator ( ) : IEnumerator
PeekEnd ( ) : T	Peek the object at the end of the queue
PeekFront ( ) : T	Peek the object at the front of the queue
RemoveEnd ( ) : T	Remove an object from the end of the queue (FIFO)
RemoveFront ( ) : T	Remove an object from the front of the queue (LIFO)

메소드	설명
IEnumerable ( ) : IEnumerator

public AddEnd ( o ) : void
리턴	void

Add an object to the front of the queue

public AddFront ( o ) : void
리턴	void

public Clear ( ) : void
리턴	void

public Deque ( ) : System
리턴	System

public GetEnumerator ( ) : IEnumerator
리턴	IEnumerator

Peek the object at the end of the queue

public PeekEnd ( ) : T
리턴	T

Peek the object at the front of the queue

public PeekFront ( ) : T
리턴	T

Remove an object from the end of the queue (FIFO)

public RemoveEnd ( ) : T
리턴	T

Remove an object from the front of the queue (LIFO)

public RemoveFront ( ) : T
리턴	T