tonytins/quickdb
1
0
Fork 0
mirror of https://github.com/tonytins/quickdb.git synced 2025-04-29 16:41:42 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions
A very simple proof of concept where the hash is a key that contains the value to be retrieved within a dictionary.
1 commit 1 branch 0 tags 34 KiB
Find a file
Exact
Tony Bark e03cd1dcca Initial commit
2025-03-23 00:56:57 -04:00
.config Initial commit 2025-03-23 00:56:57 -04:00
QuickDB Initial commit 2025-03-23 00:56:57 -04:00
QuickDB.Console Initial commit 2025-03-23 00:56:57 -04:00
QuickDB.Tests Initial commit 2025-03-23 00:56:57 -04:00
.editorconfig Initial commit 2025-03-23 00:56:57 -04:00
.gitignore Initial commit 2025-03-23 00:56:57 -04:00
LICENSE Initial commit 2025-03-23 00:56:57 -04:00
QuickDB.sln Initial commit 2025-03-23 00:56:57 -04:00
README.md Initial commit 2025-03-23 00:56:57 -04:00

README.md

QuickDB

This is a very simple proof of concept where the hash is a key that contains the value to be retrieved within a dictionary. The idea came to me after hearing (rather repeatedly) about hash tables being quit efficient at their jobs, I thought I'd try it out with a dictionary. While this is structured as a library, it currently functions (i.e. CreateFetch()) as a demo.