Re: Simple Components (Generic_Directed_Graph)

[Victor Porton <porton@narod.ru>]

Dmitry A. Kazakov wrote:

> On 2017-10-30 22:20, Victor Porton wrote:
> 
>> The issue here that equal strings should get equal access values. That is
>> the same string should be never in more than one node.
>> 
>> Thus I use a map from URIs (or they could be strings) to node access
>> values.
> 
> Use a set of general constant access type instead. I don't know it goes
> with Ada containers, but normally you should be able to define a set
> with custom < and = defined on that access:
> 
>     function "=" (Left, Right : Pointer) return Boolean is
>     begin
>        return Left = Right or else
>               (Left /= null and then Left.all = Right.all);
>     end "=";
> 
>     function "<" (Left, Right : Pointer) return Boolean is
>     begin
>        return Right /= null and then
>               (Left = null or else Left.all < Right.all);
>     end "<";
> 
> If you put each node into the set taking Node.all'Unchecked_Access. You
> could test a given aliased string by taking its 'Unchecked_Access. No
> copies.

Why Node.all'Unchecked_Access? Isn't it the same as Node?

Why no copies? Because of so defined "<"?

> 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.

What should I do?

> An finally you can have a set of access to String and a graph of that
> access to String nodes. I.e. Node would be an access to access to
> String. You can use a handle to reference counted String instead of the
> plain access to String.

-- 
Victor Porton - http://portonvictor.org