I have two lists, 1 list contains a lot of doubles (from a list.sortbykey node). And another list with “Chopping” values. For example:
I would like to sort my list each time the values in the upper list exceed the values in the bottom list. I did some testing myself but I haven’t found a good solution yet.
In example, the method below sorts the list by lengths instead of indices, this causes only the first index of each sublist to be sorted as wanted, also does the List.Chop node keep chopping according to those values, even when the list lacing is set to shortest.
Split List by Indices.dyn (15.3 KB)