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=unavailable autolearn_force=no version=3.4.4 X-Received: by 2002:a24:fe05:: with SMTP id w5-v6mr543983ith.14.1526525190821; Wed, 16 May 2018 19:46:30 -0700 (PDT) X-Received: by 2002:a9d:703:: with SMTP id 3-v6mr60565ote.11.1526525190464; Wed, 16 May 2018 19:46:30 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!news.swapon.de!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!v8-v6no375892itc.0!news-out.google.com!b185-v6ni347itb.0!nntp.google.com!u74-v6no371239itb.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 16 May 2018 19:46:30 -0700 (PDT) In-Reply-To: <6420bab2-0aef-4d36-b978-525e4de45e7e@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=73.2.251.187; posting-account=JSxOkAoAAADa00TJoz2WZ_46XrZCdXeS NNTP-Posting-Host: 73.2.251.187 References: <6420bab2-0aef-4d36-b978-525e4de45e7e@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: =?UTF-8?Q?Re=3A_meaningfully=2Fcompellingly_=E2=80=9Cadvertising=E2=80=9D_Ada_?= =?UTF-8?Q?on_StackOverflow?= From: John Perry Injection-Date: Thu, 17 May 2018 02:46:30 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader02.eternal-september.org comp.lang.ada:52379 Date: 2018-05-16T19:46:30-07:00 List-Id: On Wednesday, May 16, 2018 at 9:27:12 AM UTC-5, Dan'l Miller wrote: > One thing to help Ada =E2=80=9Ccross the chasm=E2=80=9D would be for each= of the how-can-I-do-this-in-Ada questions posted here on c.l.a to also be = posted in StackOverflow with (at least) the tag Ada. ... > Plus the more times Ada is meaningfully mentioned in technical contexts o= n the WWW, the higher Ada that scores (directly or indirectly) on those per= ennial rankings of programming languages. A quantifiable measure of succes= s in this campaign would be measured by Ada moving up at least one position= in any one (or all) of these popularity-of-programming-languages rankings = that are always coming out (with usually C, Java, C++, and Javascript among= the top positions in the ranking). The goal is not to move Ada to the top= five positions; the goal is move Ada from, say, position #22 to position #= 18. I've been learning Ada recently for fun, and asked a couple of Ada question= s on StackOverflow recently. The people who replied were really helpful. Likewise, the Ada implementations on RosettaCode were both helpful to learn= from and, back when I was visiting to look at something else, nice adverti= sements for the language. I know that what follows below isn't the same, but it's related, so I hope = you don't mind my mentioning it here: I came across this "Completely Unscie= ntific Benchmark" where the guy seems halfway serious: github.com/frol/completely-unscientific-benchmarks There was no Ada implementation, so I added one. It's quite a simple progra= m: adding and removing ~10^6 nodes to a tree, and testing if the tree has a= value. The Ada implementation I submitted is about as fast as the C++ impl= ementation: he recorded it as 1.35x slower on his machine, but it still imp= ressed him at the time as it was one of the fastest he had then. I don't know much about Ada, and I basically implemented it by translating = the C++ code to Ada, so it might be possible to improve the implementation.= Things like that could be one way to improve Ada's reputation, and I'd be = delighted to learn how I could have implemented it better.