Is there anyone that need new, or customized function or procedures. Cuz im better at creating functions and stuff that scripts. SO if anyone need a function for a script that there making then plz post them here.
Is there anyone that need new, or customized function or procedures. Cuz im better at creating functions and stuff that scripts. SO if anyone need a function for a script that there making then plz post them here.
Need testers. Part Complete Tut Runner and Account Creator
http://www.srl-forums.com/forum/acco...ut-t35933.html
http://www.fenjer.com/adnan/SRL/23/2...%20Creator.png
http://sfx-images.mozilla.org/affili...ox3/468x60.png
Can you improve my procedure? >_>
It gives 'Sure, I'll give it a go.' a few times round the loop, then fucks up. So I'd love a really nice procedure to click it. :P
SCAR Code:Procedure TalkTo;
begin
ClickToContinue;
wait(2000);
ClickNpcChatText('give it a go.');
wait(1000);
ClickToContinue;
wait(1000);
ClickToContinue;
wait(1000);
end;
Well idk but maybe this?
Yours:
SCAR Code:Procedure TalkTo;
begin
ClickToContinue;
wait(2000);
ClickNpcChatText('give it a go.');
wait(1000);
ClickToContinue;
wait(1000);
ClickToContinue;
wait(1000);
end;
Mines :
SCAR Code:Procedure TalkTo;
Begin
If(ClickToContinue)Then
Begin
Repeat
FTWait(3);
ClickToContinue;
Until(ClickNpcChatText('give it a go'))
End;
End;
that wouldnt work because give it a go comes as second more like:
SCAR Code:function ClicktoGo : boolean;
Begin
if ClickToContinue then
begin
Repeat
FTWait(3)
ClickToContinue;
Until(ClickNpcChatText('give it a go.'));
result:= true;
end;
if result then
begin
repeat
FTwait(3)
Clicktocontinue
until(not clicktocontinue)
end;
end;
Code:
- Narcle: I recall Jukka releasing a bunch of scripts like this before... Its how he rolls I think. rofl
- Solarwind: Dude, you are like... t3h s3x.
- Hy71194: JuKKa you're a machine! You released 3 scripts in 10 minutes! :O
- benjaa: woah.... Jukka is the man Guildminer pwns all
- NaumanAkhlaQ: And JuKKa Is my Her0!
function OrderIntArray(TheArray:array of integer):array of integer;
Put in an array of integer, spits out array in order, lowest to highest.
Also same but with array of Tpoint, that can sort by x or by y. Or make a separate function for x and for y, idc.


The Nerd how youre tut islnad im i need of that
I managed to make the function which was not very easy, but I did it. A function sorts TPoints from highest to lowest by either x or y.
And also one that does the same, but with integers.Code:{******************************************************************************* Function SortTPoints(Tpoints:TPointArray;SortByX:Boolean):TPointArray; By: THE NERD Description: Sorts TPointArrays from lowest to highest by either x or by depending on what you enter for SortByX *******************************************************************************} Function SortTPoints(Tpoints:TPointArray;SortByX:Boolean):TPointArray; var Numberinarray, I, II, C, NumberofSofar, CurrentNum, LargestNum:integer; Temp, Final: TPointArray; begin NumberInArray := getarraylength(TPoints); SetArrayLength(Temp, NumberInArray); SetArrayLength(Final, NumberInArray); CurrentNum := 0; For I := 0 to Numberinarray - 1 do begin Temp[I].x := TPoints[I].x; Temp[I].y := TPoints[I].y; end; If (SortByX) Then begin For II := 0 to Numberinarray - 1 do begin NumberofSofar := 0; For I := 0 to Numberinarray - 1 do begin If (Temp[II].x >= Temp[I].x) Then begin NumberofSofar := NumberofSofar + 1; end; If (NumberofSofar >= Numberinarray) Then begin LargestNum := Temp[II].x; end; end; end; Repeat For II := 0 to Numberinarray - 1 do begin NumberofSofar := 0; For I := 0 to Numberinarray - 1 do begin If (Temp[II].x <= Temp[I].x) Then begin NumberofSofar := NumberofSofar + 1; end; If (NumberofSofar >= Numberinarray) Then begin If (CurrentNum < NumberInArray) Then begin Final[CurrentNum].x := Temp[II].x; Final[CurrentNum].y := Temp[II].y; CurrentNum := CurrentNum + 1; Temp[II].x := LargestNum + 1; end; end; end; end; Until (CurrentNum >= NumberInArray); end; If Not (SortByX) Then begin For II := 0 to Numberinarray - 1 do begin NumberofSofar := 0; For I := 0 to Numberinarray - 1 do begin If (Temp[II].y >= Temp[I].y) Then begin NumberofSofar := NumberofSofar + 1; end; If (NumberofSofar >= Numberinarray) Then begin LargestNum := Temp[II].y; end; end; end; Repeat For II := 0 to Numberinarray - 1 do begin NumberofSofar := 0; For I := 0 to Numberinarray - 1 do begin If (Temp[II].y <= Temp[I].y) Then begin NumberofSofar := NumberofSofar + 1; end; If (NumberofSofar >= Numberinarray) Then begin If (CurrentNum < NumberInArray) Then begin Final[CurrentNum].y := Temp[II].y; Final[CurrentNum].x := Temp[II].x; CurrentNum := CurrentNum + 1; Temp[II].y := LargestNum + 1; end; end; end; end; Until (CurrentNum >= NumberInArray); end; Result := Final; end;
Code:{******************************************************************************* Function Sort(NumbersArray:Array Of Integer):Array of Integer; By: THE NERD Description: Sorts an array of integers from lowest to highest *******************************************************************************} Function Sort(NumbersArray:Array Of Integer):Array of Integer; var Numberinarray, I, II, C, NumberofSofar, CurrentNum, LargestNum:integer; Temp, Final: Array of Integer; begin NumberInArray := getarraylength(NumbersArray); SetArrayLength(Temp, NumberInArray); SetArrayLength(Final, NumberInArray); CurrentNum := 0; For I := 0 to Numberinarray - 1 do begin Temp[I] := NumbersArray[I]; end; For II := 0 to Numberinarray - 1 do begin NumberofSofar := 0; For I := 0 to Numberinarray - 1 do begin If (Temp[II] >= Temp[I]) Then begin NumberofSofar := NumberofSofar + 1; end; If (NumberofSofar >= Numberinarray) Then begin LargestNum := Temp[II]; end; end; end; Repeat For II := 0 to Numberinarray - 1 do begin NumberofSofar := 0; For I := 0 to Numberinarray - 1 do begin If (Temp[II] <= Temp[I]) Then begin NumberofSofar := NumberofSofar + 1; end; If (NumberofSofar >= Numberinarray) Then begin If (CurrentNum < NumberInArray) Then begin Final[CurrentNum] := Temp[II]; CurrentNum := CurrentNum + 1; Temp[II] := LargestNum + 1; end; end; end; end; Until (CurrentNum >= NumberInArray); Result := Final; end;
Need testers. Part Complete Tut Runner and Account Creator
http://www.srl-forums.com/forum/acco...ut-t35933.html
http://www.fenjer.com/adnan/SRL/23/2...%20Creator.png
http://sfx-images.mozilla.org/affili...ox3/468x60.png
Good job, thanks!
There are currently 1 users browsing this thread. (0 members and 1 guests)