[Iterator] Detail - Lasso Reference

▼ LassoScript Tags

Tag

Category x

Type x

Set

Support x

Change

Description

▼ Summary

Showing Record 569 of 1441 Found

▼ Navigation

▼ Options

Sort By

▼ [Iterator]


Tag Link	[Iterator]	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

[Iterator] returns an iterator for a compound data type. The tag requires one parameter which is a compound data type. If the compound data type provides a built-in iterator then that iterator is returned. Otherwise, if the compound data type supports the ->Size and ->Get member tags then a generic iterator is returned.

A second optional parameter allows a matcher to be specified which will be passed to the compound data type's built-in iterator or to the generic iterator. The matcher defines what elements from the compound data type are returned by the iterator.

▼ Syntax

[Iterator: DataType]

[Iterator: DataType, Matcher]

▼ Parameters

Required Parameters
Value	The compound data type whose iterator will be returned.
Optional Parameters
Matcher	An optional matcher that will be passed to the iterator.

▼ Examples

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

▼ Related Tags

Member
[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]

▼ Category Tags

Substitution
[Array] [List] [Map] [Pair]	[PriorityQueue] [Queue] [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] [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] [Queue->First] [Queue->Get] [Queue->Insert] [Queue->InsertLast] [Queue->Remove] [Queue->RemoveFirst] [Queue->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]