Hi everyone,

I have a function "load_tiles" that creates and returns a pointer to an array of pointers.

To fill up the array, I use a for loop. Initially it was something like for(int i = 0; i < TOTAL_TILES, i++); however now I want to transform it to use pointers to increment - mostly for the experience, but the performance bit too :)

The problem is that when I want to access an element in the array to set whether it's walkable or not, I get an "expression must have a pointer to class type" error.

c_Tile** tileArray = new c_Tile*[TOTAL_TILES];

for (c_Tile **ptr = tileArray; ptr < (tileArray + TOTAL_TILES); ptr++)
	{
		short tileType = -1;

		map >> tileType;

		if ( tileType >= 0 && tileType <= 12 )
		{
			*ptr = new c_Tile(x, y, tileType);

			if ( tileType >= 3 && tileType <= 12 )
			{
				**ptr->setWalkable(false); /*I know there's something wrong with this, but what?*/
				c_Entity_is_movable::unWalkables.push_back(*ptr);
			}
			else
				**ptr->setWalkable(true); /*I know there's something wrong with this, but what?*/
		}

		else
			SDL_Quit();

		x += TILE_WIDTH;

		if ( x >= LEVEL_WIDTH )
		{
			x = 0;
			y += TILE_HEIGHT;
		}
	}

I've tried also tried *ptr->setWalkable(true), but to no avail - I already know why it doesn't work but it seemed worth a try. To me, **ptr->foo() makes sense since it's a pointer to a pointer; so I dereference twice and should be at a c_Tile*.

I actually didn't see the part apart converting it to pointers.

... but the performance bit too

Pointers are not necessarily going to help performance. Indirection and dynamic allocation are usually recommended against when trying to optimise code (where possible).

If ptr is a c_Tile **, then **ptr is a c_Tile, not a pointer to a c_Tile. You're probably having operator precedence problems here. Try (*ptr)->setWalkable() or (**ptr).setWalkable().

Ah! This was my problem. So I'm guessing that this is another little quirk about c++ I'll have to get used to...

@rip-off, those are some great suggestions - this is just a small project that I don't expect to go far; after (too) many memory errors because of unnecessary new() and delete() I've learned a lot of what not to do, and plan to make use of safer methods in the future - for now I'm going to try to push through with what I have :p

Pointers are generally slower than array indexing, because the compiler can reason about aliasing (whether or not two pointer point to the same thing) easier with arrays indexes, and will therefore be more aggressive at optimizing.

Pointers are generally slower than array indexing, because the compiler can reason about aliasing (whether or not two pointer point to the same thing) easier with arrays indexes, and will therefore be more aggressive at optimizing.

If you use an index to address a vector, it will have to calculate the address using integer multiplication and a pointer offset every time, because unless you have __restrict on everything it doesn't know whether the start address has changed.

Compilers are perfectly well able to reason about pointers.

They will generally do a good job with vector iterators too, because iterator implementations are written with performance in mind.

One thing is sure, though: the way you iterate through a vector is very unlikely to be significant when looking at the bigger picture.