I did some tests on the string functions using the timere and here is what I found.

The len of longstring and longstring2 is 10000
The time to go though a simple empty for loop 20000 times is 1
The time to mid(longstring,0,1); 20000 times is 232
The time to dumString = mid(longstring,500000,1); 20000 times is 258
The time to dumString = mid(longstring,0,500000); 20000 times is 538
The time to dumString = right(longstring,500000); 20000 times is 536
The time to dumString = right(longstring,1); 20000 times is 232
The time to dumString = left(longstring,500000); 20000 times is 550
The time to dumString = left(longstring,1); 20000 times is 235
The time to dummy = strcmp(longstring,longstring2); 20000 times is 362
The time to dummy = strcmp(longstring,longstringcopy); 20000 times is 428
The time to dummy = len(longstring); 20000 times is 172
The time to do dumString = longstring; 20000 times is 218
The time to do dummy = 23; 20000 times is 0

comments
some things jumped out at me
with mid it didn't matter where you started
comparing equal strings takes longer than unequal strings
assinment of strings is slow

any comments, any other functions you want tested (I think this kind of stuff is fun)

Quote:Originally posted by gannon


comparing equal strings takes longer than unequal strings

Of course. You have to check every single element of equal strings to verify their equality, while as soon as you hit a different character in unequal strings, you have your answer.

dummyimage is a blank image created with new image with the dimentions 800x600
dummyimage2 is a colored image created with new image with the dimentions 100x200 and rectfill
The time to Line(0, 0, 1, 0, gray , dummyimage); 2000 times is 0
The time to Line(0, 0, 800, 0, gray , dummyimage); 2000 times is 12
The time to Line(0, 0, 692, 400, gray , dummyimage); 2000 times is 15
The time to Blit(0, 0, dummyimage2 , dummyimage); 2000 times is 15
The time to Blit(0, 500, dummyimage2 , dummyimage); 2000 times is 6
The time to RotScale(0, 0,90,1, dummyimage2 , dummyimage); 2000 times is 1053
The time to RotScale(0, 500,90,1, dummyimage2 , dummyimage); 2000 times is 1044
The time to RotScale(0, 0,180,1, dummyimage2 , dummyimage); 2000 times is 1045
The time to RotScale(0, 0,90,2, dummyimage2 , dummyimage); 2000 times is 1051

wow now that is what you call a difference

Quote:Originally posted by gannon

(I thought it also could be used to order them am I wrong on that?)
I can confirm that at least when comparing single characters, -1 is returned if the character in the string charA comes before the one in string charB, and 1 is returned if it comes after in the example:

sort = strcmp(charA, charB);

I would guess longer strings would yeild the same result.
El

The time to CallFunction('dummyFunction'); 2000 times is 10
The time to log('this is the song that never ends'); 2000 times is 110

question how do you put " into strings in verge?
I will work on the color replacement in a min.

Assuming you don't wish to use font subsets deluxe and type %q in your string, use:
"A " + chr(34) + "shameless" + chr(34) + " plug!"
to print:
A "shameless" plug!

El

[misplaced spaces]

the less than things messed me up

void changeColor(int from, int to, int image){





	int height = ImageHeight(image);


	int width = ImageWidth(image);


	


	int h = 0;


	int w = 0;


	


	for(h = 0; h < height; h++){


		for(w = 0; w < width; w++){


			if(GetPixel(w, h, image) == from){


				SetPixel(w, h, to, image);


			}


		}


	}


}

edit: wow the tabs are big here I have mine set at 4
edit of the edit: don't edit something you had to put the < in

1.6 Ghz pentium 4
384 MB of ram
Geforce 3 video card

but this is not about how fast something will run it is about what is faster than a different thing (also remember look how many times each one ran)

thats why I said I wasn't testing how fast the things were. this is just to get some idea of the speed of things. (unless you give us the real speeds) It would be usefull to get a general feel on the speed of various things.

Nope.