From 9ff1ffa9c1bf79439bb320c3a54966e498360dcf Mon Sep 17 00:00:00 2001 From: Alexander Neubeck Date: Tue, 16 Jul 2024 14:31:35 +0200 Subject: [PATCH] Update interval_encoding.rs --- crates/bpe/src/interval_encoding.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/crates/bpe/src/interval_encoding.rs b/crates/bpe/src/interval_encoding.rs index c296bd0..d17b22b 100644 --- a/crates/bpe/src/interval_encoding.rs +++ b/crates/bpe/src/interval_encoding.rs @@ -11,7 +11,7 @@ use crate::byte_pair_encoding::BytePairEncoding; /// is the predecessor of another node. /// With the `tree_depth` field the number of path length (which is equivalent to the number of encoded tokens) can be determined /// in O(1) as well. -/// +/// /// Note: the fields `tree_end` and `tree_depth` could also be represented by succinct data structures, reducing their size drastically. /// Since we still need the `tree_id` and `last_token` fields, this would in total reduce memory footprint by a bit less than 50%. pub struct IntervalEncoding<'a> {