LassoScript Utility
Basics Browse Detail

[Queue]

Tag Link [Queue] Category Array
Type Substitution Source Available No
Support Preferred Version 8.0
Change Unchanged Data Source Any
Output Type None Security None
Implementation LCAPI Sets Lasso 8.5, Lasso 8.0

Description

[Queue] creates a new queue. Any parameters to the tag are copied as the initial elements for the queue.

Syntax

[Queue: Values]

Parameters

Optional Parameters
Initial Values Any values will be copied as the initial values of the queue.

Examples

See the Lasso 8 Language Guide for examples of how to use this tag.

Related Tags

Category Tags

Substitution
[Array]
[Iterator]
[List]
[Map]
[Pair]
[PriorityQueue]
[ReverseIterator]
[Series]
[Set]
[Stack]
[TreeMap]
Member
[Array->Contains]
[Array->Difference]
[Array->Find]
[Array->FindPosition]
[Array->First]
[Array->ForEach]
[Array->Get]
[Array->Insert]
[Array->InsertFirst]
[Array->InsertFrom]
[Array->InsertLast]
[Array->Intersection]
[Array->Iterator]
[Array->Join]
[Array->Last]
[Array->Merge]
[Array->Remove]
[Array->RemoveAll]
[Array->RemoveFirst]
[Array->RemoveLast]
[Array->Reserve]
[Array->Reverse]
[Array->ReverseIterator]
[Array->Second]
[Array->Size]
[Array->Sort]
[Array->SortWith]
[Array->Union]
[Iterator->AtBegin]
[Iterator->AtBottom]
[Iterator->AtEnd]
[Iterator->AtFarLeft]
[Iterator->AtFarRight]
[Iterator->AtTop]
[Iterator->Backward]
[Iterator->Down]
[Iterator->Forward]
[Iterator->InsertAtCurrent]
[Iterator->Key]
[Iterator->Left]
[Iterator->RemoveCurrent]
[Iterator->Reset]
[Iterator->Right]
[Iterator->Up]
[Iterator->Value]
[List->Contains]
[List->Difference]
[List->Find]
[List->FindPosition]
[List->First]
[List->ForEach]
[List->Get]
[List->Insert]
[List->InsertFirst]
[List->InsertFrom]
[List->InsertLast]
[List->Intersection]
[List->Iterator]
[List->Join]
[List->Last]
[List->Remove]
[List->RemoveAll]
[List->RemoveFirst]
[List->RemoveLast]
[List->Reverse]
[List->ReverseIterator]
[List->Second]
[List->Size]
[List->Sort]
[List->SortWith]
[List->Union]
[Map->Contains]
[Map->Find]
[Map->Get]
[Map->Insert]
[Map->InsertFrom]
[Map->Iterator]
[Map->Keys]
[Map->Remove]
[Map->Removeall]
[Map->Size]
[Map->Values]
[Pair->First]
[Pair->Get]
[Pair->Name]
[Pair->Second]
[Pair->Size]
[Pair->Value]
[PriorityQueue->First]
[PriorityQueue->Get]
[PriorityQueue->Insert]
[PriorityQueue->InsertLast]
[PriorityQueue->Remove]
[PriorityQueue->RemoveFirst]
[PriorityQueue->Size]
[ReverseIterator->AtBegin]
[ReverseIterator->AtBottom]
[ReverseIterator->AtEnd]
[ReverseIterator->AtFarLeft]
[ReverseIterator->AtFarRight]
[ReverseIterator->AtTop]
[ReverseIterator->Backward]
[ReverseIterator->Down]
[ReverseIterator->Forward]
[ReverseIterator->InsertAtCurrent]
[ReverseIterator->Key]
[ReverseIterator->Left]
[ReverseIterator->RemoveCurrent]
[ReverseIterator->Reset]
[ReverseIterator->Right]
[ReverseIterator->Up]
[ReverseIterator->Value]
[Set->Contains]
[Set->Difference]
[Set->Find]
[Set->ForEach]
[Set->Get]
[Set->Insert]
[Set->InsertFrom]
[Set->Intersection]
[Set->Iterator]
[Set->Join]
[Set->Remove]
[Set->RemoveAll]
[Set->ReverseIterator]
[Set->Size]
[Set->Union]
[Stack->First]
[Stack->Get]
[Stack->Insert]
[Stack->InsertFirst]
[Stack->Remove]
[Stack->RemoveFirst]
[Stack->Size]
[TreeMap->Contains]
[TreeMap->Find]
[TreeMap->Get]
[TreeMap->Insert]
[TreeMap->Insertfrom]
[TreeMap->Iterator]
[TreeMap->Keys]
[TreeMap->Remove]
[TreeMap->RemoveAll]
[TreeMap->Size]
[TreeMap->Values]