rendering question

[lolmister]

Im working on a project where i have to display many small squares on a grid, like a falling sands game. Im wondering if I could make my game run faster by drawing squares in groups as one big square? and if this would cause a speedup, how would I do it?

[pbrockway2]

In problems like this it is generally a good idea to to get the logic of the program solid (compiles,runs and passes your comprehensive tests so you're sure it is valid) before optimising things. The last thing you want is to be dealing with tricky painting code if the underlying stuff you are painting is buggy in some way.

The effectiveness of the improved painting code will (like the proverbial pudding) be seen only once you have written it and measured the effect.

-----

That's not to say that someone here can't look at how you are painting and suggest something. (In my limited experience speedup will be associated with some *simplification* of the code.) But for that to happen you will have to post the code that you are using to paint. Others may be familiar with this "falling sands game", but I'm not. Code should compile and run, but be free from dependencies on other aspects of the program - no-one wants to wade through hundreds of lines of code to examine 20 or so that deal with painting. That is, the data you are painting should be "mocked" in some way: supplied to the painting code in some simple way like an array, but resembling the actual data that would arise as your program runs (having realistic "clumping" properties for instance).

[DarrylBurke]

This one didn't bother to return to the first thread started, not even to thank Norm.
affecting other classes

I don't really expect any better behavior here.

db

[lolmister]

Sorry, This is the first time I've checked back. As for my draw code, here it is:
for(int i=0;i<width;i++){
for(int n=0;n<height;n++){
if(map[i][n]!=lmap[i][n]){
g.setColor(inf.getCol(map[i][n]));
g.fillRect(i*size, n*size, size, size);
}
}
}
width and height are the total number of cells, size is the size of each cell. g is the graphics 2d. Map[][] is what im drawing, it stores an int in each cell, and each int represents a different type of cell. inf.getCol(...) returns the color for each type of cell. lmap[][] is the map from the last refresh, i use it so that I can draw only the cells that have changed.

Is there any quick way for me to detect groups of cells of the same type that are in a rectangle?

[DarrylBurke]

BB Code List - Java Programming Forum

db

[lolmister]

what?

[Vinx]

what?

He wants you to put code tags around your snippet.

for(int i=0;i<width;i++){
for(int n=0;n<height;n++){
if(map[i][n]!=lmap[i][n]){
g.setColor(inf.getCol(map[i][n]));
g.fillRect(i*size, n*size, size, size);
}
}

As for the original topic itself, I apologize that I am unable to assist. I am just beginning Java.

[lolmister]

ooohhh... :P
sorry