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

AnchorEditor: fix range-check, bug #12906

Browse Source 
git-svn-id: trunk@18076 -
This commit is contained in:
martin 2009-01-03 14:08:37 +00:00
parent d012677d14
commit 96f69ddc65
1 changed files with 25 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
designer/anchoreditor.pas
View File

@ -461,34 +461,37 @@ begin
NewSibling:=nil;
if (NewValue<>AnchorDesignerNoSiblingText) then
begin
CurNeighbour:=akTop;
while CurNeighbour <= akBottom do
begin
if NewValue=AnchorDesignerNeighbourText(CurNeighbour) then
begin
CurNeighbour:=low(TAnchorKind);
// Check if relative Anchor to be used, such as '(selected left neighbour)'
while true do begin
if NewValue=AnchorDesignerNeighbourText(CurNeighbour) then begin
UseNeighbours:=true;
//todo: copy the list if it is needed unsorted somewhere else
case CurNeighbour of //todo: use just one sorting function
akTop: SelectedControls.Sort(@compareControlTop);
akLeft: SelectedControls.Sort(@compareControlLeft);
akRight: SelectedControls.Sort(@compareControlRight);
akBottom: SelectedControls.Sort(@compareControlBottom);
end;
setlength(OldPositions,SelectedControls.Count);
setlength(OldPositions2,SelectedControls.Count);
for i:=0 to SelectedControls.Count-1 do begin
OldPositions[i]:=NeighbourPosition(tcontrol(SelectedControls[i]));
case CurNeighbour of
akLeft,akRight: OldPositions2[i]:=tcontrol(SelectedControls[i]).top;
akTop,akBottom: OldPositions2[i]:=tcontrol(SelectedControls[i]).Left;
end;
end;
break;
end;
if (CurNeighbour = high(TAnchorKind)) then
break;
inc(CurNeighbour);
end;
if not UseNeighbours then
if UseNeighbours then
begin
//todo: copy the list if it is needed unsorted somewhere else
case CurNeighbour of //todo: use just one sorting function
akTop: SelectedControls.Sort(@compareControlTop);
akLeft: SelectedControls.Sort(@compareControlLeft);
akRight: SelectedControls.Sort(@compareControlRight);
akBottom: SelectedControls.Sort(@compareControlBottom);
end;
setlength(OldPositions,SelectedControls.Count);
setlength(OldPositions2,SelectedControls.Count);
for i:=0 to SelectedControls.Count-1 do begin
OldPositions[i]:=NeighbourPosition(tcontrol(SelectedControls[i]));
case CurNeighbour of
akLeft,akRight: OldPositions2[i]:=tcontrol(SelectedControls[i]).top;
akTop,akBottom: OldPositions2[i]:=tcontrol(SelectedControls[i]).Left;
end;
end;
end
else begin
NewSibling:=FindSibling(NewValue);
if NewSibling=nil then exit;
end;