A Sparse Array of Any Type with Fast Access

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 using std::map;typedefmap > arr2SomeData;typedefmap > 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.

See also  Essential Measures for Safeguarding Your Digital Data

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist