Searching the no of occurences of String in a file

Hi,
I want to count the no of times the string occurs in a specific file. I will get the string from the user. How do i do that.

FileInputStream fis = new FileInputStream(Pass on the fle name here);
DataInputStream dis = new DataInputStream(fid);
String line = dis.readLine();
StringTokenizer token = new StringTokenizer(line);
token.nextToken()
StringTokenizer breakes the string and stores it as word by word. So we can get the string word by word token.nextToken()
This method will return the string value for each and every word so check weather the word or the string u search for is present in the token.nextToken() or not

Similar Messages

How can I search the tree with a given string?

How can I search the tree with a given string?
I don't find any function like "search(...)".
I want to find the tree nodes which include the given string.
Thanks.

Try it with .com instead of .ca - fixes it for me (corporate firewall blocks .ca here)
http://spendolini.blogspot.com/2013/09/working-with-apex-tree.html
Anyway - it links to an article of mine which describes interacting with the tree: Tom's Blog: Working with the tree in Apex. There is also a demo application on apex.oracle.com: http://apex.oracle.com/pls/apex/f?p=54687:38

Fastest way to count the number of occurences of string in file

I have an application that will process a number of records in a plain text file, and the processing takes a long time. Therefore, I'd like to first calculate the number of records in the file so that I can display a progress dialog to the user (e.g. " 1234 out of 5678 records processed"). The records are separated by the string "//" followed by a newline, so all I need to do to get the number of records is to count the number of times that '//' occurs in the file. What's the quickest way to do this? On a test file of ~1.5 Gb with ~500 000 records, grep manages under 5 seconds, whereas a naive Java approach:
BufferedReader bout = new BufferedReader (new FileReader (sourcefile));
               String ffline = null;
               int lcnt = 0;
               int searchCount = 0;
               while ((ffline = bout.readLine()) != null) {
                    lcnt++;
                    for(int searchIndex=0;searchIndex<ffline.length();) {
                         int index=ffline.indexOf(searchFor,searchIndex);
                         if(index!=-1) {
                              //System.out.println("Line number " + lcnt);
                              searchCount++;
                              searchIndex+=index+searchLength;
                         } else {
                              break;
               }takes about 10 times as long:
martin@martin-laptop:~$ time grep -c '//' Desktop/moresequences.gb
544064
real     0m4.449s
user     0m3.880s
sys     0m0.544s
martin@martin-laptop:~$ time java WordCounter Desktop/moresequences.gb
SearchCount = 544064
real     0m42.719s
user     0m40.843s
sys     0m1.232sI suspect that dealing with the file as a whole, rather than line-by-line, might be quicker, based on previous experience with Perl.

Reading lines is very slow. If your file has single byte character encoding then use something like the KMP algorithm on an BufferedInputStream to find the byte sequence of "//\n".getBytes(). If the file has a multi-byte encoding then use the KMP algorithm on a BufferedReader to find the chars "//\n".getCharacters() .
The basis for this can be found in reply #12 of http://forum.java.sun.com/thread.jspa?threadID=769325&messageID=4386201 .
Edited by: sabre150 on May 2, 2008 2:10 PM

How to find the number of occurence of a string

String str="The AR tech seeks experienced candidates in java,jsp. The candidates should have atleast 1 year of experience in the specified skills.";
here i need to find the number of occurence of the string "experience".
how to find it out?

String str="The AR tech seeks experienced candidates in java,jsp. The candidates should have atleast 1 year of experience in the specified skills.";
String findStr = "experience";
int count = 0;
int index = 0;
while(index != -1) {
index = str.indexOf(findStr, (count == 0 ? 0 : index + findStr.length()));
if(index != -1) {
count++;

I need to WAP to count the number of occurences of an alphabet in a string.

I need to WAP to count the number of occurences of an alphabet in a string.I tried a lot and have surfed a lot regarding this problem.
I m not the most proficient with java.but this is all i could come up with,and would appreciate some help here.I hope you guys would help me find a solution to this.
e.g String : abcabrty
Result should be
a:2
b:2
c:1
r:1
t:1
y:1
public class chkoccurences
     public static void main(String args[ ])
          String user_Data=args[0];
          int counter=0;
          try
               for(int i=0;i<user_Data.length( );i++)
                    for(int j=0;j<user_Data.length( );j++)
                         if(user_Data.charAt(i) == user_Data.charAt(j))
                         counter++;
                    System.out.println(user_Data.charAt(i)+" exists "+counter+" time(s) in the word.");
               System.out.println(" ");
          catch(ArrayIndexOutOfBoundsException e)
               System.out.println("Check the array size.");
}This is the output i get out of the program:
a exists 2 time(s) in the word.
b exists 4 time(s) in the word.
c exists 5 time(s) in the word.
a exists 7 time(s) in the word.
b exists 9 time(s) in the word.
r exists 10 time(s) in the word.
t exists 11 time(s) in the word.
y exists 12 time(s) in the word.What i think is i need an array to store the repeated characters because the repeated characters are getting counted again in the loop,if you know what i mean.
Please, i would appreciate some help here.

Criticism is welcomed
public class tests {
     final int min = 10;
     final int max = 35;
     final char[] chars = new char[] {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h',
               'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u',
               'v', 'w', 'x', 'y', 'z'};
     public static void main(String[] args){
          tests t = new tests();
          String[] strings = new String[] {"aabcze", "att3%a", ""};
          for(String s : strings){
               System.out.println(t.getAlphaCount(s));
     public String getAlphaCount(String s){
          int[] alphaCount = new int[26];
          int val;
          for(char c : s.toCharArray()){
               val = Character.getNumericValue(c);
               if( (val>=min) && (val<=max)){
                    alphaCount[val-min]++;
          StringBuilder result = new StringBuilder();
          for(int i=0; i<alphaCount.length; i++){
               if(alphaCount[i] > 0){
                    result.append(chars[i] + ":" + alphaCount[i] + ", ");
          if(result.length() != 0){
               result.delete(result.length()-2, result.length());
          return result.toString();
}

Searching for a substring within a string

can someone reccomend a simple way to search for a substring within a string and count the number occurences of that substring.
The substring and the string will be provided as command line parameters.
Thanks
gg

A simple way would be to use the indexOf methods in String:
http://java.sun.com/j2se/1.5.0/docs/api/java/lang/String.html
Not sure what this has to do with event handling though :-P

How to count the number of occurences of a character

hi
wat command is used to count the number of occurences of a charcter in a line?
i have to count the number of '.' in a line

FIND
Searches for patterns.
Syntax
FIND <p> IN [SECTION OFFSET <off> LENGTH <len> OF] <text>
            [IGNORING CASE|RESPECTING CASE]
            [IN BYTE MODE|IN CHARACTER MODE]
            [MATCH OFFSET <o>] [MATCH LENGTH <l>].
The system searches the field <text> for the pattern <p>. The SECTION OFFSET <off> LENGTH <len> OF addition tells the system to search only from the <off> position in the length <len>. IGNORING CASE or RESPECTING CASE (default) specifies whether the search is to be case-sensitive. In Unicode programs, you must specify whether the statement is a character or byte operation, using the IN BYTE MODE or IN CHARACTER MODE (default) additions. The MATCH OFFSET and MATCH LENGTH additions set the offset of the first occurrence and length of the search string in the fields <p> and <l>.

How to search a special string in txt file and return it's position in txt file?

How to search a special string in txt file and return it's position in txt file?

I just posted a solution for a similar question here: http://forums.ni.com/ni/board/message?board.id=170&view=by_date_ascending&message.id=362699#M362699
The top portion can search for the location of a string, while the bottom portion is to locate the position of a character. Both can search for a character.
The position of the character within the file is displayed in the indicator(s).
R

Search and replace strings in a file while ignoring substrings

Hi:
I have a java program that searches and replaces strings in a file. It makes a new copy of the file, searches for a string in the copy, replaces the string and renames the new copy to the original file, thereafter deleting the copy.
Now searching for "abcd", for eg works fine, but searching for "Topabcd" and replacing it doesnot work because there is a match for "abcd" in a different search scenario. How can I modify the code such that if "abcd" is already searched and replaced then it should not be searched for again or rather search for "abcd" as entire string and not if its a substring of another string.
In the below code output, all instances of "abcd" and the ones of "Topabcd" are replaced by ABCDEFG and TopABCDEF respectively, whereas according to the desired output, "abcd" should be replaced by ABCDEFG and "Topabcd" should be replaced by REPLACEMEFIRST.
try
          String find_productstring = "abcd";
          String replacement_productstring = "ABCDEFG";
          compsXml = new FileReader(compsLoc);
          compsConfigFile = new BufferedReader(compsXml);
          File compsFile =new File("file.xml");
          File compsNewFile =new File("file1.xml");
          BufferedWriter out =new BufferedWriter(new FileWriter("file1.xml"));
          while ((compsLine = compsConfigFile.readLine()) != null)
                new_compsLine =compsLine.replaceFirst(find_productstring, replacement_productstring);
                out.write(new_compsLine);
                out.write("\n");
            out.close();
            compsConfigFile.close();
            compsFile.delete();
            compsNewFile.renameTo(compsFile);
        catch (IOException e)
        //since "Topabcd" contains "abcd", which is the search above and hence the string "Topabcd" is not replaced correctly
         try
               String find_producttopstring = "Topabcd";
               String replacement_producttopstring = "REPLACEMEFIRST";
               compsXml = new FileReader(compsLoc);
               compsConfigFile = new BufferedReader(compsXml);
               File compsFile =new File("file.xml");
               File compsNewFile =new File("file1.xml");
               BufferedWriter out =new BufferedWriter(new FileWriter("file1.xml"));
               while ((compsLine = compsConfigFile.readLine()) != null)
                     new_compsLine =compsLine.replaceFirst(find_producttopstring, replacement_producttopstring);
                     out.write(new_compsLine);
                     out.write("\n");
                 out.close();
                 compsConfigFile.close();
                 compsFile.delete();
                 compsNewFile.renameTo(compsFile);
             catch (IOException e)
        }Thanks a lot!

Hi:
I have a java program that searches and replaces
strings in a file. It makes a new copy of the file,
searches for a string in the copy, replaces the
string and renames the new copy to the original file,
thereafter deleting the copy.
Now searching for "abcd", for eg works fine, but
searching for "Topabcd" and replacing it doesnot work
because there is a match for "abcd" in a different
search scenario. How can I modify the code such that
if "abcd" is already searched and replaced then it
should not be searched for again or rather search for
"abcd" as entire string and not if its a substring of
another string.
In the below code output, all instances of "abcd" and
the ones of "Topabcd" are replaced by ABCDEFG and
TopABCDEF respectively, whereas according to the
desired output, "abcd" should be replaced by ABCDEFG
and "Topabcd" should be replaced by REPLACEMEFIRST.
try
String find_productstring = "abcd";
String replacement_productstring = "ABCDEFG";
compsXml = new FileReader(compsLoc);
compsConfigFile = new
BufferedReader(compsXml);
File compsFile =new File("file.xml");
File compsNewFile =new File("file1.xml");
BufferedWriter out =new BufferedWriter(new
FileWriter("file1.xml"));
while ((compsLine =
compsConfigFile.readLine()) != null)
new_compsLine
=compsLine.replaceFirst(find_productstring,
replacement_productstring);
out.write(new_compsLine);
out.write("\n");
out.close();
compsConfigFile.close();
compsFile.delete();
compsNewFile.renameTo(compsFile);
catch (IOException e)
//since "Topabcd" contains "abcd", which is
the search above and hence the string "Topabcd" is
not replaced correctly
try
               String find_producttopstring = "Topabcd";
String replacement_producttopstring =
topstring = "REPLACEMEFIRST";
               compsXml = new FileReader(compsLoc);
compsConfigFile = new
gFile = new BufferedReader(compsXml);
               File compsFile =new File("file.xml");
               File compsNewFile =new File("file1.xml");
BufferedWriter out =new BufferedWriter(new
dWriter(new FileWriter("file1.xml"));
while ((compsLine =
compsLine = compsConfigFile.readLine()) != null)
new_compsLine
new_compsLine
=compsLine.replaceFirst(find_producttopstring,
replacement_producttopstring);
out.write(new_compsLine);
out.write("\n");
out.close();
compsConfigFile.close();
compsFile.delete();
compsNewFile.renameTo(compsFile);
             catch (IOException e)
Thanks a lot!I tried the matches(...) method but it doesnt seem to work.
while ((compsLine = compsConfigFile.readLine()) != null)
if(compsLine.matches(find_productstring))
     System.out.println("Exact match is found for abcd");
     new_compsLine =compsLine.replaceFirst(find_productstring, replacement_productstring);
out.write(new_compsLine);
out.write("\n");
     else
     System.out.println("Exact match is not found for abcd");
     out.write(compsLine);
     out.write("\n");

Can I search the current set path in a script?

I have on my machine a folder full of mathscript commands and functions. This folder is beginning to get quite large and I'd like to be able to clean it up a bit by grouping the files into sub-folders.  For example, I'd like to create the following folders;
C:\MatrixXTools
C:\MatrixXTools\StringTools
C:\MatrixXTools\VariableTools
Of course, this would be fine if I was to set the path to every folder individually. What I want to do though, is to set my path manually to C:\MatrixXTools and then put a command in there called 'import'. The 'import' command would be responsible for searching the current path for a given folder and then adding it to the path when it finds it. So to import the StringTools, I would just call
import "StringTools"
All of my base scripts would go into C:/MatrixXTools and then if a script needed to use the StringTools, I could just call the import function.
The problem I have is that I can't find a command that will return me the path into a string vector. Is there some way of doing this? 'SHOW PATH' doesn't do what I want it to because it just shows the path and doesn't give me a way of programmatically viewing it.
Is there a better method of getting everything into sub-folders all together?
I realise that I could also do this using the startup script, however I have the tools in revision control (svn) so that other people can use them - I don't want to have to get everyone to change their startup script every time I make a new folder - I should be able to do this in the scripts.
Note: we are still on v62.2 and we are looking into upgrade options.
Solved!
Go to Solution.

You can get the show path output into a string using === operator.
   [showPathStr,] === show path;
You can break up the showPathStr on the new line characters
into a string vector using the split function.
The split function was added in MATRIXx 7.1.9. The split function internally
uses the index and stringex functions to create the split string vector.
   showPathVector = split(""n",showPathStr);
If you try out the split function and look at the algorithm you will need to
download and eval MATRIXx 7.1.9 or higher.
Also, instead of changing startup.ms everytime you add a tools directory, why not
have startup.ms execute another script (i.e. execute file = toolsetup.ms) and you
would only update toolsetup.ms when adding a new tools directory.

How to search for upper/lower case using string using JAVA!!!?

-I am trying to write a program that will examine each letter in the string and count how many time the upper-case letter 'E' appears, and how many times the lower-case letter 'e' appears.
-I also have to use a JOptionPane.showMessageDialog() to tell the user how many upper and lower case e's were in the string.
-This will be repeated until the user types the word "Stop".
please help if you can
what i have so far:
[code]
public class Project0 {
public static void main(String[] args) {
String[] uppercase = {'E'};
String[] lowercase = {'e'};
String isOrIsNot, inputWord;
while (true) {
   // This line asks the user for input by popping out a single window
   // with text input
   inputWord = JOptionPane.showInputDialog(null, "Please enter a sentence");
   if ( inputWord.equals("stop") )
    System.exit(0);
   // if the inputWord is contained within uppercase or
   // lowercase return true
   if (wordIsThere(inputWord, lowercase))
    isOrIsNot = "Number of lower case e's: ";
   if (wordIsThere(inputword, uppercase))
     isOrIsNot = "number of upper case e's: ";
   // Output to a JOptionPane window whether the word is on the list or not
   JOptionPane.showMessageDialog(null, "The word " + inputWord + " " + isOrIsNot + " on the list.");
} //main
public static boolean wordIsThere(String findMe, String[] theList) {
for (int i=0; i<theList.length; ++i) {
   if (findMe.equals(theList[i])) return true;
return false;
} // wordIsThere
} // class Lab4Program1
[/code]

So what is your question? Do you get any errors? If so, post them. What doesn't work?
And crossposted: how to search for upper/lower case using string using JAVA!!!?

How to search specific text/string in pdf files from command prompt?

Hi,
How to search specific text/string in pdf files from command prompt?
Will be great if you can refer to any adobe provided command base utility to achieve the above target.
Best Regards,

You can't. The commandline parameters for Acrobat and Adobe Reader do not allow any type of commands to be run.

How to search for perticular substring in given string.

Hi, Can any one tell me how to search for perticular substring in given string.
example:
I have to search for CA in given Order type it may be CA10 or CA15. Please Do the needful.

Hi Aniruddha,
check this...
Data var string,
var = 'India'.
search var for 'Ind'.
if sy-subrc = 0. " var having ind
Message 'Ind found' type 'I'.
else . "var not having ind
Message 'Ind not Found' type 'I'.
endif.
thanx
bgan.

Searching for a string within a file

In control panel \ folder options \ search tab I've selected "always search file names and conents (this might take several minutes). and under "how to search" I have checked all 4 boxes. Yet, when I search a folder
and all sub-folders for a file containing a string Windows 7 finds nothing. in XP this worked perfectly. How do you search like this in Windows 7? I actually had to write a PowerShell script that does the search for me and I thought Windows
7 could do this by default but I guess not?!?!?
mqh7

Hello mqh7.
You can use the find command from the Windows 7 command prompt window.
Open a command prompt window and run find /? to have more informations about the command syntax or read the command documentation available
here in TechNet Library.
Bye.
Luigi Bruno
MCP, MCTS, MOS, MTA

Is there any vi or possibility to find the hole dates in an directory and to list the data-pfads as a string?

is there any vi or possibility to find the hole dates in an directory and to list the data-pfads as a string?
like in windows a search-funtion?
I have found one VI, it list the data in the directory self (the pfad from the data as string) but not the data in an under-directory. it also has the funktion to list me the under-directory but it do not list the complite data in every directory
can somebody help me pleace
THX

Hallo Chef,
unter LV8.21 befindet sich die beschriebene Funktion in der File-Palette:
Dummerweise gibt es die Funktion in LV8 noch nicht... (Deshalb ist es immer eine gute Idee zu sagen, mit welcher LV-Verson man arbeitet!)
Du kannst aber unter vi.lib/utility/RecursiveDirList.llb nachschauen, wie es gemacht wird
Message Edited by GerdW on 08-17-2007 11:17 AM
Best regards,
GerdW
CLAD, using 2009SP1 + LV2011SP1 + LV2014SP1 on WinXP+Win7+cRIO
Kudos are welcome
Attachments:
AdvFileFunc.png ‏10 KB

Searching the no of occurences of String in a file

Similar Messages

Maybe you are looking for