@@ -4328,7 +4328,7 @@ procedure TBaseVirtualTree.InitRootNode(OldSize: Cardinal = 0);
4328
4328
// Indication that this node is the root node.
4329
4329
PrevSibling := FRoot;
4330
4330
NextSibling := FRoot;
4331
- Parent := Pointer(Self);
4331
+ SetParent( Pointer(Self) );
4332
4332
States := [vsInitialized, vsExpanded, vsHasChildren, vsVisible];
4333
4333
TotalHeight := FDefaultNodeHeight;
4334
4334
TotalCount := 1;
@@ -5049,7 +5049,7 @@ procedure TBaseVirtualTree.SetChildCount(Node: PVirtualNode; NewChildCount: Card
5049
5049
Child.PrevSibling := Node.LastChild;
5050
5050
if Assigned(Node.LastChild) then
5051
5051
Node.LastChild.NextSibling := Child;
5052
- Child.Parent := Node;
5052
+ Child.SetParent( Node) ;
5053
5053
Node.LastChild := Child;
5054
5054
if Node.FirstChild = nil then
5055
5055
Node.FirstChild := Child;
@@ -13775,7 +13775,7 @@ procedure TBaseVirtualTree.InternalConnectNode(Node, Destination: PVirtualNode;
13775
13775
Node.PrevSibling := Destination.PrevSibling;
13776
13776
Destination.PrevSibling := Node;
13777
13777
Node.NextSibling := Destination;
13778
- Node.Parent := Destination.Parent;
13778
+ Node.SetParent( Destination.Parent) ;
13779
13779
Node.Index := Destination.Index;
13780
13780
if Node.PrevSibling = nil then
13781
13781
Node.Parent.FirstChild := Node
@@ -13795,7 +13795,7 @@ procedure TBaseVirtualTree.InternalConnectNode(Node, Destination: PVirtualNode;
13795
13795
Node.NextSibling := Destination.NextSibling;
13796
13796
Destination.NextSibling := Node;
13797
13797
Node.PrevSibling := Destination;
13798
- Node.Parent := Destination.Parent;
13798
+ Node.SetParent( Destination.Parent) ;
13799
13799
if Node.NextSibling = nil then
13800
13800
Node.Parent.LastChild := Node
13801
13801
else
@@ -13827,7 +13827,7 @@ procedure TBaseVirtualTree.InternalConnectNode(Node, Destination: PVirtualNode;
13827
13827
Node.NextSibling := nil;
13828
13828
end;
13829
13829
Node.PrevSibling := nil;
13830
- Node.Parent := Destination;
13830
+ Node.SetParent( Destination) ;
13831
13831
Node.Index := 0;
13832
13832
// reindex all following nodes
13833
13833
Run := Node.NextSibling;
@@ -13854,7 +13854,7 @@ procedure TBaseVirtualTree.InternalConnectNode(Node, Destination: PVirtualNode;
13854
13854
Node.PrevSibling := nil;
13855
13855
end;
13856
13856
Node.NextSibling := nil;
13857
- Node.Parent := Destination;
13857
+ Node.SetParent( Destination) ;
13858
13858
if Assigned(Node.PrevSibling) then
13859
13859
Node.Index := Node.PrevSibling.Index + 1
13860
13860
else
@@ -15137,7 +15137,7 @@ function TBaseVirtualTree.ReadChunk(Stream: TStream; Version: Integer; Node: PVi
15137
15137
else
15138
15138
Node.FirstChild := Run;
15139
15139
Node.LastChild := Run;
15140
- Run.Parent := Node;
15140
+ Run.SetParent( Node) ;
15141
15141
15142
15142
ReadNode(Stream, Version, Run);
15143
15143
System.Dec(ChunkBody.ChildCount);
0 commit comments