Hello, I am working on a project in which I have multiple 16x128x16 chunks of data(basically just a 3d array). I need to save the chunks so that they can be easily and quickly rebuilt later. The problem is that each element in the chunk is a short, so each chunk uses a lot of space. Would there be some algorithm that I could use to add all the values in the chunk together, then generate a key to rebuild the chunk based on the values added to it? If not, what is some other efficient approach that I could take?
Afropuff01
0
Newbie Poster
Recommended Answers
Jump to PostIt takes 8 bits to store a short, no matter how you decide to store it. So unless you have some way to compress the data you aren't going to be saving any space.
Does the data have large groupings of the same value?
All 3 Replies
Momerath
1,327
Nearly a Senior Poster
Featured Poster
sfuo
111
Practically a Master Poster
Momerath
1,327
Nearly a Senior Poster
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.