List

By

BeeGraphy

Version 1.7.67

Version history

Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 54
Groups: 4
Nodes: 53
Groups: 4
Nodes: 53
Groups: 4
Nodes: 53
Groups: 4
Nodes: 53
Groups: 4
Nodes: 52
Groups: 4
Nodes: 52
Groups: 4
Nodes: 52
Groups: 4
Nodes: 52
Groups: 4
Nodes: 52
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
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
Groups: 4
Nodes: 51

BeeGraphy Editor Data Structure Package This package provides essential data structure nodes for performing various operations on lists, sequences, sets, and trees within the BeeGraphy Editor. These nodes are categorized into groups, each tailored for specific data management and manipulation tasks. Usage The nodes in this package allow users to work with different data structures, including lists, sequences, sets, and trees. Typical operations include measuring lengths, manipulating items, organizing hierarchical data, and performing complex data transformations. To locate these nodes, look under the corresponding group in the menu, or use the search functionality. Node Groups List Group The List group provides nodes for working with ordered collections of items. These nodes enable you to manipulate list elements by adding, removing, inserting, and extracting items at specific positions. You can measure list lengths, sort items, reverse lists, partition lists into subsets, and perform various filtering and transformation operations. List nodes are essential for managing collections of data where order matters and items can be accessed by their position. Sequence Group The Sequence group contains nodes for generating and managing ordered data sequences. These nodes help you create numerical sequences, generate patterns, and perform sequence-specific operations such as remapping values, finding bounds, and creating sequences with specific growth patterns. Sequence nodes are useful for generating ordered data, creating mathematical progressions, and working with numerical ranges. Set Group The Set group offers nodes for handling collections of unique items and performing set operations. These nodes allow you to merge sets, find intersections and differences between sets, remove duplicates, and manipulate set membership. Set nodes are ideal for working with data where uniqueness is important and for performing mathematical set operations like union, intersection, and difference. Tree Group The Tree group provides nodes designed for hierarchical data organization and tree structure manipulation. These nodes enable you to construct and deconstruct tree paths, flatten and unflatten tree structures, graft and prune branches, filter tree data, and perform various tree transformations. Tree nodes are essential for working with hierarchical data structures, managing nested data, and organizing complex relationships between data elements. Each group provides specialized nodes to simplify complex data handling, making it easier to create dynamic and organized data structures in the BeeGraphy Editor.

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

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 list

Creates the union of two list

Creates the union of two list

Creates the union of two list

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