On Thu, 17 Aug 2006 13:03:41 +0200
Burkhard Carstens <[EMAIL PROTECTED]> wrote:
> Am Donnerstag, 17. August 2006 11:25 schrieb Mattias:
> > On Thu, 17 Aug 2006 11:16:58 +0000
> >
> > Albert Zeyer <[EMAIL PROTECTED]> wrote:
> > > Which one do you mean? I only find there a few special lists.
> > >
> > > But I need an implementation of a map (key elements map to some
> > > data), implemented with B-trees or similar (the key elements need
> > > to be hashed for this), like hash_map in STL. In my case, I don't
> > > need a special hash function because my key elements are object
> > > pointers.
> >
> > lcl/avglvltree.pas has TPointerToPointerTree
> > Usage:
> > Tree:=TPointerToPointerTree.Create;
> > Tree[SomePointer]:=SomeData;
> > Value:=Tree[SomePointer];
>
> Nice thing! Looks like there is no dependency on lcl, so couldn't this
> be moved to rtl/fcl ?
Yes. Maybe we should add a Delete or Undefine method.
Mattias
_________________________________________________________________
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
archives at http://www.lazarus.freepascal.org/mailarchives
