LabVIEW
repeatability of words in an array
Solved!
First you need to convert you string to an 1D array of words (e.g. use scan strings for tokens because there are probably several delimiters (space, newline, return, tab, tec.). Then sort the array, so identical words are adjacent. Now you simply loop over the array and watch whenever the element changes. This is a good exercise and there are plenty of examples already in the forum.
There are some fancier and even more elegant ways to count the duplicates, but let's first see how far you get.
When attaching an example program, you should also make sure that the input string contains typical default data.
altenbach wrote:There are some fancier and even more elegant ways to count the duplicates, but let's first see how far you get.
Here's a cute way using variant attributes. Make sure you fully understand every single detail of the code.
As I said, this is incomplete because it only recognizes "space" as delimiter and will thus not work for multiline strings unless you do some simple adjustments.
You can right-click each node and call up the help.
For a variant free solution, study this example. It only needs a few simple modifications to deal with strings. See how far you get. 😄
That's why I said it needs a few simple modifications. 😄
Instead of a 2D array of strings, use a 1D array of a cluster containing a string and an integer. Try to figure it out. 😉
@hameedkdnl wrote:
I have done using some loopings..but it not working properly..need some changes..pls help..
Whatever you are doing makes no sense. Why don't you simply adapt my old code in the given link?
Here's a quick draft showing both methods. Note that it gives incorrect results if the input array is empty, but that could be corrected easily with a little more code. Try it!
