Skip to content

⚡ optimize: use slice fill for code length repetitions in decompressor #428

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
404Setup merged 1 commit into from
Apr 29, 2026
Merged

⚡ optimize: use slice fill for code length repetitions in decompressor #428

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 9 additions & 18 deletions src/decompress/mod.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -462,38 +462,29 @@ impl Decompressor {
let rep_count = 3 + ((self.bitbuf & 3) as usize);
self.bitbuf >>= 2;
self.bitsleft -= 2;
for _ in 0..rep_count {
if i < total_syms {
self.lens[i] = rep_val;
i += 1;
}
}
let fill_len = min(rep_count, total_syms - i);
self.lens[i..i + fill_len].fill(rep_val);
i += fill_len;
} else if presym == 17 {
if self.bitsleft < 3 {
return DecompressResult::ShortInput;
}
let rep_count = 3 + ((self.bitbuf & 7) as usize);
self.bitbuf >>= 3;
self.bitsleft -= 3;
for _ in 0..rep_count {
if i < total_syms {
self.lens[i] = 0;
i += 1;
}
}
let fill_len = min(rep_count, total_syms - i);
self.lens[i..i + fill_len].fill(0);
i += fill_len;
} else {
if self.bitsleft < 7 {
return DecompressResult::ShortInput;
}
let rep_count = 11 + ((self.bitbuf & 0x7F) as usize);
self.bitbuf >>= 7;
self.bitsleft -= 7;
for _ in 0..rep_count {
if i < total_syms {
self.lens[i] = 0;
i += 1;
}
}
let fill_len = min(rep_count, total_syms - i);
self.lens[i..i + fill_len].fill(0);
i += fill_len;
}
}
if i != total_syms {
Expand Down