Repeatability of words in an array

I need a logic for this program
Count number of words and number of repeating words of multi line text.Further display the repeating words in that string.
pls help me..
kudos sure..
Solved!
Go to Solution.
Attachments:
Number of words and repeatingt.vi ‏13 KB

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.
LabVIEW Champion . Do more with less code and in less time .
Attachments:
Number of words and repeatingMODCA.vi ‏10 KB
WordStatistics.png ‏11 KB

Similar Messages

To display consecutive words from an array on a keypress. Event listeners not working.

I need to display a series of words consecutively on a black background. A new word presented each time the Enter key is pressed (It is necessary that its the same key each time i.e the Enter Key). The words are arranged in an array. I have created a function for each Keypress and a listener. Also, as the previous word is replaced by the next, I have a removeChild() to get rid of the the last word.
I have a removeEventListener set up also, to avoid any problems with the listeners. I have been at this a long time without sucess. It must be a listener problem (i.e I have not got the listeners focussed properly?) or a display problem. It only ever displays one word. Please see below code for the display of two of the words from the array which is called cvcwords. The main problem is that the words do not display one after the other (indeed not at all, except for the first one) when the enter key is pressed. Very much as a powerpoint presentation would, thats the idea anyway. I have just a sample of the code below. any help appreciated.
var cvcwords : Array = ["bad", "mod", "hud", "mit", "sat", "fog", "puc",];
this.stage.addEventListener(KeyboardEvent.KEY_DOWN, modKeyDown);
                              function modKeyDown(e : KeyboardEvent) : void {
                                        if (e.keyCode == Keyboard.ENTER) {
                                                  removeChild(myText);               // to remove previous word from screen
                                                  myText.text = cvcwords[1];        //to display element one of the array
                                                  addChild(myText);
                                        } else if (e.keyCode == Keyboard.SPACE) { //this is for another seperate option
                                                  myText.text = "try again";
                                                  addChild(myText);
               this.stage.removeEventListener(KeyboardEvent.KEY_DOWN, modKeyDown);
                              this.stage.addEventListener(KeyboardEvent.KEY_DOWN, hudKeyDown);
                              function hudKeyDown(e : KeyboardEvent) : void {
                                        if (e.keyCode == Keyboard.ENTER) {
                                                  removeChild(myText); //to remove previous word from the screen
                                                  myText.text = cvcwords[2];
                                                  addChild(myText);
                                        } else if (e.keyCode == Keyboard.SPACE) {
                                                  myText.text = "do again";
                                                  addChild(myText);
               this.stage.removeEventListener(KeyboardEvent.KEY_DOWN, hudKeyDown);

Based on what I see of your code, the following is all you might need...
var cvcwords : Array = ["bad", "mod", "hud", "mit", "sat", "fog", "puc",];
var counter:int = 0;
stage.addEventListener(KeyboardEvent.KEY_DOWN, modKeyDown);
function modKeyDown(e : KeyboardEvent) : void {
    if (e.keyCode == Keyboard.ENTER) {
        myText.text = cvcwords[counter];
        counter++;
    } else if (e.keyCode == Keyboard.SPACE) {
        myText.text = "try again";
        addChild(myText);
        stage.removeEventListener(KeyboardEvent.KEY_DOWN, modKeyDown);
When you test this in Flash, in the player you need to be sure to select the Diable Keyboard Shortcuts option found under the Control option in the top toolbar
If you really mean to have them try again, you probably do not want to remove the event listener

How to split words in two arrays depending of the first letter.

Yes, how to split words in two arrays depending of the first letter.
I have a string array with some words, and I need to separe this array into two differents string arrays depending of the first letter:
if the word starts in A to M the word goes to array Words_AM;
if the word starts in N to Z the word goes to array Words_NZ;
Now I'm doing the next:
if ((ArrayWord.charAt(0))<='a') && (ArrayWord.charAt(0)>='m')) {
Words_AM]=ArrayWord;
else
Words_NZ[i]]=ArrayWord;
But doesn't work.
Any solution?
Best wishes.

Yes , that's true. But also I have to change the <='a' to <'a', because of with first option didn't selecting the a letter.
But with z letter, doing the same before, doens't run.
if ((ArrayWord.charAt(0))<'a') || (ArrayWord.charAt(0)>='m'))
Words_NZ]=ArrayWord;
else
if ((ArrayWord.charAt(0))<='n') || (ArrayWord.charAt(0)>'z')) Words_AM[i]]=ArrayWord;
Regards ;)

Replacing words in an array of strings

hi
im trying to create a method that takes three arrays of strings as parameters and replaces some words in one of them
heres my code
class A0
public static void main (String[] args)
int index;
String[] in = {"life","is","a","bowl","of","pits"};
String[] what={"pits", "bowl"};
String[] with={"chocolates", "box"};
String[] result=new String [in.length];
result=findAndReplace(in, what, with);
for (index=0;index<in.length;index++)
System.out.print(result[index]+" ");
static String[] findAndReplace (String[] in, String[] what, String[] with)
int index1;
int index2;
String[] newString= new String [in.length];
for (index1=0;index1<in.length;index1++)
for (index2=0;index2<what.length;index2++)
if (in[index1]==what[index2])
newString[index1]=with[index2];
else
newString[index1]=in[index1];
return newString;
ok so it's supposed to print life is a box of chocolates, only it prints life is a box of pits???pls help

i figured it out

Question regarding functionality of "Search 1D Array Function" in TCP/IP context

In the attached tcp_Registry.vi, the vi uses the "Search 1D Array Function". I can't figure out why this function can't find the index of the input element, since the inputs to the function match...
Solved!
Go to Solution.
Attachments:
tcpInstrument.llb ‏238 KB
tcp_registry_error_2Jun09.zip ‏435 KB

I was a bit surprised this morning by the fact that the Initialize vi worked, so I decided, "What the heck?" I'll try the "LCLSA Wave Save To File.vi" again, as I haven't been able to get this one working without errors for the past few months. And, magically, it worked! I didn't believe it, so I ran it again - and it worked again! I still didn't think this was true, so I ran a slightly modified vi I made, "LCLSA Wave Save To File_looped.vi", which just repeats the vi for multiple iterations to create multiple data files. And this worked, too! I have NO idea why today everything seems to be fine - I've seriously had issues with the stuff for at least 3 months. However, I'm just going to go with the flow and see if I can now implement this stuff in my own application now and will let you know how that goes.
A quick question - do you have any suggestions as to how to view the data files properly? I believe they come out as binary, but look like mumbo-jumbo when viewed in a text editor like WordPad. Thanks!
Attachments:
3Jun09 Files.zip ‏2 KB

How to search a word in a 2d array

Hi, i'm seeking advice on how to search a word in 2d array. The method will only taking one argument string and will search in row by row, column by column and diagonall down and up. for example, user input String "SEEK" or then the method will have different search pattern to locate the word. Here is the 2d array look like.
S + K E E S + +
E + + + + + + K
E S + + + + + E
K + E + + + + E
+ + + E + + + S
+ + + + K + + +
What i've done so far is;
// this loop is for search SEEK column by column
public boolean finder(String w){
for(int j = 0; j < puzzle[0].length; j++) {
for(int a = 0; a < w.length(); a++) {
char n = w.charAt(a);
String r = String.valueOf(n);
if (puzzle[0][j] != w.charAt(a)) {
return false
} else {
return true;

read this

Check variable against an array of words

Hi,
I wish to check a variable for a number of words that are in
a array.
Not sure if this is the best way to do it, but this is what i
have.
I have my own counter system that counts every visitor, but
some of these visits are from BOTS, spiders..
So i wish to have a method of searching the HTTP_USER_AGENT
for certain words i put in a array.
What i am after is how i get the words in an array and how i
then get the script to check the HTTP_USER_AGENT for a word in the
array and if so it will not complete the script. (not add to the
counter)
if none of the words are in the HTTP_USER_AGENT then it will
add to the counter.
so something like?
<?
// do array
// check if HTTP_USER_AGENT contains a word from array
if () {
// increase counter if none of the words are in
HTTP_USER_AGENT
include(increase.php);
?>
its the bit between the if () that i have no idea about, any
help would be great.
cheers in advance for your help.
Jason

not very clever wrote:
> this is a bit more about what i am trying to do.
>
> <?
> // do array
> array(1)="something";
> array(2)="something else";
> array(3)=..
> ..
> ..
>
>
> $HTTP_USER_AGENT = contants of the HTTP_USER_AGENT
> // check if HTTP_USER_AGENT contains a word from array
> if (array(x) is in the string $HTTP_USER_AGENT) {
> // increase counter if none of the words are in
HTTP_USER_AGENT
> include(increase.php);
> }
>
> ?>
>
>
$myArray = array('blip','blop','glup',...);
$counter = 0;
foreach($myArray as $mA){
if(preg_match('/'.$mA.'/',$HTTP_USER_AGENT)){
$counter++;
seb ( [email protected])
http://webtrans1.com | high-end web
design
Downloads: Slide Show, Directory Browser, Mailing List

Working with word arrays in a game

In my spelling game, I have arrays of words that is added to a text field one at a time (through a loop). They are also split into letters so that the player can click on a corresponding letter tile to copy the word. The active letter would be 100% visible (alpha setting )and the other letters would be set to 80%.
Splitting each word works well it you just want the entire word broken into individual letters, BUT I want my game to be phonics based - so sometimes the sound in a word will have more than one letter e.g. for the word "elephant" the array would be: activeWord:Array = ["e","l","e","ph","a","nt"] and there would of cause be letter tiles with the sound -ph- and -nt- on them to click on too.
I guess this is where arrays within arrays gets the job done? I have 10 words per level and 30 levels. I will break each word into it's sounds and hardcode each word like I did elephant above.
How do I rewrite the loop below to accomodate the 10 word loop within a level. After each level I want a score to appear with the option to click next for the next level.
public var wordsL1:Array = ["elephant","has","of","off","on","not","got","in","is","it"];
                private var tf:TextField;
                public var letterArray:LetterArray;
                public var tileTimer = new Timer(500,384);
                // ***constructor code
                public function WordArray(_tf:TextField)
                    tf = _tf;
                    nextWordF();
                    //**Run letter Tiles Start**//
                    letterArray = new LetterArray();
                    addChild(letterArray);
                    tileTimer.addEventListener(TimerEvent.TIMER, gameLoop);
                    tileTimer.start();
                    public function gameLoop(timerEvent:TimerEvent):void
                        trace("Tile Timer Started");
                        letterArray.gameLoop();
                    //**end**//
                function nextWordF():void
                    if(wordsL1.length>0)
                        activeWordF();
                        populateMyWordBox();
                    else
                            //quiz is complete
                    private function activeWordF():void
                        activeWordArray = wordsL1.shift().split("");
                         // this array needs to be passed to the class that checks which letters are clicked (or used in this class if that's where the clicked letters are handled) so the clicked letters                               can be compared to activeWordArray's elements.
                        // when the clicked letters are completed for this word, call nextWordF().

There's always a better way to do things but ultimately it comes down to if what you're doing works for your audience. If it does, the majority would say you did it correct. After you did it correctly you can spend time optimizing it however you like. If you get down to those specific questions be sure to provide a sample and some code that you think needs optimization and I'm sure we'll be able to help. You're welcome and good luck!

Sentence input to array of words

I'm supposed to read an input of a sentence from the user, and then use an array to view each word separately....I'm getting an out of bounds error for the following two lines and can't figure out why or how to fix it....any help would be greatly appreciated....
import java.util.Scanner;
public class Project7A2
     public static void main(String[] args)
          String sentence, words[], result[];
          Scanner scan = new Scanner (System.in);
          System.out.print("Please enter a sentence: ");
          sentence = scan.nextLine();
          words = methods.translate (sentence);
          System.out.println(words);
import java.util.Scanner;
public class methods
public static String[] translate (String sentence)
          String temp;
          String methods[] = new String[10];
          int i=0;
          Scanner scan = new Scanner (sentence);
          temp = scan.next();
          do
               methods[i] = temp;
               i++;
          while (scan.hasNext());
          return methods;
}

I'm going to take a guess here and let me know if I'm way off base...instead of translating the sentence into an array of words should I translate the sentence into individual words and then use a loop (in the main program or a separate method) to assign each word to an array index?

Remove words from file

Hello, I have created a class which is supposed to be an array of stopwords (words that I want to remove from a file).
Then I want to create another class which reads in a file. It reads the file. Then it looks through the array of stopwords. If it encounters a word in the file which is the same as the word in the array, it replaces it with nothing.
I want this class to be separate from the main class so that in the main class,I can specify any file, and the stopwords will be removed. Here is some code, thanks
import java.io.*;
import java.util.*;
public class StopWordArray {
     //This class represents an array of stopwords
     //The stopwords are read from a text file into an array
     private String [] tokens;
     //constructor
    public StopWordArray(){
         try{
//         open input stream
         File inputFile = new File("/home/myrmen/workspace/Chisquare/extract/stopWordList.txt");
         InputStream inStream = new FileInputStream(inputFile);
         InputStreamReader inreader = new InputStreamReader(inStream, "8859_1");
         BufferedReader reader = new BufferedReader(inreader);
        String line;
        //Fills array
        while ((line = reader.readLine()) != null) {
        StringTokenizer st1 = new StringTokenizer(line);
        int numberOfElements = st1.countTokens();
         tokens = new String[ numberOfElements ];
        int index = 0;
         while( st1.hasMoreTokens() )
           String element = st1.nextToken();
         tokens[ index ] = element;
                   index ++;
        reader.close();
     catch (Exception ex) { ex.printStackTrace(); }
import java.io.*;
import java.util.StringTokenizer;
public class RemoveStop {
     //Fields
     private StopWordArray myArray = new StopWordArray();
    private String myString;
     //Constructor
    public RemoveStop(String myString){
import java.io.*;
public class Main {
     public static void main(String[] args) {
          StopWordArray theWords = new StopWordArray();
        theWords.printArray();
        String file = "/home/myrmen/workspace/Chisquare/extract/Turing";
        RemoveStop remove = new RemoveStop(file);
}

Ok, here is an update:
private String [] tokens;
   //Method which returns each element in the array as a string
    public String word()
    String word = null;
    for(int i = 0; i < tokens.length; i++)
    word = tokens.toString();
return word;
public void readFile(){
String output = null;
StringTokenizer st1 = new StringTokenizer(aString);
while(st1.hasMoreTokens())
String element = st1.nextToken();
//System.out.println(myArray.word());
if(element.equals(myArray.word()))
output = element.replaceAll(myArray.word(), "WAY");
//else{System.out.println("ERROR");
System.out.println(output);
But with the readFile() method, I only access the LAST element of the array. How can I iterate through the whole array, and search for the words that are stored in the array in the input file?

How to create a dll in LabVIEW with a 2D array

I'm attempting to create a dll in LabVIEW with the following parameters from Test DLL.vi:
Inputs:
IN1 - Word
Buffer - 2D array of Unsigned Byte
Output:
OUT1 - Unsigned Byte
The prototype is constructed as follows in the Build Specifications of the Project:
uint8_t TestDLL(int16_t IN1, TD1Hdl *Buffer)
The dll builds successfully but when I attempt to use it in another VI (using the Call Library Function block) the prototype appears but it does not look like what was defined from the Build Specifications. Instead it looks like the following:
void TestDll(void );
I attached some screen shots of all the settings as described above.
Attachments:
Test DLL Front Panel.JPG ‏85 KB
DLL Prototype Before.JPG ‏84 KB
DLL Prototype After.JPG ‏54 KB

The Test DLL.vi is what I used to create dll prototype with in the Build Specifications in the project.
Note: There is no logic implemented yet.
Attachments:
Test DLL.vi ‏7 KB

Searching for an entry in a file that contains 2 words or more...

Hey :)
I created a Binary Search Tree that would hold a list of words located in a .txt file. So, basically, the objective of the program is to search through a typed up document for the words in the search tree, and if the word is found, return it to the user to see.
I have that part working, but what I'm having trouble with is one of the entries in the file. The entry is "data structure." All the other entries are 1 word, like queue, depth-first, etc...but this one is 2 words. I'm having trouble making it so that the search will detect the 2-word entry, "data structure." How do I go about searching for entries that are 2 or more words in length?
I have been struggling with this for some time, and I don't know if it's just me, but I'd really like to get this done since this is the only thing I'm having trouble with right now. I thought I could figure this out, but I'm just putting too much time into it, and I need to submit this tomorrow.
Any help would really be appreciated! :)
Take care,
Alex

Yea, I was thinking of doing that myself. Turning the two words into one word, so it'll end up like, "datastructure," but how do I do that? Would I use the substring method? Or is there something else that I can use to get rid of whitespace. I'll look that up now on google or something, but in the meantime, if anyone can help me out with this, it would be great.
Just for a reminder, this is my problem :: I need to be able to locate an entry in my document that has 2 words in it. In this case, the entry is, "data structure." How can I go about searching for this 2 word entry? It seems to be a bit more complex than merely searching for one word. Any help you can provide me would be great! :)
Here's the code for the Binary Search Tree:
import java.io.*;
import java.util.*;
public class KeywordBinarySearchTree
     BinaryNode root;
     //static String[] docWords; // captures each of the words into an array while ignoring punctuation
     public KeywordBinarySearchTree()
          root = null;
     public void preOrderTraversal()
          preOrderTraversal(root);
     public void inOrderTraversal()
          inOrderTraversal(root);
     public Comparable findNode(Comparable node)
          return dataOfNode(findNode(node, root));
     public Comparable dataOfNode(BinaryNode node)
          if (node == null)
               return null;
          else
               return node.nodeData;
     public BinaryNode insertInOrder(Comparable iNodeData)
          BinaryNode nodeWalker;   // used to walk through each of the nodes until the appropriate spot
                                        // is found to insert the node of data
          BinaryNode parentNode = new BinaryNode(iNodeData); // represents the new root node after each pass through the tree
          if (root == null) // if it's a brand new tree with no nodes, then insert the new root of the tree
               root = new BinaryNode(iNodeData);
          else
               nodeWalker = root; // sets current root of tree to nodeWalker
               while (nodeWalker != null) // will start its first iteration of the loop at the top of the tree
                    parentNode = nodeWalker;
                    if (iNodeData.compareTo(nodeWalker.nodeData) < 0) // if the data to be inserted is less than the current
                                                                                   // node in the tree
                         nodeWalker = nodeWalker.leftChild;                  // set nodeWalker to the left child of that node
                         System.out.println("INSERT NODE: LEFT CHILD");
                    else
                         nodeWalker = nodeWalker.rightChild;                 // otherwise, set nodeWalker to the right child of that node
                         System.out.println("INSERT NODE: RIGHT CHILD");
               } // this loop will determine where the node has to travel to get to the appropriate destination. once the nodeWalker
                 // has reached its final stop, the while loop exits into the statements below to insert the new node of data
               if (iNodeData.compareTo(parentNode.nodeData) < 0)
                    parentNode.leftChild = new BinaryNode(iNodeData);
                    System.out.println("INSERT NODE: PARENT NODE LEFT CHILD");
               else
                    parentNode.rightChild = new BinaryNode(iNodeData);
                    System.out.println("INSERT NODE: PARENT NODE RIGHT CHILD");
          return parentNode;
     public BinaryNode findNode(Comparable searchNode, BinaryNode bn)
          if (bn == null)
               return null;
          else
               while (bn != null)
                    if (searchNode.compareTo(bn.nodeData) < 0)
                         bn = bn.leftChild;
                         //System.out.println("FIND NODE: LEFT CHILD DETECTED");
                    else if (searchNode.compareTo(bn.nodeData) > 0)
                         bn = bn.rightChild;
                         //System.out.println("FIND NODE: RIGHT CHILD DETECTED");
                    else // word has been spotted in the tree!
                         System.out.println(bn.nodeData);
                         return bn;
          return null;
     public void preOrderTraversal(BinaryNode bn)
          if (bn == null)
               return;
          System.out.println(bn.nodeData);
          preOrderTraversal(bn.leftChild);
          preOrderTraversal(bn.rightChild);
     public void inOrderTraversal(BinaryNode bn)
          if (bn == null)
               return;
          inOrderTraversal(bn.leftChild);
          System.out.println(bn.nodeData);
          inOrderTraversal(bn.rightChild);
// and then the code after this is the public static void main code, which I posted snippets of above.

Passing array of objects from java to oracle.

Hi,
We have the following structure in oracle.
We have a nested table type of varchar2(50).
type var_tab is table of varchar2(50);
We have one object type with one member as varchar2 and another one as var_tab type.
type attribute_obj is object(
attrib_name varchar2(100)
,attrib_val var_tab
Then we have table type of that object type,
type table_tab is table of attribute_obj;
Then we have one object type with one member as varchar2,another member as integer and another one as table_tab type.
type prod_obj is object(
pr_name varchar2(100), tb_flag integer
,pr_attrib table_tab
Then we have table type of this object type,
type prod_tab as table of prod_obj;
So, the total structure is something like this;
'OS','OS_NAME', 'Windows'
'Linux'
'UNIX'
'OS_VERSION','XP'
'RED HAT'
'SOLARIS'
so, basically we have
x prod_tab:=prod_tab();
x(3):=prod_obj('OS',0,table_tab(attribute_obj('OS_NAME',var_tab('Windows','Linux','UNIX')),attribute_obj('OS_VERSION','XP','RED HAT','SOLARIS'))));
And this how we call the procedure ---
all_prod_comb_pkg.sp_main(x)
The procedure deifinition is -
procedure sp_main ( p_prod_arr prod_tab);
Please suggest a way so that we can implement the same structure in Java and then call the procedure using that array of objects.
regards,
Dipankar.

Dipankar,
There's a separate example of how to map Oracle OBJECTs to JDBC STRUCTs.
Study that one and combine the two. Not difficult (in my opinion :-)
Or search the JDBC forum for the words "STRUCT" and "ARRAY".
(What, you want me to do your coding for you?)
Good Luck,
Avi.

Increasing size of array

is there anyway to increase the size of the array without losing previous information
for example
//String[] words = new String[2];
//words[0] = "Hello";
//words[1] = "Byes";
if i do this
//words = new String[3];
//words[2] = "goodbye";
then the previous two will be lost... is there anyway to go around this... thank you

Option A: use a Vector
Option B: do like Vector does (look at the source to Vector)String[] words = new String[2];
words[0] = "Hello";
words[1] = "Byes";
String tmp = new String[3]     // make a new array
for (int x=0; x<words.length; x++) tmp[x]=words[x]; // copy all old to new array
words = tmp;                   // point variable words to new array
words[3]="goodbye";            // fill last elementVector does this a lot more efficiently than this.

How To Read/Modify/Write Array?

Ive got a bunch of switches, where each switch represents a bit in a
word...
So from each switch, in the control panel, it goes throu a boolean to
integer vi, and then to a x*2^n vi.
I then set a constant for each n.. so that if the switch is true (x=1
after the conversion) and n = 5 for that switch,
then the output will be 1 * 2^5.
Finally, I add all 16 outputs together (x*2^0 to x*2^15) to create a
word.. I actually have so many switches
that I have a couple of words (each made up with the above scheme)!
So far, this works fine, however, my question is, I would like to have
a global array that contains these words. I
dont want to insert this word into the array, but rather, I'd like to
sort of latch the values...
If in the array's word, the n bit was already one (i.e. that switch at
one point was on), then I dont want to reset it
to 0, even though the switch is off now.
This probably sounds confusing, I know I am confused just reading that
back, anyhoot, if I could make a global
array (ten 16-bit unsigned words), that I can read any word from,
modify it and set it back to its same place,
that would be great!

Hi Anonoymous
Here's one quick example that does what you want, it functions like a function global and relies on boolean logic.
For your own experience I challenge you how to reset just one bit or word.
Also you have to connect the connector pane.
Ton
Free Code Capture Tool! Version 2.1.3 with comments, web-upload, back-save and snippets!
Nederlandse LabVIEW user groep www.lvug.nl
My LabVIEW Ideas
LabVIEW, programming like it should be!
Attachments:
quickbitregister.vi ‏20 KB

Repeatabil​ity of words in an array

Similar Messages

Maybe you are looking for

Repeatability of words in an array