Greetings Delphians,

   Quick question.. does the method "indexof" in Tlist object do a sequential
search?

  If it does, I'll better use something else...

Balance Trees anyone?

In article <4ggfn4$...@isis.fiu.edu>, anola...@solix.fiu.edu says...

hello

Yes.  This is from the VCL source:

function TList.IndexOf(Item: Pointer): Integer;
begin
  Result := 0;
  while (Result < FCount) and (FList^[Result] <> Item) do Inc(Result);
  if Result = FCount then Result := -1;
end;

:-O  

In article <4ggfn4$...@isis.fiu.edu>,
alexander m nolasco <anola...@solix.fiu.edu> wrote:

Yes, it does do a sequential search. I think they very rationally decided that
most TList's would have a few hundred or thousand entries at most, and most
would have mere tens, and that simplicity of implementation was worth more
than optimizing a small percentage of the uses.
--

http://www.armory.com/~jon               Personal Pages
http://www.armory.com/~jon/pubs             Programming Publications
http://www.armory.com/~jon/hs         Home School Resource List