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 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!v102.xanadu-bbs.net!xanadu-bbs.net!news.mixmin.net!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Simple Components (Generic_Directed_Graph) Date: Tue, 31 Oct 2017 13:42:20 +0100 Organization: Aioe.org NNTP Server Message-ID: References: NNTP-Posting-Host: MajGvm9MbNtGBKE7r8NgYA.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.4.0 Content-Language: en-US X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:48686 Date: 2017-10-31T13:42:20+01:00 List-Id: On 2017-10-31 12:12, Victor Porton wrote: > Why Node.all'Unchecked_Access? Isn't it the same as Node? No. Node is pool-specific. And anyway different access types are different types. Ada is strongly typed. It is one of great advantages of Ada typing system that pointer types have no structure-equivalence. In particular the solution I proposed is based on that. You can have different kinds of pointers to the same target type with operations like "<" and "=" defined differently on them. Thus having differently indexed structures of targets without copying the targets. In your case it is a set of strings and a graph of strings. > Why no copies? Because of so defined "<"? Because the set's element is access-to-String rather than String. >> Alternatively you can use a set of Node with order operations defined as >> above and allocate a copy of the tested string in the test. You then >> free that string if it is already in the set and use one in the set >> instead. If duplicated strings are rather exception a few allocations >> should be no problem. > > Duplicated strings is NOT an exception. URIs do not repeat frequently. But I don't understand what are you doing anyway because the same URI can be resolved to different targets and conversely same target can have different URIs. And why they should have to be in a graph is a mystery to me. > What should I do? It is your choice. I merely pointed out that you can easily avoid having the same string kept twice. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de