summaryrefslogtreecommitdiff
path: root/Roadmap.mdwn
diff options
context:
space:
mode:
Diffstat (limited to 'Roadmap.mdwn')
-rw-r--r--Roadmap.mdwn2
1 files changed, 1 insertions, 1 deletions
diff --git a/Roadmap.mdwn b/Roadmap.mdwn
index 8cba90b..f00442d 100644
--- a/Roadmap.mdwn
+++ b/Roadmap.mdwn
@@ -111,7 +111,7 @@ index an entire SSD worth of blocks, and for persistent data structures btrees
have a number of advantages over hash tables (can do extents, and when access
patterns have locality they preserve that locality). Using singleton btrees is
a major simplification when writing a filesystem, but it does mean that
-everything is leaving rather heavily on the performance and scalability of the
+everything is leaning rather heavily on the performance and scalability of the
btree implementation.
Bcachefs b-trees are a hybrid compacting data structure - they share some