diff options
| author | Lisandro Pin <lisandro.pin@proton.ch> | 2025-06-06 14:59:11 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-06-06 05:59:11 -0700 |
| commit | 00c621abb8effbfdf5f58b3603fcc0175c688b7b (patch) | |
| tree | 03d1ea57df59bced26aa39002cefbe614010e90e | |
| parent | c99530ec666cfa8b0ef8063bd0b14ae944e28894 (diff) | |
| download | seaweedfs-00c621abb8effbfdf5f58b3603fcc0175c688b7b.tar.xz seaweedfs-00c621abb8effbfdf5f58b3603fcc0175c688b7b.zip | |
Fix dumb typo in 08556257 (#6844)
| -rw-r--r-- | weed/storage/needle_map/compact_map.go | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/weed/storage/needle_map/compact_map.go b/weed/storage/needle_map/compact_map.go index 33514476a..3146c7502 100644 --- a/weed/storage/needle_map/compact_map.go +++ b/weed/storage/needle_map/compact_map.go @@ -3,7 +3,7 @@ package needle_map /* CompactMap is an in-memory map of needle indeces, optimized for memory usage. * * It's implemented as a map of sorted indeces segments, which are in turn accessed through binary - * search. This guarantees a best-case scenario (ordered inserts/updates) of O(N) and a worst case + * search. This guarantees a best-case scenario (ordered inserts/updates) of O(1) and a worst case * scenario of O(log n) runtime, with memory usage unaffected by insert ordering. * * Note that even at O(log n), the clock time for both reads and writes is very low, so CompactMap |