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,69e5d995d9880729 X-Google-Attributes: gid103376,public From: dweller@Starbase.NeoSoft.COM (David Weller) Subject: Re: Need help with semaphores Date: 1995/04/22 Message-ID: <3nc696$bbi@Starbase.NeoSoft.COM>#1/1 X-Deja-AN: 101370058 references: <3mjtms$ksu@pegasus.rutgers.edu> organization: NeoSoft Internet Services +1 713 968 5800 newsgroups: comp.lang.ada Date: 1995-04-22T00:00:00+00:00 List-Id: >In article <3mjtms$ksu@pegasus.rutgers.edu>, craighd@pegasus.rutgers.edu (Craig Davis) writes: >|> I need help with writing a program that uses semaphores. I'm not >|> sure of the syntax for "wait" and "signal" entries. >|> >|> I am supposed to create two instances of type semaphore. Each >|> semaphore is initially set to 1. "accept wait" subtracts 1, while >|> "accept signal" adds 1. I was told that ada has a pre-defined semaphore type. >|> Another book worht picking up is Burns' and Davies' "Concurrent Programming"(Addison-Wesley, ISBN: 0-201-54417-2). It uses Pascal-FC as the promary language, but it also discusses Ada95 in there. The Pascal-FC language actually adopts the "protected type" syntax of Ada95, so the mapping is relatively isomorphic. -- Frustrated with C, C++, Pascal, Fortran? Ada95 _might_ be for you! For all sorts of interesting Ada95 tidbits, run the command: "finger dweller@starbase.neosoft.com | more" (or e-mail with "finger" as subj.) if u cn rd ths, u r gd enuf to chg to Ada :-)