[TreeMap->Insert] Detail - Lasso Reference

▼ LassoScript Tags

Tag

Category x

Type x

Set

Support x

Change

Description

▼ Summary

Showing Record 1245 of 1441 Found

▼ Navigation

▼ Options

Sort By

▼ [TreeMap->Insert]


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

[TreeMap->Insert] inserts a new element into the tree map. The tag requires a single name/value parameter which includes the key and the value for the inserted element. If an element with the same key already exists in the tree map then that value is replaced by the inserted value.

▼ Syntax

[TreeMap->(Insert: Key = Value)]

▼ Parameters

Required Parameters
Key/Value	The name/value pair which is to be inserted into the tree map.

▼ Examples

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

▼ Related Tags

Substitution
[TreeMap]
Member
[TreeMap->Contains] [TreeMap->Find] [TreeMap->Get] [TreeMap->Insertfrom]	[TreeMap->Iterator] [TreeMap->Keys] [TreeMap->Remove] [TreeMap->RemoveAll]	[TreeMap->Size] [TreeMap->Values]

▼ Category Tags

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