bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Bithack optimizations, why not.

Browse Source 
It saves a branch and a (possibly inlined) function call, but it also
halves the runtime.
This commit is contained in:
Bert Peters
2018-12-05 22:37:22 +01:00
parent f426e7067a
commit f3d0297da5
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
2018/src/day05.rs
View File

@@ -13,7 +13,7 @@ impl Day05 {
fn reduce(mut data: Vec<u8>) -> usize {
let mut dptr = 0;
for iptr in 0..data.len() {
if dptr > 0 && (data[iptr].eq_ignore_ascii_case(&data[dptr - 1])) && data[iptr] != data[dptr - 1] {
if dptr > 0 && (data[iptr] ^ data[dptr - 1]) == 32 {
dptr -= 1;
} else {
data[dptr] = data[iptr];