paweld/lazarus
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/lazarus/lazarus.git synced 2025-04-10 04:48:36 +02:00
Code Issues Packages Projects Releases Wiki Activity

lazcontrols: lvlgraph: added GetVisibleSourceNodes, GetVisibleTargetNodes

Browse Source 
git-svn-id: trunk@40750 -
This commit is contained in:
mattias 2013-04-08 10:52:02 +00:00
parent 3621bd6a70
commit e287d845f0
1 changed files with 92 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

92
components/lazcontrols/lvlgraphctrl.pas
View File

@ -130,6 +130,10 @@ type
property BackEdge: boolean read FBackEdge; // edge was disabled to break a cycle
property Highlighted: boolean read FHighlighted write SetHighlighted;
property DrawnAt: TRect read FDrawnAt; // last drawn with scrolling
function GetVisibleSourceNodes: TLvlGraphNodeArray;
function GetVisibleSourceNodesAsAVLTree: TAvgLvlTree;
function GetVisibleTargetNodes: TLvlGraphNodeArray;
function GetVisibleTargetNodesAsAVLTree: TAvgLvlTree;
function AsString: string;
end;
TLvlGraphEdgeClass = class of TLvlGraphEdge;
@ -3485,6 +3489,94 @@ begin
Result:=Source.Level.Index>=Target.Level.Index;
end;
function TLvlGraphEdge.GetVisibleSourceNodes: TLvlGraphNodeArray;
// return all visible nodes connected in Source direction
var
Nodes: TAvgLvlTree; // tree of TLvlGraphNode
i: Integer;
AVLNode: TAvgLvlTreeNode;
begin
Nodes:=GetVisibleSourceNodesAsAVLTree;
try
SetLength(Result,Nodes.Count);
AVLNode:=Nodes.FindLowest;
i:=0;
while AVLNode<>nil do begin
Result[i]:=TLvlGraphNode(AVLNode.Data);
inc(i);
AVLNode:=Nodes.FindSuccessor(AVLNode);
end;
finally
Nodes.Free;
end;
end;
function TLvlGraphEdge.GetVisibleSourceNodesAsAVLTree: TAvgLvlTree;
// return all visible nodes connected in Source direction
procedure Search(Node: TLvlGraphNode);
var
i: Integer;
begin
if Node=nil then exit;
if Node.Visible then begin
if Result.Find(Node)=nil then
Result.Add(Node)
end else begin
for i:=0 to Node.InEdgeCount-1 do
Search(Node.InEdges[i].Source);
end;
end;
begin
Result:=TAvgLvlTree.Create;
Search(Source);
end;
function TLvlGraphEdge.GetVisibleTargetNodes: TLvlGraphNodeArray;
// return all visible nodes connected in Target direction
var
Nodes: TAvgLvlTree; // tree of TLvlGraphNode
i: Integer;
AVLNode: TAvgLvlTreeNode;
begin
Nodes:=GetVisibleTargetNodesAsAVLTree;
try
SetLength(Result,Nodes.Count);
AVLNode:=Nodes.FindLowest;
i:=0;
while AVLNode<>nil do begin
Result[i]:=TLvlGraphNode(AVLNode.Data);
inc(i);
AVLNode:=Nodes.FindSuccessor(AVLNode);
end;
finally
Nodes.Free;
end;
end;
function TLvlGraphEdge.GetVisibleTargetNodesAsAVLTree: TAvgLvlTree;
// return all visible nodes connected in Target direction
procedure Search(Node: TLvlGraphNode);
var
i: Integer;
begin
if Node=nil then exit;
if Node.Visible then begin
if Result.Find(Node)=nil then
Result.Add(Node)
end else begin
for i:=0 to Node.OutEdgeCount-1 do
Search(Node.OutEdges[i].Source);
end;
end;
begin
Result:=TAvgLvlTree.Create;
Search(Target);
end;
function TLvlGraphEdge.AsString: string;
begin
Result:='('+Source.Caption+'->'+Target.Caption+')';