mirror of
https://github.com/moparisthebest/Simba
synced 2024-11-22 17:22:21 -05:00
f0dd60011b
git-svn-id: http://www.villavu.com/repositories/merlijn/mufasa@333 3f818213-9676-44b0-a9b4-5e4c4e03d09d
466 lines
13 KiB
ObjectPascal
466 lines
13 KiB
ObjectPascal
{
|
|
This file is part of the Mufasa Macro Library (MML)
|
|
Copyright (c) 2009 by Raymond van Venetië and Merlijn Wajer
|
|
|
|
MML is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
MML is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with MML. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
See the file COPYING, included in this distribution,
|
|
for details about the copyright.
|
|
|
|
DTM class for the Mufasa Macro Library
|
|
}
|
|
|
|
unit dtm;
|
|
|
|
{$mode objfpc}{$H+}
|
|
|
|
interface
|
|
|
|
uses
|
|
Classes, SysUtils, MufasaTypes;
|
|
|
|
type
|
|
TMDTM = class(TObject)
|
|
|
|
private
|
|
|
|
|
|
public
|
|
function AddDTM(d: TDTM): Integer;
|
|
function AddpDTM(d: pDTM): Integer;
|
|
function GetDTM(index: Integer; out dtm: pDTM): Boolean;
|
|
procedure FreeDTM(DTM: Integer);
|
|
function StringToDTM(S: String): pDTM;
|
|
function SetDTMName(DTM: Integer; S: String): boolean;
|
|
|
|
|
|
{ function FindDTM(DTM: Integer; out x, y: Integer; x1, y1, x2,
|
|
y2: Integer): Boolean;
|
|
function FindDTMs(DTM: Integer; out Points: TPointArray; x1, y1, x2,
|
|
y2: Integer): Boolean;
|
|
function FindDTMRotated(DTM: Integer; out x, y: Integer; x1, y1, x2,
|
|
y2: Integer; sAngle, eAngle, aStep: Extended;
|
|
out aFound: Extended): Boolean;
|
|
function FindDTMsRotated(DTM: Integer; out Points: TPointArray; x1,
|
|
y1, x2, y2: Integer; sAngle, eAngle,
|
|
aStep: Extended; out aFound: T2DExtendedArray)
|
|
: Boolean;
|
|
function pFindDTM(DTM: pDTM; out x, y: Integer; x1, y1, x2, y2:
|
|
Integer): Boolean;
|
|
function pFindDTMRotated(DTM: pDTM; out x, y: Integer; x1, y1, x2,
|
|
y2: Integer; sAngle, eAngle, aStep: Extended;
|
|
out aFound: Extended): Boolean;
|
|
function pFindDTMsRotated(DTM: pDTM; out Points: TPointArray; x1,
|
|
y1, x2, y2: Integer; sAngle, eAngle,
|
|
aStep: Extended; out aFound: T2DExtendedArray)
|
|
: Boolean;
|
|
}
|
|
constructor Create(Owner: TObject);
|
|
destructor Destroy; override;
|
|
private
|
|
Client: TObject;
|
|
|
|
// For decompressing.
|
|
BufferString: String;
|
|
|
|
DTMList: Array Of pDTM;
|
|
FreeSpots: Array Of Integer;
|
|
end;
|
|
|
|
{
|
|
I am not sure wether I should simply copy and paste the old DTM implementation,
|
|
or rewrite it from scratch.
|
|
|
|
The old DTM system problaby doesn't perform that well, but seems to be quite
|
|
stable and complete.
|
|
|
|
If I would rewrite it from scratch, it would probably be faster, and
|
|
hopefully more efficient.That won't be too hard, especially since I have
|
|
direct data access now. (TClient FTW!)
|
|
|
|
Rewrite from scratch it will be, I guess.
|
|
And AreaShape will be turned into a {$I }, inline simply doesn't cut it.
|
|
|
|
~Wizz
|
|
}
|
|
|
|
|
|
implementation
|
|
uses
|
|
Client, dtmutil, paszlib,
|
|
graphics, // for TColor
|
|
math // for max
|
|
;
|
|
|
|
type
|
|
TBufferByteArray = Array[0..524287] of Byte;
|
|
PBufferByteArray = ^TBufferByteArray;
|
|
|
|
|
|
constructor TMDTM.Create(Owner: TObject);
|
|
begin
|
|
inherited Create;
|
|
Self.Client := Owner;
|
|
|
|
SetLength(DTMList, 0);
|
|
SetLength(FreeSpots, 0);
|
|
SetLength(BufferString, 524288);
|
|
end;
|
|
|
|
{$DEFINE DTM_DEBUG}
|
|
destructor TMDTM.Destroy;
|
|
|
|
var
|
|
i, j: integer;
|
|
b:boolean;
|
|
begin
|
|
for i := 0 to high(DTMList) do
|
|
begin
|
|
b := false;
|
|
for j := 0 to high(freespots) do
|
|
if i = freespots[j] then
|
|
begin
|
|
b := true;
|
|
break;
|
|
end;
|
|
if not b then
|
|
begin;
|
|
if DTMList[i].n <> '' then
|
|
Writeln(Format('DTM [%s] was not freed',[DTMList[i].n]))
|
|
else
|
|
writeln(Format('DTM [%d] was not freed',[i]));
|
|
end;
|
|
end;
|
|
SetLength(DTMList, 0);
|
|
SetLength(FreeSpots, 0);
|
|
SetLength(BufferString, 0);
|
|
|
|
inherited Destroy;
|
|
end;
|
|
|
|
Function AreaShape(Color, Tolerance, Size, Shape: Integer; P: TPoint) : Boolean; inline;
|
|
|
|
Begin
|
|
|
|
End;
|
|
|
|
// Rotates the given point (p) by A (in radians) around the point defined by cx, cy.
|
|
|
|
function RotatePoint(p: TPoint; angle, mx, my: Extended): TPoint; inline;
|
|
|
|
begin
|
|
Result.X := Round(mx + cos(angle) * (p.x - mx) - sin(angle) * (p.y - my));
|
|
Result.Y := Round(my + sin(angle) * (p.x - mx) + cos(angle) * (p.y- my));
|
|
end;
|
|
|
|
function HexToInt(HexNum: string): LongInt;inline;
|
|
begin
|
|
Result:=StrToInt('$' + HexNum);
|
|
end;
|
|
|
|
function TMDTM.StringToDTM(S: String): pDTM;
|
|
var
|
|
b: PBufferByteArray;
|
|
Source : String;
|
|
DestLen : longword;
|
|
i,ii,c : integer;
|
|
begin
|
|
SetLength(Result.p,0);
|
|
SetLength(Result.c,0);
|
|
SetLength(Result.t,0);
|
|
SetLength(Result.asz,0);
|
|
SetLength(Result.ash,0);
|
|
ii := Length(S);
|
|
if (ii = 0) or (ii mod 2 <> 0) then
|
|
Exit;
|
|
ii := ii div 2;
|
|
SetLength(Source,ii);
|
|
for i := 1 to ii do
|
|
Source[i] := Chr(HexToInt(S[i * 2 - 1] + S[i * 2]));
|
|
DestLen := Length(Self.BufferString);
|
|
if uncompress(PChar(Self.Bufferstring),Destlen,pchar(Source), ii) = Z_OK then
|
|
begin;
|
|
if (Destlen mod 36) > 0 then
|
|
begin;
|
|
Writeln('Invalid DTM');
|
|
Exit;
|
|
end;
|
|
DestLen := DestLen div 36;
|
|
SetLength(Result.p,DestLen);
|
|
SetLength(Result.c,DestLen);
|
|
SetLength(Result.t,DestLen);
|
|
SetLength(Result.asz,DestLen);
|
|
SetLength(Result.ash,DestLen);
|
|
b := @Self.Bufferstring[1];
|
|
for i := 0 to DestLen - 1 do
|
|
begin;
|
|
c := i * 36;
|
|
Result.p[i].x := PInteger(@b^[c+1])^;
|
|
Result.p[i].y := PInteger(@b^[c+5])^;
|
|
Result.asz[i] := PInteger(@b^[c+12])^;
|
|
Result.ash[i] := PInteger(@b^[c+16])^;
|
|
Result.c[i] := PInteger(@b^[c+20])^;
|
|
Result.t[i] := PInteger(@b^[c+24])^;
|
|
end;
|
|
end;
|
|
result.l := length(result.p);
|
|
end;
|
|
|
|
function TMDTM.AddDTM(d: TDTM): Integer;
|
|
|
|
begin
|
|
if Length(FreeSpots) > 0 then
|
|
begin
|
|
DTMList[FreeSpots[High(FreeSpots)]] := TDTMTopDTM(d);
|
|
Result := FreeSpots[High(FreeSpots)];
|
|
SetLength(FreeSpots, High(FreeSpots));
|
|
end
|
|
else
|
|
begin
|
|
SetLength(DTMList, Length(DTMList) + 1);
|
|
DTMList[High(DTMList)] := TDTMTopDTM(d);
|
|
Result := High(DTMList);
|
|
end;
|
|
end;
|
|
|
|
{/\
|
|
Adds the given pDTM to the DTM Array, and returns it's index.
|
|
/\}
|
|
|
|
function TMDTM.AddpDTM(d: pDTM): Integer;
|
|
|
|
begin
|
|
if Length(FreeSpots) > 0 then
|
|
begin
|
|
DTMList[FreeSpots[High(FreeSpots)]] := d;
|
|
Result := FreeSpots[High(FreeSpots)];
|
|
SetLength(FreeSpots, High(FreeSpots));
|
|
end
|
|
Else
|
|
begin
|
|
SetLength(DTMList, Length(DTMList) + 1);
|
|
DTMList[High(DTMList)] := d;
|
|
Result := High(DTMList);
|
|
end;
|
|
end;
|
|
|
|
{/\
|
|
Returns the DTM (pDTM type) in the variable dtm at the given index.
|
|
Returns true is succesfull, false if the dtm does not exist.
|
|
/\}
|
|
|
|
function TMDTM.GetDTM(index: Integer; out dtm: pDTM): Boolean;
|
|
begin
|
|
Result := True;
|
|
try
|
|
dtm := DTMList[index];
|
|
except
|
|
begin
|
|
raise Exception.CreateFmt('The given DTM Index ([%d]) is invalid.',
|
|
[index]);
|
|
//WriteLn('DTM Index ' + IntToStr(index) + ' does not exist');
|
|
Result := False;
|
|
end;
|
|
end
|
|
end;
|
|
|
|
function TMDTM.SetDTMName(DTM: Integer; s: string): boolean;
|
|
var
|
|
dtm_: pDTM;
|
|
begin
|
|
if(GetDTM(dtm, dtm_)) then
|
|
begin
|
|
dtm_.n := s;
|
|
Exit(True);
|
|
end;
|
|
raise Exception.CreateFMT('SetDTMName: The given DTM %d does not exist.', [DTM]);
|
|
Exit(False);
|
|
end;
|
|
|
|
{/\
|
|
Unloads the DTM at the given index from the DTM Array.
|
|
Notes:
|
|
Will keep track of not used index, so it is very memory efficient.
|
|
/\}
|
|
|
|
Procedure TMDTM.FreeDTM(DTM: Integer);
|
|
begin
|
|
try
|
|
SetLength(DTMList[DTM].p, 0);
|
|
SetLength(DTMList[DTM].c, 0);
|
|
SetLength(DTMList[DTM].t, 0);
|
|
SetLength(DTMList[DTM].asz, 0);
|
|
SetLength(DTMList[DTM].ash, 0);
|
|
DTMList[DTM].l := 0;
|
|
except
|
|
raise Exception.CreateFmt('Invalid DTM passed to FreeDTM', []);
|
|
//WriteLn('Invalid DTM');
|
|
end;
|
|
SetLength(FreeSpots, Length(FreeSpots) + 1);
|
|
FreeSpots[High(FreeSpots)] := DTM;
|
|
end;
|
|
|
|
|
|
{
|
|
Tries to find the given DTM (index). If found will put the point the dtm has
|
|
been found at in x, y and result to true.
|
|
}
|
|
{function TMDTM.FindDTM(DTM: Integer; out x, y: Integer; x1, y1, x2, y2: Integer): Boolean;
|
|
var
|
|
temp: pDTM;
|
|
begin
|
|
if GetDTM(DTM, temp) then
|
|
Result := pFindDTM(temp, x, y, x1, y1, x2, y2)
|
|
else
|
|
begin
|
|
x := 0;
|
|
y := 0;
|
|
Result := False;
|
|
end;
|
|
end; }
|
|
|
|
{
|
|
Tries to find the given pDTM. If found will put the point the dtm has
|
|
been found at in x, y and result to true.
|
|
}
|
|
|
|
{function TMDTM.pFindDTM(DTM: pDTM; out x, y: Integer; x1, y1, x2, y2: Integer): Boolean;
|
|
|
|
|
|
begin
|
|
|
|
end; }
|
|
|
|
{/\
|
|
Tries to find the given DTM (index). Will return true if it has found one or more
|
|
DTM's. All the occurances are stored in the Points (TPointArray)
|
|
/\}
|
|
|
|
{function TMDTM.FindDTMs(DTM: Integer; out Points: TPointArray; x1, y1, x2, y2: Integer): Boolean;
|
|
Var
|
|
temp: pDTM;
|
|
Begin
|
|
If GetDTM(DTM, temp) Then
|
|
Result := pFindDTMs(temp, Points, x1, y1, x2, y2)
|
|
Else
|
|
Begin
|
|
SetLength(Points, 0);
|
|
Result := False;
|
|
End;
|
|
End; }
|
|
|
|
{/\
|
|
Tries to find the given pDTM. Will return true if it has found one or more
|
|
DTM's. All the occurances are stored in the Points (TPointArray)
|
|
/\}
|
|
|
|
|
|
|
|
{wat}
|
|
// Then, first find all occurances of all colours on the given client.
|
|
// Each point has a colour, and we call them C_0...C_n.
|
|
// MP denotes the points of the main point colour on the client.
|
|
// P_i denotes the points on the client for C_i
|
|
// O_i denotes the point offset, and possible area shape and size.
|
|
// B_i denotes a boolean representation of P_i for C_i, for C_1...C_n.
|
|
// B_0 and O_0 are the merry exception here, as we don't need them for C_0,
|
|
// which we will show later.
|
|
|
|
// I hope it is clear how this will be respresented in computer data
|
|
// structures.
|
|
|
|
// Now, we iterate for i in range(1, n),
|
|
// We use MP_i, and iterate for j in range(0, dtm_points),
|
|
// Calculate the B_j indices (with MP_i and O_j) for each j, and
|
|
// see if B_j is not true, go on with MP_i + 1.
|
|
// Possible using areasize/shape.
|
|
|
|
// else, if B_j is true, continue with this inner loop.
|
|
// If B_{0...dtm_points} were all true, the point is valid.
|
|
|
|
{/\
|
|
Tries to find the given DTM (index). If found will put the point the dtm has
|
|
been found at in x, y and result to true.
|
|
Will rotate the DTM starting at sAngle, increasing by aStep until eAngle has been reached, or when the DTM has been found.
|
|
Returns all Angles in an Extended array.
|
|
/\}
|
|
|
|
{Function TMDTM.FindDTMRotated(DTM: Integer; out x, y: Integer; x1, y1, x2, y2: Integer; sAngle, eAngle, aStep: Extended; out aFound: Extended): Boolean;
|
|
Var
|
|
temp: pDTM;
|
|
Begin
|
|
If GetDTM(DTM, temp) Then
|
|
Result := pFindDTMRotated(temp, x, y, x1, y1, x2, y2, sAngle, eAngle, aStep, aFound)
|
|
Else
|
|
Begin
|
|
x := 0;
|
|
y := 0;
|
|
aFound := 0.0;
|
|
Result := False;
|
|
End;
|
|
End; }
|
|
|
|
{/\
|
|
Tries to find the given pDTM. If found will put the point the dtm has
|
|
been found at in x, y and result to true.
|
|
Will rotate the DTM starting at sAngle, increasing by aStep until eAngle has been reached, or when the DTM has been found.
|
|
Returns all Angles in an Extended array.
|
|
/\}
|
|
|
|
{Function TMDTM.pFindDTMRotated(DTM: pDTM; out x, y: Integer; x1, y1, x2, y2: Integer; sAngle, eAngle, aStep: Extended; out aFound: Extended): Boolean;
|
|
|
|
Begin
|
|
|
|
End; }
|
|
|
|
{/\
|
|
Tries to find the given DTM (index). Will return true if it has found one or more
|
|
DTM's. All the occurances are stored in the Points (TPointArray)
|
|
Will rotate the DTM starting at sAngle, increasing by aStep until eAngle has been reached.
|
|
Does not stop rotating when one occurance of a DTM has been found.
|
|
Returns all Angles in a Two Dimensional Extended array.
|
|
/\}
|
|
|
|
{Function TMDTM.FindDTMsRotated(DTM: Integer; out Points: TPointArray; x1, y1, x2, y2: Integer; sAngle, eAngle, aStep: Extended; out aFound: T2DExtendedArray): Boolean;
|
|
Var
|
|
temp: pDTM;
|
|
Begin
|
|
If GetDTM(DTM, temp) Then
|
|
Result := pFindDTMsRotated(temp, Points, x1, y1, x2, y2, sAngle, eAngle, aStep, aFound)
|
|
Else
|
|
Begin
|
|
SetLength(Points, 0);
|
|
SetLength(aFound, 0);
|
|
Result := False;
|
|
End;
|
|
End; }
|
|
|
|
{/\
|
|
Tries to find the given pDTM. Will return true if it has found one or more
|
|
DTM's. All the occurances are stored in the Points (TPointArray)
|
|
Will rotate the DTM starting at sAngle, increasing by aStep until eAngle has been reached.
|
|
Does not stop rotating when one occurance of a DTM has been found.
|
|
Returns all Angles in a Two Dimensional Extended array.
|
|
/\}
|
|
|
|
{Function TMDTM.pFindDTMsRotated(DTM: pDTM; out Points: TPointArray; x1, y1, x2, y2: Integer; sAngle, eAngle, aStep: Extended; out aFound: T2DExtendedArray): Boolean;
|
|
|
|
Begin
|
|
// Don't forget to pre calculate the rotated points at the start.
|
|
// Saves a lot of rotatepoint() calls.
|
|
End; }
|
|
|
|
end.
|
|
|