LassoScript Utility
Basics Browse Detail

[Array->FindPosition]

Tag Link [Array->FindPosition] Category Array
Type Member 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

[Array->FindPosition] searches the array for the parameter and returns an array of positions for those elements which match. Accepts a single parameter of any data type including matchers.

If the array contains any pair values, only the first part of the pair is compared with the parameter of the [Array->FindPosition] tag.

If no elements in the array match the parameter to the [Array->FindPosition] tag then an empty array is returned.

Syntax

[Array->(FindPosition: 'Find Value')]

Parameters

Required Parameters
Matcher Any value or matcher. Each element of the array will be compared to this value or matcher and the matching positions will be returned.

Change Notes

This tag was formerly called [Array->FindIndex].

Examples

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

Related Tags

Category Tags

Substitution
[Iterator]
[List]
[Map]
[Pair]
[PriorityQueue]
[Queue]
[ReverseIterator]
[Series]
[Set]
[Stack]
[TreeMap]
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]
[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]