Do parallel mapping over rows.
Not that it will make much difference, but performance on this is currently very poor.
This commit is contained in:
parent
18fbc61d2b
commit
733bc7768d
|
@ -128,7 +128,7 @@
|
||||||
([o]
|
([o]
|
||||||
(in-store-find-objects o {}))
|
(in-store-find-objects o {}))
|
||||||
([o s]
|
([o s]
|
||||||
(l/debug "Finding objects in:" o)
|
(when (map? o) (l/debug "Finding objects in:" o))
|
||||||
(cond
|
(cond
|
||||||
(set? o) s ;; TODO: should I search in sets for objects when storing?
|
(set? o) s ;; TODO: should I search in sets for objects when storing?
|
||||||
(map? o) (if (:walkmap.id/id o)
|
(map? o) (if (:walkmap.id/id o)
|
||||||
|
@ -274,4 +274,4 @@
|
||||||
([^IPersistentMap target ^IPersistentMap s]
|
([^IPersistentMap target ^IPersistentMap s]
|
||||||
(neighbour-ids target identity s))
|
(neighbour-ids target identity s))
|
||||||
([^IPersistentMap target ^IFn filter-fn ^IPersistentMap s]
|
([^IPersistentMap target ^IFn filter-fn ^IPersistentMap s]
|
||||||
(map :walkmap.id/id (neighbours target filter-fn s))))
|
(pmap :walkmap.id/id (neighbours target filter-fn s))))
|
||||||
|
|
Loading…
Reference in a new issue