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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,74d953d10520ed5e X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-05-27 11:35:04 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!cyclone.bc.net!logbridge.uoregon.edu!hammer.uoregon.edu!skates!not-for-mail From: Stephen Leake Newsgroups: comp.lang.ada Subject: Re: using charles library Date: 27 May 2003 14:27:18 -0400 Organization: NASA Goddard Space Flight Center (skates.gsfc.nasa.gov) Message-ID: References: NNTP-Posting-Host: anarres.gsfc.nasa.gov Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: skates.gsfc.nasa.gov 1054060998 17323 128.183.235.92 (27 May 2003 18:43:18 GMT) X-Complaints-To: usenet@news.gsfc.nasa.gov NNTP-Posting-Date: 27 May 2003 18:43:18 GMT User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3 Xref: archiver1.google.com comp.lang.ada:37849 Date: 2003-05-27T18:43:18+00:00 List-Id: rm@gunlab.com.ru (Roman V. Isaev) writes: > I wonder is there any package easier to use? Try SAL: http://www.toadmail.com/~ada_wizard/ada/sal.html (yes, I checked the link this time). See the file Source_Common/Test/test_poly_binary_trees_sorted_aux.ads for an example of a sorted binary tree with string keys. "Easy" is mostly a matter of good examples. I hope this works for you. > I only want two functions, something like store(key,value) and > lookup(key), that's all, without 20+ string declaration voodoo... > Grrrrr. I miss perl's associative arrays. Well, Ada is more powerful and more flexible, and therefore packages are harder to learn. But more productive once you do. -- -- Stephe