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-Thread: 103376,f2690a5e963b61b6 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!news.maxwell.syr.edu!news.tele.dk!news.tele.dk!small.news.tele.dk!newsgate.cistron.nl!newsfeed.stueberl.de!peernews3.colt.net!colt.net!peer-uk.news.demon.net!kibo.news.demon.net!news.demon.co.uk!demon!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: GCC 4.0 Ada.Containers Cursor danger. Date: Tue, 12 Jul 2005 22:38:09 +0100 Organization: Pushface Message-ID: References: <1120583470.429264.325450@g43g2000cwa.googlegroups.com> <42cb8d21$0$22761$9b4e6d93@newsread2.arcor-online.net> <42cd064c$0$10817$9b4e6d93@newsread4.arcor-online.net> <42cda8c4$0$22780$9b4e6d93@newsread2.arcor-online.net> <1u3hh2597i4ne$.1ryetugksbmus.dlg@40tude.net> <1121093807.949660.274060@g44g2000cwa.googlegroups.com> <1121124248.600055.292320@f14g2000cwb.googlegroups.com> <1121137531.752285.44280@g44g2000cwa.googlegroups.com> <946e7$42d3c64d$4995421$28449@ALLTEL.NET> <1121179909.262566.192270@o13g2000cwo.googlegroups.com> <1121182524.007719.77090@z14g2000cwz.googlegroups.com> NNTP-Posting-Host: pogner.demon.co.uk Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: news.demon.co.uk 1121204279 11509 62.49.19.209 (12 Jul 2005 21:37:59 GMT) X-Complaints-To: abuse@demon.net NNTP-Posting-Date: Tue, 12 Jul 2005 21:37:59 +0000 (UTC) Cancel-Lock: sha1:GD/cGbpmyXCAdgPEkiAigmIsr0U= User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.0.50 (darwin) Xref: g2news1.google.com comp.lang.ada:12032 Date: 2005-07-12T22:38:09+01:00 List-Id: "Matthew Heaney" writes: > It depends of course on how one defines "unordered." > > I use the term "unordered" to refer to a set (or map) implemented using > some kind of sequential container (a list, say). The only way to find > an element is by performing a linear search. > > An "ordered" set is implemented using a data structure that allows you > to find an element in better than O(n) time. Using that criterion, > then both the Hashed_Set and Ordered_Sets are "ordered." These seem very unnatural and misleading usages to me.