1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441
//! A region that encodes its contents.
use crate::{CopyOnto, CopyRegion, Region};
pub use self::misra_gries::MisraGries;
pub use dictionary::DictionaryCodec;
// TODO: Consolidation comes from Differential.
/// Sorts and consolidates `vec`.
///
/// This method will sort `vec` and then consolidate runs of more than one entry with
/// identical first elements by accumulating the second elements of the pairs. Should the final
/// accumulation be zero, the element is discarded.
fn consolidate<T: Ord>(vec: &mut Vec<(T, usize)>) {
consolidate_from(vec, 0);
}
/// Sorts and consolidate `vec[offset..]`.
///
/// This method will sort `vec[offset..]` and then consolidate runs of more than one entry with
/// identical first elements by accumulating the second elements of the pairs. Should the final
/// accumulation be zero, the element is discarded.
fn consolidate_from<T: Ord>(vec: &mut Vec<(T, usize)>, offset: usize) {
let length = consolidate_slice(&mut vec[offset..]);
vec.truncate(offset + length);
}
/// Sorts and consolidates a slice, returning the valid prefix length.
fn consolidate_slice<T: Ord>(slice: &mut [(T, usize)]) -> usize {
// We could do an insertion-sort like initial scan which builds up sorted, consolidated runs.
// In a world where there are not many results, we may never even need to call in to merge sort.
slice.sort_by(|x, y| x.0.cmp(&y.0));
let slice_ptr = slice.as_mut_ptr();
// Counts the number of distinct known-non-zero accumulations. Indexes the write location.
let mut offset = 0;
for index in 1..slice.len() {
// The following unsafe block elides various bounds checks, using the reasoning that `offset`
// is always strictly less than `index` at the beginning of each iteration. This is initially
// true, and in each iteration `offset` can increase by at most one (whereas `index` always
// increases by one). As `index` is always in bounds, and `offset` starts at zero, it too is
// always in bounds.
//
// LLVM appears to struggle to optimize out Rust's split_at_mut, which would prove disjointness
// using run-time tests.
unsafe {
assert!(offset < index);
// LOOP INVARIANT: offset < index
let ptr1 = slice_ptr.add(offset);
let ptr2 = slice_ptr.add(index);
if (*ptr1).0 == (*ptr2).0 {
(*ptr1).1 += (*ptr2).1;
} else {
if (*ptr1).1 != 0 {
offset += 1;
}
let ptr1 = slice_ptr.add(offset);
std::ptr::swap(ptr1, ptr2);
}
}
}
if offset < slice.len() && slice[offset].1 != 0 {
offset += 1;
}
offset
}
/// A region that encodes its data in a codec `C`.
#[derive(Default, Debug)]
pub struct CodecRegion<C: Codec, R = CopyRegion<u8>> {
inner: R,
codec: C,
}
impl<C: Codec, R> Region for CodecRegion<C, R>
where
for<'a> R: Region<ReadItem<'a> = &'a [u8]> + 'a,
for<'a> &'a [u8]: CopyOnto<R>,
{
type ReadItem<'a> = &'a [u8]
where
Self: 'a;
type Index = R::Index;
/// Construct a region that can absorb the contents of `regions` in the future.
fn merge_regions<'a>(regions: impl Iterator<Item = &'a Self> + Clone) -> Self
where
Self: 'a,
{
let codec = C::new_from(regions.clone().map(|r| &r.codec));
Self {
inner: R::merge_regions(regions.map(|r| &r.inner)),
codec,
}
}
fn index(&self, index: Self::Index) -> Self::ReadItem<'_> {
self.codec.decode(self.inner.index(index))
}
fn reserve_regions<'a, I>(&mut self, regions: I)
where
Self: 'a,
I: Iterator<Item = &'a Self> + Clone,
{
self.inner.reserve_regions(regions.map(|r| &r.inner));
}
fn clear(&mut self) {
self.codec = Default::default();
}
fn heap_size<F: FnMut(usize, usize)>(&self, mut callback: F) {
self.inner.heap_size(&mut callback);
self.codec.heap_size(callback);
}
}
impl<C: Codec, R> CopyOnto<CodecRegion<C, R>> for &[u8]
where
for<'a> R: Region<ReadItem<'a> = &'a [u8]> + 'a,
for<'a> &'a [u8]: CopyOnto<R>,
{
fn copy_onto(self, target: &mut CodecRegion<C, R>) -> <CodecRegion<C, R> as Region>::Index {
target.codec.encode(self, &mut target.inner)
}
}
/// Encode and decode byte strings.
pub trait Codec: Default + 'static {
/// Decodes an input byte slice into a sequence of byte slices.
fn decode<'a>(&'a self, bytes: &'a [u8]) -> &'a [u8];
/// Encodes a sequence of byte slices into an output byte slice.
fn encode<R: Region>(&mut self, bytes: &[u8], output: &mut R) -> R::Index
where
for<'a> &'a [u8]: CopyOnto<R>;
/// Constructs a new instance of `Self` from accumulated statistics.
/// These statistics should cover the data the output expects to see.
fn new_from<'a, I: Iterator<Item = &'a Self> + Clone>(stats: I) -> Self;
/// Diagnostic information about the state of the codec.
fn report(&self) {}
/// Heap size, size - capacity
fn heap_size<F: FnMut(usize, usize)>(&self, callback: F);
}
mod dictionary {
use crate::{CopyOnto, Region};
use std::collections::BTreeMap;
pub use super::{BytesMap, Codec, MisraGries};
/// A type that can both encode and decode sequences of byte slices.
#[derive(Default, Debug)]
pub struct DictionaryCodec {
encode: BTreeMap<Vec<u8>, u8>,
decode: BytesMap,
stats: (MisraGries<Vec<u8>>, [u64; 4]),
bytes: usize,
total: usize,
}
impl Codec for DictionaryCodec {
/// Decode a sequence of byte slices.
fn decode<'a>(&'a self, bytes: &'a [u8]) -> &'a [u8] {
if let Some(bytes) = self.decode.get(bytes[0].into()) {
bytes
} else {
bytes
}
}
/// Encode a sequence of byte slices.
///
/// Encoding also records statistics about the structure of the input.
fn encode<R: Region>(&mut self, bytes: &[u8], output: &mut R) -> R::Index
where
for<'a> &'a [u8]: CopyOnto<R>,
{
self.total += bytes.len();
// If we have an index referencing `bytes`, use the index key.
let index = if let Some(b) = self.encode.get(bytes) {
self.bytes += 1;
[*b].as_slice().copy_onto(output)
} else {
self.bytes += bytes.len();
bytes.copy_onto(output)
};
// Stats stuff.
self.stats.0.insert(bytes.to_owned());
let tag = bytes[0];
let tag_idx: usize = (tag % 4).into();
self.stats.1[tag_idx] |= 1 << (tag >> 2);
index
}
/// Construct a new encoder from supplied statistics.
fn new_from<'a, I: Iterator<Item = &'a Self> + Clone>(stats: I) -> Self {
// Collect most popular bytes from combined containers.
let mut mg = MisraGries::default();
for (thing, count) in stats.clone().flat_map(|stats| stats.stats.0.clone().done()) {
mg.update(thing, count);
}
let mut mg = mg.done().into_iter();
// Establish encoding and decoding rules.
let mut encode = BTreeMap::new();
let mut decode = BytesMap::default();
for tag in 0..=255 {
let tag_idx: usize = (tag % 4).into();
let shift = tag >> 2;
let or = stats
.clone()
.fold(0, |acc, stats| acc | stats.stats.1[tag_idx]);
if (or >> shift) & 0x01 != 0 {
decode.push(None);
} else if let Some((next_bytes, _count)) = mg.next() {
decode.push(Some(&next_bytes[..]));
encode.insert(next_bytes, tag);
}
}
Self {
encode,
decode,
stats: (MisraGries::default(), [0u64; 4]),
bytes: 0,
total: 0,
}
}
fn report(&self) {
let mut tags_used = 0;
tags_used += self.stats.1[0].count_ones();
tags_used += self.stats.1[1].count_ones();
tags_used += self.stats.1[2].count_ones();
tags_used += self.stats.1[3].count_ones();
let mg = self.stats.0.clone().done();
let mut bytes = 0;
for (vec, _count) in mg.iter() {
bytes += vec.len();
}
// if self.total > 10000 && !mg.is_empty() {
println!(
"\t{:?}v{:?}: {:?} -> {:?} + {:?} = (x{:?})",
tags_used,
mg.len(),
self.total,
self.bytes,
bytes,
self.total / (self.bytes + bytes),
)
// }
}
fn heap_size<F: FnMut(usize, usize)>(&self, _callback: F) {
// Lazy
}
}
}
/// A map from `0 .. something` to `Option<&[u8]>`.
///
/// Non-empty slices are pushed in order, and can be retrieved by index.
/// Pushing an empty slice is equivalent to pushing `None`.
#[derive(Debug)]
pub struct BytesMap {
offsets: Vec<usize>,
bytes: Vec<u8>,
}
impl Default for BytesMap {
fn default() -> Self {
Self {
offsets: vec![0],
bytes: Vec::new(),
}
}
}
impl BytesMap {
fn push(&mut self, input: Option<&[u8]>) {
if let Some(bytes) = input {
self.bytes.extend(bytes);
}
self.offsets.push(self.bytes.len());
}
fn get(&self, index: usize) -> Option<&[u8]> {
if index < self.offsets.len() - 1 {
let lower = self.offsets[index];
let upper = self.offsets[index + 1];
if lower < upper {
Some(&self.bytes[lower..upper])
} else {
None
}
} else {
None
}
}
#[allow(dead_code)]
fn len(&self) -> usize {
self.offsets.len() - 1
}
}
mod misra_gries {
/// Maintains a summary of "heavy hitters" in a presented collection of items.
#[derive(Clone, Debug)]
pub struct MisraGries<T> {
inner: Vec<(T, usize)>,
}
impl<T> Default for MisraGries<T> {
fn default() -> Self {
Self {
inner: Vec::with_capacity(1024),
}
}
}
impl<T: Ord> MisraGries<T> {
/// Inserts an additional element to the summary.
pub fn insert(&mut self, element: T) {
self.update(element, 1);
}
/// Inserts multiple copies of an element to the summary.
pub fn update(&mut self, element: T, count: usize) {
self.inner.push((element, count));
if self.inner.len() == self.inner.capacity() {
self.tidy();
}
}
/// Allocates a Misra-Gries summary which intends to hold up to `k` examples.
///
/// After `n` insertions it will contain only elements that were inserted at least `n/k` times.
/// The actual memory use is proportional to `2 * k`, so that we can amortize the consolidation.
pub fn with_capacity(k: usize) -> Self {
Self {
inner: Vec::with_capacity(2 * k),
}
}
/// Completes the summary, and extracts the items and their counts.
pub fn done(mut self) -> Vec<(T, usize)> {
use super::consolidate;
consolidate(&mut self.inner);
self.inner.sort_by(|x, y| y.1.cmp(&x.1));
self.inner
}
/// Internal method that reduces the summary down to at most `k-1` distinct items, by repeatedly
/// removing sets of `k` distinct items. The removal is biased towards the lowest counts, so as
/// to preserve fidelity around the larger counts, for whatever that is worth.
fn tidy(&mut self) {
use super::consolidate;
consolidate(&mut self.inner);
self.inner.sort_by(|x, y| y.1.cmp(&x.1));
let k = self.inner.capacity() / 2;
if self.inner.len() > k {
let sub_weight = self.inner[k].1 - 1;
self.inner.truncate(k);
for (_, weight) in self.inner.iter_mut() {
*weight -= sub_weight;
}
while self.inner.last().map(|x| x.1) == Some(0) {
self.inner.pop();
}
}
}
}
}
#[cfg(test)]
mod tests {
use super::{Codec, CodecRegion, DictionaryCodec};
use crate::*;
#[test]
fn test_simple() {
let mut r = CodecRegion::<DictionaryCodec>::default();
for _ in 0..1000 {
let index = "abc".as_bytes().copy_onto(&mut r);
assert_eq!("abc".as_bytes(), r.index(index));
}
let mut r2 = CodecRegion::default();
for _ in 0..1000 {
let index = "abc".as_bytes().copy_onto(&mut r2);
assert_eq!("abc".as_bytes(), r2.index(index));
}
let mut r3 = CodecRegion::merge_regions([&r, &r2].into_iter());
for _ in 0..2000 {
let index = "abc".as_bytes().copy_onto(&mut r3);
assert_eq!("abc".as_bytes(), r3.index(index));
}
println!("new container after inserts:");
r.codec.report();
println!("second new container after inserts:");
r2.codec.report();
println!("new container with merged stats after inserts:");
r3.codec.report();
}
#[test]
fn test_multi() {
let mut regions = Vec::new();
for _ in 0..8 {
regions.push(CodecRegion::<DictionaryCodec>::default());
}
for _ in 0..1000 {
for r in &mut regions {
"abcdef".as_bytes().copy_onto(r);
"defghi".as_bytes().copy_onto(r);
}
}
let mut merged = CodecRegion::merge_regions(regions.iter());
for _ in 0..2000 {
let index = "abcdef".as_bytes().copy_onto(&mut merged);
assert_eq!("abcdef".as_bytes(), merged.index(index));
let index = "defghi".as_bytes().copy_onto(&mut merged);
assert_eq!("defghi".as_bytes(), merged.index(index));
}
println!("new container with merged stats after inserts:");
merged.codec.report();
}
}