@add-on-hlapi-sdk / ItemList
Class: ItemList<T>
ItemList represents an ordered list of API objects, representing items that are all children of the same parent node. (The reverse is not necessarily true, however: this list might not include all children that exist in the parent node. See allChildren for details).
ItemList also provides APIs for manipulating the list by adding items to the parent or removing items from the parent.
This class is used in different places for various types of items, including Nodes, Fills, and Strokes.
Type parameters
| Name | Type |
|---|---|
T | extends ListItem |
Hierarchy
↳
ItemList
Table of contents
Accessors
Methods
Accessors
first
• get first(): undefined | T
First item in this list, or undefined if list is empty.
Returns
undefined | T
Inherited from
ReadOnlyItemList.first
last
• get last(): undefined | T
Last item in this list, or undefined if list is empty.
Returns
undefined | T
Inherited from
ReadOnlyItemList.last
length
• get length(): number
Number of items in this list.
Returns
number
Inherited from
ReadOnlyItemList.length
Methods
[iterator]
▸ [iterator](): Iterator<T, any, undefined>
Iterates over all the items in this list. Mutations that occur mid-iteration are not reflected by the iterator.
Returns
Iterator<T, any, undefined>
Inherited from
append
▸ append(...items): void
Add one or more items to the end of the list. The last argument will become the last item in this list. Items are removed from their previous parent, if any – or if an item is already in this list, its index is simply changed.
Parameters
| Name | Type |
|---|---|
...items | T[] |
Returns
void
clear
▸ clear(): void
Remove all items from this list. No-op if list is already empty.
Returns
void
insertAfter
▸ insertAfter(newItem, after): void
Insert newItem so it is immediately after after in this list: places newItem at the index one higher than after,
shifting all later items to higher indices (the index of after remains unchanged). newItem is removed from its previous parent,
if any – or if it's already in this list, its index is simply changed. No-op if both arguments are the same item.
Parameters
| Name | Type |
|---|---|
newItem | T |
after | T |
Returns
void
insertBefore
▸ insertBefore(newItem, before): void
Insert newItem so it is immediately before before in this list: places newItem at the index that before used
to occupy, shifting before and all later items to higher indices. newItem is removed from its previous parent,
if any – or if it's already in this list, its index is simply changed. No-op if both arguments are the same item.
Parameters
| Name | Type |
|---|---|
newItem | T |
before | T |
Returns
void
item
▸ item(index): undefined | T
Returns item at the given index, or undefined if index is out of range.
Parameters
| Name | Type | Description |
|---|---|---|
index | number | Zero-based index |
Returns
undefined | T
Inherited from
remove
▸ remove(...items): void
Remove one or more items from this list. The items need not be contiguous. Throws without performing any removals if any item is not a member of this list.
Parameters
| Name | Type |
|---|---|
...items | T[] |
Returns
void
replace
▸ replace(oldItem, newItem): void
Replace oldItem with newItem in this list. Throws if oldItem is not a member of this list.
newItem is removed from its previous parent, if any – or if it's already in this list, its index is simply
changed. No-op if both arguments are the same item.
Parameters
| Name | Type |
|---|---|
oldItem | T |
newItem | T |
Returns
void
toArray
▸ toArray(): readonly T[]
All items in the list, as a static array. Mutations that occur later are not reflected in an array returned earlier.
Returns
readonly T[]
