How do I search for a word through multiple files in my directories ??

Hello everyone
How do I search for a word through multiple files in my directories ??
I am guessing one tedious way to do it would be to pass all the file names as command line arguments but I"m sure there exist a much easier and faster way to do it.
Thanks a lot

You need to pass only the directory name as parameter and then retrieve the files(recursively throug subdirs or not, however you wish) of that directory.
There were at least 2 threads yesterday on how to retrieve files from directory, and there are many others in the archive so I leave the search part to you ;)
HTH
Mike

Similar Messages

Will not search for a word in pdf file. Using Windows 7

Like most I have used Acrobat reader for viewing PDF files for years. I recently upgraded to Windows 7 from XP. I have tried to search a PDF file for a word and it always comes up with none found even though I search for a word that is displayed in the document I'm looking at. Any advice?
Regards,
Dwight

If the PDF is not a scanned image, can you share it with us: https://forums.adobe.com/thread/1070933

How do I search for adjacent words within MS WORD?

I am new to Mac. I need to search WITHIN MS Word Documents for specific phrases. Example: Jim is a good boy. Spotlight will find all documents containing those 5 words, but not those 5 words together. There has to be a way...
MacBook Mac OS X (10.4.8)

First, thanks, I did. My naive take is that new plug-ins wouldn't be required.
Second - I don't know about Google finding every document, but it returns some pretty impressive results, and fast (so long as Google indexes the page in the first place of course). You've never used this feature? I do it all the time when I want to see if there's an internet version of a document I have in my hand.
Here's a random example the feature in action - I went to boingboing.net and snagged a phrase from the October archives: "You should give props to BabyStyle.com for the blue octopus costume". Here's the link to the October page:
http://boingboing.net/200610_01archive.html
and here's the link to the successful Google search:
http://www.google.com/search?num=50&hl=en&lr=&safe=off&c2coff=1&client=firefox-a &rls=org.mozilla%3Aen-US%3Aofficial&q=%22Youshould+give+props+to+BabyStyle.com+for+the+blue+octopuscostume%22&btnG=Search
Pretty impressive - the internet is a big place!
Thirdly, there was a program written for OS 9 called "Gopher" that did just that. It was pretty handy. Come to think of it, it may have been written for System 8! It vanished from publication before there was even a web for it to be distributed on, and when I switched to OS X, it wasn't working well under 9. Of course outside of the personal computing realm, there are well known database programs like Lexis and Nexis that perform exact phrase searches on their databases, which are pretty extensive (at least as large as most document collections on most personal computers, I'd venture). In fact if you've never used those programs they have some pretty powerful functions, like searching for any occurrence of a word within so many words of a second target word.
I'll give you a couple of examples of where phrase searching might come in handy. Suppose I have a collection of e-mails or correspondence (I guess we all do) and I want to find the one in which I facetiously repeated the punchline to the chicken joke - "to get to the other side". (You have to grant I might have a reason for wanting this particular e-mail, okay?) Of course if I search on "get", "other" and "side" I may wind up with four or five hundred results; those are pretty common words. That doesn't help me much. A phrase search,however, will yield, I dunno, three or four documents. Bingo.
Or, here. I work in an office creating documents all day long. I've been working in this office, on PCs, for 16 years. That's a lot of documents. I may create three dozen or more on a single subject. The documents are all on the same subject and all pretty much have the same words in them. Maybe I've got a single paragraph printed from one of them and want to find the source document. A simple word search will yield back 80% of the lot. A phrase search typed in from the paragraph is almost certainly unique, however, and will give me my document in a blink.
(Um, I'd have to move all the documents to a Macintosh to do this, but you get the point I hope.)
Spotlight says it finds "anything anywhere" on your computer. I would use a feature like this *all the time*. Why shouldn't it be able to do it?

How do I search for a word within a web page

I would like to be able to do a search for a pecific within the page currenly viewed in the browser. Is there a way to do that in Firefox?

Hi JossefPerl,
Searching on a page is actually really easy. You can just hit ''CTRL + F'' to use the search feature. You should take a look at the Knowledge Base article on [[Searching within a page]] for more information.
Hopefully this helps!

Programmatically search for a word in PDF file

In the program I am developing, I am opening up a PDF file from the application. Is there any way to search for a particular word in the PDF file and move to the page containing the first occurance of that word in the PDF file programmatically? I am using VC++ to develop the application.
Any guidance is appreciated and thanks in advance.

Thanks for your reply Leonard. I am not using any library now. Currently I am just opening up the PDF file in Adobe Acrobat Reader using ShellExecute() API passing the PDF filename. Now I want to open the PDF file in Adobe Acrobat Reader, and move to the page containig a particular text automatically. Is it possible through any command line arguments to AcroRd32.exe like, AcroRd32.exe <filename.pdf> search:<wordtosearch> OR I have to use any third party library to do this.

How can I search for details in job log files

Hi,
I'm looking for a specific entry in the job log. I don't know when it was written (other than the date), to find the log without trial and error, I need a specific time to open the correct one in IDC.
The entry was written by the modifyADSuser pass and it would have an userID tag in the log file but there are many hundreds a day for me to hunt through. If I could find where identity center pulls the log files from I could either use a SQL select (if it's held in the database) or text search (if it's held in a folder) to zero in on the correct log file. Does anyone know where the information that's shown in the IDC job logs is stored?
Thanks,
Pete

Thanks for the response, I checked MC_LOGS and that looks to be the same detail that is available in the management console, basically the rows displayed in the job log. Do you know the table relationship after MC_LOGS, what's the tale name for the data (even if encrypted) that details each pass etc?
Thanks,
Pete

How do I search for common values across multiple columns?

I am coordinating a schedule with 5 people across hundreds of dates, and have columns A-E filled with many rows of dates. How can I make a new column that displays all the dates (values) that each person (column) has in common with all the others?
Is there a simple formula for this?
thanks!

Scarampella,
A second table can be used to find your matching dates.
Here's an example:
The formula in Matching Dates is:
=IF(ISERROR(MATCH(A,Table 1 :: A, 0)+MATCH(A,Table 1 :: B, 0)+MATCH(A,Table 1 :: C, 0)+MATCH(A,Table 1 :: D, 0)+MATCH(A,Table 1 :: E, 0)), "", A)
Basically, I look for matches in each person's list of dates, and if any fail to produce a match with the date being examined, the result is a miss, and if all match, it's a hit. You can sort the result to get a short list of matches without spaces.
Regards,
Jerry

How to use BAPIs for Infopackage execution : loading multiple files

Hello
I have been told that BAPIs can be used to load multiple csv files at once for which some BAPIs exists (BAPI_IPAK_CREATE_FROM_REF , BAPI_IPAK_CREATE , etc)
I have users who will be dropping their standard files in a directory (this should be a local one or server one ?) according to one of 3 types of formats defined.
As they wont be trigering the IP but instead plan to use a Process chain need a way to collect all files and trigger a IP that can process them all
Can somebody lead me into using the appropriate ones in the right way?
thanks

First if you are using process chain then the files should be placed in Application Server only and process chain can not work with IPs which are using Local Files.
Instead of BAPI in the infopackage there is a feature to select the file using routines. May be you can pick the necessary file in the routine itself.
In the extraction tab you can find this option.
Regs
Gopi
Assign points if it is useful

Search for "A word or phrase in the file" in .trc files gives no result

Hi
When i Search through Explorer using search for "A word or phrase in the file" in .trc files I get no result.
Probably because these files are of type "Microsoft Network Monitor Document".
But I can open them using Notepad, so why can't I search for a word in these files?
I there another way to search?
Normally I ofcourse use Visual Admin. but there are a lot of trace files so it would be nice to do this kind of search
br Peter

Hi Peter,
This is a known problem, see http://support.microsoft.com/kb/309173
An alternative is to use other tools which search even faster than the slow MS search does.
Hope it helps
Detlev

How do i search for a specific music video instead of browsing through thousands

how do i search for a specific music video instead of browsing through thousands?

Type a keyword or two in the search area - shown in the upper right here (the oval area):

On iMac maverick using numbers how do I search for an address without scrolling through all. Chris

On iMac with maverick using numbers spreadsheet, how do I search for an address without scrolling through the lot.

Better to post your topic in the dedicated Numbers community > Numbers for Mac: iWork: Apple Support Communities

How to search for a word in a text editor

Hi,
I have created a custom container and added some text to it. Is there any method to search for words in this?

Lilan,
To search a character field for a particular pattern, use the SEARCH statement as follows:
SEARCH <c> FOR <str> <options>.
The statement searches the field <c> for <str> starting at position <n1>. If successful, the return code value of SY-SUBRC is set to 0 and SY-FDPOS is set to the offset of the string in the field <c>. Otherwise, SY-SUBRC is set to 4.
The search string <str> can have one of the following forms.
<str>
Function
<pattern>
Searches for <pattern> (any sequence of characters). Trailing blanks are ignored.
.<pattern>.
Searches for <pattern>. Trailing blanks are not ignored.
*<pattern>
A word ending with <pattern> is sought.
<pattern>*
Searches for a word starting with <pattern>.
Words are separated by blanks, commas, periods, semicolons, colons, question marks, exclamation marks, parentheses, slashes, plus signs, and equal signs.
<option> in the SEARCH FOR statement can be any of the following:
ABBREVIATED
Searches the field <c> for a word containing the string in <str>. The characters can be separated by other characters. The first letter of the word and the string <str> must be the same.
STARTING AT <n1>
Searches the field <c> for <str> starting at position <n1>. The result SY-FDPOS refers to the offset relative to <n1> and not to the start of the field.
ENDING AT <n2>
Searches the field <c> for <str> up to position <n2>.
AND MARK
If the search string is found, all the characters in the search string (and all the characters in between when using ABBREVIATED) are converted to upper case.
Pls. Mark

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.

Search for a word in a string.

Hello everybody,
Could anybody help me how to search for a word in a string ?
Example: I have a string as below:
String[] weather = {"snow", "rain", "sunny", "temperature", "storm", "freezing"};
And I have a sentence like this:
"Today is a sunny day"
I want to break this sentence to pickup the word "sunny" and search this word in String[] weather to see if they match. How could i do that?
Thank you very much. I really appreciate.
still_learn

1 iterate through the strings in your array.
2. use String.indexOf(...) to test if the query string is present in the string

How do I search for a value in a db?

I have a mysql-db which is connected to a java-program.
It is an applet with a JTextField and a JButton.
When I write something in the JTextField and presses the JButton I want to search for the word in my database and return some other values.
This works properly if I write the exact String.
How shall I do if I want to be able to only write the beginning of the word and retrieve all values that begins with these letters?
Instead of writing "ABC123" I would be able to write "ABC" and retrieve all values that begins with ABC.
Any suggestions?

Yep,
String sql ="select * from tablename where VALUE like '"+textfield.getText()+"%'";That should do.
HTH

How do I search for a word through multiple files in my directories ??

Similar Messages

Maybe you are looking for