// The uncompactor will output deduplicated and sorted elements as compaction algorithm
// guarantees it.
The uncompactor will output deduplicated and sorted elements as compaction algorithm
guarantees it.
The uncompactor will output deduplicated and sorted elements as compaction algorithm guarantees it .
fn uncompact(compacted: Vec<(u32, u32)>) -> Vec<u32> {
        let mut result = Vec::new();
        for (start, len) in compacted {
            result.extend(start..start + len);
        }
        result
    }
fn uncompact ( compacted : Vec < ( u32 , u32 ) > ) -> Vec < u32 > { let mut result = Vec :: new ( ) ; for ( start , len ) in compacted { result . extend ( start .. start + len ) ; } result }
The uncompactor will output deduplicated and sorted elements as compaction algorithm
guarantees it.
The uncompactor will output deduplicated and sorted elements as compaction algorithm guarantees it .
compacted
Vec<(u32, u32)>