opensource/HeidiSQL
1
0
Fork 0
mirror of https://github.com/HeidiSQL/HeidiSQL.git synced 2025-08-06 18:24:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

Workaround to avoid exceptions in FindNode() when an Int64 from TDBQuery.RecNo comes in and gets compared to the Cardinal typed VTree.Node.Index.

Browse Source
This commit is contained in:
Ansgar Becker
2012-11-21 05:10:25 +00:00
parent b6a18114f4
commit caaaaedc11
1 changed files with 10 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
source/helpers.pas
View File

@ -1610,20 +1610,17 @@ var
begin begin
// Helper to find a node by its index // Helper to find a node by its index
Result := nil; Result := nil;
// Grid.RootNodeCount is unfortunately Cardinal, not Int64. if Assigned(ParentNode) then
// Work around that as long as VT does not change that. Node := VT.GetFirstChild(ParentNode)
if (idx >= Low(Cardinal)) or (idx <= High(Cardinal)) then begin else
if Assigned(ParentNode) then Node := VT.GetFirst;
Node := VT.GetFirstChild(ParentNode) while Assigned(Node) do begin
else // Note: Grid.RootNodeCount is unfortunately Cardinal, not UInt64.
Node := VT.GetFirst; if Node.Index = idx then begin
while Assigned(Node) do begin Result := Node;
if Node.Index = idx then begin break;
Result := Node;
break;
end;
Node := VT.GetNextSibling(Node);
end; end;
Node := VT.GetNextSibling(Node);
end; end;
end; end;