Search for project
More than 2000 projects issued through our platform and this
amount increases very fast.
3-dimension access array (ID:6924)
| Project Creator: |
Enelar
FC Member For 4403 Days
Credits 20 Completed Proj. Num. 0 / 1 Total payment USD 0.00 Avg Daily Online 0.00 h (From 21/5/2007) Available on MSN/Skype No Last Login 2/11/2013 Peers Rating 0.00% 
|
|---|---|
| Budget: | Less than 250 |
| Created: | 2/10/2013 10:08:13 AM EST |
| Bidding Ends: | 2/15/2013 10:08:13 AM EST ( Expired ) |
| Development Cycle: | 5 Days |
| Bid Count: | 1
|
| Average Bid: | 250.00 |
| Project Description:
Array of <type>, template Requires the development of a data structure in which access to the elements produced by the three axes: x, y, z. structure is dynamically extensible, unit expansion - Chunk (16x16x16 elements). Appeal to a nonexistent chunk require explicit creation. When creating all the elements are filled with zeros. Need the following functionality: download chunk, all zeros unload chunk know is loaded chunk in which the element to be stored with these coordinates know the value of these coordinates change the value of these coordinates get chunk (which would continue to work directly, read and change quickly) get an iterator over all loaded chunk. == Need to pay attention: the restrictions on the coordinates - 32 bits, signed by all coordinates. Operations do not have to use multiple transitions between functions that make it difficult to debug == At any moment structure uses an adequate amount of memory. As i see it: chunk of chunks of .... of elements (like matrioshka) |
|
| Job Type | C/C++ |
| Attached Files: | N/A |
