Changeset 91 for trunk/UTrack.pas

Timestamp:

Sep 22, 2022, 10:57:26 PM (20 months ago)

Author:

chronos

Message:

• Modified: More classes separated from UEngine unit.

File:

• trunk/UTrack.pas (modified) (13 diffs)

trunk/UTrack.pas

@@ -4 +4 @@
 
 uses
-  Classes, SysUtils, Generics.Collections;
+  Classes, SysUtils, Math, Generics.Collections;
 
 type
   TTrack = class;
   TTrackPoints = class;
+  TTrackLink = class;
   TTrackLinks = class;
 
@@ -14 +15 @@
 
   TTrackPoint = class
+    OwnerPoint: TObject;
+    Position: TPoint;
+    //PositionShift: TPoint;
+    PositionDesigned: TPoint;
+    Pending: Boolean;
     Track: TTrack;
-    Position: TPoint;
     NeighPoints: TTrackPoints;
     NeighLinks: TTrackLinks;
+    LinkUp: TTrackLink;
+    LinkDown: TTrackLink;
     procedure Connect(TrackPoint: TTrackPoint);
     procedure Disconnect(TrackPoint: TTrackPoint);
+    function GetDown: TTrackPoint;
+    function GetUp: TTrackPoint;
+    function GetNeighDown: TTrackPoint;
+    function GetNeighUp: TTrackPoint;
+    function GetLinkDown: TTrackLink;
+    function GetLinkUp: TTrackLink;
+    // Move to TTrackLink later
+    function GetDistance: Integer;
     constructor Create;
     destructor Destroy; override;
@@ -27 +42 @@
 
   TTrackPoints = class(TObjectList<TTrackPoint>)
+    Track: TTrack;
+    function AddNew: TTrackPoint;
   end;
 
@@ -32 +49 @@
 
   TTrackLink = class
-    Track: TTrack;
     Points: TTrackPoints;
+    Shift: TPoint;
     constructor Create;
     destructor Destroy; override;
@@ -42 +59 @@
   TTrackLinks = class(TObjectList<TTrackLink>)
     function SearchPoints(Point1, Point2: TTrackPoint): TTrackLink;
+    function AddNew: TTrackLink;
   end;
 
@@ -47 +65 @@
 
   TTrack = class
-  public
     Points: TTrackPoints;
     Links: TTrackLinks;
-    function AddNew: TTrackPoint;
+    Owner: TObject;
+    function GetLength: Integer;
+    procedure RouteTrack(TP1, TP2: TTrackPoint);
+    procedure RemoveTrackBetween(TP1, TP2: TTrackPoint);
     constructor Create;
     destructor Destroy; override;
-    procedure RemoveTrackBetween(TP1, TP2: TTrackPoint);
+  end;
+
+  { TTrackPointsAngle }
+
+  TTrackPointsAngle = class
+    Angle: Double;
+    TrackLinks: TTrackLinks;
+    constructor Create;
+    destructor Destroy; override;
+  end;
+
+  { TTrackPointsAngleGroup }
+
+  TTrackPointsAngleGroup = class(TObjectList<TTrackPointsAngle>)
+    function SearchAngle(Angle: Double): TTrackPointsAngle;
   end;
 
 
 implementation
+
+uses
+  UGeometric;
+
+resourcestring
+  SAlreadyConnectedTrackPoint = 'Trying to connect already connected track point';
+  SAlreadyDisconnectedTrackPoint = 'Trying to disconnect not connected track point';
+  STrackPointNotFound = 'Track point %d not found';
 
 { TTrackLinks }
@@ -67 +109 @@
   I := 0;
   while (I < 0) and
-  ((Items[I].Points.First <> Point1) or (Items[I].Points.Last <> Point2))
-  and ((Items[I].Points.First <> Point2) or (Items[I].Points.Last <> Point1)) do
+    ((Items[I].Points.First <> Point1) or (Items[I].Points.Last <> Point2)) and
+    ((Items[I].Points.First <> Point2) or (Items[I].Points.Last <> Point1)) do
   Inc(I);
   if I < 0 then Result := Items[I]
@@ -74 +116 @@
 end;
 
+function TTrackLinks.AddNew: TTrackLink;
+begin
+  Result := TTrackLink.Create;
+end;
+
+{ TTrackPoints }
+
+function TTrackPoints.AddNew: TTrackPoint;
+begin
+  Result := TTrackPoint.Create;
+  Result.Track := Track;
+end;
+
+{ TTrack }
+
+constructor TTrack.Create;
+begin
+  Points := TTrackPoints.Create;
+  Points.Track := Self;
+  Links := TTrackLinks.Create;
+end;
+
+destructor TTrack.Destroy;
+begin
+  FreeAndNil(Points);
+  FreeAndNil(Links);
+  inherited;
+end;
+
+function TTrack.GetLength: Integer;
+var
+  I: Integer;
+begin
+  Result := 0;
+  for I := 0 to Points.Count - 1 do
+  if I > 0 then
+    Result := Result + Distance(Points[I].Position, Points[I - 1].Position);
+end;
+
+procedure TTrack.RouteTrack(TP1, TP2: TTrackPoint);
+var
+  NewTrackPoint: TTrackPoint;
+  Delta: TPoint;
+  P1, P2: TPoint;
+  Index1, Index2: Integer;
+begin
+  RemoveTrackBetween(TP1, TP2);
+  Index1 := Points.IndexOf(TP1);
+  Index2 := Points.IndexOf(TP2);
+  P1 := Points[Index1].PositionDesigned;
+  P2 := Points[Index2].PositionDesigned;
+  NewTrackPoint := Points.AddNew;
+  Delta := Point(P2.X - P1.X, P2.Y - P1.Y);
+  if Abs(Delta.X) > Abs(Delta.Y) then begin
+    NewTrackPoint.PositionDesigned := Point(P2.X - Sign(Delta.X) * Abs(Delta.Y), P1.Y);
+    NewTrackPoint.Position := NewTrackPoint.PositionDesigned;
+  end else begin
+    NewTrackPoint.PositionDesigned := Point(P1.X, P2.Y - Sign(Delta.Y) * Abs(Delta.X));
+    NewTrackPoint.Position := NewTrackPoint.PositionDesigned;
+  end;
+  Points.Insert(Index1 + 1, NewTrackPoint);
+end;
+
+procedure TTrack.RemoveTrackBetween(TP1, TP2: TTrackPoint);
+var
+  Index1, Index2: Integer;
+  Temp: Integer;
+  I: Integer;
+begin
+  Index1 := Points.IndexOf(TP1);
+  Index2 := Points.IndexOf(TP2);
+  if (Index1 = -1) then
+    raise Exception.Create(Format(STrackPointNotFound, [1]));
+  if (Index2 = -1) then
+    raise Exception.Create(Format(STrackPointNotFound, [2]));
+  if Index1 > Index2 then begin
+    Temp := Index1;
+    Index1 := Index2;
+    Index2 := Temp;
+  end;
+  for I := 1 to Index2 - Index1 - 1 do
+    Points.Delete(Index1 + 1);
+end;
+
 { TTrackLink }
 
@@ -84 +210 @@
 destructor TTrackLink.Destroy;
 begin
-  Points.Free;
+  FreeAndNil(Points);
   inherited;
 end;
 
-{ TTrackPoints }
-
-function TTrack.AddNew: TTrackPoint;
-begin
-  Result := TTrackPoint.Create;
-  Result.Track := Self;
-  Points.Add(Result);
+{ TTrackPointsAngleGroup }
+
+function TTrackPointsAngleGroup.SearchAngle(Angle: Double): TTrackPointsAngle;
+var
+  I: Integer;
+begin
+  I := 0;
+  while (I < Count) and (Items[I].Angle <> Angle) do Inc(I);
+  if I < Count then Result := Items[I]
+    else Result := nil;
+end;
+
+{ TTrackPointsAngle }
+
+constructor TTrackPointsAngle.Create;
+begin
+  TrackLinks := TTrackLinks.Create;
+  TrackLinks.OwnsObjects := False;
+end;
+
+destructor TTrackPointsAngle.Destroy;
+begin
+  FreeAndNil(TrackLinks);
+  inherited;
 end;
 
@@ -106 +249 @@
     NeighPoints.Add(TrackPoint);
     TrackPoint.NeighPoints.Add(Self);
-    // Add new link
-    NewLink := TTrackLink.Create;
+
+    // Add new link to both self and connected track point
+    NewLink := Track.Links.AddNew;
     NewLink.Points.Add(TrackPoint);
     NewLink.Points.Add(Self);
@@ -113 +257 @@
     TrackPoint.NeighLinks.Add(NewLink);
     Track.Links.Add(NewLink);
-  end;
+  end else raise Exception.Create(SAlreadyConnectedTrackPoint);
 end;
 
@@ -125 +269 @@
     NeighPoints.Delete(Index);
     TrackPoint.NeighPoints.Remove(Self);
-    // Remove link
+
+    // Remove link from both track points
     Link := NeighLinks.SearchPoints(Self, TrackPoint);
     NeighLinks.Remove(Link);
     TrackPoint.NeighLinks.Remove(Link);
     Track.Links.Remove(Link);
-  end;
+  end else raise Exception.Create(SAlreadyDisconnectedTrackPoint);
+end;
+
+function TTrackPoint.GetDown: TTrackPoint;
+var
+  I: Integer;
+begin
+  I := Track.Points.IndexOf(Self) - 1;
+  while (I >= 0) and not Assigned(Track.Points[I].OwnerPoint) do
+    Dec(I);
+  if I >= 0 then Result := Track.Points[I]
+    else Result := nil;
+end;
+
+function TTrackPoint.GetUp: TTrackPoint;
+var
+  I: Integer;
+begin
+  I := Track.Points.IndexOf(Self) + 1;
+  while (I < Track.Points.Count) and not Assigned(Track.Points[I].OwnerPoint) do
+    Inc(I);
+  if I < Track.Points.Count then Result := Track.Points[I]
+    else Result := nil;
+end;
+
+function TTrackPoint.GetNeighDown: TTrackPoint;
+var
+  NewIndex: Integer;
+begin
+  Result := nil;
+  NewIndex := Track.Points.IndexOf(Self) - 1;
+  if NewIndex >= 0 then Result := Track.Points[NewIndex];
+end;
+
+function TTrackPoint.GetNeighUp: TTrackPoint;
+var
+  NewIndex: Integer;
+begin
+  Result := nil;
+  if Assigned(Track) then begin
+    NewIndex := Track.Points.IndexOf(Self) + 1;
+    if NewIndex < Track.Points.Count then Result := Track.Points[NewIndex];
+  end;
+end;
+
+function TTrackPoint.GetLinkDown: TTrackLink;
+begin
+  if Assigned(LinkDown) then Result := LinkDown
+    else begin
+      LinkDown := TTrackLink.Create;
+      LinkDown.Points.Add(GetNeighDown);
+      LinkDown.Points.Add(Self);
+      Result := LinkDown;
+      GetNeighDown.LinkUp := LinkDown;
+    end;
+end;
+
+function TTrackPoint.GetLinkUp: TTrackLink;
+begin
+  if Assigned(LinkUp) then Result := LinkUp
+    else begin
+      LinkUp := TTrackLink.Create;
+      LinkUp.Points.Add(Self);
+      LinkUp.Points.Add(GetNeighUp);
+      Result := LinkUp;
+      GetNeighUp.LinkDown := LinkUp;
+    end;
+end;
+
+function TTrackPoint.GetDistance: Integer;
+var
+  Index: Integer;
+begin
+  Index := Track.Points.IndexOf(Self);
+  Result := Distance(Track.Points[Index + 1].Position, Track.Points[Index].Position);
 end;
 
@@ -137 +356 @@
   NeighPoints := TTrackPoints.Create;
   NeighPoints.OwnsObjects := False;
+  NeighLinks := TTrackLinks.Create;
+  NeighLinks.OwnsObjects := False;
 end;
 
 destructor TTrackPoint.Destroy;
-var
-  I: Integer;
-begin
-  // Disconnect from all before destruction
-  for I := NeighPoints.Count - 1 downto 0 do
-    NeighPoints[I].Disconnect(Self);
-  if Assigned(Track) then Track.Points.Remove(Self);
-  NeighPoints.Free;
+begin
+  FreeAndNil(NeighLinks);
+  FreeAndNil(NeighPoints);
   inherited;
 end;
 
-{ TTrack }
-
-constructor TTrack.Create;
-begin
-  Points := TTrackPoints.Create;
-end;
-
-destructor TTrack.Destroy;
-begin
-  Points.Free;
-  inherited;
-end;
-
-procedure TTrack.RemoveTrackBetween(TP1, TP2: TTrackPoint);
-var
-  Index1, Index2: Integer;
-  Temp: Integer;
-  I: Integer;
-begin
-  Index1 := Points.IndexOf(TP1);
-  Index2 := Points.IndexOf(TP2);
-  if (Index1 = -1) then
-    raise Exception.Create('TrackPoint1 not found');
-  if (Index2 = -1) then
-    raise Exception.Create('TrackPoint2 not found');
-  if Index1 > Index2 then begin
-    Temp := Index1;
-    Index1 := Index2;
-    Index2 := Temp;
-  end;
-  for I := 1 to Index2 - Index1 - 1 do
-    Points.Delete(Index1 + 1);
-end;
-
-
 end.