Timeline for Simple Key Value Database using C
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2023 at 12:30 | comment | added | P4PL4 | @PerdiEstaquel Thanks for the feedback! I had considered a BST and hash map, however I haven't encountered them in the context of writing to a file. From my understanding, these methods require the ability to index into an array. So, should I have made the KV entries of fixed size in the file so I could calculate file offsets (like one calculates memory offsets for an array)? | |
| Nov 11, 2023 at 15:55 | comment | added | chux | @PerdiEstaquel Good and fair point about looping vs hashtable (vs BST vs whatever). | |
| Nov 11, 2023 at 13:32 | comment | added | Perdi Estaquel | @Billal the OP was asking: "What ways can I improve?"...in my humble opinion, this is the BEST way to improve, and excuse me if this sounds harsh: the main reason he didn't progress to the next step in the application process...Hashtables are a basic concept, and if you do programming, you must know them | |
| Nov 11, 2023 at 13:21 | comment | added | Billal Begueradj | IMHO, this should be a comment, not an answer. | |
| S Nov 11, 2023 at 12:56 | review | First answers | |||
| Nov 11, 2023 at 13:21 | |||||
| S Nov 11, 2023 at 12:56 | history | answered | Perdi Estaquel | CC BY-SA 4.0 |