SRL Archive - SRL Archives

Just a bunch of unnecessary stuff..

Current one:

{*******************************************************************************
Function IsPointInTPA(Point:TPoint; TPA:TPointArray):Boolean;
By: Bad Boy JH
Description:
*******************************************************************************}
Function IsPointInTPA(Point:TPoint; TPA:TPointArray):Boolean;
var I:integer;
begin
  for i := 0 to high(TPA)-1 do
  begin
    if (TPA[i].x = Point.x) and (TPA[i].y = Point.y) then
    begin
      Result:= True
      Exit;
    end;
  end;
  Result := False
end;

New one

{*******************************************************************************
Function IsPointInTPA(Point:TPoint; TPA:TPointArray):Boolean;
By: Bad Boy JH
Description:
*******************************************************************************}
Function IsPointInTPA(Point:TPoint; TPA:TPointArray):Boolean;
var I:integer;
begin
  for i := 0 to high(TPA) - 1 do
    Result := (TPA[i].x = Point.x) and (TPA[i].y = Point.y);
end;

That would slow it down a little.

Sorry, but this won't work. It needs to break out of the loop otherwise the last points in the TPA corresponding will determine whether the argument is true or not.

From: IceFire908
Sorry, but this won't work. It needs to break out of the loop otherwise the last points in the TPA corresponding will determine whether the argument is true or not.

Ah >.< I see what you mean. Never mind then

erm, it seems that it should be looping up to high, not high -1? At the moment it looks like it will return false if the matching TPoint was the last one in the loop… If you did want to speed it up though, I think I suggested in his original thread somewhere that you can sort the TPA based on the TPoint then just compare the first point.

{*******************************************************************************
function IsPointInTPA(Point:TPoint; TPA:TPointArray): Boolean;
By: IceFire908
*******************************************************************************}

function IsPointInTPA(Point: TPoint; TPA: TPointArray): Boolean;
var
  I: LongInt;
begin
  for I := High(TPA) downto 0 do
    if ((TPA[I].X = Point.X) and (TPA[I].Y = Point.Y)) then
    begin
      Result:= True
      Exit;
    end;
end;

That's as fast as it will go SCAR side… I'll commit later when something else needs to be done.

Isn't it faster to split the comparison?

function IsPointInTPA2(Point: TPoint; TPA: TPointArray): Boolean;
var
  I: LongInt;
begin
  for I := High(TPA) downto 0 do
    if (TPA[I].X = Point.X) then if (TPA[I].Y = Point.Y) then
    begin
      Result:= True
      Exit;
    end;
  Result := False;
end;

From: nielsie95
Isn't it faster to split the comparison?

function IsPointInTPA2(Point: TPoint; TPA: TPointArray): Boolean;
var
  I: LongInt;
begin
  for I := High(TPA) downto 0 do
    if (TPA[I].X = Point.X) then if (TPA[I].Y = Point.Y) then
    begin
      Result:= True
      Exit;
    end;
  Result := False;
end;

Yea I'll do that.

Use WizzyPlugin's PointInTPA - same purpose, same params.

The problem of rewriting in Scar originates in that the WizzyPlugin one suddenly started crashing Scar or something or other. Unless you mean just steal the code.

From: mixster
The problem of rewriting in Scar originates in that the WizzyPlugin one suddenly started crashing Scar or something or other. Unless you mean just steal the code.

Oh sorry, wasn't aware of that. Ignore my post then.

Use nielsie's as scar doesn't have short circuit evalution. If you don't know what it is, wikipedia.


~RM

Committed.

From: Rasta Magician
Use nielsie's as scar doesn't have short circuit evalution. If you don't know what it is, wikipedia.


~RM

I'm pretty sure I know what you mean by that.

I hope what you meant was this:

SRL Rev 388+

{*******************************************************************************
function IsPointInTPA(Point:TPoint; TPA:TPointArray): Boolean;
By: IceFire908
*******************************************************************************}

function IsPointInTPA(Point: TPoint; TPA: TPointArray): Boolean;
var
  I: LongInt;
begin
  for I := High(TPA) downto 0 do
    if (TPA[I].X = Point.X) then
      if (TPA[I].Y = Point.Y) then
      begin
        Result:= True
        Exit;
      end;
end;

From: Rasta Magician
Use nielsie's as scar doesn't have short circuit evalution. If you don't know what it is, wikipedia.


~RM

wtf.
Any good interpreter/language uses short circuit evaluation :duh:

From: noidea
wtf.
Any good interpreter/language uses short circuit evaluation :duh:

Not scar tho.

~RM

From: Rasta Magician
Not scar tho.

~RM

I think I can vaguely remember Wizzup? saying that SCAR had short circuit evaluation..?

It doesn't. You can easily test it and see.

function meow: Boolean;
begin
  Writeln('Meow!');
  Result := True;
end;

begin
  Writeln('Begin');
  
  if (False) and (meow) then
    Writeln('Defying the laws of Booleans!');

  if (True) or (meow) then
    Writeln('Following the laws of Booleans!');

  Writeln('End');
end.

From: Zyt3x
I think I can vaguely remember Wizzup? saying that SCAR had short circuit evaluation..?

program New;

var
  time, i: integer;
  boolF, boolT: boolean;

begin
  boolF := False;
  boolT := True;
  
  Time := GetSystemTime;
  for i := 0 to 99999 do
    if (boolF)and(boolT) then
      wait(1);
  writeln(GetSystemTime - Time);
  
  Time := GetSystemTime;
  for i := 0 to 99999 do
    if (boolF) then
      if (boolT) then
      wait(1);
  writeln(GetSystemTime - Time);
      

end.

From: scar

546
312

~RM

[SPAM]

Successfully compiled (21 ms)
124
75
Successfully executed

Funny. :p[/SPAM]

From: Timer
[SPAM]

Successfully compiled (21 ms)
124
75
Successfully executed

Funny. :p[/SPAM]

Oh you have a faster computer what a cool kid…

/facepalm
Stop caring about speed within the interpreter!