Re: hashed_maps

["Lucretia" <lucretia9@lycos.co.uk>]

Ok...I have been developing a binding to wxWidgets, so as an example:

package wx.Core.Window is

  type Window_Type is new Event_Handler_Type with private;

  procedure New_Window(Self : in out Window_Type; ...);

end wx.Core.Window;

New_Window contains a function wxWindow_ctor which calls a C function
which in turn calls "new wxWindow(...)" and returns the C++ pointer to
the New_Window procedure. I was originally storing the address of the
Ada instance (using Address_To_Access_Conversions) in the C++ class,
but this was messy and I needed a generic way of doing this for every
instance created on the Ada side, so a mapping seemed like a good idea
(C++ pointer :-> Ada access type)*.

* The "Ada access type" is the address of the newly constructed Ada
instance, from, for example, New_Window!

Now, I just need to know that what I'm doing with the ordered map isn't
going to generate a linked list in which the search will end up linear
as new C++ types are allocated as the key will be the address of the
C++ instance. Should a hashed map be used, if so, how do you do this?
I've only seen examples of hashing with strings.

Thanks,
Luke.