pcplayer · 2004-09-05 04:29:22 · 阅读: 1711 看Delphi.Class.TList.IndexOf()的辕马,果然是遍历 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;