From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,b7ec49c4bcff25e9 X-Google-Attributes: gid103376,public From: Charles Hixson Subject: Re: Bus Schedules Date: 2000/01/18 Message-ID: <3884E682.1093B7F6@earthlink.net>#1/1 X-Deja-AN: 574417032 Content-Transfer-Encoding: 7bit References: <85vaqu$b2a$1@nnrp1.deja.com> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-ELN-Date: Tue Jan 18 14:17:41 2000 X-Complaints-To: abuse@earthlink.net X-Trace: newsread1.prod.itd.earthlink.net 948233861 198.94.156.19 (Tue, 18 Jan 2000 14:17:41 PST) Organization: EarthLink Network, Inc. MIME-Version: 1.0 NNTP-Posting-Date: Tue, 18 Jan 2000 14:17:41 PST Newsgroups: comp.lang.ada Date: 2000-01-18T00:00:00+00:00 List-Id: Depends on what he means. I once spent several months programming a bus schedule system in Fox Pro. One needs to be able to accept some of the stranger things as input data, and the way times are represented --- shudder. Eventually I insisted on some restrictions on the forms that data could take on arrival. Then it was possible to make a go of it. But it was a several months project. I think the first step it to get a decent database to hold the data as you acquire it, define what you will accept as valid times (I ended up using 03:00 -> 25:00). Figure out whether or not you will be able to get the times presented in 24 hour format (or even [pray for it] a format based on the number of minutes since midnight of the base day [that's what I ended up recalculating all the times to, but if you can get clean data in that form you'll save yourself a lot of effort!]). How many users will need to be accessing the system simultaneously? Can you just keep it simple, and give them access to a read-only copy? If it's going to be available on separated machines, do you need to go to each one to set up an ODBC connection? Or is it simpler to manage your own b-tree lookup? (Depends on implementation considerations.) Sorry I don't have anything pre-built, but that's a starting list of considerations (i.e., the one's that I remember off the top of my head). Ted Dennison wrote: > In article , > "Arthur Schwarz" wrote: > > Anyone know any Ada software which can calculate a > > bus schedule? This includes major/minor frame calculations > > and so on. > > That sounds like it would make a really good programming assignment for > students. > > -- > T.E.D. > > http://www.telepath.com/~dennison/Ted/TED.html > > Sent via Deja.com http://www.deja.com/ > Before you buy.