List

By

BeeGraphy

Version 1.8.5

Version history

Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 52
Groups: 4
Nodes: 51
Groups: 4
Nodes: 51
Groups: 4
Nodes: 51
Groups: 4
Nodes: 51
Groups: 4
Nodes: 51
Groups: 4
Nodes: 51
Groups: 4
Nodes: 51
Data Structure nodes for the BeeGraphy Editor.

What's New in v1.8.5

Released on March 6, 2026

This release includes 0 nodes and 0 groups, providing expanded capabilities for your workflows.

What's New

  • Expanded node library with 0 available nodes
  • Organized into 0 functional groups
  • Enhanced plugin capabilities and workflow options

Changes in This Version

  • Update this section with specific features, fixes, or improvements
  • List breaking changes if any
  • Mention deprecated features or migration notes

Release notes generated on March 6, 2026. Edit this content to add version-specific details.

Documentation

List

Measure the length of a list

Returns the ith element

Retrieve the index of a certain item in a list

Remove the subset from the list

Extract a subset from a list

Split a list into separate parts

Reverse the order of a list

Insert items in list

Dispatch the items in a list into two target lists

Take every Nth element in a list

Remove every Nth element in a list

Remove indexed elements from a list

Sort a list of numeric keys

Replace certain items in a list

Partition a list into sub-lists

Sort a list of numeric keys with optional synchronous values.

Creates a sequence of ascending and descending numbers

Remove elements in a list using a repeating bit mask

Sequence

Creates a sequence of numbers

Creates a Fibonacci sequence

Duplicate list a predefined number of times

Creates a list of random numbers

Repeat a pattern until it reaches a certain length

Creates a sequence of numbers using start, end and count

Remap numbers into a new numbers list

Returns the number list minimum and maximum values

Creates a sequence by growing steps

Set

Change the order of the list

Creates the intersection of two lists

Creates the union of two list

Creates the difference of two lists

Creates the union of two lists

Delete consecutive similar members in a list

Offset all items in a list

Tree

Construct a data tree branch path.

Deconstruct a data tree path into individual integers

Filters a collection of input streams

Filters a collection of input streams

Weave a set of input data using a custom pattern

Removed all null and invalid items from a data tree

Reduce tree complexity by merging outermost branches

Flatten a data tree by removing all branching information

Graft a data tree by adding an extra branch for every item

Simplify a data tree by removing shared overlap amongst all branches

Flip a tree like data tree by swapping rows and columns

Remove small branches from a data tree

Unflatten a data tree by moving items back into branches

Get some statistics regarding a data tree

Retrieve a specific branch from a data tree

Retrieve a specific branch from a data tree

Retrieve a specific item from a data tree

Shift paths safely...will flatten data trees with fewer elements than shifts specified

Map or flatten a data tree based on path patterns

Flatten or graft a data tree by removing all branching information