List

By

BeeGraphy Support

Version 1.8.11

Version history

Groups: 0
Nodes: 0
Groups: 0
Nodes: 0
Groups: 4
Nodes: 54
Groups: 4
Nodes: 0
Groups: 0
Nodes: 0
Groups: 4
Nodes: 0
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.10

Released on August 27, 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 August 27, 2026. Edit this content to add version-specific details.

Documentation

List

Measure the length of a list

Reverse the order of a list

Dispatch the items in a list into two target lists

Retrieve the index of a certain item in a list

Take every Nth element in a list

Remove every Nth element in a list

Sort a list of numeric keys

Returns the ith element

Remove the subset from the list

Insert items in list

Remove indexed elements from a list

Replace certain items in a list

Partition a list into sub-lists

Creates a sequence of ascending and descending numbers

Remove elements in a list using a repeating bit mask

Extract a subset from a list

Split a list into separate parts

Sort a list of numeric keys with optional synchronous values.

Sequence

Creates a sequence of numbers

Repeat a pattern until it reaches a certain length

Duplicate list a predefined number of times

Creates a list of random numbers

Remap numbers into a new numbers list

Creates a Fibonacci sequence

Creates a sequence of numbers using start, end and count

Returns the number list minimum and maximum values

Creates a sequence by growing steps

Set

Creates the intersection of two lists

Creates the difference of two lists

Change the order of the list

Delete consecutive similar members in a list

Creates the union of two list

Creates the union of two lists

Offset all items in a list

Tree

Construct a data tree branch path.

Reduce tree complexity by merging outermost branches

Filters a collection of input streams

Routes the input to the output(s) whose bound Scope is active; other outputs emit nothing

Flatten a data tree by removing all branching information

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

Remove small branches from a data tree

Retrieve a specific branch from a data tree

Retrieve a specific item from a data tree

Filters a collection of input streams

Weave a set of input data using a custom pattern

Flip a tree like data tree by swapping rows and columns

Unflatten a data tree by moving items back into branches

Get some statistics regarding 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

Deconstruct a data tree path into individual integers

Removed all null and invalid items from a data tree

Simplify a data tree by removing shared overlap amongst all branches

Retrieve a specific branch from a data tree