LassoScript Utility
Basics Browse Detail

[Array->Insert]

Tag Link [Array->Insert] Category Array
Type Member Source Available No
Support Preferred Version 5.0
Change Unchanged Data Source Any
Output Type None Security None
Implementation LCAPI Sets Lasso 8.5, Lasso 8.0, Lasso 7.0, Lasso 6.0, Lasso 5.0

Description

[Array->Insert] inserts a value into the array. Accepts a single parameter which is the value to be inserted and an optional integer parameter identifying the position of the location where the value should be inserted. Defaults to inserting the parameter at the end of the array. Returns no value.

The first element in an array is at position 1.

Note: This tag will not replace an item in the array. Instead, it will insert the new item and increment the position of all the existing items that follow.

Syntax

[Array->(Insert: 'Insert Value')]

[Array->(Insert: 'Insert Value', Array Position)]

Parameters

Required Parameters
Insert Value The value which should be inserted as the last element of the array.
Optional Parameters
Array Index The index of the element where the new item should be inserted. Defaults to inserting at the end of the array.

Examples

To insert a new element into an array:

Use the [Array->Insert] tag. The following example starts with a partial array of the days of the week, then inserts 'Sun' as the first element and 'Sat' as the last element of the array.

<?LassoScript
  Variable: 'DaysOfWeek'=(Array:'Mon','Tue','Wed','Thu','Fri');
  $DaysOfWeek->(Insert: 'Sun', 1);
  $DaysOfWeek->(Insert: 'Sat');
  Output: $DaysOfWeek;
?>

(Array: (Sun), (Mon), (Tue), (Wed), (Thu), (Fri), (Sat))

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]