Re: How to use associative arrays in Ada 2005?

Matthew Heaney wrote:

Dmitry A. Kazakov wrote:

... asymptotically under certain conditions, which might be or not met in
a real case.

Now you're just moving the goalposts. Again.

The only issue at hand is whether the standard container library can
solve the OP's problem. The answer is emphatically yes.

Tangential discussions of relative efficiency of maps compared to arrays
are little more than a Chewbacca Defense...

I don't think this is completely fair. Yes, hashes are said to be O(1) but
also they always carry the warning that this is not absolute. I'd feel
dishonest if presenting an algorithm saying it's O(1) if it uses hash maps.
I'd probably prefer to use trees and give O(log n) as a real upper bound.
.

Relevant Pages

  • Re: A new approach to the SET
    ... ** If you keep moving the goalposts about - you will eventually FORCE the ... ball to go between them. ... Fool. ...
    (rec.audio.tubes)
  • Re: large antarctic melt in 2005.....
    ... there are no reliable 'goalposts' ... The only idiots are those who keep moving the goalposts in order to ... but you could compare their daft dogmas with your daft dogmas.... ...
    (uk.politics.misc)
  • Re: large antarctic melt in 2005.....
    ... there are no reliable 'goalposts' ... The only idiots are those who keep moving the goalposts in order to ... let our cities be our swamps and our ... far more honest than your usual fakery ...
    (uk.politics.misc)
  • Re: large antarctic melt in 2005.....
    ... there are no reliable 'goalposts' ... The only idiots are those who keep moving the goalposts in order to ... let our cities be our swamps and our ... far more honest than your usual fakery ...
    (uk.politics.misc)
  • Re: large antarctic melt in 2005.....
    ... there are no reliable 'goalposts' ... The only idiots are those who keep moving the goalposts in order to ... let our cities be our swamps and our ... far more honest than your usual fakery ...
    (uk.politics.misc)