Re: "accessibility check failed" on Node

[Georg Bauhaus <rm.dash-bauhaus@futureapps.de>]

On 27.06.13 01:01, Thomas Schmidt wrote:
> Hi,
>
> I'm new to Ada. I'm trying to write some kind of neural net software. Therefore I've written a small library to implement the neural graph. All nodes are collected in a Hashed_Set. Neurons are specialized Nodes of the graph. To lookup a given Neuron/Node I need the following subprogram "findNode".
>
> Now what I don't understand: Why does "findNode1" work well while "findNode2" raises PROGRAM_ERROR at the line indicated below?

>       position : constant NodeSets.Cursor :=
>         graph.nodes.Find (Node (aNode.all)'Access);    -- <<< Works well

>       position : constant NodeSets.Cursor :=
>         graph.nodes.Find (aNode.all'Access);    -- <<< Raises PROGRAM_ERROR with "accessibility check failed"

The only written difference I see is that the type
of the object whose 'Access is taken in findNode1 is
Node, whereas the type of aNode.all in findNode2
is not necessarily Node. Node is the type used as target
type of what is in the container. If aNode is a pointer
to type that is not declared at the same level as type
Node, then this former type may no longer be
accessible. Therefore, anything specific to the type
is assumed to be gone, including any specific 'Address
operation.

(E.g., Node may be declared at library level, and
Some_Other_Node declared inside some procedure, or
in some generic instance not at library level.)

Some ways of identifying a node can be less troublesome
than using its address. Any identity less accidental
than addresses facilitates persistent identities.

Have you looked at the indefinite containers?