I am trying to count repeated elements of a spread. The example used in the patch is:
Given String: aabcccdeee
I have tried some approaches - without success.
count repeated elements.vl (19.2 KB)
In the attached patch I have tried to compare a splice with the following slice of the given spread - but from there I have no idea on how to proceed.
I also googled the problem (adding “c#”, thanks for the hint, @sebl!), but I don’t know what to do with the result:
One answer has been:
“It seems the array is sorted (According to the example). If so you just have to pick the first element and iterate through the array until a distinct value is found. Within this process you can have a counter within loop to count the occurences.
Then pick the found distinct value instead of first element and repeat the process.” https://stackoverflow.com/questions/851716/count-repeated-elements-in-an-array
I’m not even sure if that can be implemented in VL - let alone, how to do it! :-)
So, any help is much appreciated!
Thanks a lot in advance!
Thank you both very much!
Linq (being completely new to me) looks very interesting!
I feel like I have to get my head around the new datatypes in gamma ( char, sequence, hashset, list etc.) and how to transform them to other datatypes; also when to use what. But your patches are great starting points for that, and I definetely see how powerful things can get!
Thanks a lot!
Would like to ask one more thing @sebl if you don’t mind. Pls have a look at the patch. My idea was to have a patch to check each sentence and bring out the common words. However, distance count checks each slice on it’s own and if they are exactly similar then counts. How it is possible to make the check between slices also and how also capslock or small letter should not affect the search? In the txt file there are few VVVV words written in each slice but couldn’t find a way to count them.