Timeline for Using 2D arrays to make more efficient sequential storage
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2015 at 20:09 | vote | accept | rolfl | ||
| Mar 2, 2015 at 13:41 | answer | added | janos | timeline score: 7 | |
| Mar 2, 2015 at 12:44 | answer | added | Simon Forsberg | timeline score: 7 | |
| Mar 2, 2015 at 11:52 | comment | added | rolfl | @janos - the initial use case is presented here: Mapping arbitrary Int values to a linear index space | |
| Mar 2, 2015 at 9:29 | comment | added | janos | I think "Use Case" usually describe a scenario where something is useful, and it explains the purpose. That section above is more like a "Usage Example". So I would rephrase that, and also add some real example scenarios where this library will be useful (reduce overall complexity in some way). Disclamer: I'm not a native speaker so I could be all wrong. | |
| Mar 2, 2015 at 2:55 | history | tweeted | twitter.com/#!/StackCodeReview/status/572228690442133504 | ||
| Mar 1, 2015 at 23:41 | history | edited | rolfl | CC BY-SA 3.0 |
add concerns
|
| Mar 1, 2015 at 23:31 | comment | added | Simon Forsberg | Do you have any primary concerns about this? What would you like reviewers to focus on? API? Usability? Performance? Readability? Maintainability? Everything? | |
| Mar 1, 2015 at 23:14 | history | asked | rolfl | CC BY-SA 3.0 |