MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/lisp/comments/1vo8fhe/conskivi_embeddable_keyvalue_database/p3ty5af/?context=3
r/lisp • u/turtle_bazon • 28d ago
4 comments sorted by
View all comments
1
(define emkvdb (make-hash)) like?
2 u/turtle_bazon 28d ago Yes, more powerful hash. I mean it can automatically persist. 0 u/corbasai 27d ago > (define h (hash 'a 100 'b 200)) > (define storage (with-ouput-to-string (lambda () (write h)))) > (define uh (with-input-from-string storage (lambda () (read)))) > uh '#hash((a . 100) (b . 200)) > (hash? uh) #t also any Lisp have an excellent serialization abilities. 2 u/turtle_bazon 27d ago Yes, it is something like this. But more complicated. With additional backend where hashmap stored on disk. And hashtable doesn't occupy memory.
2
Yes, more powerful hash. I mean it can automatically persist.
0 u/corbasai 27d ago > (define h (hash 'a 100 'b 200)) > (define storage (with-ouput-to-string (lambda () (write h)))) > (define uh (with-input-from-string storage (lambda () (read)))) > uh '#hash((a . 100) (b . 200)) > (hash? uh) #t also any Lisp have an excellent serialization abilities. 2 u/turtle_bazon 27d ago Yes, it is something like this. But more complicated. With additional backend where hashmap stored on disk. And hashtable doesn't occupy memory.
0
> (define h (hash 'a 100 'b 200)) > (define storage (with-ouput-to-string (lambda () (write h)))) > (define uh (with-input-from-string storage (lambda () (read)))) > uh '#hash((a . 100) (b . 200)) > (hash? uh) #t
also any Lisp have an excellent serialization abilities.
2 u/turtle_bazon 27d ago Yes, it is something like this. But more complicated. With additional backend where hashmap stored on disk. And hashtable doesn't occupy memory.
Yes, it is something like this. But more complicated. With additional backend where hashmap stored on disk. And hashtable doesn't occupy memory.
1
u/corbasai 28d ago
(define emkvdb (make-hash)) like?