-
Notifications
You must be signed in to change notification settings - Fork 160
/
index.clj
998 lines (861 loc) · 40.1 KB
/
index.clj
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
(ns crux.index
(:require [crux.codec :as c]
[crux.db :as db]
[crux.kv :as kv]
[crux.memory :as mem]
[crux.morton :as morton]
[taoensso.nippy :as nippy])
(:import [clojure.lang IReduceInit Seqable Sequential]
crux.api.IndexVersionOutOfSyncException
crux.codec.EntityTx
[crux.index BinaryJoinLayeredVirtualIndexState DocAttributeValueEntityEntityIndexState EntityHistoryRangeState EntityValueEntityPeekState NAryJoinLayeredVirtualIndexState NAryWalkState RelationIteratorsState RelationNestedIndexState SortedVirtualIndexState UnaryJoinIteratorState UnaryJoinIteratorsThunkFnState UnaryJoinIteratorsThunkState ValueEntityValuePeekState]
[java.io Closeable DataInputStream]
[java.util Collections Comparator Date]
java.util.function.Supplier
[org.agrona DirectBuffer ExpandableDirectByteBuffer]
org.agrona.io.DirectBufferInputStream))
(set! *unchecked-math* :warn-on-boxed)
;; NOTE: A buffer returned from an kv/KvIterator can only be assumed
;; to be valid until the next call on the same iterator. In practice
;; this limitation is only for RocksJNRKv.
;; TODO: It would be nice to make this explicit somehow.
;; Indexes
(defrecord PrefixKvIterator [i ^DirectBuffer prefix]
kv/KvIterator
(seek [_ k]
(when-let [k (kv/seek i k)]
(when (mem/buffers=? k prefix (mem/capacity prefix))
k)))
(next [_]
(when-let [k (kv/next i)]
(when (mem/buffers=? k prefix (mem/capacity prefix))
k)))
(value [_]
(kv/value i))
Closeable
(close [_]
(.close ^Closeable i)))
(defn new-prefix-kv-iterator ^java.io.Closeable [i prefix]
(->PrefixKvIterator i prefix))
(def ^ThreadLocal seek-buffer-tl
(ThreadLocal/withInitial
(reify Supplier
(get [_]
(ExpandableDirectByteBuffer.)))))
;; AVE
(defn- attribute-value+placeholder [k ^ValueEntityValuePeekState peek-state]
(let [value (.value (c/decode-avec-key->evc-from k))]
(set! (.last-k peek-state) k)
(set! (.value peek-state) value)
[value :crux.index.binary-placeholder/value]))
(defrecord DocAttributeValueEntityValueIndex [i ^DirectBuffer attr ^ValueEntityValuePeekState peek-state]
db/Index
(seek-values [this k]
(when-let [k (->> (c/encode-avec-key-to
(.get seek-buffer-tl)
attr
(or k c/empty-buffer))
(kv/seek i))]
(attribute-value+placeholder k peek-state)))
(next-values [this]
(when-let [last-k (.last-k peek-state)]
(let [prefix-size (- (mem/capacity last-k) c/id-size c/id-size)]
(when-let [k (some->> (mem/inc-unsigned-buffer! (mem/limit-buffer (mem/copy-buffer last-k prefix-size (.get seek-buffer-tl)) prefix-size))
(kv/seek i))]
(attribute-value+placeholder k peek-state))))))
(defn new-doc-attribute-value-entity-value-index [snapshot attr]
(let [attr (c/->id-buffer attr)
prefix (c/encode-avec-key-to nil attr)]
(->DocAttributeValueEntityValueIndex (new-prefix-kv-iterator (kv/new-iterator snapshot) prefix) attr (ValueEntityValuePeekState. nil nil))))
(defn- attribute-value-entity-entity+value [snapshot i ^DirectBuffer current-k attr value entity-as-of-idx peek-eb ^DocAttributeValueEntityEntityIndexState peek-state]
(loop [k current-k]
(let [limit (- (mem/capacity k) c/id-size)]
(set! (.peek peek-state) (mem/inc-unsigned-buffer! (mem/limit-buffer (mem/copy-buffer k limit peek-eb) limit))))
(or (let [eid (.eid (c/decode-avec-key->evc-from k))
eid-buffer (c/->id-buffer eid)
[_ ^EntityTx entity-tx] (db/seek-values entity-as-of-idx eid-buffer)]
(when entity-tx
(let [eid-buffer (c/->id-buffer (.eid entity-tx))
version-k (c/encode-avec-key-to
(.get seek-buffer-tl)
attr
value
eid-buffer
(c/->id-buffer (.content-hash entity-tx)))]
(when (kv/get-value snapshot version-k)
[eid-buffer entity-tx]))))
(when-let [k (some->> (.peek peek-state) (kv/seek i))]
(recur k)))))
(defrecord ValueAndPrefixIterator [value prefix-iterator])
(defn- attribute-value-value+prefix-iterator ^crux.index.ValueAndPrefixIterator [i ^DocAttributeValueEntityValueIndex value-entity-value-idx attr prefix-eb]
(let [value (.value ^ValueEntityValuePeekState (.peek-state value-entity-value-idx))
prefix (c/encode-avec-key-to prefix-eb attr value)]
(ValueAndPrefixIterator. value (new-prefix-kv-iterator i prefix))))
(defrecord DocAttributeValueEntityEntityIndex [snapshot i ^DirectBuffer attr value-entity-value-idx entity-as-of-idx prefix-eb peek-eb ^DocAttributeValueEntityEntityIndexState peek-state]
db/Index
(seek-values [this k]
(when (c/valid-id? k)
(let [value+prefix-iterator (attribute-value-value+prefix-iterator i value-entity-value-idx attr prefix-eb)
value (.value value+prefix-iterator)
i (.prefix-iterator value+prefix-iterator)]
(when-let [k (->> (c/encode-avec-key-to
(.get seek-buffer-tl)
attr
value
(or k c/empty-buffer))
(kv/seek i))]
(attribute-value-entity-entity+value snapshot i k attr value entity-as-of-idx peek-eb peek-state)))))
(next-values [this]
(let [value+prefix-iterator (attribute-value-value+prefix-iterator i value-entity-value-idx attr prefix-eb)
value (.value value+prefix-iterator)
i (.prefix-iterator value+prefix-iterator)]
(when-let [k (some->> (.peek peek-state) (kv/seek i))]
(attribute-value-entity-entity+value snapshot i k attr value entity-as-of-idx peek-eb peek-state)))))
(defn new-doc-attribute-value-entity-entity-index [snapshot attr value-entity-value-idx entity-as-of-idx]
(->DocAttributeValueEntityEntityIndex snapshot (kv/new-iterator snapshot) (c/->id-buffer attr) value-entity-value-idx entity-as-of-idx
(ExpandableDirectByteBuffer.) (ExpandableDirectByteBuffer.)
(DocAttributeValueEntityEntityIndexState. nil)))
;; AEV
(defn- attribute-entity+placeholder [k attr entity-as-of-idx ^EntityValueEntityPeekState peek-state]
(let [eid (.eid (c/decode-aecv-key->evc-from k))
eid-buffer (c/->id-buffer eid)
[_ ^EntityTx entity-tx] (db/seek-values entity-as-of-idx eid-buffer)]
(set! (.last-k peek-state) k)
(set! (.entity-tx peek-state) entity-tx)
(if entity-tx
[(c/->id-buffer (.eid entity-tx)) :crux.index.binary-placeholder/entity]
::deleted-entity)))
(defrecord DocAttributeEntityValueEntityIndex [i ^DirectBuffer attr entity-as-of-idx ^EntityValueEntityPeekState peek-state]
db/Index
(seek-values [this k]
(when (c/valid-id? k)
(when-let [k (->> (c/encode-aecv-key-to
(.get seek-buffer-tl)
attr
(or k c/empty-buffer))
(kv/seek i))]
(let [placeholder (attribute-entity+placeholder k attr entity-as-of-idx peek-state)]
(if (= ::deleted-entity placeholder)
(db/next-values this)
placeholder)))))
(next-values [this]
(when-let [last-k (.last-k peek-state)]
(let [prefix-size (+ c/index-id-size c/id-size c/id-size)]
(when-let [k (some->> (mem/inc-unsigned-buffer! (mem/limit-buffer (mem/copy-buffer last-k prefix-size (.get seek-buffer-tl)) prefix-size))
(kv/seek i))]
(let [placeholder (attribute-entity+placeholder k attr entity-as-of-idx peek-state)]
(if (= ::deleted-entity placeholder)
(recur)
placeholder)))))))
(defn new-doc-attribute-entity-value-entity-index [snapshot attr entity-as-of-idx]
(let [attr (c/->id-buffer attr)
prefix (c/encode-aecv-key-to nil attr)]
(->DocAttributeEntityValueEntityIndex (new-prefix-kv-iterator (kv/new-iterator snapshot) prefix) attr entity-as-of-idx
(EntityValueEntityPeekState. nil nil))))
(defrecord EntityTxAndPrefixIterator [entity-tx prefix-iterator])
(defn- attribute-value-entity-tx+prefix-iterator ^crux.index.EntityTxAndPrefixIterator [i ^DocAttributeEntityValueEntityIndex entity-value-entity-idx attr prefix-eb]
(let [entity-tx ^EntityTx (.entity-tx ^EntityValueEntityPeekState (.peek-state entity-value-entity-idx))
prefix (c/encode-aecv-key-to prefix-eb attr (c/->id-buffer (.eid entity-tx)) (c/->id-buffer (.content-hash entity-tx)))]
(EntityTxAndPrefixIterator. entity-tx (new-prefix-kv-iterator i prefix))))
(defrecord DocAttributeEntityValueValueIndex [i ^DirectBuffer attr entity-value-entity-idx prefix-eb]
db/Index
(seek-values [this k]
(let [entity-tx+prefix-iterator (attribute-value-entity-tx+prefix-iterator i entity-value-entity-idx attr prefix-eb)
entity-tx ^EntityTx (.entity-tx entity-tx+prefix-iterator)
i (.prefix-iterator entity-tx+prefix-iterator)]
(when-let [k (->> (c/encode-aecv-key-to
(.get seek-buffer-tl)
attr
(c/->id-buffer (.eid entity-tx))
(c/->id-buffer (.content-hash entity-tx))
(or k c/empty-buffer))
(kv/seek i))]
[(mem/copy-buffer (.value (c/decode-aecv-key->evc-from k)))
entity-tx])))
(next-values [this]
(let [entity-tx+prefix-iterator (attribute-value-entity-tx+prefix-iterator i entity-value-entity-idx attr prefix-eb)
entity-tx ^EntityTx (.entity-tx entity-tx+prefix-iterator)
i (.prefix-iterator entity-tx+prefix-iterator)]
(when-let [k (kv/next i)]
[(mem/copy-buffer (.value (c/decode-aecv-key->evc-from k)))
entity-tx]))))
(defn new-doc-attribute-entity-value-value-index [snapshot attr entity-value-entity-idx]
(->DocAttributeEntityValueValueIndex (kv/new-iterator snapshot) (c/->id-buffer attr) entity-value-entity-idx
(ExpandableDirectByteBuffer.)))
;; Range Constraints
(defrecord PredicateVirtualIndex [idx pred seek-k-fn]
db/Index
(seek-values [this k]
(when-let [value+results (db/seek-values idx (seek-k-fn k))]
(when (pred (first value+results))
value+results)))
(next-values [this]
(when-let [value+results (db/next-values idx)]
(when (pred (first value+results))
value+results))))
(defn- value-comparsion-predicate
([compare-pred compare-v]
(value-comparsion-predicate compare-pred compare-v Integer/MAX_VALUE))
([compare-pred ^DirectBuffer compare-v max-length]
(if compare-v
(fn [value]
(and value (compare-pred (mem/compare-buffers value compare-v max-length))))
(constantly true))))
(defn new-less-than-equal-virtual-index [idx max-v]
(let [pred (value-comparsion-predicate (comp not pos?) (c/->value-buffer max-v))]
(->PredicateVirtualIndex idx pred identity)))
(defn new-less-than-virtual-index [idx max-v]
(let [pred (value-comparsion-predicate neg? (c/->value-buffer max-v))]
(->PredicateVirtualIndex idx pred identity)))
(defn new-greater-than-equal-virtual-index [idx min-v]
(let [min-v (c/->value-buffer min-v)
pred (value-comparsion-predicate (comp not neg?) min-v)]
(->PredicateVirtualIndex idx pred (fn [k]
(if (pred k)
k
min-v)))))
(defrecord GreaterThanVirtualIndex [idx]
db/Index
(seek-values [this k]
(or (db/seek-values idx k)
(db/next-values idx)))
(next-values [this]
(db/next-values idx)))
(defn new-greater-than-virtual-index [idx min-v]
(let [min-v (c/->value-buffer min-v)
pred (value-comparsion-predicate pos? min-v)
idx (->PredicateVirtualIndex idx pred (fn [k]
(if (pred k)
k
min-v)))]
(->GreaterThanVirtualIndex idx)))
(defn new-equals-virtual-index [idx v]
(let [v (c/->value-buffer v)
pred (value-comparsion-predicate zero? v)]
(->PredicateVirtualIndex idx pred (fn [k]
(if (pred k)
k
v)))))
(defn new-prefix-equal-virtual-index [idx ^DirectBuffer prefix-v]
(let [seek-k-pred (value-comparsion-predicate (comp not neg?) prefix-v (mem/capacity prefix-v))
pred (value-comparsion-predicate zero? prefix-v (mem/capacity prefix-v))]
(->PredicateVirtualIndex idx pred (fn [k]
(if (seek-k-pred k)
k
prefix-v)))))
(defn wrap-with-range-constraints [idx range-constraints]
(if range-constraints
(range-constraints idx)
idx))
;; Meta
(defn meta-kv [k v]
[(c/encode-meta-key-to (.get seek-buffer-tl) (c/->id-buffer k))
(mem/->off-heap (nippy/fast-freeze v))])
(defn store-meta [kv k v]
(kv/store kv [(meta-kv k v)]))
(defn read-meta [kv k]
(let [seek-k (c/encode-meta-key-to (.get seek-buffer-tl) (c/->id-buffer k))]
(with-open [snapshot (kv/new-snapshot kv)]
(some->> (kv/get-value snapshot seek-k)
(DirectBufferInputStream.)
(DataInputStream.)
(nippy/thaw-from-in!)))))
(defn swap-meta [kv k f & args]
(let [ret (apply f (read-meta kv k) args)]
(store-meta kv k ret)
ret))
;; Object Store
(defn evicted-doc?
[{:crux.db/keys [id evicted?] :as doc}]
(or (= :crux.db/evicted id) evicted?))
(defn keep-non-evicted-doc [doc]
(when-not (evicted-doc? doc)
doc))
(defn vectorize-value [v]
(cond-> v
(not (or (vector? v) (set? v)))
(vector)))
(defn doc-predicate-stats [doc evicted?]
(->> (for [[k v] doc]
[k (cond-> (count (vectorize-value v)) evicted? -)])
(into {})))
(defn update-predicate-stats [kv docs-stats]
(swap-meta kv :crux.kv/stats #(apply merge-with + % docs-stats)))
(defn doc-idx-keys [content-hash doc]
(let [id (c/->id-buffer (:crux.db/id doc))
content-hash (c/->id-buffer content-hash)]
(->> (for [[k v] doc
:let [k (c/->id-buffer k)]
v (vectorize-value v)
:let [v (c/->value-buffer v)]
:when (pos? (mem/capacity v))]
[(c/encode-avec-key-to nil k v id content-hash)
(c/encode-aecv-key-to nil k id content-hash v)])
(apply concat))))
(defn store-doc-idx-keys [kv idx-keys]
(kv/store kv (for [k idx-keys]
[k c/empty-buffer])))
(defn delete-doc-idx-keys [kv idx-keys]
(kv/delete kv idx-keys))
;; Utils
(defn doc-indexed? [snapshot eid content-hash]
(let [k (c/->id-buffer :crux.db/id)
eid (c/->id-buffer eid)
content-hash (c/->id-buffer content-hash)]
(boolean (kv/get-value snapshot (c/encode-aecv-key-to nil k eid content-hash eid)))))
(defn current-index-version [kv]
(with-open [snapshot (kv/new-snapshot kv)]
(some->> (kv/get-value snapshot (c/encode-index-version-key-to nil))
(c/decode-index-version-value-from))))
(defn check-and-store-index-version [kv]
(if-let [index-version (current-index-version kv)]
(when (not= c/index-version index-version)
(throw (IndexVersionOutOfSyncException.
(str "Index version on disk: " index-version " does not match index version of code: " c/index-version))))
(doto kv
(kv/store [[(c/encode-index-version-key-to nil)
(c/encode-index-version-value-to nil c/index-version)]])
(kv/fsync)))
kv)
;; NOTE: We need to copy the keys and values here, as the originals
;; returned by the iterator will (may) get invalidated by the next
;; iterator call.
(defn all-keys-in-prefix
([i prefix]
(all-keys-in-prefix i prefix false))
([i ^DirectBuffer prefix entries?]
(all-keys-in-prefix i prefix prefix entries?))
([i ^DirectBuffer seek-k prefix entries?]
((fn step [f-cons f-next]
(lazy-seq
(let [k (f-cons)]
(when (and k (mem/buffers=? prefix k (mem/capacity prefix)))
(cons (if entries?
[(mem/copy-to-unpooled-buffer k)
(mem/copy-to-unpooled-buffer (kv/value i))]
(mem/copy-to-unpooled-buffer k)) (step f-next f-next))))))
#(kv/seek i seek-k) #(kv/next i))))
(defn idx->series
[idx]
(reify
IReduceInit
(reduce [_ rf init]
(loop [ret (rf init (db/seek-values idx nil))]
(if-let [x (db/next-values idx)]
(let [ret (rf ret x)]
(if (reduced? ret)
@ret
(recur ret)))
ret)))
Seqable
(seq [_]
(when-let [result (db/seek-values idx nil)]
(->> (repeatedly #(db/next-values idx))
(take-while identity)
(cons result))))
Sequential))
(defn idx->seq
[idx]
(seq (idx->series idx)))
;; Entities
(defn- ^EntityTx enrich-entity-tx [entity-tx ^DirectBuffer content-hash]
(assoc entity-tx :content-hash (when (pos? (mem/capacity content-hash))
(c/safe-id (c/new-id content-hash)))))
(defn- safe-entity-tx ^crux.codec.EntityTx [entity-tx]
(-> entity-tx
(update :eid c/safe-id)
(update :content-hash c/safe-id)))
(defn- find-first-entity-tx-within-range [i min max eid]
(let [prefix-size (+ c/index-id-size c/id-size)
seek-k (c/encode-entity+z+tx-id-key-to
(.get seek-buffer-tl)
eid
min)]
(loop [k (kv/seek i seek-k)]
(when (and k (mem/buffers=? seek-k k prefix-size))
(let [z (c/decode-entity+z+tx-id-key-as-z-number-from k)]
(if (morton/morton-number-within-range? min max z)
(let [entity-tx (safe-entity-tx (c/decode-entity+z+tx-id-key-from k))
v (kv/value i)]
(if-not (mem/buffers=? (c/nil-id-buffer) v)
[(c/->id-buffer (.eid entity-tx))
(enrich-entity-tx entity-tx v)
z]
[::deleted-entity entity-tx z]))
(let [[litmax bigmin] (morton/morton-range-search min max z)]
(when-not (neg? (.compareTo ^Comparable bigmin z))
(recur (kv/seek i (c/encode-entity+z+tx-id-key-to
(.get seek-buffer-tl)
eid
bigmin)))))))))))
(defn- find-entity-tx-within-range-with-highest-valid-time [i min max eid prev-candidate]
(if-let [[_ ^EntityTx entity-tx z :as candidate] (find-first-entity-tx-within-range i min max eid)]
(let [[^long x ^long y] (morton/morton-number->longs z)
min-x (long (first (morton/morton-number->longs min)))
max-x (dec x)]
(if (and (not (pos? (Long/compareUnsigned min-x max-x)))
(not= y -1))
(let [min (morton/longs->morton-number
min-x
(unchecked-inc y))
max (morton/longs->morton-number
max-x
-1)]
(recur i min max eid candidate))
candidate))
prev-candidate))
(def ^:private min-date (Date. Long/MIN_VALUE))
(def ^:private max-date (Date. Long/MAX_VALUE))
(defrecord EntityAsOfIndex [i valid-time transact-time]
db/Index
(db/seek-values [this k]
(let [eid k
prefix-size (+ c/index-id-size c/id-size)
seek-k (c/encode-entity+vt+tt+tx-id-key-to
(.get seek-buffer-tl)
k
valid-time
transact-time
nil)]
(loop [k (kv/seek i seek-k)]
(when (and k (mem/buffers=? seek-k k prefix-size))
(let [entity-tx (safe-entity-tx (c/decode-entity+vt+tt+tx-id-key-from k))
v (kv/value i)]
(if (<= (compare (.tt entity-tx) transact-time) 0)
(when-not (mem/buffers=? (c/nil-id-buffer) v)
[(c/->id-buffer (.eid entity-tx))
(enrich-entity-tx entity-tx v)])
(if morton/*use-space-filling-curve-index?*
(let [seek-z (c/encode-entity-tx-z-number valid-time transact-time)]
(when-let [[k v] (find-entity-tx-within-range-with-highest-valid-time i seek-z morton/z-max-mask eid nil)]
(when-not (= ::deleted-entity k)
[k v])))
(recur (kv/next i)))))))))
(db/next-values [this]
(throw (UnsupportedOperationException.))))
(defn new-entity-as-of-index ^crux.index.EntityAsOfIndex [iterator valid-time transaction-time]
(->EntityAsOfIndex iterator (or valid-time min-date) (or transaction-time min-date)))
(defn entity-at [entity-as-of-idx eid]
(let [[_ entity-tx] (db/seek-values entity-as-of-idx (c/->id-buffer eid))]
entity-tx))
(defn entities-at [snapshot eids valid-time transact-time]
(with-open [i (kv/new-iterator snapshot)]
(let [entity-as-of-idx (new-entity-as-of-index i valid-time transact-time)]
(some->> (for [eid eids
:let [entity-tx (entity-at entity-as-of-idx eid)]
:when entity-tx]
entity-tx)
(not-empty)
(vec)))))
(defn- entity-history-range-step [i min max ^EntityHistoryRangeState state k]
(loop [k k]
(when (and k (mem/buffers=? (.prefix state) k (.capacity ^DirectBuffer (.prefix state))))
(let [z (c/decode-entity+z+tx-id-key-as-z-number-from k)]
(when (not (neg? (.compareTo ^Comparable max z)))
(if (morton/morton-number-within-range? min max z)
(let [entity-tx (safe-entity-tx (c/decode-entity+z+tx-id-key-from k))
v (kv/value i)]
[(c/->id-buffer (.eid entity-tx))
(enrich-entity-tx entity-tx v)])
(let [[litmax bigmin] (morton/morton-range-search min max z)]
(when-not (neg? (.compareTo ^Comparable bigmin z))
(recur (kv/seek i (c/encode-entity+z+tx-id-key-to
(.get seek-buffer-tl)
(.eid state)
bigmin)))))))))))
(defrecord EntityHistoryRangeIndex [i min max ^EntityHistoryRangeState state]
db/Index
(db/seek-values [this k]
(let [prefix-size (+ c/index-id-size c/id-size)
seek-k (c/encode-entity+z+tx-id-key-to
(.get seek-buffer-tl)
k
min)]
(set! (.eid state) k)
(set! (.prefix state) (mem/copy-buffer seek-k prefix-size))
(entity-history-range-step i min max state (kv/seek i seek-k))))
(db/next-values [this]
(entity-history-range-step i min max state (kv/next i))))
(defn new-entity-history-range-index [snapshot vt-start tt-start vt-end tt-end]
(let [vt-start (or vt-start min-date)
tt-start (or tt-start min-date)
vt-end (or vt-end max-date)
tt-end (or tt-end max-date)
[min max] (sort (reify Comparator
(compare [_ a b]
(.compareTo ^Comparable a b)))
[(c/encode-entity-tx-z-number vt-start tt-start)
(c/encode-entity-tx-z-number vt-end tt-end)])]
(->EntityHistoryRangeIndex (kv/new-iterator snapshot) min max
(EntityHistoryRangeState. nil nil))))
(defn entity-history-range [snapshot eid vt-start tt-start vt-end tt-end]
(let [idx (new-entity-history-range-index snapshot vt-start tt-start vt-end tt-end)]
(when-let [result (db/seek-values idx (c/->id-buffer eid))]
(->> (repeatedly #(db/next-values idx))
(take-while identity)
(cons result)
(not-empty)
(map second)))))
(defn all-entities [snapshot valid-time transact-time]
(with-open [i (kv/new-iterator snapshot)]
(let [eids (->> (all-keys-in-prefix i (c/encode-entity+vt+tt+tx-id-key-to (.get seek-buffer-tl)))
(map (comp :eid c/decode-entity+vt+tt+tx-id-key-from))
(distinct))]
(entities-at snapshot eids valid-time transact-time))))
;; TODO: Entity history would need to be able to use the Z order index
;; for us to be able to remove the old index. Outstanding questions
;; around how and if LITMAX would work together with seeks and prev
;; for ascending search.
(defn- entity-history-step [i seek-k f-cons f-next]
(lazy-seq
(let [k (f-cons)]
(when (and k (mem/buffers=? seek-k k (+ c/index-id-size c/id-size)))
(cons
(-> (c/decode-entity+vt+tt+tx-id-key-from k)
(safe-entity-tx)
(enrich-entity-tx (kv/value i)))
(entity-history-step i seek-k f-next f-next))))))
(defn entity-history-seq-ascending [snapshot eid ^Date from-valid-time ^Date transaction-time]
(let [i (kv/new-iterator snapshot)
seek-k (c/encode-entity+vt+tt+tx-id-key-to nil (c/->id-buffer eid) (Date. (dec (.getTime from-valid-time))))]
(->> (entity-history-step i seek-k #(when-let [k (kv/seek i seek-k)]
(kv/prev i)) #(kv/prev i))
(drop-while (fn [^EntityTx entity-tx]
(neg? (compare (.vt entity-tx) from-valid-time))))
(partition-by :vt)
(map (fn [group]
(->> group
(reverse)
(drop-while (fn [^EntityTx entity-tx]
(pos? (compare (.tt entity-tx) transaction-time))))
(first))))
(remove nil?))))
(defn entity-history-seq-descending [snapshot eid ^Date from-valid-time ^Date transaction-time]
(let [i (kv/new-iterator snapshot)
seek-k (c/encode-entity+vt+tt+tx-id-key-to nil (c/->id-buffer eid) from-valid-time)]
(->> (entity-history-step i seek-k #(kv/seek i seek-k) #(kv/next i))
(partition-by :vt)
(map (fn [group]
(->> group
(drop-while (fn [^EntityTx entity-tx]
(pos? (compare (.tt entity-tx) transaction-time))))
(first))))
(remove nil?))))
;; TODO: This would need to change to simply walk the entire Z curve
;; from a point in the right order.
(defn- entity-history-seq [i eid]
(let [seek-k (c/encode-entity+vt+tt+tx-id-key-to nil (c/->id-buffer eid))]
(for [[k v] (all-keys-in-prefix i seek-k true)]
(-> (c/decode-entity+vt+tt+tx-id-key-from k)
(enrich-entity-tx v)))))
(defn entity-history
([snapshot eid]
(entity-history snapshot eid Long/MAX_VALUE))
([snapshot eid n]
(with-open [i (kv/new-iterator snapshot)]
(->> (entity-history-seq i eid)
(take n)
(vec)))))
;; Join
(extend-protocol db/LayeredIndex
Object
(open-level [_])
(close-level [_])
(max-depth [_] 1))
(def ^:private sorted-virtual-index-key-comparator
(reify Comparator
(compare [_ [a] [b]]
(mem/compare-buffers (or a (c/nil-id-buffer))
(or b (c/nil-id-buffer))))))
(defrecord SortedVirtualIndex [values ^SortedVirtualIndexState state]
db/Index
(seek-values [this k]
(let [idx (Collections/binarySearch values
[k]
sorted-virtual-index-key-comparator)
[x & xs] (subvec values (if (neg? idx)
(dec (- idx))
idx))]
(set! (.seq state) (seq xs))
x))
(next-values [this]
(when-let [[x & xs] (.seq state)]
(set! (.seq state) (seq xs))
x)))
(defn new-sorted-virtual-index [idx-or-seq]
(let [idx-as-seq (if (satisfies? db/Index idx-or-seq)
(idx->seq idx-or-seq)
idx-or-seq)]
(->SortedVirtualIndex
(->> idx-as-seq
(sort-by first mem/buffer-comparator)
(distinct)
(vec))
(SortedVirtualIndexState. nil))))
;; NOTE: Not used by production code, kept for reference.
(defrecord OrVirtualIndex [indexes ^objects peek-state]
db/Index
(seek-values [this k]
(loop [[idx & indexes] indexes
i 0]
(when idx
(aset peek-state i (db/seek-values idx k))
(recur indexes (inc i))))
(db/next-values this))
(next-values [this]
(let [[n value] (->> (map-indexed vector peek-state)
(remove (comp nil? second))
(sort-by (comp first second) mem/buffer-comparator)
(first))]
(when n
(aset peek-state n (db/next-values (get indexes n))))
value)))
(defn new-or-virtual-index [indexes]
(->OrVirtualIndex indexes (object-array (count indexes))))
(defn or-known-triple-fast-path [snapshot e a v valid-time transact-time]
(when-let [[^EntityTx entity-tx] (entities-at snapshot [e] valid-time transact-time)]
(let [version-k (c/encode-aecv-key-to
nil
a
(c/->id-buffer (.eid entity-tx))
(c/->id-buffer (.content-hash entity-tx))
v)]
(when (kv/get-value snapshot version-k)
entity-tx))))
(defn- new-unary-join-iterator-state [idx [value results]]
(let [result-name (:name idx)]
(UnaryJoinIteratorState.
idx
(or value (c/nil-id-buffer))
(when (and result-name results)
{result-name results}))))
(defrecord UnaryJoinVirtualIndex [indexes ^UnaryJoinIteratorsThunkFnState state]
db/Index
(seek-values [this k]
(->> #(let [iterators (->> (for [idx indexes]
(new-unary-join-iterator-state idx (db/seek-values idx k)))
(sort-by (fn [x] (.key ^UnaryJoinIteratorState x)) mem/buffer-comparator)
(vec))]
(UnaryJoinIteratorsThunkState. iterators 0))
(set! (.thunk state)))
(db/next-values this))
(next-values [this]
(when-let [iterators-thunk (.thunk state)]
(when-let [iterators-thunk ^UnaryJoinIteratorsThunkState (iterators-thunk)]
(let [iterators (.iterators iterators-thunk)
index (.index iterators-thunk)
iterator-state ^UnaryJoinIteratorState (nth iterators index nil)
max-index (mod (dec index) (count iterators))
max-k (.key ^UnaryJoinIteratorState (nth iterators max-index nil))
match? (mem/buffers=? (.key iterator-state) max-k)
idx (.idx iterator-state)]
(->> #(let [next-value+results (if match?
(db/next-values idx)
(db/seek-values idx max-k))]
(when next-value+results
(set! (.iterators iterators-thunk)
(assoc iterators index (new-unary-join-iterator-state idx next-value+results)))
(set! (.index iterators-thunk) (mod (inc index) (count iterators)))
iterators-thunk))
(set! (.thunk state)))
(if match?
(let [new-results (map (fn [x] (.results ^UnaryJoinIteratorState x)) iterators)]
(when-let [result (->> new-results
(apply merge-with
(fn [x y]
(if (or (= :crux.index.binary-placeholder/entity y)
(= :crux.index.binary-placeholder/value y))
x y))))]
[max-k result]))
(recur))))))
db/LayeredIndex
(open-level [this]
(doseq [idx indexes]
(db/open-level idx)))
(close-level [this]
(doseq [idx indexes]
(db/close-level idx)))
(max-depth [this]
1))
(defn new-unary-join-virtual-index [indexes]
(->UnaryJoinVirtualIndex indexes (UnaryJoinIteratorsThunkFnState. nil)))
(defn constrain-join-result-by-empty-names [join-keys join-results]
(when (not-any? nil? (vals join-results))
join-results))
(defrecord NAryJoinLayeredVirtualIndex [unary-join-indexes ^NAryJoinLayeredVirtualIndexState state]
db/Index
(seek-values [this k]
(db/seek-values (nth unary-join-indexes (.depth state) nil) k))
(next-values [this]
(db/next-values (nth unary-join-indexes (.depth state) nil)))
db/LayeredIndex
(open-level [this]
(db/open-level (nth unary-join-indexes (.depth state) nil))
(set! (.depth state) (inc (.depth state)))
nil)
(close-level [this]
(db/close-level (nth unary-join-indexes (dec (long (.depth state))) nil))
(set! (.depth state) (dec (.depth state)))
nil)
(max-depth [this]
(count unary-join-indexes)))
(defn new-n-ary-join-layered-virtual-index [indexes]
(->NAryJoinLayeredVirtualIndex indexes (NAryJoinLayeredVirtualIndexState. 0)))
(defrecord BinaryJoinLayeredVirtualIndex [^BinaryJoinLayeredVirtualIndexState state]
db/Index
(seek-values [this k]
(db/seek-values (nth (.indexes state) (.depth state) nil) k))
(next-values [this]
(db/next-values (nth (.indexes state) (.depth state) nil)))
db/LayeredIndex
(open-level [this]
(db/open-level (nth (.indexes state) (.depth state) nil))
(set! (.depth state) (inc (.depth state)))
nil)
(close-level [this]
(db/close-level (nth (.indexes state) (dec (long (.depth state))) nil))
(set! (.depth state) (dec (.depth state)))
nil)
(max-depth [this]
2))
(defn new-binary-join-virtual-index
([]
(new-binary-join-virtual-index nil nil))
([lhs-index rhs-index]
(->BinaryJoinLayeredVirtualIndex (BinaryJoinLayeredVirtualIndexState.
[lhs-index rhs-index]
0))))
(defn update-binary-join-order! [^BinaryJoinLayeredVirtualIndex binary-join-index lhs-index rhs-index]
(set! (.indexes ^BinaryJoinLayeredVirtualIndexState (.state binary-join-index)) [lhs-index rhs-index])
binary-join-index)
(defn- build-constrained-result [constrain-result-fn result-stack [max-k new-values]]
(let [[max-ks parent-result] (last result-stack)
join-keys (conj (or max-ks []) max-k)]
(when-let [join-results (->> (merge parent-result new-values)
(constrain-result-fn join-keys)
(not-empty))]
(conj result-stack [join-keys join-results]))))
(defrecord NAryConstrainingLayeredVirtualIndex [n-ary-index constrain-result-fn ^NAryWalkState state]
db/Index
(seek-values [this k]
(when-let [[value :as values] (db/seek-values n-ary-index k)]
(if-let [result (build-constrained-result constrain-result-fn (.result-stack state) values)]
(do (set! (.last state) result)
[value (second (last result))])
(db/next-values this))))
(next-values [this]
(when-let [[value :as values] (db/next-values n-ary-index)]
(if-let [result (build-constrained-result constrain-result-fn (.result-stack state) values)]
(do (set! (.last state) result)
[value (second (last result))])
(recur))))
db/LayeredIndex
(open-level [this]
(db/open-level n-ary-index)
(set! (.result-stack state) (.last state))
nil)
(close-level [this]
(db/close-level n-ary-index)
(set! (.result-stack state) (pop (.result-stack state)))
nil)
(max-depth [this]
(db/max-depth n-ary-index)))
(defn new-n-ary-constraining-layered-virtual-index [idx constrain-result-fn]
(->NAryConstrainingLayeredVirtualIndex idx constrain-result-fn (NAryWalkState. [] nil)))
(defn layered-idx->seq [idx]
(when idx
(let [max-depth (long (db/max-depth idx))
build-result (fn [max-ks [max-k new-values]]
(when new-values
(conj max-ks max-k)))
build-leaf-results (fn [max-ks idx]
(for [result (idx->seq idx)
:let [leaf-key (build-result max-ks result)]
:when leaf-key]
[leaf-key (last result)]))
step (fn step [max-ks ^long depth needs-seek?]
(when (Thread/interrupted)
(throw (InterruptedException.)))
(let [close-level (fn []
(when (pos? depth)
(lazy-seq
(db/close-level idx)
(step (pop max-ks) (dec depth) false))))
open-level (fn [result]
(db/open-level idx)
(if-let [max-ks (build-result max-ks result)]
(step max-ks (inc depth) true)
(do (db/close-level idx)
(step max-ks depth false))))]
(if (= depth (dec max-depth))
(concat (build-leaf-results max-ks idx)
(close-level))
(if-let [result (if needs-seek?
(db/seek-values idx nil)
(db/next-values idx))]
(open-level result)
(close-level)))))]
(when (pos? max-depth)
(step [] 0 true)))))
(defn- relation-virtual-index-depth ^long [^RelationIteratorsState iterators-state]
(dec (count (.indexes iterators-state))))
(defrecord RelationVirtualIndex [relation-name max-depth layered-range-constraints ^RelationIteratorsState state]
db/Index
(seek-values [this k]
(when-let [idx (last (.indexes state))]
(let [[k ^RelationNestedIndexState nested-index-state] (db/seek-values idx k)]
(set! (.child-idx state) (some-> nested-index-state (.child-idx)))
(set! (.needs-seek? state) false)
(when k
[k (.value nested-index-state)]))))
(next-values [this]
(if (.needs-seek? state)
(db/seek-values this nil)
(when-let [idx (last (.indexes state))]
(let [[k ^RelationNestedIndexState nested-index-state] (db/next-values idx)]
(set! (.child-idx state) (some-> nested-index-state (.child-idx)))
(when k
[k (.value nested-index-state)])))))
db/LayeredIndex
(open-level [this]
(when (= max-depth (relation-virtual-index-depth state))
(throw (IllegalStateException. (str "Cannot open level at max depth: " max-depth))))
(set! (.indexes state) (conj (.indexes state) (.child-idx state)))
(set! (.child-idx state) nil)
(set! (.needs-seek? state) true)
nil)
(close-level [this]
(when (zero? (relation-virtual-index-depth state))
(throw (IllegalStateException. "Cannot close level at root.")))
(set! (.indexes state) (pop (.indexes state)))
(set! (.child-idx state) nil)
(set! (.needs-seek? state) false)
nil)
(max-depth [this]
max-depth))
(defn- build-nested-index [tuples [range-constraints & next-range-constraints]]
(-> (new-sorted-virtual-index
(for [prefix (vals (group-by first tuples))
:let [value (ffirst prefix)]]
[(c/->value-buffer value)
(RelationNestedIndexState.
value
(when (seq (next (first prefix)))
(build-nested-index (map next prefix) next-range-constraints)))]))
(wrap-with-range-constraints range-constraints)))
(defn update-relation-virtual-index!
([^RelationVirtualIndex relation tuples]
(update-relation-virtual-index! relation tuples (.layered-range-constraints relation)))
([^RelationVirtualIndex relation tuples layered-range-constraints]
(let [state ^RelationIteratorsState (.state relation)]
(set! (.indexes state) [(binding [nippy/*freeze-fallback* :write-unfreezable]
(build-nested-index tuples layered-range-constraints))])
(set! (.child-idx state) nil)
(set! (.needs-seek? state) false))
relation))
(defn new-relation-virtual-index
([relation-name tuples max-depth]
(new-relation-virtual-index relation-name tuples max-depth nil))
([relation-name tuples max-depth layered-range-constraints]
(let [iterators-state (RelationIteratorsState. nil nil false)]
(update-relation-virtual-index! (->RelationVirtualIndex relation-name max-depth layered-range-constraints iterators-state) tuples))))