#include "tileentry.hxx"
-FG_USING_STD(map);
-
-
-typedef map < long, FGTileEntry * > tile_map;
-typedef tile_map::iterator tile_map_iterator;
-typedef tile_map::const_iterator const_tile_map_iterator;
-
+SG_USING_STD(map);
// A class to store and manage a pile of tiles
class FGNewCache {
+ typedef map < long, FGTileEntry * > tile_map;
+ typedef tile_map::iterator tile_map_iterator;
+ typedef tile_map::const_iterator const_tile_map_iterator;
+
// cache storage space
tile_map tile_cache;
public:
// Constructor
- FGNewCache( void );
+ FGNewCache();
// Destructor
- ~FGNewCache( void );
+ ~FGNewCache();
// Initialize the tile cache subsystem
void init( void );
// Check if the specified "bucket" exists in the cache
- bool exists( const SGBucket& b );
+ bool exists( const SGBucket& b ) const;
// Ensure at least one entry is free in the cache
void make_space();
+ // Clear all completely loaded tiles (ignores partially loaded tiles)
+ void clear_cache();
+
// Fill in a tile cache entry with real data for the specified bucket
- void fill_in( const SGBucket& b );
+ // void fill_in( const SGBucket& b );
// Return a pointer to the specified tile cache entry
inline FGTileEntry *get_tile( const long tile_index ) {
inline int get_max_cache_size() const { return max_cache_size; }
inline void set_max_cache_size( int m ) { max_cache_size = m; }
-};
-
-// the tile cache
-extern FGNewCache global_tile_cache;
+ /**
+ * Create a new tile and enqueue it for loading.
+ * @param b
+ */
+ void insert_tile( FGTileEntry* e );
+};
#endif // _NEWCACHE_HXX