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,703c4f68db81387d X-Google-Thread: 109fba,703c4f68db81387d X-Google-Thread: 115aec,703c4f68db81387d X-Google-Thread: f43e6,703c4f68db81387d X-Google-Attributes: gid103376,gid109fba,gid115aec,gidf43e6,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news4.google.com!news.glorb.com!newsfeed00.sul.t-online.de!t-online.de!newsfeed.freenet.de!80.239.136.22.MISMATCH!tsicnews.teliasonera.com!news.otenet.gr!news.grnet.gr!newsfd02.forthnet.gr!not-for-mail From: Ioannis Vranos Newsgroups: comp.lang.ada,comp.lang.c++,comp.realtime,comp.software-eng Subject: Re: Teaching new tricks to an old dog (C++ -->Ada) Date: Wed, 23 Mar 2005 13:18:04 +0200 Organization: FORTHnet S.A., Atthidon 4, GR-17671 Kalithea, Greece, Tel: +30 2109559000, Fax: +30 2109559333, url: http://www.forthnet.gr Message-ID: <1111576684.292321@athnrd02> References: <4229bad9$0$1019$afc38c87@news.optusnet.com.au> <1110032222.447846.167060@g14g2000cwa.googlegroups.com> <871xau9nlh.fsf@insalien.org> <3SjWd.103128$Vf.3969241@news000.worldonline.dk> <87r7iu85lf.fsf@insalien.org> <1110052142.832650@athnrd02> <1110284070.410136.205090@o13g2000cwo.googlegroups.com> <395uqaF5rhu2mU1@individual.net> <1110329098.642196@athnrd02> <1110361741.551255@athnrd02> <422edaec$0$26554$9b4e6d93@newsread4.arcor-online.net> <1111464133.508323@athnrd02> <423fe9df$0$11476$9b4e6d93@newsread2.arcor-online.net> <1111524623.705533@athnrd02> <4240937b$0$9215$9b4e6d93@newsread4.arcor-online.net> <1111568536.640808@athnrd02> <42414d77$0$9217$9b4e6d93@newsread4.arcor-online.net> NNTP-Posting-Host: athnrd02.forthnet.gr Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Trace: athprx02.forthnet.gr 1111576684 3762 193.92.150.73 (23 Mar 2005 11:18:04 GMT) X-Complaints-To: abuse@forthnet.gr NNTP-Posting-Date: Wed, 23 Mar 2005 11:18:04 +0000 (UTC) User-Agent: Mozilla Thunderbird 1.0 (Windows/20041206) X-Accept-Language: en-us, en In-Reply-To: <42414d77$0$9217$9b4e6d93@newsread4.arcor-online.net> Cache-Post-Path: newsfd02!unknown@ppp9-adsl-61.ath.forthnet.gr Xref: g2news1.google.com comp.lang.ada:9787 comp.lang.c++:46791 comp.realtime:1608 comp.software-eng:5208 Date: 2005-03-23T13:18:04+02:00 List-Id: Georg Bauhaus wrote: > Compare log(10^6) to 1. > > I can't see how O(log(n)) isn't huge when compared to > O(1), in an inner loop for containers of size 10^6. OK, but besides the fact that only explicit entries in map occupy space, and the rest keys return 0, which means that the search and counting of a value is faster than an array in case that no the entire range is under use, there are also third-party hashed containers, including hashed maps. Also, as I said it is not difficult to define an array that takes arbitrary signed ranges, but this does not make much sense in C++. In other words, the direct equivalent of your array is probably valarray/vector, ignoring the signed ranges. BTW, the compile-time boundary checks you have been mentioning, sounds like they are restricted to built-in arrays, which means is not of much use. Also the lack of a "STL like" library in Ada until now probably sounds like that Ada lacks much of the high-level abstraction that C++ provides. -- Ioannis Vranos http://www23.brinkster.com/noicys