We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent f726a43 commit 4f33ea5Copy full SHA for 4f33ea5
1 file changed
src/ezmiller/relaunching_tablecloth_time.clj
@@ -45,6 +45,9 @@
45
;; tree-based index is pure overhead — you'd rebuild it constantly. As Chris
46
;; Nuernberger (author of tech.ml.dataset) put it: "Just sorting the dataset and
47
;; using binary search will outperform most/all tree structures in this scenario."
48
+;; (Notably, [Polars](https://pola.rs/) — the Rust-based DataFrame library gaining
49
+;; traction as a Pandas alternative — reached the same conclusion and has no index
50
+;; by design.)
51
;;
52
;; **On convenience:** The index adds implicit state threaded through your data.
53
;; Tablecloth's API avoids this — you always say which columns you're operating on.
0 commit comments