Re: discriminant questions

[ytomino <aghia05@gmail.com>]

I'm glad you wrote body of Generic_Count.

> I think, though, that Query_Element will obviate the need for the
> wrapping pointer types; not sure I understand why you want them.
To be honest, I think so, too. Query_Interface is enough. ^_^;
I'm trying to use new inerface. And Constant_Reference makes code a
little easy. You do not need to divide Search and Use_CRefT differ
from Query_Interface.

    procedure Search (Position : Cursor) is
    begin
       if Constant_Reference (C, Position).Element.all = Value then
          Sum := Sum + 1;
       end if;
    end Search;

> Is this influenced by a 1:1 transport of C++ STL algorithms?
> I wonder whether the C++ STL would be different if C++ could use
> proper nesting or in case it had drawn more attention to function
> objects.

It will be wonderful supposing STL algorithms is transplantable.
But I do not feel necessity.
I just want to make my generic subprograms (it is not so general as
STL algorithms) independent of a container for conforming to the first
purpose of abstraction of STL is separation of a container and an
algorithm, but I do NOT want to make a perfect copy of C++.
Of course there is some differences. Iterator of STL mimics pointer,
but Cursor of Ada.Containers mimics index. C++0x has lambda, but Ada
has downward closure, etc. I would like to respect functions in Ada.