Login | Register   
LinkedIn
Google+
Twitter
RSS Feed
Download our iPhone app
TODAY'S HEADLINES  |   ARTICLE ARCHIVE  |   FORUMS  |   TIP BANK
Browse DevX
Sign up for e-mail newsletters from DevX


Tip of the Day
Home » Tip Bank » C++
Language: C++
Expertise: Beginner
Oct 11, 2002

A Sparse Array of Any Type with Fast Access


A sparse array saves memory by not allocating memory for elements that are not initialized or to which you don't need access. They're quite easy using the STL map.

This example defines a two dimensional array of type SomeData and a three dimensional array of type SomeStruct:
 
#include <map>
using std::map;

typedef
map<unsigned,
map<unsigned, SomeData> > arr2SomeData;

typedef
map<unsigned,
map<unsigned,
map<unsigned, SomeStruct> > arr3SomeStruct;

Here's how to use it:
 
int main()
{
   arr2SomeData arr2SD;
   arr2SD[3][4] = SomeData();

   arr3SomeStruct arr3SS;
   arr3SS[0][3][4] = SomeStruct();

   return 0;
}

If SomeStruct and SomeData were non-integral types it would be more effective to use hash_map instead of map. However, hash_map is not a standard STL container.
Igor Soukhov
 
Comment and Contribute

 

 

 

 

 


(Maximum characters: 1200). You have 1200 characters left.

 

 

Sitemap
Thanks for your registration, follow us on our social networks to keep up-to-date