Why does this recursive Function in Bend Hangs with list size > 11?
I was experimenting with the language called Bend. It claims to be “A high-level, massively parallel programming language”. I was thinking of using it to validate a list of strings( 10 million phone numbers approx, the numbers are at most 13 and at least 10 char long). I was suggested to look into this language. I was playing with list type, and this function which simply iterates over and adds to a new list the list hangs when the element count becomes more than 11(weird). same thing happens with list comprehension.