generic-arraydeque 0.2.0

A fixed-capacity, stack-allocated double-ended queue (deque) backed by generic-array
Documentation
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
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
use core::str::from_utf8;
use std::io::{self, BufRead, IoSlice, Read, Write};

use super::{ArrayLength, GenericArrayDeque};

impl<N: ArrayLength> GenericArrayDeque<u8, N> {
  #[cfg_attr(not(tarpaulin), inline(always))]
  fn extend_bytes(&mut self, buf: &[u8]) {
    let written = unsafe {
      self.write_iter_wrapping(
        self.to_physical_idx(self.len),
        buf.iter().copied(),
        buf.len(),
      )
    };

    debug_assert_eq!(
      buf.len(),
      written,
      "The number of items written to VecDeque doesn't match the TrustedLen size hint"
    );
  }
}

/// Read is implemented for `GenericArrayDeque<u8>` by consuming bytes from the front of the `GenericArrayDeque`.
impl<N: ArrayLength> Read for GenericArrayDeque<u8, N> {
  /// Fill `buf` with the contents of the "front" slice as returned by
  /// [`as_slices`][`GenericArrayDeque::as_slices`]. If the contained byte slices of the `GenericArrayDeque` are
  /// discontiguous, multiple calls to `read` will be needed to read the entire content.
  #[inline]
  fn read(&mut self, buf: &mut [u8]) -> io::Result<usize> {
    let (ref mut front, _) = self.as_slices();
    let n = Read::read(front, buf)?;
    self.drain(..n);
    Ok(n)
  }

  #[inline]
  fn read_exact(&mut self, buf: &mut [u8]) -> io::Result<()> {
    let (front, back) = self.as_slices();

    // Use only the front buffer if it is big enough to fill `buf`, else use
    // the back buffer too.
    match SplitAtMut::split_at_mut_checked(buf, front.len()) {
      None => buf.copy_from_slice(&front[..buf.len()]),
      Some((buf_front, buf_back)) => match SplitAt::split_at_checked(back, buf_back.len()) {
        Some((back, _)) => {
          buf_front.copy_from_slice(front);
          buf_back.copy_from_slice(back);
        }
        None => {
          // Leave the buffered data in place — matches `VecDeque`'s
          // behavior and lets the caller retry or fall back to `read`.
          return Err(io::Error::new(
            io::ErrorKind::UnexpectedEof,
            "failed to fill whole buffer",
          ));
        }
      },
    }

    self.drain(..buf.len());
    Ok(())
  }

  #[inline]
  fn read_to_end(&mut self, buf: &mut Vec<u8>) -> io::Result<usize> {
    // The total len is known upfront so we can reserve it in a single call.
    let len = self.len();
    buf
      .try_reserve(len)
      .map_err(|_| io::ErrorKind::OutOfMemory)?;

    let (front, back) = self.as_slices();
    buf.extend_from_slice(front);
    buf.extend_from_slice(back);
    self.clear();
    Ok(len)
  }

  #[inline]
  fn read_to_string(&mut self, buf: &mut String) -> io::Result<usize> {
    // A single UTF-8 codepoint may straddle the ring's split point, so
    // validate the concatenated byte stream rather than each half.
    // `make_contiguous` reorganizes the physical buffer in place; after it,
    // `as_slices` returns everything in the front slice.
    let bytes = self.make_contiguous();
    let s = match from_utf8(bytes) {
      Ok(s) => s,
      Err(_) => {
        return Err(io::Error::new(
          io::ErrorKind::InvalidData,
          "stream did not contain valid UTF-8",
        ));
      }
    };

    buf
      .try_reserve(s.len())
      .map_err(|_| io::ErrorKind::OutOfMemory)?;

    let len = s.len();
    buf.push_str(s);
    // Match the `Read::read_to_string` contract: the source is consumed.
    self.clear();
    Ok(len)
  }
}

/// BufRead is implemented for `GenericArrayDeque<u8>` by reading bytes from the front of the `GenericArrayDeque`.
impl<N: ArrayLength> BufRead for GenericArrayDeque<u8, N> {
  /// Returns the contents of the "front" slice as returned by
  /// [`as_slices`][`GenericArrayDeque::as_slices`]. If the contained byte slices of the `GenericArrayDeque` are
  /// discontiguous, multiple calls to `fill_buf` will be needed to read the entire content.
  #[inline]
  fn fill_buf(&mut self) -> io::Result<&[u8]> {
    let (front, _) = self.as_slices();
    Ok(front)
  }

  #[inline]
  fn consume(&mut self, amt: usize) {
    self.drain(..amt);
  }
}

/// Write is implemented for `GenericArrayDeque<u8>` by appending to the `GenericArrayDeque`, growing it as needed.
impl<N: ArrayLength> Write for GenericArrayDeque<u8, N> {
  #[inline]
  fn write(&mut self, buf: &[u8]) -> io::Result<usize> {
    let remaining = self.remaining_capacity();
    if remaining == 0 || buf.is_empty() {
      return Ok(0);
    }

    let n = remaining.min(buf.len());
    self.extend_bytes(&buf[..n]);
    Ok(n)
  }

  #[inline]
  fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> io::Result<usize> {
    // Behave like `write` concatenated over the buffers: write as much as
    // fits and report the actual byte count. Returning `WriteZero` when
    // the combined length exceeds capacity would be inconsistent with the
    // scalar `write`, which performs partial writes.
    let mut written = 0;
    for buf in bufs {
      let remaining = self.remaining_capacity();
      if remaining == 0 {
        break;
      }
      let n = remaining.min(buf.len());
      if n == 0 {
        continue;
      }
      self.extend_bytes(&buf[..n]);
      written += n;
      if n < buf.len() {
        // Ran out of room mid-buffer; a further `write` would return 0.
        break;
      }
    }
    Ok(written)
  }

  #[inline]
  fn write_all(&mut self, buf: &[u8]) -> io::Result<()> {
    if buf.len() > self.remaining_capacity() {
      return Err(io::Error::new(
        io::ErrorKind::WriteZero,
        "not enough capacity to write buffer",
      ));
    }
    self.extend_bytes(buf);
    Ok(())
  }

  #[inline]
  fn flush(&mut self) -> io::Result<()> {
    Ok(())
  }
}

trait SplitAt {
  #[allow(unstable_name_collisions)]
  fn split_at_checked(&self, mid: usize) -> Option<(&Self, &Self)>;
}

trait SplitAtMut {
  #[allow(unstable_name_collisions)]
  fn split_at_mut_checked(&mut self, mid: usize) -> Option<(&mut Self, &mut Self)>;
}

#[rustversion::since(1.80)]
impl<T> SplitAt for [T] {
  #[allow(unstable_name_collisions)]
  #[cfg_attr(not(tarpaulin), inline(always))]
  fn split_at_checked(&self, mid: usize) -> Option<(&Self, &Self)> {
    <[T]>::split_at_checked(self, mid)
  }
}

#[rustversion::before(1.80)]
impl<T> SplitAt for [T] {
  #[allow(unstable_name_collisions)]
  #[cfg_attr(not(tarpaulin), inline(always))]
  fn split_at_checked(&self, mid: usize) -> Option<(&Self, &Self)> {
    use core::slice::from_raw_parts;

    let len = self.len();
    if mid <= len {
      // SAFETY: `0 <= mid <= self.len()`
      Some(unsafe {
        (
          from_raw_parts(self.as_ptr(), mid),
          from_raw_parts(self.as_ptr().add(mid), len - mid),
        )
      })
    } else {
      None
    }
  }
}

#[rustversion::since(1.80)]
impl<T> SplitAtMut for [T] {
  #[allow(unstable_name_collisions)]
  #[cfg_attr(not(tarpaulin), inline(always))]
  fn split_at_mut_checked(&mut self, mid: usize) -> Option<(&mut Self, &mut Self)> {
    <[T]>::split_at_mut_checked(self, mid)
  }
}

#[rustversion::before(1.80)]
impl<T> SplitAtMut for [T] {
  #[allow(unstable_name_collisions)]
  #[cfg_attr(not(tarpaulin), inline(always))]
  fn split_at_mut_checked(&mut self, mid: usize) -> Option<(&mut Self, &mut Self)> {
    use core::slice::from_raw_parts_mut;
    let len = self.len();
    if mid <= len {
      let len = self.len();
      // SAFETY: `0 <= mid <= self.len()`, so the two slices do not overlap.
      Some(unsafe {
        (
          from_raw_parts_mut(self.as_mut_ptr(), mid),
          from_raw_parts_mut(self.as_mut_ptr().add(mid), len - mid),
        )
      })
    } else {
      None
    }
  }
}

#[cfg(test)]
mod tests {
  use crate::{
    typenum::{U2, U4, U6, U8},
    GenericArrayDeque,
  };
  use std::{
    io::{self, BufRead, IoSlice, Read, Write},
    string::String,
    vec::Vec,
  };

  #[test]
  fn read_consumes_front_slice() {
    let mut deque = GenericArrayDeque::<u8, U8>::new();
    for byte in b"hello" {
      assert!(deque.push_back(*byte).is_none());
    }

    let mut buf = [0u8; 3];
    let read = Read::read(&mut deque, &mut buf).unwrap();
    assert_eq!(read, 3);
    assert_eq!(&buf[..read], b"hel");
    assert_eq!(deque.into_iter().collect::<Vec<_>>(), b"lo".to_vec());
  }

  #[test]
  fn read_exact_handles_wrapped_storage() {
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    for byte in b"abcd" {
      assert!(deque.push_back(*byte).is_none());
    }
    assert_eq!(deque.pop_front(), Some(b'a'));
    assert!(deque.push_back(b'e').is_none());

    let mut buf = [0u8; 3];
    deque.read_exact(&mut buf).unwrap();
    assert_eq!(&buf, b"bcd");
    assert_eq!(deque.into_iter().collect::<Vec<_>>(), vec![b'e']);
  }

  #[test]
  fn read_exact_reports_eof() {
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    assert!(deque.push_back(b'x').is_none());

    let mut buf = [0u8; 2];
    let err = Read::read_exact(&mut deque, &mut buf).unwrap_err();
    assert_eq!(err.kind(), io::ErrorKind::UnexpectedEof);
    // The buffered byte must remain in the deque — matches `VecDeque`.
    assert_eq!(deque.len(), 1);
    assert_eq!(deque.pop_front(), Some(b'x'));
  }

  #[test]
  fn read_to_end_and_string_clear_buffer() {
    let mut deque = GenericArrayDeque::<u8, U6>::new();
    for byte in b"abc" {
      assert!(deque.push_back(*byte).is_none());
    }
    let mut buf = Vec::new();
    deque.read_to_end(&mut buf).unwrap();
    assert_eq!(buf, b"abc");
    assert!(deque.is_empty());

    for byte in b"de" {
      assert!(deque.push_back(*byte).is_none());
    }
    let mut string = String::new();
    deque.read_to_string(&mut string).unwrap();
    assert_eq!(string, "de");
    // `read_to_string` consumes the source, like the `Read` contract demands.
    assert!(deque.is_empty());

    deque.clear();
    deque.push_back(0xFF);
    let mut invalid = String::new();
    let err = deque.read_to_string(&mut invalid).unwrap_err();
    assert_eq!(err.kind(), io::ErrorKind::InvalidData);
  }

  #[test]
  fn bufread_fill_and_consume() {
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    for byte in b"abcd" {
      assert!(deque.push_back(*byte).is_none());
    }

    let buf = BufRead::fill_buf(&mut deque).unwrap();
    assert_eq!(buf, b"abcd");
    BufRead::consume(&mut deque, 3);
    assert_eq!(deque.into_iter().collect::<Vec<_>>(), vec![b'd']);
  }

  #[test]
  fn write_variants_respect_capacity() {
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    let written = Write::write(&mut deque, b"abcdef").unwrap();
    assert_eq!(written, 4);
    assert_eq!(deque.len(), 4);

    let mut deque = GenericArrayDeque::<u8, U8>::new();
    let slices = [IoSlice::new(b"ab"), IoSlice::new(b"cd")];
    assert_eq!(Write::write_vectored(&mut deque, &slices).unwrap(), 4);
    assert_eq!(deque.len(), 4);
    // When the combined length exceeds remaining capacity, `write_vectored`
    // performs a partial write (matching scalar `write`) rather than erroring.
    let overflow = [IoSlice::new(b"1234"), IoSlice::new(b"5678")];
    let written = Write::write_vectored(&mut deque, &overflow).unwrap();
    assert_eq!(written, 4);
    assert_eq!(deque.len(), 8);

    let mut deque = GenericArrayDeque::<u8, U4>::new();
    Write::write_all(&mut deque, b"wxyz").unwrap();
    let err = Write::write_all(&mut deque, b"overflow").unwrap_err();
    assert_eq!(err.kind(), io::ErrorKind::WriteZero);

    let mut deque = GenericArrayDeque::<u8, U2>::new();
    Write::flush(&mut deque).unwrap();
  }

  // Regression: previously, `read_to_string` validated front and back slices
  // independently, so a codepoint whose bytes straddled the ring boundary
  // was rejected as InvalidData.
  #[test]
  fn read_to_string_accepts_utf8_across_ring_boundary() {
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    // Push 3 padding bytes then `é`'s leading byte; rotate head so `é`
    // ends up split across the physical buffer boundary.
    for _ in 0..3 {
      assert!(deque.push_back(b'x').is_none());
    }
    assert!(deque.push_back(0xC3).is_none());
    for _ in 0..3 {
      deque.pop_front();
    }
    assert!(deque.push_back(0xA9).is_none());
    // Confirm the bytes are actually split (each half is invalid UTF-8 alone).
    let (front, back) = deque.as_slices();
    assert_eq!(front, &[0xC3]);
    assert_eq!(back, &[0xA9]);

    let mut s = String::new();
    let n = deque.read_to_string(&mut s).unwrap();
    assert_eq!(n, 2);
    assert_eq!(s, "é");
    assert!(deque.is_empty());
  }

  // Regression: `write_vectored` used to return `WriteZero` when the combined
  // buffers exceeded remaining capacity, while `write` did partial writes.
  #[test]
  fn write_vectored_does_partial_writes() {
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    let slices = [IoSlice::new(b"12"), IoSlice::new(b"345")];
    let n = Write::write_vectored(&mut deque, &slices).unwrap();
    assert_eq!(n, 4);
    assert_eq!(deque.len(), 4);
    assert_eq!(deque.iter().copied().collect::<Vec<_>>(), b"1234");
  }

  #[test]
  fn read_exact_from_front_slice_only() {
    // Exercise the `split_at_mut_checked` → None arm where `buf` fits entirely
    // within the front slice.
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    for byte in b"abcd" {
      assert!(deque.push_back(*byte).is_none());
    }
    let mut buf = [0u8; 2];
    deque.read_exact(&mut buf).unwrap();
    assert_eq!(&buf, b"ab");
    assert_eq!(deque.iter().copied().collect::<Vec<_>>(), b"cd");
  }

  #[test]
  fn write_on_full_and_empty_buf_returns_zero() {
    // `remaining == 0` branch.
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    for byte in b"abcd" {
      assert!(deque.push_back(*byte).is_none());
    }
    assert_eq!(Write::write(&mut deque, b"xx").unwrap(), 0);

    // `buf.is_empty()` branch.
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    assert_eq!(Write::write(&mut deque, b"").unwrap(), 0);
  }

  #[test]
  fn write_vectored_skips_empty_slices() {
    // Exercise the `n == 0 { continue }` arm without hitting the full-capacity
    // break first.
    let mut deque = GenericArrayDeque::<u8, U4>::new();
    let slices = [IoSlice::new(b""), IoSlice::new(b"ab")];
    let n = Write::write_vectored(&mut deque, &slices).unwrap();
    assert_eq!(n, 2);
    assert_eq!(deque.iter().copied().collect::<Vec<_>>(), b"ab");
  }
}