From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on ip-172-31-65-14.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00,T_SCC_BODY_TEXT_LINE autolearn=ham autolearn_force=no version=3.4.6 Path: eternal-september.org!reader01.eternal-september.org!aioe.org!gz+JwLUglqIuIsOsQSSzqA.user.46.165.242.91.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: New aggregates with Ada 2022. Date: Wed, 29 Jun 2022 11:04:09 +0200 Organization: Aioe.org NNTP Server Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Info: gioia.aioe.org; logging-data="34058"; posting-host="gz+JwLUglqIuIsOsQSSzqA.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org"; User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Thunderbird/91.10.0 Content-Language: en-US X-Notice: Filtered by postfilter v. 0.9.2 Xref: reader01.eternal-september.org comp.lang.ada:64049 List-Id: On 2022-06-29 10:30, Jeffrey R.Carter wrote: > * Maps are usually constrained. It does not make sense to concatenate, > sort, slice, or slide a map. The abstraction of a map includes > non-discrete key subtypes, so arrays used as maps are a special case. There is an important distinction regarding the keys. Some maps assume keys ordered or have a distance measure, so that the map would have operations like next-to-this or closest-neighbor-of. Another type of maps is when keys are totally unordered, e.g. relational tables (key = tuple). > A language that provided direct support for these abstractions should > not need to provide arrays. Which is of course impossible considering the variety of maps (e.g. graph is a map etc) and all problem-space specific. Array as a building block is the best way to go, IMO. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de