home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.databases
- Path: sparky!uunet!spool.mu.edu!agate!dog.ee.lbl.gov!news!humu!pegasus!tleylan
- From: tleylan@pegasus.com (Tom Leylan)
- Subject: Re: Pls help: algorithm wanted (xbase, pref foxpro)
- Message-ID: <1993Jan7.212402.21752@pegasus.com>
- Organization: Pegasus, Honolulu
- References: <1993Jan4.201319.9088@almserv.uucp>
- Date: Thu, 7 Jan 93 21:24:02 GMT
- Lines: 23
-
- In article <1993Jan4.201319.9088@almserv.uucp> g9utxu@fnma.COM writes:
-
- >I like this program, <...> But does it work...I tried using
- >the following:
- >
- >RATE.DBF Record START_DATE END_DATE STATUS
- > 1 07/01/91 06/30/92 FINAL
- > 2 07/01/92 06/30/93 FINAL
- > 3 07/01/93 12/31/93 PROVL
- > 4 01/01/94 06/30/94 FINAL
-
- Your results and the RATES.DBF indicate that you did not add the final
- "rest of time" record. Add a 5th record from 07/01/94 - 12/31/99 that
- is uncovered.
-
- By shifting that burden onto the database I was able to reduce the code
- size. In your version (written more to spec perhaps) a "no find" meant
- that you still had to skip back one record to make certain that if it
- _really_ was a no find or if the search date was prior to the last
- record's END_DATE.
-
- tom
-
-