Retro video games delivered to your door every month!
Click above to get retro games delivered to your door ever month!
X-Hacker.org- FAST TEXT SEARCH for Clipper v.2.0 - <b>searching - step 2</b> http://www.X-Hacker.org [<<Previous Entry] [^^Up^^] [Next Entry>>] [Menu] [About The Guide]
   Searching  - Step 2

   Searches are done by three functions: CftsSet(), CftsNext() and 
   CftsVeri(). CftsSet() receives the handle (identifier) for the 
   appropriate index file and the character string(s) to be searched for. 
   CftsSet() prepares the index file for a search and will return a 1 if 
   successful.

   CftsNext() is then called and will return a number representing the 
   first index record containing all the signatures of the search 
   string(s). It will return the number of the next matching index record 
   each time it is called until no more are found. A return value of zero 
   indicates no further records match. The return of a negative number 
   indicates an error condition. This is true of all CFTS functions.

   A program will usually take each return for CftsNext() and verify that 
   the search string does in fact occur in that record. This verification 
   can take place as each CftsNext() return is made or these returns can 
   be stored and the verification done as a batch operation. SHOW1.PRG is 
   an example of the first method.


See Also: CftsSet() CftsNext() CftsVeri() SHOW1.PRG

Online resources provided by: http://www.X-Hacker.org --- NG 2 HTML conversion by Dave Pearson