I want to sort list 1 wich contains a few substring of list 2 in the order of list 2
and the elements wich doesn’t contains a substring of list 2 needs to be added at the and of the new list.
i tried a few options.
see image
but in this case i want the elements wicht contains “stoelpoot” behind the elements “stoeltest” and “stoeltr”
it needs to search for a part of string from list 1
for example if a part of a string in list1 contains the string “stad01” it needs to put that one at the top of the new list
i know i can get what i want if i use 6 times list.filter.byboolmask. but when the length of list 2 changes i need to change my graph
but now i have more items in the new list (19 in the original list and 23 in the new one) and in youre example one les.
And stil the strings wich contains “stoelpoot” become before “stoeltest” and that is not what i want.
I need the strings containing “stoelpoot” after strings that contains only “stoel” .
I know it can be done with a lot of times list.filterByBoolMask after eachother. But both list can change in length and than i have too change the graphs each time.
You don’t need multiple BoolMask nodes, you just need to use the proper list levels. The problem is that stoel is also going to return stoelpoot strings and stad is also going to return stad01 strings. It’s not a huge issue for stoel because you have stoel and stoelpoot in alphabetical order so you could probably just filter by stoel. But this is an issue when you have stad01 coming before stad.