SRL Archive - Help and Support

Ok, well i just recently got back into scripting and i dont remember a whole lot, so i was wondering if someone would be willing to help me out..

Currently i have a procedure that finds a color and stores that color into a TPointArray and splits it up using TPAtoATPAEx but now i want to know how to take all of those points and compare the distances from the center of the main screen. When it finds the one with the shortest distance i want it to check it to see if it is the right object and if it is not, to proceed onto the next point.. I know how to do everything except comparing the distance of the points… Help is greatly appreciated. :)

SortTPAFrom(TPA, Point(MSCX, MSCY));

Then just loop through the points and check each one.

Ahhh thank you very much.

or instead of using a FindColorsTolerance you could use FindColorsSpiralTolerance and make it start from the middle of the screen.

~RM

Dist({ forgot params });

Actually, it's Distance(x1, y1, x2, y2); =]

When you use TPAtoATPA(ex) it is best to use FindColorsSpiralTolerance(MSCX, MSCY, color, x1, y1, x2, y2, tol); However when you use SplitTPA(ex) it messes with the order of points so eventhough the point in the TPA are ordened, SplitTPA messes that up, so FindColorsSpiralTolerance won't help there. You could use SortATPAFrom(T2DPointArray, Point(MSCX, MSCY)); but in my experience that is not working well. What I do, I make another TPointArray, with the center of each found object (made by SplitTPA) and the perform a SortTPAFrom(TPA, Point(MSCX, MSCY)); on it. That works better for me.

But you're using TPAtoATPA so you should just use FindColorsSpiralTolerance :p

ooo Sumilion.. i like your idea… Interesting…

Sumilion is right, SortATPAFrom actually does half of the sorting an ATPA from a point; It sorts the TPAs in the ATPA from the point but not the ATPA itself…

From: n3ss3s
Sumilion is right, SortATPAFrom actually does half of the sorting an ATPA from a point; It sorts the TPAs in the ATPA from the point but not the ATPA itself…

Ah see I didn't know that :p

I'm too lazy to do it atm, but you can simply make it truly sort from the point if you first do SortATPAFrom and then, use the BubbleSort algorithm with Freddy's new Swap function that can swap anything of the same type, using the distance instead of the size of the int…

Ok guys, that problem is solved.. But now i have another question.. I'm searching for the object with a specific color with a tolerance, using FindColorsSpiralTolerance.. I would like to know if it is possible to list all of the colors it finds and puts into the array. I would like to display this as a writeln, for a debug function for my benefit. Please let me know if this is possible.

intArray := getColors(TPA);
 

thatll make a list of all the colors. You can use

clearSameIntegers(intArray);

to clear duplicate colors

I was wondering why sortATPAfrom wasnt working right for me. I really like your idea Sum, and im going to borrow it ;)

I know that part munk, but is there any way to convert an integer array to a string?? so i can put it into a Writeln?

Come on, try harder!

Just go through the array in a for loop doing Writeln(IntToStr(Arr))…

Yeah.. lol i did it a different way, but that way would work.

Ok, I'll try, but I don't got no scar to test…

function Find_Nearest_To_XY(cx, cy : Integer; TPA : TPointArray) : TPoint;
var
  I, L, D, Index, C : integer;
begin
  L := High(TPA)
  D := Distance(cx, cy, TPA[0].x, TPA[0].y) + 1; 
  For I:=0 to L do 
  begin
    C := D;
    D := Min(Distance(cx, cy, TPA[I].x, TPA[I].y), D);
    If (C > D) then Index := D;
  end;
  Result := TPA[Index];   
end;

Pretty sure it gives an error, but you can try;)