Clojurians Log v2

;; Instead of sequential:                                                                                                                                                                                                                                   
[(attr-graph ?attr) ?g]                                                                                                                                                                                                                                     
[(bfs-reachable ?g $ ?p) ?r]                                                                                                                                                                                                                                
                                                                                                                                                                                                                                                              
;; Can write nested:                                                                                                                                                                                                                                        
[(bfs-reachable (attr-graph ?attr) $ ?p) ?r]                                                                                                                                                                                                                
                                                                                                                                                                                                                                                              
;; Or deeply nested:                                                                                                                                                                                                                                        
[(out-neighbors (reverse-graph (attr-graph ?attr)) $ ?p) ?incoming]

I am experimenting with graph algorithms a bit atm. and I was wondering whether it would be better to allow nested expressions in function calls. I am not convinced this is a good idea per se, but I tripped over this a few times when I started using Datomic, and it can be annoying to first bind each nested variable to a logic var. I am curious to hear others opinions on this? Also on which kind of graph algorithms people would be interested in. I have hierarchical Louvain for instance.

LMDB backend fails:

Caused by: java.lang.IllegalArgumentException: No implementation of method: :-assoc-serializers of protocol: #'konserve.protocols/PAssocSerializers found for class: konserve_lmdb.store.LMDBStore

org.replikativ/datahike "0.7.1631" io.replikativ/datahike-lmdb

Why would I get an error like this. I thought homogenous tuples can be of any length. It's stopping me from retracting the entity.

clojure.lang.ExceptionInfo: Bad format for value in pattern, must be a scalar, nil or a vector of two elements. {:error :search/pattern, :v ["" "tag139878778372080000" "tag139879675144920000"], :pattern [10484919 :taglist ["" "tag139878778372080000" "tag139879675144920000"]]}

This is the schema definition:

{:db/ident :taglist
 :db/valueType :db.type/tuple
 :db/cardinality :db.cardinality/one
 :db/tupleType :db.type/string}