Simplify a data tree by removing shared overlap amongst all branches

tree

Simplify Tree

Data Structure nodes for the BeeGraphy Editor.

List

Sequence

Tree

list

List Length

count

index

List Item

geometry

Retrieve the index of a certain item in a list

item

Item Index

indexes

indexStart

indexEnd

Remove Subset

resultList

Extract Subset

Split List

listA

listB

Reverse List

reverseList

Items to insert. If no items are supplied, nulls will be inserted

indices

Insert List Items

modifyList

Dispatch the items in a list into two target lists

dispatchPattern

Dispatch List

start

Take Nth

Remove Nth

Remove By Index

Number List Sort

sortedList

items

Replace Items

replacedList

sizes

Partition List

chunks

Creates a sequence of ascending and descending numbers

step

AscDesc List

ascDescList

Remove elements in a list using a repeating bit mask

removePattern

Remove Pattern

removedList

List Sequence

listSequence

seedA

seedB

Fibonacci

series

Duplicate list a predefined number of times

order

Duplicate List

seed

Integer or float. If true returns integer

integer

Random Numbers List

numberArray

numberSortedArray

Repeat a pattern until it reaches a certain length

length

Repeat List

Creates a sequence of numbers using start, end and count

List Sequence SEC

value

sourceMin

sourceMax

targetMin

targetMax

Remap Numbers

mapped

Returns the number list minimum and maximum values

Bounds

listMin

listMax

The first incremental step applied to the initial value

step1

The second incremental step applied to the sequence

step2

Grow Step Sequence

changingFactor

List Order Changing

changedList

List Intersection

List Union

List Difference

List Merge

Delete consecutive similar members in a list

Delete Consecutive

Construct Path

path

Deconstruct a data tree path into individual integers

Deconstruct Path

conditions

Condition

stream

Weave a set of input data using a custom pattern

Weave

weave

Removed all null and invalid items from a data tree

removeNulls

removeInvalid

removeEmpty

Clean Tree

Reduce tree complexity by merging outermost branches

depth

Trim Tree

Flatten a data tree by removing all branching information

Flatten Tree

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

Graft Tree

Flip a tree like data tree by swapping rows and columns

Flip Tree

Remove branches with more than N1 items (use zero to ignore the upper limit)

Prune Tree

Unflatten a data tree by moving items back into branches

Guide data tree that defines the path layout

guid

Unflatten Tree

Get some statistics regarding a data tree

Tree Statistics

Retrieve a specific branch from a data tree

Tree Branch

branch

Retrieve a specific item from a data tree

Creation method

There are two options for creating a Simplify Tree node.

Steps

See also