Deploy Bytes API documentation

.github/workflows/ci.yml

@@ -1,211 +0,0 @@
-name: CI
-
-on:
-  pull_request:
-    branches:
-      - master
-  push:
-    branches:
-      - master
-  schedule:
-    - cron: '0 2 * * 0'
-
-env:
-  RUSTFLAGS: -Dwarnings
-  RUST_BACKTRACE: 1
-  nightly: nightly-2024-09-15
-
-defaults:
-  run:
-    shell: bash
-
-jobs:
-  # Check formatting
-  rustfmt:
-    name: rustfmt
-    runs-on: ubuntu-latest
-    steps:
-    - uses: actions/checkout@v4
-    - name: Install Rust
-      run: rustup update stable
-    - name: Check formatting
-      run: cargo fmt --all --check
-
-  # TODO
-  # # Apply clippy lints
-  # clippy:
-  #   name: clippy
-  #   runs-on: ubuntu-latest
-  #   steps:
-  #   - uses: actions/checkout@v4
-  #   - name: Apply clippy lints
-  #     run: cargo clippy --all-features
-
-  # This represents the minimum Rust version supported by
-  # Bytes. Updating this should be done in a dedicated PR.
-  #
-  # Tests are not run as tests may require newer versions of
-  # rust.
-  minrust:
-    name: minrust
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install cargo-hack
-        uses: taiki-e/install-action@cargo-hack
-      - name: Check
-        run: cargo hack check --feature-powerset --optional-deps --rust-version
-
-  # Stable
-  stable:
-    name: stable
-    strategy:
-      matrix:
-        os:
-          - ubuntu-latest
-          - ubuntu-22.04-arm # TODO: update to 24.04 when https://github.com/rust-lang/rust/issues/135867 solved
-          - macos-latest
-          - windows-latest
-    runs-on: ${{ matrix.os }}
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        # --no-self-update is necessary because the windows environment cannot self-update rustup.exe.
-        run: rustup update stable --no-self-update
-      - name: Install cargo-hack
-        uses: taiki-e/install-action@cargo-hack
-      - name: Test
-        run: ci/test-stable.sh test
-
-  # Nightly
-  nightly:
-    name: nightly
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update $nightly && rustup default $nightly
-      - name: Install cargo-hack
-        uses: taiki-e/install-action@cargo-hack
-      - name: Test
-        run: ci/test-stable.sh test
-
-  panic-abort:
-    name: panic=abort tests
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update $nightly && rustup default $nightly
-      - name: Run tests with -Cpanic=abort
-        run: ci/panic-abort.sh
-
-  # Run tests on some extra platforms
-  cross:
-    name: cross
-    strategy:
-      matrix:
-        include:
-          - target: i686-unknown-linux-gnu
-            os: ubuntu-latest
-          - target: armv7-unknown-linux-gnueabihf
-            os: ubuntu-22.04-arm # TODO: update to 24.04 when https://github.com/rust-lang/rust/issues/135867 solved
-          - target: powerpc-unknown-linux-gnu
-            os: ubuntu-latest
-          - target: powerpc64-unknown-linux-gnu
-            os: ubuntu-latest
-          - target: wasm32-wasip1
-            os: ubuntu-latest
-    runs-on: ${{ matrix.os }}
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update stable
-      - uses: taiki-e/setup-cross-toolchain-action@v1
-        with:
-          target: ${{ matrix.target }}
-      - name: Test
-        run: cargo test --target ${{ matrix.target }}
-
-  # Build for no_std environment.
-  no-std:
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update stable
-      - name: Install cargo-hack
-        uses: taiki-e/install-action@cargo-hack
-      # thumbv6m-none-eabi supports atomic, but not atomic CAS.
-      # thumbv7m-none-eabi supports atomic CAS.
-      - run: rustup target add thumbv6m-none-eabi thumbv7m-none-eabi
-      # * --optional-deps is needed for serde feature
-      # * --no-dev-deps is needed to avoid https://github.com/rust-lang/cargo/issues/4866
-      - run: cargo hack build --target thumbv7m-none-eabi --feature-powerset --skip std,default --optional-deps --no-dev-deps
-      # A sound way to provide atomic CAS on platforms without native atomic CAS is system-dependent.
-      # portable-atomic provides major ways via cfgs and accepts user-defined implementations via critical-section feature.
-      - run: cargo hack build --target thumbv6m-none-eabi --feature-powerset --skip std,default --optional-deps --no-dev-deps --features extra-platforms,extra-platforms/critical-section
-
-  # Sanitizers
-  tsan:
-    name: tsan
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update $nightly && rustup default $nightly
-      - name: Install rust-src
-        run: rustup component add rust-src
-      - name: ASAN / TSAN
-        run: ci/tsan.sh
-
-  miri:
-    name: miri
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update $nightly && rustup default $nightly
-      - name: Miri
-        run: ci/miri.sh
-
-  # Loom
-  loom:
-    name: loom
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update $nightly && rustup default $nightly
-      - name: Loom tests
-        run: RUSTFLAGS="--cfg loom -Dwarnings" cargo test --lib
-
-  publish_docs:
-    name: Publish Documentation
-    needs:
-      - rustfmt
-      # - clippy
-      - stable
-      - nightly
-      - minrust
-      - cross
-      - tsan
-      - miri
-      - loom
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-      - name: Install Rust
-        run: rustup update $nightly && rustup default $nightly
-      - name: Build documentation
-        run: cargo doc --no-deps --all-features
-        env:
-          RUSTDOCFLAGS: --cfg docsrs
-      - name: Publish documentation
-        run: |
-          cd target/doc
-          git init
-          git add .
-          git -c user.name='ci' -c user.email='ci' commit -m 'Deploy Bytes API documentation'
-          git push -f -q https://git:${{ secrets.github_token }}@github.com/${{ github.repository }} HEAD:gh-pages
-        if: github.event_name == 'push' && github.event.ref == 'refs/heads/master' && github.repository == 'tokio-rs/bytes'

.gitignore

@@ -1,2 +0,0 @@
-/target
-/Cargo.lock

CHANGELOG.md

@@ -1,470 +0,0 @@
-# 1.12.1 (July 8th, 2026)
-
-### Fixed
-- Properly handle when `Box::new` panics (#837)
-
-# 1.12.0 (June 18th, 2026)
-
-### Added
-- Add `BytesMut::extend_from_within()` (#818)
-- Add `BytesMut::try_unsplit()` (#746)
-
-### Fixed
-- Fix panic in `get_int` if `nbytes` is zero (#806)
-
-### Changed
-- Pass vtable data by value (#826)
-- Exclude development scripts from published package (#810)
-
-### Documented
-- Document that `BytesMut::{reserve,try_reserve}` doesn't preserve unused capacity (#808)
-
-# 1.11.1 (February 3rd, 2026)
-
-- Fix integer overflow in `BytesMut::reserve`
-
-# 1.11.0 (November 14th, 2025)
-
-- Bump MSRV to 1.57 (#788)
-
-### Fixed
-
-- fix: `BytesMut` only reuse if src has remaining (#803)
-- Specialize `BytesMut::put::<Bytes>` (#793)
-- Reserve capacity in `BytesMut::put` (#794)
-- Change `BytesMut::remaining_mut` to use `isize::MAX` instead of `usize::MAX` (#795)
-
-### Internal changes
-
-- Guarantee address in `slice()` for empty slices. (#780)
-- Rename `Vtable::to_*` -> `Vtable::into_*` (#776)
-- Fix latest clippy warnings (#787)
-- Ignore `BytesMut::freeze` doctest on wasm (#790)
-- Move `drop_fn` of `from_owner` into vtable (#801)
-
-# 1.10.1 (March 5th, 2025)
-
-### Fixed
-
-- Fix memory leak when using `to_vec` with `Bytes::from_owner` (#773)
-
-# 1.10.0 (February 3rd, 2025)
-
-### Added
-
-- Add feature to support platforms without atomic CAS (#467)
-- `try_get_*` methods for `Buf` trait (#753)
-- Implement `Buf::chunks_vectored` for `Take` (#617)
-- Implement `Buf::chunks_vectored` for `VecDeque<u8>` (#708)
-
-### Fixed
-
-- Remove incorrect guarantee for `chunks_vectored` (#754)
-- Ensure that tests pass under `panic=abort` (#749)
-
-# 1.9.0 (November 27, 2024)
-
-### Added
-
-- Add `Bytes::from_owner` to enable externally-allocated memory (#742)
-
-### Documented
-
-- Fix typo in Buf::chunk() comment (#744)
-
-### Internal changes
-
-- Replace BufMut::put with BufMut::put_slice in Writer impl (#745)
-- Rename hex_impl! to fmt_impl! and reuse it for fmt::Debug (#743)
-
-# 1.8.0 (October 21, 2024)
-
-- Guarantee address in `split_off`/`split_to` for empty slices (#740)
-
-# 1.7.2 (September 17, 2024)
-
-### Fixed
-
-- Fix default impl of `Buf::{get_int, get_int_le}` (#732)
-
-### Documented
-
-- Fix double spaces in comments and doc comments (#731)
-
-### Internal changes
-
-- Ensure BytesMut::advance reduces capacity (#728)
-
-# 1.7.1 (August 1, 2024)
-
-This release reverts the following change due to a regression:
-
-- Reuse capacity when possible in `<BytesMut as Buf>::advance` impl (#698)
-
-The revert can be found at #726.
-
-# 1.7.0 (July 31, 2024)
-
-### Added
-
-- Add conversion from `Bytes` to `BytesMut` (#695, #710)
-- Add reclaim method without additional allocation (#686)
-
-### Documented
-
-- Clarify how `BytesMut::zeroed` works (#714)
-- Clarify the behavior of `Buf::chunk` (#717)
-
-### Changed
-
-- Change length condition of `BytesMut::truncate`
-- Reuse capacity when possible in `<BytesMut as Buf>::advance` impl (#698)
-- Improve `must_use` suggestion of `BytesMut::split` (#699)
-
-### Internal changes
-
-- Use `ManuallyDrop` instead of `mem::forget` (#678)
-- Don't set `len` in `BytesMut::reserve` (#682)
-- Optimize `Bytes::copy_to_bytes` (#688)
-- Refactor `BytesMut::truncate` (#694)
-- Refactor `BytesMut::resize` (#696)
-- Reorder assertion in `Bytes::split_to`, `Bytes::split_off` (#689, #693)
-- Use `offset_from` in more places (#705)
-- Correct the wrong usage of `IntoIter` (#707)
-
-# 1.6.1 (July 13, 2024)
-
-This release fixes a bug where `Bytes::is_unique` returns incorrect values when
-the `Bytes` originates from a shared `BytesMut`. (#718)
-
-# 1.6.0 (March 22, 2024)
-
-### Added
-
-- Add `Bytes::is_unique` (#643)
-
-### Documented
-
-- Fix changelog typo (#628)
-- Fix some spelling mistakes (#633)
-- Typo fix (#637)
-- Fix broken links (#639)
-- Add security policy (#649)
-
-### Internal changes
-
-- Move comment to correct constant (#629)
-- Various cleanup (#635)
-- Simplify `UninitSlice::as_uninit_slice_mut()` logic (#644)
-- Use `self.` instead of `Self::` (#642)
-- `BytesMut`: Assert alignment of `Shared` (#652)
-- Remove unnecessary namespace qualifier (#660)
-- Remove an unnecessary else branch (#662)
-- Remove unreachable else branch (#661)
-- make parameter mut in `From<Vec>` (#667)
-- Restore commented tests (#665)
-- Use `sub` instead of `offset` (#668)
-- Calculate original capacity only if necessary (#666)
-- `set_vec_pos` does not need a second parameter (#672)
-- `get_vec_pos`: use `&self` instead of `&mut self` (#670)
-- Refactor `split_at`/`split_to` (#663)
-- Use `Iterator` from the prelude (#673)
-- `copy_to_bytes`: Add panic section to docs (#676)
-- Remove redundant reserve call (#674)
-- Use `ManuallyDrop` instead of `mem::forget` (#675)
-
-
-# 1.5.0 (September 7, 2023)
-
-### Added
-
-- Add `UninitSlice::{new,uninit}` (#598, #599)
-- Implement `BufMut` for `&mut [MaybeUninit<u8>]` (#597)
-
-### Changed
-
-- Mark `BytesMut::extend_from_slice` as inline (#595)
-
-# 1.4.0 (January 31, 2023)
-
-### Added
-
-- Make `IntoIter` constructor public (#581)
-
-### Fixed
-
-- Avoid large reallocations when freezing `BytesMut` (#592)
-
-### Documented
-
-- Document which functions require `std` (#591)
-- Fix duplicate "the the" typos (#585)
-
-# 1.3.0 (November 20, 2022)
-
-### Added
-
-- Rename and expose `BytesMut::spare_capacity_mut` (#572)
-- Implement native-endian get and put functions for `Buf` and `BufMut` (#576)
-
-### Fixed
-
-- Don't have important data in unused capacity when calling reserve (#563)
-
-### Documented
-
-- `Bytes::new` etc should return `Self` not `Bytes` (#568)
-
-# 1.2.1 (July 30, 2022)
-
-### Fixed
-
-- Fix unbounded memory growth when using `reserve` (#560)
-
-# 1.2.0 (July 19, 2022)
-
-### Added
-
-- Add `BytesMut::zeroed` (#517)
-- Implement `Extend<Bytes>` for `BytesMut` (#527)
-- Add conversion from `BytesMut` to `Vec<u8>` (#543, #554)
-- Add conversion from `Bytes` to `Vec<u8>` (#547)
-- Add `UninitSlice::as_uninit_slice_mut()` (#548)
-- Add const to `Bytes::{len,is_empty}` (#514)
-
-### Changed
-
-- Reuse vector in `BytesMut::reserve` (#539, #544)
-
-### Fixed
-
-- Make miri happy (#515, #523, #542, #545, #553)
-- Make tsan happy (#541)
-- Fix `remaining_mut()` on chain (#488)
-- Fix amortized asymptotics of `BytesMut` (#555)
-
-### Documented
-
-- Redraw layout diagram with box drawing characters (#539)
-- Clarify `BytesMut::unsplit` docs (#535)
-
-# 1.1.0 (August 25, 2021)
-
-### Added
-
-- `BufMut::put_bytes(self, val, cnt)` (#487)
-- Implement `From<Box<[u8]>>` for `Bytes` (#504)
-
-### Changed
-
-- Override `put_slice` for `&mut [u8]` (#483)
-- Panic on integer overflow in `Chain::remaining` (#482)
-- Add inline tags to `UninitSlice` methods (#443)
-- Override `copy_to_bytes` for Chain and Take (#481)
-- Keep capacity when unsplit on empty other buf (#502)
-
-### Documented
-
-- Clarify `BufMut` allocation guarantees (#501)
-- Clarify `BufMut::put_int` behavior (#486)
-- Clarify actions of `clear` and `truncate`. (#508)
-
-# 1.0.1 (January 11, 2021)
-
-### Changed
-- mark `Vec::put_slice` with `#[inline]` (#459)
-
-### Fixed
-- Fix deprecation warning (#457)
-- use `Box::into_raw` instead of `mem::forget`-in-disguise (#458)
-
-# 1.0.0 (December 22, 2020)
-
-### Changed
-- Rename `Buf`/`BufMut` methods `bytes()` and `bytes_mut()` to `chunk()` and `chunk_mut()` (#450)
-
-### Removed
-- remove unused Buf implementation. (#449)
-
-# 0.6.0 (October 21, 2020)
-
-API polish in preparation for a 1.0 release.
-
-### Changed
-- `BufMut` is now an `unsafe` trait (#432).
-- `BufMut::bytes_mut()` returns `&mut UninitSlice`, a type owned by `bytes` to
-  avoid undefined behavior (#433).
-- `Buf::copy_to_bytes(len)` replaces `Buf::into_bytes()` (#439).
-- `Buf`/`BufMut` utility methods are moved onto the trait and `*Ext` traits are
-  removed (#431).
-
-### Removed
-- `BufMut::bytes_vectored_mut()` (#430).
-- `new` methods on combinator types (#434).
-
-# 0.5.6 (July 13, 2020)
-
-- Improve `BytesMut` to reuse buffer when fully `advance`d.
-- Mark `BytesMut::{as_mut, set_len}` with `#[inline]`.
-- Relax synchronization when cloning in shared vtable of `Bytes`.
-- Move `loom` to `dev-dependencies`.
-
-# 0.5.5 (June 18, 2020)
-
-### Added
-- Allow using the `serde` feature in `no_std` environments (#385).
-
-### Fix
-- Fix `BufMut::advance_mut` to panic if advanced passed the capacity (#354)..
-- Fix `BytesMut::freeze` ignoring amount previously `advance`d (#352).
-
-# 0.5.4 (January 23, 2020)
-
-### Added
-- Make `Bytes::new` a `const fn`.
-- Add `From<BytesMut>` for `Bytes`.
-
-### Fix
-- Fix reversed arguments in `PartialOrd` for `Bytes`.
-- Fix `Bytes::truncate` losing original capacity when repr is an unshared `Vec`.
-- Fix `Bytes::from(Vec)` when allocator gave `Vec` a pointer with LSB set.
-- Fix panic in `Bytes::slice_ref` if argument is an empty slice.
-
-# 0.5.3 (December 12, 2019)
-
-### Added
-- `must_use` attributes to `split`, `split_off`, and `split_to` methods (#337).
-
-### Fix
-- Potential freeing of a null pointer in `Bytes` when constructed with an empty `Vec<u8>` (#341, #342).
-- Calling `Bytes::truncate` with a size large than the length will no longer clear the `Bytes` (#333).
-
-# 0.5.2 (November 27, 2019)
-
-### Added
-- `Limit` methods `into_inner`, `get_ref`, `get_mut`, `limit`, and `set_limit` (#325).
-
-# 0.5.1 (November 25, 2019)
-
-### Fix
-- Growth documentation for `BytesMut` (#321)
-
-# 0.5.0 (November 25, 2019)
-
-### Fix
-- Potential overflow in `copy_to_slice`
-
-### Changed
-- Increased minimum supported Rust version to 1.39.
-- `Bytes` is now a "trait object", allowing for custom allocation strategies (#298)
-- `BytesMut` implicitly grows internal storage. `remaining_mut()` returns
-  `usize::MAX` (#316).
-- `BufMut::bytes_mut` returns `&mut [MaybeUninit<u8>]` to reflect the unknown
-  initialization state (#305).
-- `Buf` / `BufMut` implementations for `&[u8]` and `&mut [u8]`
-  respectively (#261).
-- Move `Buf` / `BufMut` "extra" functions to an extension trait (#306).
-- `BufMutExt::limit` (#309).
-- `Bytes::slice` takes a `RangeBounds` argument (#265).
-- `Bytes::from_static` is now a `const fn` (#311).
-- A multitude of smaller performance optimizations.
-
-### Added
-- `no_std` support (#281).
-- `get_*`, `put_*`, `get_*_le`, and `put_*le` accessors for handling byte order.
-- `BorrowMut` implementation for `BytesMut` (#185).
-
-### Removed
-- `IntoBuf` (#288).
-- `Buf` implementation for `&str` (#301).
-- `byteorder` dependency (#280).
-- `iovec` dependency, use `std::IoSlice` instead (#263).
-- optional `either` dependency (#315).
-- optional `i128` feature -- now available on stable. (#276).
-
-# 0.4.12 (March 6, 2019)
-
-### Added
-- Implement `FromIterator<&'a u8>` for `BytesMut`/`Bytes` (#244).
-- Implement `Buf` for `VecDeque` (#249).
-
-# 0.4.11 (November 17, 2018)
-
-* Use raw pointers for potentially racy loads (#233).
-* Implement `BufRead` for `buf::Reader` (#232).
-* Documentation tweaks (#234).
-
-# 0.4.10 (September 4, 2018)
-
-* impl `Buf` and `BufMut` for `Either` (#225).
-* Add `Bytes::slice_ref` (#208).
-
-# 0.4.9 (July 12, 2018)
-
-* Add 128 bit number support behind a feature flag (#209).
-* Implement `IntoBuf` for `&mut [u8]`
-
-# 0.4.8 (May 25, 2018)
-
-* Fix panic in `BytesMut` `FromIterator` implementation.
-* Bytes: Recycle space when reserving space in vec mode (#197).
-* Bytes: Add resize fn (#203).
-
-# 0.4.7 (April 27, 2018)
-
-* Make `Buf` and `BufMut` usable as trait objects (#186).
-* impl BorrowMut for BytesMut (#185).
-* Improve accessor performance (#195).
-
-# 0.4.6 (Janary 8, 2018)
-
-* Implement FromIterator for Bytes/BytesMut (#148).
-* Add `advance` fn to Bytes/BytesMut (#166).
-* Add `unsplit` fn to `BytesMut` (#162, #173).
-* Improvements to Bytes split fns (#92).
-
-# 0.4.5 (August 12, 2017)
-
-* Fix range bug in `Take::bytes`
-* Misc performance improvements
-* Add extra `PartialEq` implementations.
-* Add `Bytes::with_capacity`
-* Implement `AsMut[u8]` for `BytesMut`
-
-# 0.4.4 (May 26, 2017)
-
-* Add serde support behind feature flag
-* Add `extend_from_slice` on `Bytes` and `BytesMut`
-* Add `truncate` and `clear` on `Bytes`
-* Misc additional std trait implementations
-* Misc performance improvements
-
-# 0.4.3 (April 30, 2017)
-
-* Fix Vec::advance_mut bug
-* Bump minimum Rust version to 1.15
-* Misc performance tweaks
-
-# 0.4.2 (April 5, 2017)
-
-* Misc performance tweaks
-* Improved `Debug` implementation for `Bytes`
-* Avoid some incorrect assert panics
-
-# 0.4.1 (March 15, 2017)
-
-* Expose `buf` module and have most types available from there vs. root.
-* Implement `IntoBuf` for `T: Buf`.
-* Add `FromBuf` and `Buf::collect`.
-* Add iterator adapter for `Buf`.
-* Add scatter/gather support to `Buf` and `BufMut`.
-* Add `Buf::chain`.
-* Reduce allocations on repeated calls to `BytesMut::reserve`.
-* Implement `Debug` for more types.
-* Remove `Source` in favor of `IntoBuf`.
-* Implement `Extend` for `BytesMut`.
-
-
-# 0.4.0 (February 24, 2017)
-
-* Initial release

Cargo.toml

@@ -1,46 +0,0 @@
-[package]
-
-name = "bytes"
-# When releasing to crates.io:
-# - Update CHANGELOG.md.
-# - Create "v1.x.y" git tag.
-version = "1.12.1"
-edition = "2021"
-rust-version = "1.57"
-license = "MIT"
-authors = [
-    "Carl Lerche <[email protected]>",
-    "Sean McArthur <[email protected]>",
-]
-description = "Types and traits for working with bytes"
-repository = "https://github.com/tokio-rs/bytes"
-readme = "README.md"
-keywords = ["buffers", "zero-copy", "io"]
-categories = ["network-programming", "data-structures"]
-include = ["CHANGELOG.md", "LICENSE", "README.md", "SECURITY.md", "Cargo.toml", "src/**/*.rs", "tests/**/*.rs", "clippy.toml"]
-
-[features]
-default = ["std"]
-std = []
-
-[dependencies]
-serde = { version = "1.0.60", optional = true, default-features = false, features = ["alloc"] }
-# Use portable-atomic crate to support platforms without atomic CAS.
-# See "no_std support" section in readme for more information.
-#
-# Enable require-cas feature to provide a better error message if the end user forgets to use the cfg or feature.
-extra-platforms = { package = "portable-atomic", version = "1.3", optional = true, default-features = false, features = ["require-cas"] }
-
-[dev-dependencies]
-serde_test = "1.0"
-
-[target.'cfg(loom)'.dev-dependencies]
-loom = "0.7"
-
-[package.metadata.docs.rs]
-rustdoc-args = ["--cfg", "docsrs"]
-
-[lints.rust]
-unexpected_cfgs = { level = "warn", check-cfg = [
-  'cfg(loom)',
-] }

README.md

@@ -1,73 +0,0 @@
-# Bytes
-
-A utility library for working with bytes.
-
-[![Crates.io][crates-badge]][crates-url]
-[![Build Status][ci-badge]][ci-url]
-
-[crates-badge]: https://img.shields.io/crates/v/bytes.svg
-[crates-url]: https://crates.io/crates/bytes
-[ci-badge]: https://github.com/tokio-rs/bytes/workflows/CI/badge.svg
-[ci-url]: https://github.com/tokio-rs/bytes/actions
-
-[Documentation](https://docs.rs/bytes)
-
-## Usage
-
-To use `bytes`, first add this to your `Cargo.toml`:
-
-```toml
-[dependencies]
-bytes = "1"
-```
-
-Next, add this to your crate:
-
-```rust
-use bytes::{Bytes, BytesMut, Buf, BufMut};
-```
-
-## no_std support
-
-To use `bytes` with no_std environment, disable the (enabled by default) `std` feature.
-
-```toml
-[dependencies]
-bytes = { version = "1", default-features = false }
-```
-
-To use `bytes` with no_std environment without atomic CAS, such as thumbv6m, you also need to enable
-the `extra-platforms` feature. See the [documentation for the `portable-atomic`
-crate](https://docs.rs/portable-atomic) for more information.
-
-The MSRV when `extra-platforms` feature is enabled depends on the MSRV of `portable-atomic`.
-
-## Serde support
-
-Serde support is optional and disabled by default. To enable use the feature `serde`.
-
-```toml
-[dependencies]
-bytes = { version = "1", features = ["serde"] }
-```
-
-The MSRV when `serde` feature is enabled depends on the MSRV of `serde`.
-
-## Building documentation
-
-When building the `bytes` documentation the `docsrs` option should be used, otherwise
-feature gates will not be shown. This requires a nightly toolchain:
-
-```
-RUSTDOCFLAGS="--cfg docsrs" cargo +nightly doc
-```
-
-## License
-
-This project is licensed under the [MIT license](LICENSE).
-
-### Contribution
-
-Unless you explicitly state otherwise, any contribution intentionally submitted
-for inclusion in `bytes` by you, shall be licensed as MIT, without any additional
-terms or conditions.

SECURITY.md

@@ -1,9 +0,0 @@
-# Security Policy
-
-Bytes is part of the Tokio project and uses the same security policy as [Tokio][tokio-security].
-
-## Report a security issue
-
-The process for reporting an issue is the same as for [Tokio][tokio-security]. This includes private reporting via security@tokio.rs.
-
-[tokio-security]: https://github.com/tokio-rs/tokio/security/policy

benches/buf.rs

@@ -1,186 +0,0 @@
-#![feature(test)]
-#![warn(rust_2018_idioms)]
-
-extern crate test;
-
-use bytes::Buf;
-use test::Bencher;
-
-/// Dummy Buf implementation
-struct TestBuf {
-    buf: &'static [u8],
-    readlens: &'static [usize],
-    init_pos: usize,
-    pos: usize,
-    readlen_pos: usize,
-    readlen: usize,
-}
-impl TestBuf {
-    fn new(buf: &'static [u8], readlens: &'static [usize], init_pos: usize) -> TestBuf {
-        let mut buf = TestBuf {
-            buf,
-            readlens,
-            init_pos,
-            pos: 0,
-            readlen_pos: 0,
-            readlen: 0,
-        };
-        buf.reset();
-        buf
-    }
-    fn reset(&mut self) {
-        self.pos = self.init_pos;
-        self.readlen_pos = 0;
-        self.next_readlen();
-    }
-    /// Compute the length of the next read :
-    /// - use the next value specified in readlens (capped by remaining) if any
-    /// - else the remaining
-    fn next_readlen(&mut self) {
-        self.readlen = self.buf.len() - self.pos;
-        if let Some(readlen) = self.readlens.get(self.readlen_pos) {
-            self.readlen = std::cmp::min(self.readlen, *readlen);
-            self.readlen_pos += 1;
-        }
-    }
-}
-impl Buf for TestBuf {
-    fn remaining(&self) -> usize {
-        self.buf.len() - self.pos
-    }
-    fn advance(&mut self, cnt: usize) {
-        self.pos += cnt;
-        assert!(self.pos <= self.buf.len());
-        self.next_readlen();
-    }
-    fn chunk(&self) -> &[u8] {
-        if self.readlen == 0 {
-            Default::default()
-        } else {
-            &self.buf[self.pos..self.pos + self.readlen]
-        }
-    }
-}
-
-/// Dummy Buf implementation
-///  version with methods forced to not be inlined (to simulate costly calls)
-struct TestBufC {
-    inner: TestBuf,
-}
-impl TestBufC {
-    fn new(buf: &'static [u8], readlens: &'static [usize], init_pos: usize) -> TestBufC {
-        TestBufC {
-            inner: TestBuf::new(buf, readlens, init_pos),
-        }
-    }
-    fn reset(&mut self) {
-        self.inner.reset()
-    }
-}
-impl Buf for TestBufC {
-    #[inline(never)]
-    fn remaining(&self) -> usize {
-        self.inner.remaining()
-    }
-    #[inline(never)]
-    fn advance(&mut self, cnt: usize) {
-        self.inner.advance(cnt)
-    }
-    #[inline(never)]
-    fn chunk(&self) -> &[u8] {
-        self.inner.chunk()
-    }
-}
-
-macro_rules! bench {
-    ($fname:ident, testbuf $testbuf:ident $readlens:expr, $method:ident $(,$arg:expr)*) => (
-        #[bench]
-        fn $fname(b: &mut Bencher) {
-            let mut bufs = [
-                $testbuf::new(&[1u8; 8+0], $readlens, 0),
-                $testbuf::new(&[1u8; 8+1], $readlens, 1),
-                $testbuf::new(&[1u8; 8+2], $readlens, 2),
-                $testbuf::new(&[1u8; 8+3], $readlens, 3),
-                $testbuf::new(&[1u8; 8+4], $readlens, 4),
-                $testbuf::new(&[1u8; 8+5], $readlens, 5),
-                $testbuf::new(&[1u8; 8+6], $readlens, 6),
-                $testbuf::new(&[1u8; 8+7], $readlens, 7),
-            ];
-            b.iter(|| {
-                for i in 0..8 {
-                    bufs[i].reset();
-                    let buf: &mut dyn Buf =  &mut bufs[i]; // type erasure
-                    test::black_box(buf.$method($($arg,)*));
-                }
-            })
-        }
-    );
-    ($fname:ident, slice, $method:ident $(,$arg:expr)*) => (
-        #[bench]
-        fn $fname(b: &mut Bencher) {
-            // buf must be long enough for one read of 8 bytes starting at pos 7
-            let arr = [1u8; 8+7];
-            b.iter(|| {
-                for i in 0..8 {
-                    let mut buf = &arr[i..];
-                    let buf = &mut buf as &mut dyn Buf; // type erasure
-                    test::black_box(buf.$method($($arg,)*));
-                }
-            })
-        }
-    );
-    ($fname:ident, option) => (
-        #[bench]
-        fn $fname(b: &mut Bencher) {
-            let data = [1u8; 1];
-            b.iter(|| {
-                for _ in 0..8 {
-                    let mut buf = Some(data);
-                    let buf = &mut buf as &mut dyn Buf; // type erasure
-                    test::black_box(buf.get_u8());
-                }
-            })
-        }
-    );
-}
-
-macro_rules! bench_group {
-    ($method:ident $(,$arg:expr)*) => (
-        bench!(slice, slice, $method $(,$arg)*);
-        bench!(tbuf_1,        testbuf TestBuf  &[],  $method $(,$arg)*);
-        bench!(tbuf_1_costly, testbuf TestBufC &[],  $method $(,$arg)*);
-        bench!(tbuf_2,        testbuf TestBuf  &[1], $method $(,$arg)*);
-        bench!(tbuf_2_costly, testbuf TestBufC &[1], $method $(,$arg)*);
-        // bench!(tbuf_onebyone,        testbuf TestBuf  &[1,1,1,1,1,1,1,1], $method $(,$arg)*);
-        // bench!(tbuf_onebyone_costly, testbuf TestBufC &[1,1,1,1,1,1,1,1], $method $(,$arg)*);
-    );
-}
-
-mod get_u8 {
-    use super::*;
-    bench_group!(get_u8);
-}
-mod get_u16 {
-    use super::*;
-    bench_group!(get_u16);
-}
-mod get_u32 {
-    use super::*;
-    bench_group!(get_u32);
-}
-mod get_u64 {
-    use super::*;
-    bench_group!(get_u64);
-}
-mod get_f32 {
-    use super::*;
-    bench_group!(get_f32);
-}
-mod get_f64 {
-    use super::*;
-    bench_group!(get_f64);
-}
-mod get_uint24 {
-    use super::*;
-    bench_group!(get_uint, 3);
-}

benches/bytes.rs

@@ -1,120 +0,0 @@
-#![feature(test)]
-#![warn(rust_2018_idioms)]
-
-extern crate test;
-
-use bytes::Bytes;
-use test::Bencher;
-
-#[bench]
-fn deref_unique(b: &mut Bencher) {
-    let buf = Bytes::from(vec![0; 1024]);
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(&buf[..]);
-        }
-    })
-}
-
-#[bench]
-fn deref_shared(b: &mut Bencher) {
-    let buf = Bytes::from(vec![0; 1024]);
-    let _b2 = buf.clone();
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(&buf[..]);
-        }
-    })
-}
-
-#[bench]
-fn deref_static(b: &mut Bencher) {
-    let buf = Bytes::from_static(b"hello world");
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(&buf[..]);
-        }
-    })
-}
-
-#[bench]
-fn clone_static(b: &mut Bencher) {
-    let bytes =
-        Bytes::from_static("hello world 1234567890 and have a good byte 0987654321".as_bytes());
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(test::black_box(&bytes).clone());
-        }
-    })
-}
-
-#[bench]
-fn clone_shared(b: &mut Bencher) {
-    let bytes = Bytes::from(b"hello world 1234567890 and have a good byte 0987654321".to_vec());
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(test::black_box(&bytes).clone());
-        }
-    })
-}
-
-#[bench]
-fn clone_arc_vec(b: &mut Bencher) {
-    use std::sync::Arc;
-    let bytes = Arc::new(b"hello world 1234567890 and have a good byte 0987654321".to_vec());
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(test::black_box(&bytes).clone());
-        }
-    })
-}
-
-#[bench]
-fn from_long_slice(b: &mut Bencher) {
-    let data = [0u8; 128];
-    b.bytes = data.len() as u64;
-    b.iter(|| {
-        let buf = Bytes::copy_from_slice(&data[..]);
-        test::black_box(buf);
-    })
-}
-
-#[bench]
-fn slice_empty(b: &mut Bencher) {
-    b.iter(|| {
-        // `clone` is to convert to ARC
-        let b = Bytes::from(vec![17; 1024]).clone();
-        for i in 0..1000 {
-            test::black_box(b.slice(i % 100..i % 100));
-        }
-    })
-}
-
-#[bench]
-fn slice_short_from_arc(b: &mut Bencher) {
-    b.iter(|| {
-        // `clone` is to convert to ARC
-        let b = Bytes::from(vec![17; 1024]).clone();
-        for i in 0..1000 {
-            test::black_box(b.slice(1..2 + i % 10));
-        }
-    })
-}
-
-#[bench]
-fn split_off_and_drop(b: &mut Bencher) {
-    b.iter(|| {
-        for _ in 0..1024 {
-            let v = vec![10; 200];
-            let mut b = Bytes::from(v);
-            test::black_box(b.split_off(100));
-            test::black_box(b);
-        }
-    })
-}

benches/bytes_mut.rs

@@ -1,266 +0,0 @@
-#![feature(test)]
-#![warn(rust_2018_idioms)]
-
-extern crate test;
-
-use bytes::{BufMut, BytesMut};
-use test::Bencher;
-
-#[bench]
-fn alloc_small(b: &mut Bencher) {
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(BytesMut::with_capacity(12));
-        }
-    })
-}
-
-#[bench]
-fn alloc_mid(b: &mut Bencher) {
-    b.iter(|| {
-        test::black_box(BytesMut::with_capacity(128));
-    })
-}
-
-#[bench]
-fn alloc_big(b: &mut Bencher) {
-    b.iter(|| {
-        test::black_box(BytesMut::with_capacity(4096));
-    })
-}
-
-#[bench]
-fn deref_unique(b: &mut Bencher) {
-    let mut buf = BytesMut::with_capacity(4096);
-    buf.put(&[0u8; 1024][..]);
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(&buf[..]);
-        }
-    })
-}
-
-#[bench]
-fn deref_unique_unroll(b: &mut Bencher) {
-    let mut buf = BytesMut::with_capacity(4096);
-    buf.put(&[0u8; 1024][..]);
-
-    b.iter(|| {
-        for _ in 0..128 {
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-            test::black_box(&buf[..]);
-        }
-    })
-}
-
-#[bench]
-fn deref_shared(b: &mut Bencher) {
-    let mut buf = BytesMut::with_capacity(4096);
-    buf.put(&[0u8; 1024][..]);
-    let _b2 = buf.split_off(1024);
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(&buf[..]);
-        }
-    })
-}
-
-#[bench]
-fn deref_two(b: &mut Bencher) {
-    let mut buf1 = BytesMut::with_capacity(8);
-    buf1.put(&[0u8; 8][..]);
-
-    let mut buf2 = BytesMut::with_capacity(4096);
-    buf2.put(&[0u8; 1024][..]);
-
-    b.iter(|| {
-        for _ in 0..512 {
-            test::black_box(&buf1[..]);
-            test::black_box(&buf2[..]);
-        }
-    })
-}
-
-#[bench]
-fn clone_frozen(b: &mut Bencher) {
-    let bytes = BytesMut::from(&b"hello world 1234567890 and have a good byte 0987654321"[..])
-        .split()
-        .freeze();
-
-    b.iter(|| {
-        for _ in 0..1024 {
-            test::black_box(&bytes.clone());
-        }
-    })
-}
-
-#[bench]
-fn alloc_write_split_to_mid(b: &mut Bencher) {
-    b.iter(|| {
-        let mut buf = BytesMut::with_capacity(128);
-        buf.put_slice(&[0u8; 64]);
-        test::black_box(buf.split_to(64));
-    })
-}
-
-#[bench]
-fn drain_write_drain(b: &mut Bencher) {
-    let data = [0u8; 128];
-
-    b.iter(|| {
-        let mut buf = BytesMut::with_capacity(1024);
-        let mut parts = Vec::with_capacity(8);
-
-        for _ in 0..8 {
-            buf.put(&data[..]);
-            parts.push(buf.split_to(128));
-        }
-
-        test::black_box(parts);
-    })
-}
-
-#[bench]
-fn fmt_write(b: &mut Bencher) {
-    use std::fmt::Write;
-    let mut buf = BytesMut::with_capacity(128);
-    let s = "foo bar baz quux lorem ipsum dolor et";
-
-    b.bytes = s.len() as u64;
-    b.iter(|| {
-        let _ = write!(buf, "{}", s);
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    })
-}
-
-#[bench]
-fn bytes_mut_extend(b: &mut Bencher) {
-    let mut buf = BytesMut::with_capacity(256);
-    let data = [33u8; 32];
-
-    b.bytes = data.len() as u64 * 4;
-    b.iter(|| {
-        for _ in 0..4 {
-            buf.extend(&data);
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}
-
-// BufMut for BytesMut vs Vec<u8>
-
-#[bench]
-fn put_slice_bytes_mut(b: &mut Bencher) {
-    let mut buf = BytesMut::with_capacity(256);
-    let data = [33u8; 32];
-
-    b.bytes = data.len() as u64 * 4;
-    b.iter(|| {
-        for _ in 0..4 {
-            buf.put_slice(&data);
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}
-
-#[bench]
-fn put_u8_bytes_mut(b: &mut Bencher) {
-    let mut buf = BytesMut::with_capacity(256);
-    let cnt = 128;
-
-    b.bytes = cnt as u64;
-    b.iter(|| {
-        for _ in 0..cnt {
-            buf.put_u8(b'x');
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}
-
-#[bench]
-fn put_slice_vec(b: &mut Bencher) {
-    let mut buf = Vec::<u8>::with_capacity(256);
-    let data = [33u8; 32];
-
-    b.bytes = data.len() as u64 * 4;
-    b.iter(|| {
-        for _ in 0..4 {
-            buf.put_slice(&data);
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}
-
-#[bench]
-fn put_u8_vec(b: &mut Bencher) {
-    let mut buf = Vec::<u8>::with_capacity(256);
-    let cnt = 128;
-
-    b.bytes = cnt as u64;
-    b.iter(|| {
-        for _ in 0..cnt {
-            buf.put_u8(b'x');
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}
-
-#[bench]
-fn put_slice_vec_extend(b: &mut Bencher) {
-    let mut buf = Vec::<u8>::with_capacity(256);
-    let data = [33u8; 32];
-
-    b.bytes = data.len() as u64 * 4;
-    b.iter(|| {
-        for _ in 0..4 {
-            buf.extend_from_slice(&data);
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}
-
-#[bench]
-fn put_u8_vec_push(b: &mut Bencher) {
-    let mut buf = Vec::<u8>::with_capacity(256);
-    let cnt = 128;
-
-    b.bytes = cnt as u64;
-    b.iter(|| {
-        for _ in 0..cnt {
-            buf.push(b'x');
-        }
-        test::black_box(&buf);
-        unsafe {
-            buf.set_len(0);
-        }
-    });
-}

bytes/all.html

@@ -0,0 +1 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="List of all items in this crate"><title>List of all items in this crate</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../" data-static-root-path="../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc mod sys"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="mobile-topbar"><button class="sidebar-menu-toggle" title="show sidebar"></button></nav><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../bytes/index.html">bytes</a><span class="version">1.12.1</span></h2></div><div class="sidebar-elems"><section id="rustdoc-toc"><h3><a href="#structs">Crate Items</a></h3><ul class="block"><li><a href="#structs" title="Structs">Structs</a></li><li><a href="#traits" title="Traits">Traits</a></li></ul></section><div id="rustdoc-modnav"></div></div></nav><div class="sidebar-resizer"></div><main><div class="width-limiter"><rustdoc-search></rustdoc-search><section id="main-content" class="content"><h1>List of all items</h1><h3 id="structs">Structs</h3><ul class="all-items"><li><a href="struct.Bytes.html">Bytes</a></li><li><a href="struct.BytesMut.html">BytesMut</a></li><li><a href="struct.TryGetError.html">TryGetError</a></li><li><a href="buf/struct.Chain.html">buf::Chain</a></li><li><a href="buf/struct.IntoIter.html">buf::IntoIter</a></li><li><a href="buf/struct.Limit.html">buf::Limit</a></li><li><a href="buf/struct.Reader.html">buf::Reader</a></li><li><a href="buf/struct.Take.html">buf::Take</a></li><li><a href="buf/struct.UninitSlice.html">buf::UninitSlice</a></li><li><a href="buf/struct.Writer.html">buf::Writer</a></li></ul><h3 id="traits">Traits</h3><ul class="all-items"><li><a href="buf/trait.Buf.html">buf::Buf</a></li><li><a href="buf/trait.BufMut.html">buf::BufMut</a></li></ul></section></div></main></body></html>

bytes/buf/buf_impl/trait.Buf.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/trait.Buf.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/trait.Buf.html">../../../bytes/buf/trait.Buf.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/trait.Buf.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/buf_mut/trait.BufMut.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/trait.BufMut.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/trait.BufMut.html">../../../bytes/buf/trait.BufMut.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/trait.BufMut.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/chain/struct.Chain.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.Chain.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.Chain.html">../../../bytes/buf/struct.Chain.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.Chain.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/index.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Utilities for working with buffers."><title>bytes::buf - Rust</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../sidebar-items.js"></script><script defer src="../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc mod"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="mobile-topbar"><button class="sidebar-menu-toggle" title="show sidebar"></button></nav><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../../bytes/index.html">bytes</a><span class="version">1.12.1</span></h2></div><div class="sidebar-elems"><section id="rustdoc-toc"><h2 class="location"><a href="#">Module buf</a></h2><h3><a href="#">Sections</a></h3><ul class="block top-toc"><li><a href="#buf-bufmut" title="`Buf`, `BufMut`"><code>Buf</code>, <code>BufMut</code></a></li></ul><h3><a href="#structs">Module Items</a></h3><ul class="block"><li><a href="#structs" title="Structs">Structs</a></li><li><a href="#traits" title="Traits">Traits</a></li></ul></section><div id="rustdoc-modnav"><h2 class="in-crate"><a href="../index.html">In crate bytes</a></h2></div></div></nav><div class="sidebar-resizer"></div><main><div class="width-limiter"><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="main-heading"><h1>Module <a href="../index.html">bytes</a>::<wbr><a class="mod" href="#">buf</a><button id="copy-path" title="Copy item path to clipboard">Copy item path</button></h1><span class="out-of-band"><a class="src" href="../../src/bytes/buf/mod.rs.html#1-39">source</a> · <button id="toggle-all-docs" title="collapse all docs">[<span>&#x2212;</span>]</button></span></div><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>Utilities for working with buffers.</p>
+<p>A buffer is any structure that contains a sequence of bytes. The bytes may
+or may not be stored in contiguous memory. This module contains traits used
+to abstract over buffers as well as utilities for working with buffer types.</p>
+<h2 id="buf-bufmut"><a class="doc-anchor" href="#buf-bufmut">§</a><code>Buf</code>, <code>BufMut</code></h2>
+<p>These are the two foundational traits for abstractly working with buffers.
+They can be thought as iterators for byte structures. They offer additional
+performance over <code>Iterator</code> by providing an API optimized for byte slices.</p>
+<p>See <a href="trait.Buf.html" title="trait bytes::buf::Buf"><code>Buf</code></a> and <a href="trait.BufMut.html" title="trait bytes::buf::BufMut"><code>BufMut</code></a> for more details.</p>
+</div></details><h2 id="structs" class="section-header">Structs<a href="#structs" class="anchor">§</a></h2><ul class="item-table"><li><div class="item-name"><a class="struct" href="struct.Chain.html" title="struct bytes::buf::Chain">Chain</a></div><div class="desc docblock-short">A <code>Chain</code> sequences two buffers.</div></li><li><div class="item-name"><a class="struct" href="struct.IntoIter.html" title="struct bytes::buf::IntoIter">Into<wbr>Iter</a></div><div class="desc docblock-short">Iterator over the bytes contained by the buffer.</div></li><li><div class="item-name"><a class="struct" href="struct.Limit.html" title="struct bytes::buf::Limit">Limit</a></div><div class="desc docblock-short">A <code>BufMut</code> adapter which limits the amount of bytes that can be written
+to an underlying buffer.</div></li><li><div class="item-name"><a class="struct" href="struct.Reader.html" title="struct bytes::buf::Reader">Reader</a></div><div class="desc docblock-short">A <code>Buf</code> adapter which implements <code>io::Read</code> for the inner value.</div></li><li><div class="item-name"><a class="struct" href="struct.Take.html" title="struct bytes::buf::Take">Take</a></div><div class="desc docblock-short">A <code>Buf</code> adapter which limits the bytes read from an underlying buffer.</div></li><li><div class="item-name"><a class="struct" href="struct.UninitSlice.html" title="struct bytes::buf::UninitSlice">Uninit<wbr>Slice</a></div><div class="desc docblock-short">Uninitialized byte slice.</div></li><li><div class="item-name"><a class="struct" href="struct.Writer.html" title="struct bytes::buf::Writer">Writer</a></div><div class="desc docblock-short">A <code>BufMut</code> adapter which implements <code>io::Write</code> for the inner value.</div></li></ul><h2 id="traits" class="section-header">Traits<a href="#traits" class="anchor">§</a></h2><ul class="item-table"><li><div class="item-name"><a class="trait" href="trait.Buf.html" title="trait bytes::buf::Buf">Buf</a></div><div class="desc docblock-short">Read bytes from a buffer.</div></li><li><div class="item-name"><a class="trait" href="trait.BufMut.html" title="trait bytes::buf::BufMut">BufMut</a></div><div class="desc docblock-short">A trait for values that provide sequential write access to bytes.</div></li></ul></section></div></main></body></html>

bytes/buf/iter/struct.IntoIter.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.IntoIter.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.IntoIter.html">../../../bytes/buf/struct.IntoIter.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.IntoIter.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/limit/struct.Limit.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.Limit.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.Limit.html">../../../bytes/buf/struct.Limit.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.Limit.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/reader/struct.Reader.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.Reader.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.Reader.html">../../../bytes/buf/struct.Reader.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.Reader.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/sidebar-items.js

@@ -0,0 +1 @@
+window.SIDEBAR_ITEMS = {"struct":["Chain","IntoIter","Limit","Reader","Take","UninitSlice","Writer"],"trait":["Buf","BufMut"]};

bytes/buf/take/struct.Take.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.Take.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.Take.html">../../../bytes/buf/struct.Take.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.Take.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/uninit_slice/struct.UninitSlice.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.UninitSlice.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.UninitSlice.html">../../../bytes/buf/struct.UninitSlice.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.UninitSlice.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/buf/writer/struct.Writer.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../../bytes/buf/struct.Writer.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../../bytes/buf/struct.Writer.html">../../../bytes/buf/struct.Writer.html</a>...</p>
+    <script>location.replace("../../../bytes/buf/struct.Writer.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/bytes/struct.Bytes.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../bytes/struct.Bytes.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../bytes/struct.Bytes.html">../../bytes/struct.Bytes.html</a>...</p>
+    <script>location.replace("../../bytes/struct.Bytes.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/bytes_mut/struct.BytesMut.html

@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta http-equiv="refresh" content="0;URL=../../bytes/struct.BytesMut.html">
+    <title>Redirection</title>
+</head>
+<body>
+    <p>Redirecting to <a href="../../bytes/struct.BytesMut.html">../../bytes/struct.BytesMut.html</a>...</p>
+    <script>location.replace("../../bytes/struct.BytesMut.html" + location.search + location.hash);</script>
+</body>
+</html>

bytes/index.html

@@ -0,0 +1,54 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Provides abstractions for working with bytes."><title>bytes - Rust</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../" data-static-root-path="../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../crates.js"></script><script defer src="../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc mod crate"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="mobile-topbar"><button class="sidebar-menu-toggle" title="show sidebar"></button></nav><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../bytes/index.html">bytes</a><span class="version">1.12.1</span></h2></div><div class="sidebar-elems"><ul class="block"><li><a id="all-types" href="all.html">All Items</a></li></ul><section id="rustdoc-toc"><h3><a href="#">Sections</a></h3><ul class="block top-toc"><li><a href="#bytes" title="`Bytes`"><code>Bytes</code></a></li><li><a href="#buf-bufmut" title="`Buf`, `BufMut`"><code>Buf</code>, <code>BufMut</code></a><ul><li><a href="#relation-with-read-and-write" title="Relation with `Read` and `Write`">Relation with <code>Read</code> and <code>Write</code></a></li></ul></li></ul><h3><a href="#reexports">Crate Items</a></h3><ul class="block"><li><a href="#reexports" title="Re-exports">Re-exports</a></li><li><a href="#modules" title="Modules">Modules</a></li><li><a href="#structs" title="Structs">Structs</a></li></ul></section><div id="rustdoc-modnav"></div></div></nav><div class="sidebar-resizer"></div><main><div class="width-limiter"><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="main-heading"><h1>Crate <a class="mod" href="#">bytes</a><button id="copy-path" title="Copy item path to clipboard">Copy item path</button></h1><span class="out-of-band"><a class="src" href="../src/bytes/lib.rs.html#1-219">source</a> · <button id="toggle-all-docs" title="collapse all docs">[<span>&#x2212;</span>]</button></span></div><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>Provides abstractions for working with bytes.</p>
+<p>The <code>bytes</code> crate provides an efficient byte buffer structure
+(<a href="struct.Bytes.html" title="struct bytes::Bytes"><code>Bytes</code></a>) and traits for working with buffer
+implementations (<a href="buf/trait.Buf.html" title="trait bytes::buf::Buf"><code>Buf</code></a>, <a href="buf/trait.BufMut.html" title="trait bytes::buf::BufMut"><code>BufMut</code></a>).</p>
+<h2 id="bytes"><a class="doc-anchor" href="#bytes">§</a><code>Bytes</code></h2>
+<p><code>Bytes</code> is an efficient container for storing and operating on contiguous
+slices of memory. It is intended for use primarily in networking code, but
+could have applications elsewhere as well.</p>
+<p><code>Bytes</code> values facilitate zero-copy network programming by allowing multiple
+<code>Bytes</code> objects to point to the same underlying memory. This is managed by
+using a reference count to track when the memory is no longer needed and can
+be freed.</p>
+<p>A <code>Bytes</code> handle can be created directly from an existing byte store (such as <code>&amp;[u8]</code>
+or <code>Vec&lt;u8&gt;</code>), but usually a <code>BytesMut</code> is used first and written to. For
+example:</p>
+
+<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>bytes::{BytesMut, BufMut};
+
+<span class="kw">let </span><span class="kw-2">mut </span>buf = BytesMut::with_capacity(<span class="number">1024</span>);
+buf.put(<span class="kw-2">&amp;</span><span class="string">b"hello world"</span>[..]);
+buf.put_u16(<span class="number">1234</span>);
+
+<span class="kw">let </span>a = buf.split();
+<span class="macro">assert_eq!</span>(a, <span class="string">b"hello world\x04\xD2"</span>[..]);
+
+buf.put(<span class="kw-2">&amp;</span><span class="string">b"goodbye world"</span>[..]);
+
+<span class="kw">let </span>b = buf.split();
+<span class="macro">assert_eq!</span>(b, <span class="string">b"goodbye world"</span>[..]);
+
+<span class="macro">assert_eq!</span>(buf.capacity(), <span class="number">998</span>);</code></pre></div>
+<p>In the above example, only a single buffer of 1024 is allocated. The handles
+<code>a</code> and <code>b</code> will share the underlying buffer and maintain indices tracking
+the view into the buffer represented by the handle.</p>
+<p>See the <a href="struct.Bytes.html" title="struct bytes::Bytes">struct docs</a> for more details.</p>
+<h2 id="buf-bufmut"><a class="doc-anchor" href="#buf-bufmut">§</a><code>Buf</code>, <code>BufMut</code></h2>
+<p>These two traits provide read and write access to buffers. The underlying
+storage may or may not be in contiguous memory. For example, <code>Bytes</code> is a
+buffer that guarantees contiguous memory, but a <a href="https://en.wikipedia.org/wiki/Rope_(data_structure)">rope</a> stores the bytes in
+disjoint chunks. <code>Buf</code> and <code>BufMut</code> maintain cursors tracking the current
+position in the underlying byte storage. When bytes are read or written, the
+cursor is advanced.</p>
+<h3 id="relation-with-read-and-write"><a class="doc-anchor" href="#relation-with-read-and-write">§</a>Relation with <code>Read</code> and <code>Write</code></h3>
+<p>At first glance, it may seem that <code>Buf</code> and <code>BufMut</code> overlap in
+functionality with <a href="https://doc.rust-lang.org/nightly/std/io/trait.Read.html" title="trait std::io::Read"><code>std::io::Read</code></a> and <a href="https://doc.rust-lang.org/nightly/std/io/trait.Write.html" title="trait std::io::Write"><code>std::io::Write</code></a>. However, they
+serve different purposes. A buffer is the value that is provided as an
+argument to <code>Read::read</code> and <code>Write::write</code>. <code>Read</code> and <code>Write</code> may then
+perform a syscall, which has the potential of failing. Operations on <code>Buf</code>
+and <code>BufMut</code> are infallible.</p>
+</div></details><h2 id="reexports" class="section-header">Re-exports<a href="#reexports" class="anchor">§</a></h2><ul class="item-table"><li><div class="item-name" id="reexport.Buf"><code>pub use crate::buf::<a class="trait" href="buf/trait.Buf.html" title="trait bytes::buf::Buf">Buf</a>;</code></div></li><li><div class="item-name" id="reexport.BufMut"><code>pub use crate::buf::<a class="trait" href="buf/trait.BufMut.html" title="trait bytes::buf::BufMut">BufMut</a>;</code></div></li></ul><h2 id="modules" class="section-header">Modules<a href="#modules" class="anchor">§</a></h2><ul class="item-table"><li><div class="item-name"><a class="mod" href="buf/index.html" title="mod bytes::buf">buf</a></div><div class="desc docblock-short">Utilities for working with buffers.</div></li></ul><h2 id="structs" class="section-header">Structs<a href="#structs" class="anchor">§</a></h2><ul class="item-table"><li><div class="item-name"><a class="struct" href="struct.Bytes.html" title="struct bytes::Bytes">Bytes</a></div><div class="desc docblock-short">A cheaply cloneable and sliceable chunk of contiguous memory.</div></li><li><div class="item-name"><a class="struct" href="struct.BytesMut.html" title="struct bytes::BytesMut">Bytes<wbr>Mut</a></div><div class="desc docblock-short">A unique reference to a contiguous slice of memory.</div></li><li><div class="item-name"><a class="struct" href="struct.TryGetError.html" title="struct bytes::TryGetError">TryGet<wbr>Error</a></div><div class="desc docblock-short">Error type for the <code>try_get_</code> methods of <a href="buf/trait.Buf.html" title="trait bytes::buf::Buf"><code>Buf</code></a>.
+Indicates that there were not enough remaining
+bytes in the buffer while attempting
+to get a value from a <a href="buf/trait.Buf.html" title="trait bytes::buf::Buf"><code>Buf</code></a> with one
+of the <code>try_get_</code> methods.</div></li></ul></section></div></main></body></html>

bytes/sidebar-items.js

@@ -0,0 +1 @@
+window.SIDEBAR_ITEMS = {"mod":["buf"],"struct":["Bytes","BytesMut","TryGetError"]};

ci/miri.sh

@@ -1,13 +0,0 @@
-#!/bin/bash
-set -e
-
-rustup component add miri
-cargo miri setup
-
-export MIRIFLAGS="-Zmiri-strict-provenance"
-
-cargo miri test
-cargo miri test --target mips64-unknown-linux-gnuabi64
-
-# run with wrapping integer overflow instead of panic
-cargo miri test --release

ci/panic-abort.sh

@@ -1,4 +0,0 @@
-#!/bin/bash
-
-set -ex
-RUSTFLAGS="$RUSTFLAGS -Cpanic=abort -Zpanic-abort-tests" cargo test --all-features --test '*'

ci/test-stable.sh

@@ -1,25 +0,0 @@
-#!/bin/bash
-
-set -ex
-
-cmd="${1:-test}"
-
-# Run with each feature
-# * --each-feature includes both default/no-default features
-# * --optional-deps is needed for serde feature
-cargo hack "${cmd}" --each-feature --optional-deps
-# Run with all features
-cargo "${cmd}" --all-features
-
-if [[ "${RUST_VERSION}" == "nightly"* ]]; then
-    # Check benchmarks
-    cargo check --benches
-
-    # Check minimal versions
-    # Remove dev-dependencies from Cargo.toml to prevent the next `cargo update`
-    # from determining minimal versions based on dev-dependencies.
-    cargo hack --remove-dev-deps --workspace
-    # Update Cargo.lock to minimal version dependencies.
-    cargo update -Z minimal-versions
-    cargo check --all-features
-fi

ci/tsan.sh

@@ -1,13 +0,0 @@
-#!/bin/bash
-
-set -ex
-
-export ASAN_OPTIONS="detect_odr_violation=0 detect_leaks=0"
-
-# Run address sanitizer
-RUSTFLAGS="-Z sanitizer=address" \
-cargo test --target x86_64-unknown-linux-gnu --test test_bytes --test test_buf --test test_buf_mut
-
-# Run thread sanitizer
-RUSTFLAGS="-Z sanitizer=thread" \
-cargo -Zbuild-std test --target x86_64-unknown-linux-gnu --test test_bytes --test test_buf --test test_buf_mut

clippy.toml

@@ -1 +0,0 @@
-msrv = "1.57"

crates.js

@@ -0,0 +1,2 @@
+window.ALL_CRATES = ["bytes"];
+//{"start":21,"fragment_lengths":[7]}

help.html

@@ -0,0 +1 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Documentation for Rustdoc"><title>Help</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="./static.files/${f}">`).join(""))</script><link rel="stylesheet" href="./static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="./static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="./" data-static-root-path="./static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="./static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="./static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="./static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="./static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="./static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc mod sys"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="mobile-topbar"><button class="sidebar-menu-toggle" title="show sidebar"></button><a class="logo-container" href="./index.html"><img class="rust-logo" src="./static.files/rust-logo-151179464ae7ed46.svg" alt=""></a></nav><nav class="sidebar"><div class="sidebar-crate"><a class="logo-container" href="./index.html"><img class="rust-logo" src="./static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><h2><a href="./index.html">Rustdoc</a><span class="version">1.83.0-nightly</span></h2></div><div class="version">(9b72238eb 2024-09-14)</div><h2 class="location">Help</h2><div class="sidebar-elems"></div></nav><div class="sidebar-resizer"></div><main><div class="width-limiter"><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="main-heading"><h1>Rustdoc help</h1><span class="out-of-band"><a id="back" href="javascript:void(0)" onclick="history.back();">Back</a></span></div><noscript><section><p>You need to enable JavaScript to use keyboard commands or search.</p><p>For more information, browse the <a href="https://doc.rust-lang.org/rustdoc/">rustdoc handbook</a>.</p></section></noscript></section></div></main></body></html>

settings.html

@@ -0,0 +1 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Settings of Rustdoc"><title>Settings</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="./static.files/${f}">`).join(""))</script><link rel="stylesheet" href="./static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="./static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="./" data-static-root-path="./static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="./static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="./static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="./static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="./static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="./static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc mod sys"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="mobile-topbar"><button class="sidebar-menu-toggle" title="show sidebar"></button><a class="logo-container" href="./index.html"><img class="rust-logo" src="./static.files/rust-logo-151179464ae7ed46.svg" alt=""></a></nav><nav class="sidebar"><div class="sidebar-crate"><a class="logo-container" href="./index.html"><img class="rust-logo" src="./static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><h2><a href="./index.html">Rustdoc</a><span class="version">1.83.0-nightly</span></h2></div><div class="version">(9b72238eb 2024-09-14)</div><h2 class="location">Settings</h2><div class="sidebar-elems"></div></nav><div class="sidebar-resizer"></div><main><div class="width-limiter"><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="main-heading"><h1>Rustdoc settings</h1><span class="out-of-band"><a id="back" href="javascript:void(0)" onclick="history.back();">Back</a></span></div><noscript><section>You need to enable JavaScript be able to update your settings.</section></noscript><script defer src="./static.files/settings-7e3bb6c46e92e77c.js"></script></section></div></main></body></html>

src-files.js

@@ -0,0 +1,3 @@
+var srcIndex = new Map(JSON.parse('[["bytes",["",[["buf",[],["buf_impl.rs","buf_mut.rs","chain.rs","iter.rs","limit.rs","mod.rs","reader.rs","take.rs","uninit_slice.rs","vec_deque.rs","writer.rs"]],["fmt",[],["debug.rs","hex.rs","mod.rs"]]],["bytes.rs","bytes_mut.rs","lib.rs","loom.rs","serde.rs"]]]]'));
+createSrcSidebar();
+//{"start":36,"fragment_lengths":[264]}

src/buf/chain.rs

@@ -1,240 +0,0 @@
-use crate::buf::{IntoIter, UninitSlice};
-use crate::{Buf, BufMut};
-
-#[cfg(feature = "std")]
-use std::io::IoSlice;
-
-/// A `Chain` sequences two buffers.
-///
-/// `Chain` is an adapter that links two underlying buffers and provides a
-/// continuous view across both buffers. It is able to sequence either immutable
-/// buffers ([`Buf`] values) or mutable buffers ([`BufMut`] values).
-///
-/// This struct is generally created by calling [`Buf::chain`]. Please see that
-/// function's documentation for more detail.
-///
-/// # Examples
-///
-/// ```
-/// use bytes::{Bytes, Buf};
-///
-/// let mut buf = (&b"hello "[..])
-///     .chain(&b"world"[..]);
-///
-/// let full: Bytes = buf.copy_to_bytes(11);
-/// assert_eq!(full[..], b"hello world"[..]);
-/// ```
-///
-/// [`Buf::chain`]: Buf::chain
-#[derive(Debug)]
-pub struct Chain<T, U> {
-    a: T,
-    b: U,
-}
-
-impl<T, U> Chain<T, U> {
-    /// Creates a new `Chain` sequencing the provided values.
-    pub(crate) fn new(a: T, b: U) -> Chain<T, U> {
-        Chain { a, b }
-    }
-
-    /// Gets a reference to the first underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::Buf;
-    ///
-    /// let buf = (&b"hello"[..])
-    ///     .chain(&b"world"[..]);
-    ///
-    /// assert_eq!(buf.first_ref()[..], b"hello"[..]);
-    /// ```
-    pub fn first_ref(&self) -> &T {
-        &self.a
-    }
-
-    /// Gets a mutable reference to the first underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::Buf;
-    ///
-    /// let mut buf = (&b"hello"[..])
-    ///     .chain(&b"world"[..]);
-    ///
-    /// buf.first_mut().advance(1);
-    ///
-    /// let full = buf.copy_to_bytes(9);
-    /// assert_eq!(full, b"elloworld"[..]);
-    /// ```
-    pub fn first_mut(&mut self) -> &mut T {
-        &mut self.a
-    }
-
-    /// Gets a reference to the last underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::Buf;
-    ///
-    /// let buf = (&b"hello"[..])
-    ///     .chain(&b"world"[..]);
-    ///
-    /// assert_eq!(buf.last_ref()[..], b"world"[..]);
-    /// ```
-    pub fn last_ref(&self) -> &U {
-        &self.b
-    }
-
-    /// Gets a mutable reference to the last underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::Buf;
-    ///
-    /// let mut buf = (&b"hello "[..])
-    ///     .chain(&b"world"[..]);
-    ///
-    /// buf.last_mut().advance(1);
-    ///
-    /// let full = buf.copy_to_bytes(10);
-    /// assert_eq!(full, b"hello orld"[..]);
-    /// ```
-    pub fn last_mut(&mut self) -> &mut U {
-        &mut self.b
-    }
-
-    /// Consumes this `Chain`, returning the underlying values.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::Buf;
-    ///
-    /// let chain = (&b"hello"[..])
-    ///     .chain(&b"world"[..]);
-    ///
-    /// let (first, last) = chain.into_inner();
-    /// assert_eq!(first[..], b"hello"[..]);
-    /// assert_eq!(last[..], b"world"[..]);
-    /// ```
-    pub fn into_inner(self) -> (T, U) {
-        (self.a, self.b)
-    }
-}
-
-impl<T, U> Buf for Chain<T, U>
-where
-    T: Buf,
-    U: Buf,
-{
-    fn remaining(&self) -> usize {
-        self.a.remaining().saturating_add(self.b.remaining())
-    }
-
-    fn chunk(&self) -> &[u8] {
-        if self.a.has_remaining() {
-            self.a.chunk()
-        } else {
-            self.b.chunk()
-        }
-    }
-
-    fn advance(&mut self, mut cnt: usize) {
-        let a_rem = self.a.remaining();
-
-        if a_rem != 0 {
-            if a_rem >= cnt {
-                self.a.advance(cnt);
-                return;
-            }
-
-            // Consume what is left of a
-            self.a.advance(a_rem);
-
-            cnt -= a_rem;
-        }
-
-        self.b.advance(cnt);
-    }
-
-    #[cfg(feature = "std")]
-    fn chunks_vectored<'a>(&'a self, dst: &mut [IoSlice<'a>]) -> usize {
-        let mut n = self.a.chunks_vectored(dst);
-        n += self.b.chunks_vectored(&mut dst[n..]);
-        n
-    }
-
-    fn copy_to_bytes(&mut self, len: usize) -> crate::Bytes {
-        let a_rem = self.a.remaining();
-        if a_rem >= len {
-            self.a.copy_to_bytes(len)
-        } else if a_rem == 0 {
-            self.b.copy_to_bytes(len)
-        } else {
-            assert!(
-                len - a_rem <= self.b.remaining(),
-                "`len` greater than remaining"
-            );
-            let mut ret = crate::BytesMut::with_capacity(len);
-            ret.put(&mut self.a);
-            ret.put((&mut self.b).take(len - a_rem));
-            ret.freeze()
-        }
-    }
-}
-
-unsafe impl<T, U> BufMut for Chain<T, U>
-where
-    T: BufMut,
-    U: BufMut,
-{
-    fn remaining_mut(&self) -> usize {
-        self.a
-            .remaining_mut()
-            .saturating_add(self.b.remaining_mut())
-    }
-
-    fn chunk_mut(&mut self) -> &mut UninitSlice {
-        if self.a.has_remaining_mut() {
-            self.a.chunk_mut()
-        } else {
-            self.b.chunk_mut()
-        }
-    }
-
-    unsafe fn advance_mut(&mut self, mut cnt: usize) {
-        let a_rem = self.a.remaining_mut();
-
-        if a_rem != 0 {
-            if a_rem >= cnt {
-                self.a.advance_mut(cnt);
-                return;
-            }
-
-            // Consume what is left of a
-            self.a.advance_mut(a_rem);
-
-            cnt -= a_rem;
-        }
-
-        self.b.advance_mut(cnt);
-    }
-}
-
-impl<T, U> IntoIterator for Chain<T, U>
-where
-    T: Buf,
-    U: Buf,
-{
-    type Item = u8;
-    type IntoIter = IntoIter<Chain<T, U>>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        IntoIter::new(self)
-    }
-}

src/buf/iter.rs

@@ -1,127 +0,0 @@
-use crate::Buf;
-
-/// Iterator over the bytes contained by the buffer.
-///
-/// # Examples
-///
-/// Basic usage:
-///
-/// ```
-/// use bytes::Bytes;
-///
-/// let buf = Bytes::from(&b"abc"[..]);
-/// let mut iter = buf.into_iter();
-///
-/// assert_eq!(iter.next(), Some(b'a'));
-/// assert_eq!(iter.next(), Some(b'b'));
-/// assert_eq!(iter.next(), Some(b'c'));
-/// assert_eq!(iter.next(), None);
-/// ```
-#[derive(Debug)]
-pub struct IntoIter<T> {
-    inner: T,
-}
-
-impl<T> IntoIter<T> {
-    /// Creates an iterator over the bytes contained by the buffer.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::Bytes;
-    ///
-    /// let buf = Bytes::from_static(b"abc");
-    /// let mut iter = buf.into_iter();
-    ///
-    /// assert_eq!(iter.next(), Some(b'a'));
-    /// assert_eq!(iter.next(), Some(b'b'));
-    /// assert_eq!(iter.next(), Some(b'c'));
-    /// assert_eq!(iter.next(), None);
-    /// ```
-    pub fn new(inner: T) -> IntoIter<T> {
-        IntoIter { inner }
-    }
-
-    /// Consumes this `IntoIter`, returning the underlying value.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::{Buf, Bytes};
-    ///
-    /// let buf = Bytes::from(&b"abc"[..]);
-    /// let mut iter = buf.into_iter();
-    ///
-    /// assert_eq!(iter.next(), Some(b'a'));
-    ///
-    /// let buf = iter.into_inner();
-    /// assert_eq!(2, buf.remaining());
-    /// ```
-    pub fn into_inner(self) -> T {
-        self.inner
-    }
-
-    /// Gets a reference to the underlying `Buf`.
-    ///
-    /// It is inadvisable to directly read from the underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::{Buf, Bytes};
-    ///
-    /// let buf = Bytes::from(&b"abc"[..]);
-    /// let mut iter = buf.into_iter();
-    ///
-    /// assert_eq!(iter.next(), Some(b'a'));
-    ///
-    /// assert_eq!(2, iter.get_ref().remaining());
-    /// ```
-    pub fn get_ref(&self) -> &T {
-        &self.inner
-    }
-
-    /// Gets a mutable reference to the underlying `Buf`.
-    ///
-    /// It is inadvisable to directly read from the underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::{Buf, BytesMut};
-    ///
-    /// let buf = BytesMut::from(&b"abc"[..]);
-    /// let mut iter = buf.into_iter();
-    ///
-    /// assert_eq!(iter.next(), Some(b'a'));
-    ///
-    /// iter.get_mut().advance(1);
-    ///
-    /// assert_eq!(iter.next(), Some(b'c'));
-    /// ```
-    pub fn get_mut(&mut self) -> &mut T {
-        &mut self.inner
-    }
-}
-
-impl<T: Buf> Iterator for IntoIter<T> {
-    type Item = u8;
-
-    fn next(&mut self) -> Option<u8> {
-        if !self.inner.has_remaining() {
-            return None;
-        }
-
-        let b = self.inner.chunk()[0];
-        self.inner.advance(1);
-
-        Some(b)
-    }
-
-    fn size_hint(&self) -> (usize, Option<usize>) {
-        let rem = self.inner.remaining();
-        (rem, Some(rem))
-    }
-}
-
-impl<T: Buf> ExactSizeIterator for IntoIter<T> {}

src/buf/limit.rs

@@ -1,75 +0,0 @@
-use crate::buf::UninitSlice;
-use crate::BufMut;
-
-use core::cmp;
-
-/// A `BufMut` adapter which limits the amount of bytes that can be written
-/// to an underlying buffer.
-#[derive(Debug)]
-pub struct Limit<T> {
-    inner: T,
-    limit: usize,
-}
-
-pub(super) fn new<T>(inner: T, limit: usize) -> Limit<T> {
-    Limit { inner, limit }
-}
-
-impl<T> Limit<T> {
-    /// Consumes this `Limit`, returning the underlying value.
-    pub fn into_inner(self) -> T {
-        self.inner
-    }
-
-    /// Gets a reference to the underlying `BufMut`.
-    ///
-    /// It is inadvisable to directly write to the underlying `BufMut`.
-    pub fn get_ref(&self) -> &T {
-        &self.inner
-    }
-
-    /// Gets a mutable reference to the underlying `BufMut`.
-    ///
-    /// It is inadvisable to directly write to the underlying `BufMut`.
-    pub fn get_mut(&mut self) -> &mut T {
-        &mut self.inner
-    }
-
-    /// Returns the maximum number of bytes that can be written
-    ///
-    /// # Note
-    ///
-    /// If the inner `BufMut` has fewer bytes than indicated by this method then
-    /// that is the actual number of available bytes.
-    pub fn limit(&self) -> usize {
-        self.limit
-    }
-
-    /// Sets the maximum number of bytes that can be written.
-    ///
-    /// # Note
-    ///
-    /// If the inner `BufMut` has fewer bytes than `lim` then that is the actual
-    /// number of available bytes.
-    pub fn set_limit(&mut self, lim: usize) {
-        self.limit = lim
-    }
-}
-
-unsafe impl<T: BufMut> BufMut for Limit<T> {
-    fn remaining_mut(&self) -> usize {
-        cmp::min(self.inner.remaining_mut(), self.limit)
-    }
-
-    fn chunk_mut(&mut self) -> &mut UninitSlice {
-        let bytes = self.inner.chunk_mut();
-        let end = cmp::min(bytes.len(), self.limit);
-        &mut bytes[..end]
-    }
-
-    unsafe fn advance_mut(&mut self, cnt: usize) {
-        assert!(cnt <= self.limit);
-        self.inner.advance_mut(cnt);
-        self.limit -= cnt;
-    }
-}

src/buf/mod.rs

@@ -1,39 +0,0 @@
-//! Utilities for working with buffers.
-//!
-//! A buffer is any structure that contains a sequence of bytes. The bytes may
-//! or may not be stored in contiguous memory. This module contains traits used
-//! to abstract over buffers as well as utilities for working with buffer types.
-//!
-//! # `Buf`, `BufMut`
-//!
-//! These are the two foundational traits for abstractly working with buffers.
-//! They can be thought as iterators for byte structures. They offer additional
-//! performance over `Iterator` by providing an API optimized for byte slices.
-//!
-//! See [`Buf`] and [`BufMut`] for more details.
-//!
-//! [rope]: https://en.wikipedia.org/wiki/Rope_(data_structure)
-
-mod buf_impl;
-mod buf_mut;
-mod chain;
-mod iter;
-mod limit;
-#[cfg(feature = "std")]
-mod reader;
-mod take;
-mod uninit_slice;
-mod vec_deque;
-#[cfg(feature = "std")]
-mod writer;
-
-pub use self::buf_impl::Buf;
-pub use self::buf_mut::BufMut;
-pub use self::chain::Chain;
-pub use self::iter::IntoIter;
-pub use self::limit::Limit;
-pub use self::take::Take;
-pub use self::uninit_slice::UninitSlice;
-
-#[cfg(feature = "std")]
-pub use self::{reader::Reader, writer::Writer};

src/buf/reader.rs

@@ -1,81 +0,0 @@
-use crate::Buf;
-
-use std::{cmp, io};
-
-/// A `Buf` adapter which implements `io::Read` for the inner value.
-///
-/// This struct is generally created by calling `reader()` on `Buf`. See
-/// documentation of [`reader()`](Buf::reader) for more
-/// details.
-#[derive(Debug)]
-pub struct Reader<B> {
-    buf: B,
-}
-
-pub fn new<B>(buf: B) -> Reader<B> {
-    Reader { buf }
-}
-
-impl<B: Buf> Reader<B> {
-    /// Gets a reference to the underlying `Buf`.
-    ///
-    /// It is inadvisable to directly read from the underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::Buf;
-    ///
-    /// let buf = b"hello world".reader();
-    ///
-    /// assert_eq!(b"hello world", buf.get_ref());
-    /// ```
-    pub fn get_ref(&self) -> &B {
-        &self.buf
-    }
-
-    /// Gets a mutable reference to the underlying `Buf`.
-    ///
-    /// It is inadvisable to directly read from the underlying `Buf`.
-    pub fn get_mut(&mut self) -> &mut B {
-        &mut self.buf
-    }
-
-    /// Consumes this `Reader`, returning the underlying value.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::Buf;
-    /// use std::io;
-    ///
-    /// let mut buf = b"hello world".reader();
-    /// let mut dst = vec![];
-    ///
-    /// io::copy(&mut buf, &mut dst).unwrap();
-    ///
-    /// let buf = buf.into_inner();
-    /// assert_eq!(0, buf.remaining());
-    /// ```
-    pub fn into_inner(self) -> B {
-        self.buf
-    }
-}
-
-impl<B: Buf + Sized> io::Read for Reader<B> {
-    fn read(&mut self, dst: &mut [u8]) -> io::Result<usize> {
-        let len = cmp::min(self.buf.remaining(), dst.len());
-
-        Buf::copy_to_slice(&mut self.buf, &mut dst[0..len]);
-        Ok(len)
-    }
-}
-
-impl<B: Buf + Sized> io::BufRead for Reader<B> {
-    fn fill_buf(&mut self) -> io::Result<&[u8]> {
-        Ok(self.buf.chunk())
-    }
-    fn consume(&mut self, amt: usize) {
-        self.buf.advance(amt)
-    }
-}

src/buf/take.rs

@@ -1,187 +0,0 @@
-use crate::Buf;
-
-use core::cmp;
-
-#[cfg(feature = "std")]
-use std::io::IoSlice;
-
-/// A `Buf` adapter which limits the bytes read from an underlying buffer.
-///
-/// This struct is generally created by calling `take()` on `Buf`. See
-/// documentation of [`take()`](Buf::take) for more details.
-#[derive(Debug)]
-pub struct Take<T> {
-    inner: T,
-    limit: usize,
-}
-
-pub fn new<T>(inner: T, limit: usize) -> Take<T> {
-    Take { inner, limit }
-}
-
-impl<T> Take<T> {
-    /// Consumes this `Take`, returning the underlying value.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::{Buf, BufMut};
-    ///
-    /// let mut buf = b"hello world".take(2);
-    /// let mut dst = vec![];
-    ///
-    /// dst.put(&mut buf);
-    /// assert_eq!(*dst, b"he"[..]);
-    ///
-    /// let mut buf = buf.into_inner();
-    ///
-    /// dst.clear();
-    /// dst.put(&mut buf);
-    /// assert_eq!(*dst, b"llo world"[..]);
-    /// ```
-    pub fn into_inner(self) -> T {
-        self.inner
-    }
-
-    /// Gets a reference to the underlying `Buf`.
-    ///
-    /// It is inadvisable to directly read from the underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::Buf;
-    ///
-    /// let buf = b"hello world".take(2);
-    ///
-    /// assert_eq!(11, buf.get_ref().remaining());
-    /// ```
-    pub fn get_ref(&self) -> &T {
-        &self.inner
-    }
-
-    /// Gets a mutable reference to the underlying `Buf`.
-    ///
-    /// It is inadvisable to directly read from the underlying `Buf`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::{Buf, BufMut};
-    ///
-    /// let mut buf = b"hello world".take(2);
-    /// let mut dst = vec![];
-    ///
-    /// buf.get_mut().advance(2);
-    ///
-    /// dst.put(&mut buf);
-    /// assert_eq!(*dst, b"ll"[..]);
-    /// ```
-    pub fn get_mut(&mut self) -> &mut T {
-        &mut self.inner
-    }
-
-    /// Returns the maximum number of bytes that can be read.
-    ///
-    /// # Note
-    ///
-    /// If the inner `Buf` has fewer bytes than indicated by this method then
-    /// that is the actual number of available bytes.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::Buf;
-    ///
-    /// let mut buf = b"hello world".take(2);
-    ///
-    /// assert_eq!(2, buf.limit());
-    /// assert_eq!(b'h', buf.get_u8());
-    /// assert_eq!(1, buf.limit());
-    /// ```
-    pub fn limit(&self) -> usize {
-        self.limit
-    }
-
-    /// Sets the maximum number of bytes that can be read.
-    ///
-    /// # Note
-    ///
-    /// If the inner `Buf` has fewer bytes than `lim` then that is the actual
-    /// number of available bytes.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::{Buf, BufMut};
-    ///
-    /// let mut buf = b"hello world".take(2);
-    /// let mut dst = vec![];
-    ///
-    /// dst.put(&mut buf);
-    /// assert_eq!(*dst, b"he"[..]);
-    ///
-    /// dst.clear();
-    ///
-    /// buf.set_limit(3);
-    /// dst.put(&mut buf);
-    /// assert_eq!(*dst, b"llo"[..]);
-    /// ```
-    pub fn set_limit(&mut self, lim: usize) {
-        self.limit = lim
-    }
-}
-
-impl<T: Buf> Buf for Take<T> {
-    fn remaining(&self) -> usize {
-        cmp::min(self.inner.remaining(), self.limit)
-    }
-
-    fn chunk(&self) -> &[u8] {
-        let bytes = self.inner.chunk();
-        &bytes[..cmp::min(bytes.len(), self.limit)]
-    }
-
-    fn advance(&mut self, cnt: usize) {
-        assert!(cnt <= self.limit);
-        self.inner.advance(cnt);
-        self.limit -= cnt;
-    }
-
-    fn copy_to_bytes(&mut self, len: usize) -> crate::Bytes {
-        assert!(len <= self.remaining(), "`len` greater than remaining");
-
-        let r = self.inner.copy_to_bytes(len);
-        self.limit -= len;
-        r
-    }
-
-    #[cfg(feature = "std")]
-    fn chunks_vectored<'a>(&'a self, dst: &mut [IoSlice<'a>]) -> usize {
-        if self.limit == 0 {
-            return 0;
-        }
-
-        const LEN: usize = 16;
-        let mut slices: [IoSlice<'a>; LEN] = [IoSlice::new(&[]); LEN];
-
-        let cnt = self
-            .inner
-            .chunks_vectored(&mut slices[..dst.len().min(LEN)]);
-        let mut limit = self.limit;
-        for (i, (dst, slice)) in dst[..cnt].iter_mut().zip(slices.iter()).enumerate() {
-            if let Some(buf) = slice.get(..limit) {
-                // SAFETY: We could do this safely with `IoSlice::advance` if we had a larger MSRV.
-                let buf = unsafe { std::mem::transmute::<&[u8], &'a [u8]>(buf) };
-                *dst = IoSlice::new(buf);
-                return i + 1;
-            } else {
-                // SAFETY: We could do this safely with `IoSlice::advance` if we had a larger MSRV.
-                let buf = unsafe { std::mem::transmute::<&[u8], &'a [u8]>(slice) };
-                *dst = IoSlice::new(buf);
-                limit -= slice.len();
-            }
-        }
-        cnt
-    }
-}

src/buf/uninit_slice.rs

@@ -1,257 +0,0 @@
-use core::fmt;
-use core::mem::MaybeUninit;
-use core::ops::{
-    Index, IndexMut, Range, RangeFrom, RangeFull, RangeInclusive, RangeTo, RangeToInclusive,
-};
-
-/// Uninitialized byte slice.
-///
-/// Returned by `BufMut::chunk_mut()`, the referenced byte slice may be
-/// uninitialized. The wrapper provides safe access without introducing
-/// undefined behavior.
-///
-/// The safety invariants of this wrapper are:
-///
-///  1. Reading from an `UninitSlice` is undefined behavior.
-///  2. Writing uninitialized bytes to an `UninitSlice` is undefined behavior.
-///
-/// The difference between `&mut UninitSlice` and `&mut [MaybeUninit<u8>]` is
-/// that it is possible in safe code to write uninitialized bytes to an
-/// `&mut [MaybeUninit<u8>]`, which this type prohibits.
-#[repr(transparent)]
-pub struct UninitSlice([MaybeUninit<u8>]);
-
-impl UninitSlice {
-    /// Creates a `&mut UninitSlice` wrapping a slice of initialised memory.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::buf::UninitSlice;
-    ///
-    /// let mut buffer = [0u8; 64];
-    /// let slice = UninitSlice::new(&mut buffer[..]);
-    /// ```
-    #[inline]
-    pub fn new(slice: &mut [u8]) -> &mut UninitSlice {
-        unsafe { &mut *(slice as *mut [u8] as *mut [MaybeUninit<u8>] as *mut UninitSlice) }
-    }
-
-    /// Creates a `&mut UninitSlice` wrapping a slice of uninitialised memory.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::buf::UninitSlice;
-    /// use core::mem::MaybeUninit;
-    ///
-    /// let mut buffer = [MaybeUninit::uninit(); 64];
-    /// let slice = UninitSlice::uninit(&mut buffer[..]);
-    ///
-    /// let mut vec = Vec::with_capacity(1024);
-    /// let spare: &mut UninitSlice = vec.spare_capacity_mut().into();
-    /// ```
-    #[inline]
-    pub fn uninit(slice: &mut [MaybeUninit<u8>]) -> &mut UninitSlice {
-        unsafe { &mut *(slice as *mut [MaybeUninit<u8>] as *mut UninitSlice) }
-    }
-
-    fn uninit_ref(slice: &[MaybeUninit<u8>]) -> &UninitSlice {
-        unsafe { &*(slice as *const [MaybeUninit<u8>] as *const UninitSlice) }
-    }
-
-    /// Create a `&mut UninitSlice` from a pointer and a length.
-    ///
-    /// # Safety
-    ///
-    /// The caller must ensure that `ptr` references a valid memory region owned
-    /// by the caller representing a byte slice for the duration of `'a`.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::buf::UninitSlice;
-    ///
-    /// let bytes = b"hello world".to_vec();
-    /// let ptr = bytes.as_ptr() as *mut _;
-    /// let len = bytes.len();
-    ///
-    /// let slice = unsafe { UninitSlice::from_raw_parts_mut(ptr, len) };
-    /// ```
-    #[inline]
-    pub unsafe fn from_raw_parts_mut<'a>(ptr: *mut u8, len: usize) -> &'a mut UninitSlice {
-        let maybe_init: &mut [MaybeUninit<u8>] =
-            core::slice::from_raw_parts_mut(ptr as *mut _, len);
-        Self::uninit(maybe_init)
-    }
-
-    /// Write a single byte at the specified offset.
-    ///
-    /// # Panics
-    ///
-    /// The function panics if `index` is out of bounds.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::buf::UninitSlice;
-    ///
-    /// let mut data = [b'f', b'o', b'o'];
-    /// let slice = unsafe { UninitSlice::from_raw_parts_mut(data.as_mut_ptr(), 3) };
-    ///
-    /// slice.write_byte(0, b'b');
-    ///
-    /// assert_eq!(b"boo", &data[..]);
-    /// ```
-    #[inline]
-    pub fn write_byte(&mut self, index: usize, byte: u8) {
-        assert!(index < self.len());
-
-        unsafe { self[index..].as_mut_ptr().write(byte) }
-    }
-
-    /// Copies bytes from `src` into `self`.
-    ///
-    /// The length of `src` must be the same as `self`.
-    ///
-    /// # Panics
-    ///
-    /// The function panics if `src` has a different length than `self`.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::buf::UninitSlice;
-    ///
-    /// let mut data = [b'f', b'o', b'o'];
-    /// let slice = unsafe { UninitSlice::from_raw_parts_mut(data.as_mut_ptr(), 3) };
-    ///
-    /// slice.copy_from_slice(b"bar");
-    ///
-    /// assert_eq!(b"bar", &data[..]);
-    /// ```
-    #[inline]
-    pub fn copy_from_slice(&mut self, src: &[u8]) {
-        use core::ptr;
-
-        assert_eq!(self.len(), src.len());
-
-        unsafe {
-            ptr::copy_nonoverlapping(src.as_ptr(), self.as_mut_ptr(), self.len());
-        }
-    }
-
-    /// Return a raw pointer to the slice's buffer.
-    ///
-    /// # Safety
-    ///
-    /// The caller **must not** read from the referenced memory and **must not**
-    /// write **uninitialized** bytes to the slice either.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::BufMut;
-    ///
-    /// let mut data = [0, 1, 2];
-    /// let mut slice = &mut data[..];
-    /// let ptr = BufMut::chunk_mut(&mut slice).as_mut_ptr();
-    /// ```
-    #[inline]
-    pub fn as_mut_ptr(&mut self) -> *mut u8 {
-        self.0.as_mut_ptr() as *mut _
-    }
-
-    /// Return a `&mut [MaybeUninit<u8>]` to this slice's buffer.
-    ///
-    /// # Safety
-    ///
-    /// The caller **must not** read from the referenced memory and **must not** write
-    /// **uninitialized** bytes to the slice either. This is because `BufMut` implementation
-    /// that created the `UninitSlice` knows which parts are initialized. Writing uninitialized
-    /// bytes to the slice may cause the `BufMut` to read those bytes and trigger undefined
-    /// behavior.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::BufMut;
-    ///
-    /// let mut data = [0, 1, 2];
-    /// let mut slice = &mut data[..];
-    /// unsafe {
-    ///     let uninit_slice = BufMut::chunk_mut(&mut slice).as_uninit_slice_mut();
-    /// };
-    /// ```
-    #[inline]
-    pub unsafe fn as_uninit_slice_mut(&mut self) -> &mut [MaybeUninit<u8>] {
-        &mut self.0
-    }
-
-    /// Returns the number of bytes in the slice.
-    ///
-    /// # Examples
-    ///
-    /// ```
-    /// use bytes::BufMut;
-    ///
-    /// let mut data = [0, 1, 2];
-    /// let mut slice = &mut data[..];
-    /// let len = BufMut::chunk_mut(&mut slice).len();
-    ///
-    /// assert_eq!(len, 3);
-    /// ```
-    #[inline]
-    pub fn len(&self) -> usize {
-        self.0.len()
-    }
-}
-
-impl fmt::Debug for UninitSlice {
-    fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
-        fmt.debug_struct("UninitSlice[...]").finish()
-    }
-}
-
-impl<'a> From<&'a mut [u8]> for &'a mut UninitSlice {
-    fn from(slice: &'a mut [u8]) -> Self {
-        UninitSlice::new(slice)
-    }
-}
-
-impl<'a> From<&'a mut [MaybeUninit<u8>]> for &'a mut UninitSlice {
-    fn from(slice: &'a mut [MaybeUninit<u8>]) -> Self {
-        UninitSlice::uninit(slice)
-    }
-}
-
-macro_rules! impl_index {
-    ($($t:ty),*) => {
-        $(
-            impl Index<$t> for UninitSlice {
-                type Output = UninitSlice;
-
-                #[inline]
-                fn index(&self, index: $t) -> &UninitSlice {
-                    UninitSlice::uninit_ref(&self.0[index])
-                }
-            }
-
-            impl IndexMut<$t> for UninitSlice {
-                #[inline]
-                fn index_mut(&mut self, index: $t) -> &mut UninitSlice {
-                    UninitSlice::uninit(&mut self.0[index])
-                }
-            }
-        )*
-    };
-}
-
-impl_index!(
-    Range<usize>,
-    RangeFrom<usize>,
-    RangeFull,
-    RangeInclusive<usize>,
-    RangeTo<usize>,
-    RangeToInclusive<usize>
-);

src/buf/vec_deque.rs

@@ -1,40 +0,0 @@
-use alloc::collections::VecDeque;
-#[cfg(feature = "std")]
-use std::io;
-
-use super::Buf;
-
-impl Buf for VecDeque<u8> {
-    fn remaining(&self) -> usize {
-        self.len()
-    }
-
-    fn chunk(&self) -> &[u8] {
-        let (s1, s2) = self.as_slices();
-        if s1.is_empty() {
-            s2
-        } else {
-            s1
-        }
-    }
-
-    #[cfg(feature = "std")]
-    fn chunks_vectored<'a>(&'a self, dst: &mut [io::IoSlice<'a>]) -> usize {
-        if self.is_empty() || dst.is_empty() {
-            return 0;
-        }
-
-        let (s1, s2) = self.as_slices();
-        dst[0] = io::IoSlice::new(s1);
-        if s2.is_empty() || dst.len() == 1 {
-            return 1;
-        }
-
-        dst[1] = io::IoSlice::new(s2);
-        2
-    }
-
-    fn advance(&mut self, cnt: usize) {
-        self.drain(..cnt);
-    }
-}

src/buf/writer.rs

@@ -1,88 +0,0 @@
-use crate::BufMut;
-
-use std::{cmp, io};
-
-/// A `BufMut` adapter which implements `io::Write` for the inner value.
-///
-/// This struct is generally created by calling `writer()` on `BufMut`. See
-/// documentation of [`writer()`](BufMut::writer) for more
-/// details.
-#[derive(Debug)]
-pub struct Writer<B> {
-    buf: B,
-}
-
-pub fn new<B>(buf: B) -> Writer<B> {
-    Writer { buf }
-}
-
-impl<B: BufMut> Writer<B> {
-    /// Gets a reference to the underlying `BufMut`.
-    ///
-    /// It is inadvisable to directly write to the underlying `BufMut`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::BufMut;
-    ///
-    /// let buf = Vec::with_capacity(1024).writer();
-    ///
-    /// assert_eq!(1024, buf.get_ref().capacity());
-    /// ```
-    pub fn get_ref(&self) -> &B {
-        &self.buf
-    }
-
-    /// Gets a mutable reference to the underlying `BufMut`.
-    ///
-    /// It is inadvisable to directly write to the underlying `BufMut`.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::BufMut;
-    ///
-    /// let mut buf = vec![].writer();
-    ///
-    /// buf.get_mut().reserve(1024);
-    ///
-    /// assert_eq!(1024, buf.get_ref().capacity());
-    /// ```
-    pub fn get_mut(&mut self) -> &mut B {
-        &mut self.buf
-    }
-
-    /// Consumes this `Writer`, returning the underlying value.
-    ///
-    /// # Examples
-    ///
-    /// ```rust
-    /// use bytes::BufMut;
-    /// use std::io;
-    ///
-    /// let mut buf = vec![].writer();
-    /// let mut src = &b"hello world"[..];
-    ///
-    /// io::copy(&mut src, &mut buf).unwrap();
-    ///
-    /// let buf = buf.into_inner();
-    /// assert_eq!(*buf, b"hello world"[..]);
-    /// ```
-    pub fn into_inner(self) -> B {
-        self.buf
-    }
-}
-
-impl<B: BufMut + Sized> io::Write for Writer<B> {
-    fn write(&mut self, src: &[u8]) -> io::Result<usize> {
-        let n = cmp::min(self.buf.remaining_mut(), src.len());
-
-        self.buf.put_slice(&src[..n]);
-        Ok(n)
-    }
-
-    fn flush(&mut self) -> io::Result<()> {
-        Ok(())
-    }
-}

src/bytes/buf/chain.rs.html

@@ -0,0 +1,481 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/chain.rs`."><title>chain.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a>
+<a href="#89" id="89">89</a>
+<a href="#90" id="90">90</a>
+<a href="#91" id="91">91</a>
+<a href="#92" id="92">92</a>
+<a href="#93" id="93">93</a>
+<a href="#94" id="94">94</a>
+<a href="#95" id="95">95</a>
+<a href="#96" id="96">96</a>
+<a href="#97" id="97">97</a>
+<a href="#98" id="98">98</a>
+<a href="#99" id="99">99</a>
+<a href="#100" id="100">100</a>
+<a href="#101" id="101">101</a>
+<a href="#102" id="102">102</a>
+<a href="#103" id="103">103</a>
+<a href="#104" id="104">104</a>
+<a href="#105" id="105">105</a>
+<a href="#106" id="106">106</a>
+<a href="#107" id="107">107</a>
+<a href="#108" id="108">108</a>
+<a href="#109" id="109">109</a>
+<a href="#110" id="110">110</a>
+<a href="#111" id="111">111</a>
+<a href="#112" id="112">112</a>
+<a href="#113" id="113">113</a>
+<a href="#114" id="114">114</a>
+<a href="#115" id="115">115</a>
+<a href="#116" id="116">116</a>
+<a href="#117" id="117">117</a>
+<a href="#118" id="118">118</a>
+<a href="#119" id="119">119</a>
+<a href="#120" id="120">120</a>
+<a href="#121" id="121">121</a>
+<a href="#122" id="122">122</a>
+<a href="#123" id="123">123</a>
+<a href="#124" id="124">124</a>
+<a href="#125" id="125">125</a>
+<a href="#126" id="126">126</a>
+<a href="#127" id="127">127</a>
+<a href="#128" id="128">128</a>
+<a href="#129" id="129">129</a>
+<a href="#130" id="130">130</a>
+<a href="#131" id="131">131</a>
+<a href="#132" id="132">132</a>
+<a href="#133" id="133">133</a>
+<a href="#134" id="134">134</a>
+<a href="#135" id="135">135</a>
+<a href="#136" id="136">136</a>
+<a href="#137" id="137">137</a>
+<a href="#138" id="138">138</a>
+<a href="#139" id="139">139</a>
+<a href="#140" id="140">140</a>
+<a href="#141" id="141">141</a>
+<a href="#142" id="142">142</a>
+<a href="#143" id="143">143</a>
+<a href="#144" id="144">144</a>
+<a href="#145" id="145">145</a>
+<a href="#146" id="146">146</a>
+<a href="#147" id="147">147</a>
+<a href="#148" id="148">148</a>
+<a href="#149" id="149">149</a>
+<a href="#150" id="150">150</a>
+<a href="#151" id="151">151</a>
+<a href="#152" id="152">152</a>
+<a href="#153" id="153">153</a>
+<a href="#154" id="154">154</a>
+<a href="#155" id="155">155</a>
+<a href="#156" id="156">156</a>
+<a href="#157" id="157">157</a>
+<a href="#158" id="158">158</a>
+<a href="#159" id="159">159</a>
+<a href="#160" id="160">160</a>
+<a href="#161" id="161">161</a>
+<a href="#162" id="162">162</a>
+<a href="#163" id="163">163</a>
+<a href="#164" id="164">164</a>
+<a href="#165" id="165">165</a>
+<a href="#166" id="166">166</a>
+<a href="#167" id="167">167</a>
+<a href="#168" id="168">168</a>
+<a href="#169" id="169">169</a>
+<a href="#170" id="170">170</a>
+<a href="#171" id="171">171</a>
+<a href="#172" id="172">172</a>
+<a href="#173" id="173">173</a>
+<a href="#174" id="174">174</a>
+<a href="#175" id="175">175</a>
+<a href="#176" id="176">176</a>
+<a href="#177" id="177">177</a>
+<a href="#178" id="178">178</a>
+<a href="#179" id="179">179</a>
+<a href="#180" id="180">180</a>
+<a href="#181" id="181">181</a>
+<a href="#182" id="182">182</a>
+<a href="#183" id="183">183</a>
+<a href="#184" id="184">184</a>
+<a href="#185" id="185">185</a>
+<a href="#186" id="186">186</a>
+<a href="#187" id="187">187</a>
+<a href="#188" id="188">188</a>
+<a href="#189" id="189">189</a>
+<a href="#190" id="190">190</a>
+<a href="#191" id="191">191</a>
+<a href="#192" id="192">192</a>
+<a href="#193" id="193">193</a>
+<a href="#194" id="194">194</a>
+<a href="#195" id="195">195</a>
+<a href="#196" id="196">196</a>
+<a href="#197" id="197">197</a>
+<a href="#198" id="198">198</a>
+<a href="#199" id="199">199</a>
+<a href="#200" id="200">200</a>
+<a href="#201" id="201">201</a>
+<a href="#202" id="202">202</a>
+<a href="#203" id="203">203</a>
+<a href="#204" id="204">204</a>
+<a href="#205" id="205">205</a>
+<a href="#206" id="206">206</a>
+<a href="#207" id="207">207</a>
+<a href="#208" id="208">208</a>
+<a href="#209" id="209">209</a>
+<a href="#210" id="210">210</a>
+<a href="#211" id="211">211</a>
+<a href="#212" id="212">212</a>
+<a href="#213" id="213">213</a>
+<a href="#214" id="214">214</a>
+<a href="#215" id="215">215</a>
+<a href="#216" id="216">216</a>
+<a href="#217" id="217">217</a>
+<a href="#218" id="218">218</a>
+<a href="#219" id="219">219</a>
+<a href="#220" id="220">220</a>
+<a href="#221" id="221">221</a>
+<a href="#222" id="222">222</a>
+<a href="#223" id="223">223</a>
+<a href="#224" id="224">224</a>
+<a href="#225" id="225">225</a>
+<a href="#226" id="226">226</a>
+<a href="#227" id="227">227</a>
+<a href="#228" id="228">228</a>
+<a href="#229" id="229">229</a>
+<a href="#230" id="230">230</a>
+<a href="#231" id="231">231</a>
+<a href="#232" id="232">232</a>
+<a href="#233" id="233">233</a>
+<a href="#234" id="234">234</a>
+<a href="#235" id="235">235</a>
+<a href="#236" id="236">236</a>
+<a href="#237" id="237">237</a>
+<a href="#238" id="238">238</a>
+<a href="#239" id="239">239</a>
+<a href="#240" id="240">240</a></pre></div><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::buf::{IntoIter, UninitSlice};
+<span class="kw">use crate</span>::{Buf, BufMut};
+
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">use </span>std::io::IoSlice;
+
+<span class="doccomment">/// A `Chain` sequences two buffers.
+///
+/// `Chain` is an adapter that links two underlying buffers and provides a
+/// continuous view across both buffers. It is able to sequence either immutable
+/// buffers ([`Buf`] values) or mutable buffers ([`BufMut`] values).
+///
+/// This struct is generally created by calling [`Buf::chain`]. Please see that
+/// function's documentation for more detail.
+///
+/// # Examples
+///
+/// ```
+/// use bytes::{Bytes, Buf};
+///
+/// let mut buf = (&amp;b"hello "[..])
+///     .chain(&amp;b"world"[..]);
+///
+/// let full: Bytes = buf.copy_to_bytes(11);
+/// assert_eq!(full[..], b"hello world"[..]);
+/// ```
+///
+/// [`Buf::chain`]: Buf::chain
+</span><span class="attr">#[derive(Debug)]
+</span><span class="kw">pub struct </span>Chain&lt;T, U&gt; {
+    a: T,
+    b: U,
+}
+
+<span class="kw">impl</span>&lt;T, U&gt; Chain&lt;T, U&gt; {
+    <span class="doccomment">/// Creates a new `Chain` sequencing the provided values.
+    </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>new(a: T, b: U) -&gt; Chain&lt;T, U&gt; {
+        Chain { a, b }
+    }
+
+    <span class="doccomment">/// Gets a reference to the first underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::Buf;
+    ///
+    /// let buf = (&amp;b"hello"[..])
+    ///     .chain(&amp;b"world"[..]);
+    ///
+    /// assert_eq!(buf.first_ref()[..], b"hello"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>first_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.a
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the first underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::Buf;
+    ///
+    /// let mut buf = (&amp;b"hello"[..])
+    ///     .chain(&amp;b"world"[..]);
+    ///
+    /// buf.first_mut().advance(1);
+    ///
+    /// let full = buf.copy_to_bytes(9);
+    /// assert_eq!(full, b"elloworld"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>first_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>T {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.a
+    }
+
+    <span class="doccomment">/// Gets a reference to the last underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::Buf;
+    ///
+    /// let buf = (&amp;b"hello"[..])
+    ///     .chain(&amp;b"world"[..]);
+    ///
+    /// assert_eq!(buf.last_ref()[..], b"world"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>last_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>U {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.b
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the last underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::Buf;
+    ///
+    /// let mut buf = (&amp;b"hello "[..])
+    ///     .chain(&amp;b"world"[..]);
+    ///
+    /// buf.last_mut().advance(1);
+    ///
+    /// let full = buf.copy_to_bytes(10);
+    /// assert_eq!(full, b"hello orld"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>last_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>U {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.b
+    }
+
+    <span class="doccomment">/// Consumes this `Chain`, returning the underlying values.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::Buf;
+    ///
+    /// let chain = (&amp;b"hello"[..])
+    ///     .chain(&amp;b"world"[..]);
+    ///
+    /// let (first, last) = chain.into_inner();
+    /// assert_eq!(first[..], b"hello"[..]);
+    /// assert_eq!(last[..], b"world"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -&gt; (T, U) {
+        (<span class="self">self</span>.a, <span class="self">self</span>.b)
+    }
+}
+
+<span class="kw">impl</span>&lt;T, U&gt; Buf <span class="kw">for </span>Chain&lt;T, U&gt;
+<span class="kw">where
+    </span>T: Buf,
+    U: Buf,
+{
+    <span class="kw">fn </span>remaining(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        <span class="self">self</span>.a.remaining().saturating_add(<span class="self">self</span>.b.remaining())
+    }
+
+    <span class="kw">fn </span>chunk(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[u8] {
+        <span class="kw">if </span><span class="self">self</span>.a.has_remaining() {
+            <span class="self">self</span>.a.chunk()
+        } <span class="kw">else </span>{
+            <span class="self">self</span>.b.chunk()
+        }
+    }
+
+    <span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>cnt: usize) {
+        <span class="kw">let </span>a_rem = <span class="self">self</span>.a.remaining();
+
+        <span class="kw">if </span>a_rem != <span class="number">0 </span>{
+            <span class="kw">if </span>a_rem &gt;= cnt {
+                <span class="self">self</span>.a.advance(cnt);
+                <span class="kw">return</span>;
+            }
+
+            <span class="comment">// Consume what is left of a
+            </span><span class="self">self</span>.a.advance(a_rem);
+
+            cnt -= a_rem;
+        }
+
+        <span class="self">self</span>.b.advance(cnt);
+    }
+
+    <span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+    </span><span class="kw">fn </span>chunks_vectored&lt;<span class="lifetime">'a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="self">self</span>, dst: <span class="kw-2">&amp;mut </span>[IoSlice&lt;<span class="lifetime">'a</span>&gt;]) -&gt; usize {
+        <span class="kw">let </span><span class="kw-2">mut </span>n = <span class="self">self</span>.a.chunks_vectored(dst);
+        n += <span class="self">self</span>.b.chunks_vectored(<span class="kw-2">&amp;mut </span>dst[n..]);
+        n
+    }
+
+    <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize) -&gt; <span class="kw">crate</span>::Bytes {
+        <span class="kw">let </span>a_rem = <span class="self">self</span>.a.remaining();
+        <span class="kw">if </span>a_rem &gt;= len {
+            <span class="self">self</span>.a.copy_to_bytes(len)
+        } <span class="kw">else if </span>a_rem == <span class="number">0 </span>{
+            <span class="self">self</span>.b.copy_to_bytes(len)
+        } <span class="kw">else </span>{
+            <span class="macro">assert!</span>(
+                len - a_rem &lt;= <span class="self">self</span>.b.remaining(),
+                <span class="string">"`len` greater than remaining"
+            </span>);
+            <span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="kw">crate</span>::BytesMut::with_capacity(len);
+            ret.put(<span class="kw-2">&amp;mut </span><span class="self">self</span>.a);
+            ret.put((<span class="kw-2">&amp;mut </span><span class="self">self</span>.b).take(len - a_rem));
+            ret.freeze()
+        }
+    }
+}
+
+<span class="kw">unsafe impl</span>&lt;T, U&gt; BufMut <span class="kw">for </span>Chain&lt;T, U&gt;
+<span class="kw">where
+    </span>T: BufMut,
+    U: BufMut,
+{
+    <span class="kw">fn </span>remaining_mut(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        <span class="self">self</span>.a
+            .remaining_mut()
+            .saturating_add(<span class="self">self</span>.b.remaining_mut())
+    }
+
+    <span class="kw">fn </span>chunk_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>UninitSlice {
+        <span class="kw">if </span><span class="self">self</span>.a.has_remaining_mut() {
+            <span class="self">self</span>.a.chunk_mut()
+        } <span class="kw">else </span>{
+            <span class="self">self</span>.b.chunk_mut()
+        }
+    }
+
+    <span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>cnt: usize) {
+        <span class="kw">let </span>a_rem = <span class="self">self</span>.a.remaining_mut();
+
+        <span class="kw">if </span>a_rem != <span class="number">0 </span>{
+            <span class="kw">if </span>a_rem &gt;= cnt {
+                <span class="self">self</span>.a.advance_mut(cnt);
+                <span class="kw">return</span>;
+            }
+
+            <span class="comment">// Consume what is left of a
+            </span><span class="self">self</span>.a.advance_mut(a_rem);
+
+            cnt -= a_rem;
+        }
+
+        <span class="self">self</span>.b.advance_mut(cnt);
+    }
+}
+
+<span class="kw">impl</span>&lt;T, U&gt; IntoIterator <span class="kw">for </span>Chain&lt;T, U&gt;
+<span class="kw">where
+    </span>T: Buf,
+    U: Buf,
+{
+    <span class="kw">type </span>Item = u8;
+    <span class="kw">type </span>IntoIter = IntoIter&lt;Chain&lt;T, U&gt;&gt;;
+
+    <span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; <span class="self">Self</span>::IntoIter {
+        IntoIter::new(<span class="self">self</span>)
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/buf/iter.rs.html

@@ -0,0 +1,255 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/iter.rs`."><title>iter.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a>
+<a href="#89" id="89">89</a>
+<a href="#90" id="90">90</a>
+<a href="#91" id="91">91</a>
+<a href="#92" id="92">92</a>
+<a href="#93" id="93">93</a>
+<a href="#94" id="94">94</a>
+<a href="#95" id="95">95</a>
+<a href="#96" id="96">96</a>
+<a href="#97" id="97">97</a>
+<a href="#98" id="98">98</a>
+<a href="#99" id="99">99</a>
+<a href="#100" id="100">100</a>
+<a href="#101" id="101">101</a>
+<a href="#102" id="102">102</a>
+<a href="#103" id="103">103</a>
+<a href="#104" id="104">104</a>
+<a href="#105" id="105">105</a>
+<a href="#106" id="106">106</a>
+<a href="#107" id="107">107</a>
+<a href="#108" id="108">108</a>
+<a href="#109" id="109">109</a>
+<a href="#110" id="110">110</a>
+<a href="#111" id="111">111</a>
+<a href="#112" id="112">112</a>
+<a href="#113" id="113">113</a>
+<a href="#114" id="114">114</a>
+<a href="#115" id="115">115</a>
+<a href="#116" id="116">116</a>
+<a href="#117" id="117">117</a>
+<a href="#118" id="118">118</a>
+<a href="#119" id="119">119</a>
+<a href="#120" id="120">120</a>
+<a href="#121" id="121">121</a>
+<a href="#122" id="122">122</a>
+<a href="#123" id="123">123</a>
+<a href="#124" id="124">124</a>
+<a href="#125" id="125">125</a>
+<a href="#126" id="126">126</a>
+<a href="#127" id="127">127</a></pre></div><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::Buf;
+
+<span class="doccomment">/// Iterator over the bytes contained by the buffer.
+///
+/// # Examples
+///
+/// Basic usage:
+///
+/// ```
+/// use bytes::Bytes;
+///
+/// let buf = Bytes::from(&amp;b"abc"[..]);
+/// let mut iter = buf.into_iter();
+///
+/// assert_eq!(iter.next(), Some(b'a'));
+/// assert_eq!(iter.next(), Some(b'b'));
+/// assert_eq!(iter.next(), Some(b'c'));
+/// assert_eq!(iter.next(), None);
+/// ```
+</span><span class="attr">#[derive(Debug)]
+</span><span class="kw">pub struct </span>IntoIter&lt;T&gt; {
+    inner: T,
+}
+
+<span class="kw">impl</span>&lt;T&gt; IntoIter&lt;T&gt; {
+    <span class="doccomment">/// Creates an iterator over the bytes contained by the buffer.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::Bytes;
+    ///
+    /// let buf = Bytes::from_static(b"abc");
+    /// let mut iter = buf.into_iter();
+    ///
+    /// assert_eq!(iter.next(), Some(b'a'));
+    /// assert_eq!(iter.next(), Some(b'b'));
+    /// assert_eq!(iter.next(), Some(b'c'));
+    /// assert_eq!(iter.next(), None);
+    /// ```
+    </span><span class="kw">pub fn </span>new(inner: T) -&gt; IntoIter&lt;T&gt; {
+        IntoIter { inner }
+    }
+
+    <span class="doccomment">/// Consumes this `IntoIter`, returning the underlying value.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::{Buf, Bytes};
+    ///
+    /// let buf = Bytes::from(&amp;b"abc"[..]);
+    /// let mut iter = buf.into_iter();
+    ///
+    /// assert_eq!(iter.next(), Some(b'a'));
+    ///
+    /// let buf = iter.into_inner();
+    /// assert_eq!(2, buf.remaining());
+    /// ```
+    </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -&gt; T {
+        <span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Gets a reference to the underlying `Buf`.
+    ///
+    /// It is inadvisable to directly read from the underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::{Buf, Bytes};
+    ///
+    /// let buf = Bytes::from(&amp;b"abc"[..]);
+    /// let mut iter = buf.into_iter();
+    ///
+    /// assert_eq!(iter.next(), Some(b'a'));
+    ///
+    /// assert_eq!(2, iter.get_ref().remaining());
+    /// ```
+    </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the underlying `Buf`.
+    ///
+    /// It is inadvisable to directly read from the underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::{Buf, BytesMut};
+    ///
+    /// let buf = BytesMut::from(&amp;b"abc"[..]);
+    /// let mut iter = buf.into_iter();
+    ///
+    /// assert_eq!(iter.next(), Some(b'a'));
+    ///
+    /// iter.get_mut().advance(1);
+    ///
+    /// assert_eq!(iter.next(), Some(b'c'));
+    /// ```
+    </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>T {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.inner
+    }
+}
+
+<span class="kw">impl</span>&lt;T: Buf&gt; Iterator <span class="kw">for </span>IntoIter&lt;T&gt; {
+    <span class="kw">type </span>Item = u8;
+
+    <span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;u8&gt; {
+        <span class="kw">if </span>!<span class="self">self</span>.inner.has_remaining() {
+            <span class="kw">return </span><span class="prelude-val">None</span>;
+        }
+
+        <span class="kw">let </span>b = <span class="self">self</span>.inner.chunk()[<span class="number">0</span>];
+        <span class="self">self</span>.inner.advance(<span class="number">1</span>);
+
+        <span class="prelude-val">Some</span>(b)
+    }
+
+    <span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
+        <span class="kw">let </span>rem = <span class="self">self</span>.inner.remaining();
+        (rem, <span class="prelude-val">Some</span>(rem))
+    }
+}
+
+<span class="kw">impl</span>&lt;T: Buf&gt; ExactSizeIterator <span class="kw">for </span>IntoIter&lt;T&gt; {}
+</code></pre></div></section></main></body></html>

src/bytes/buf/limit.rs.html

@@ -0,0 +1,151 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/limit.rs`."><title>limit.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a></pre></div><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::buf::UninitSlice;
+<span class="kw">use </span><span class="kw">crate</span>::BufMut;
+
+<span class="kw">use </span>core::cmp;
+
+<span class="doccomment">/// A `BufMut` adapter which limits the amount of bytes that can be written
+/// to an underlying buffer.
+</span><span class="attr">#[derive(Debug)]
+</span><span class="kw">pub struct </span>Limit&lt;T&gt; {
+    inner: T,
+    limit: usize,
+}
+
+<span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>new&lt;T&gt;(inner: T, limit: usize) -&gt; Limit&lt;T&gt; {
+    Limit { inner, limit }
+}
+
+<span class="kw">impl</span>&lt;T&gt; Limit&lt;T&gt; {
+    <span class="doccomment">/// Consumes this `Limit`, returning the underlying value.
+    </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -&gt; T {
+        <span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Gets a reference to the underlying `BufMut`.
+    ///
+    /// It is inadvisable to directly write to the underlying `BufMut`.
+    </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the underlying `BufMut`.
+    ///
+    /// It is inadvisable to directly write to the underlying `BufMut`.
+    </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>T {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Returns the maximum number of bytes that can be written
+    ///
+    /// # Note
+    ///
+    /// If the inner `BufMut` has fewer bytes than indicated by this method then
+    /// that is the actual number of available bytes.
+    </span><span class="kw">pub fn </span>limit(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        <span class="self">self</span>.limit
+    }
+
+    <span class="doccomment">/// Sets the maximum number of bytes that can be written.
+    ///
+    /// # Note
+    ///
+    /// If the inner `BufMut` has fewer bytes than `lim` then that is the actual
+    /// number of available bytes.
+    </span><span class="kw">pub fn </span>set_limit(<span class="kw-2">&amp;mut </span><span class="self">self</span>, lim: usize) {
+        <span class="self">self</span>.limit = lim
+    }
+}
+
+<span class="kw">unsafe impl</span>&lt;T: BufMut&gt; BufMut <span class="kw">for </span>Limit&lt;T&gt; {
+    <span class="kw">fn </span>remaining_mut(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        cmp::min(<span class="self">self</span>.inner.remaining_mut(), <span class="self">self</span>.limit)
+    }
+
+    <span class="kw">fn </span>chunk_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>UninitSlice {
+        <span class="kw">let </span>bytes = <span class="self">self</span>.inner.chunk_mut();
+        <span class="kw">let </span>end = cmp::min(bytes.len(), <span class="self">self</span>.limit);
+        <span class="kw-2">&amp;mut </span>bytes[..end]
+    }
+
+    <span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cnt: usize) {
+        <span class="macro">assert!</span>(cnt &lt;= <span class="self">self</span>.limit);
+        <span class="self">self</span>.inner.advance_mut(cnt);
+        <span class="self">self</span>.limit -= cnt;
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/buf/mod.rs.html

@@ -0,0 +1,79 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/mod.rs`."><title>mod.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a></pre></div><pre class="rust"><code><span class="doccomment">//! Utilities for working with buffers.
+//!
+//! A buffer is any structure that contains a sequence of bytes. The bytes may
+//! or may not be stored in contiguous memory. This module contains traits used
+//! to abstract over buffers as well as utilities for working with buffer types.
+//!
+//! # `Buf`, `BufMut`
+//!
+//! These are the two foundational traits for abstractly working with buffers.
+//! They can be thought as iterators for byte structures. They offer additional
+//! performance over `Iterator` by providing an API optimized for byte slices.
+//!
+//! See [`Buf`] and [`BufMut`] for more details.
+//!
+//! [rope]: https://en.wikipedia.org/wiki/Rope_(data_structure)
+
+</span><span class="kw">mod </span>buf_impl;
+<span class="kw">mod </span>buf_mut;
+<span class="kw">mod </span>chain;
+<span class="kw">mod </span>iter;
+<span class="kw">mod </span>limit;
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">mod </span>reader;
+<span class="kw">mod </span>take;
+<span class="kw">mod </span>uninit_slice;
+<span class="kw">mod </span>vec_deque;
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">mod </span>writer;
+
+<span class="kw">pub use </span><span class="self">self</span>::buf_impl::Buf;
+<span class="kw">pub use </span><span class="self">self</span>::buf_mut::BufMut;
+<span class="kw">pub use </span><span class="self">self</span>::chain::Chain;
+<span class="kw">pub use </span><span class="self">self</span>::iter::IntoIter;
+<span class="kw">pub use </span><span class="self">self</span>::limit::Limit;
+<span class="kw">pub use </span><span class="self">self</span>::take::Take;
+<span class="kw">pub use </span><span class="self">self</span>::uninit_slice::UninitSlice;
+
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">pub use </span><span class="self">self</span>::{reader::Reader, writer::Writer};
+</code></pre></div></section></main></body></html>

src/bytes/buf/reader.rs.html

@@ -0,0 +1,163 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/reader.rs`."><title>reader.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a></pre></div><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::Buf;
+
+<span class="kw">use </span>std::{cmp, io};
+
+<span class="doccomment">/// A `Buf` adapter which implements `io::Read` for the inner value.
+///
+/// This struct is generally created by calling `reader()` on `Buf`. See
+/// documentation of [`reader()`](Buf::reader) for more
+/// details.
+</span><span class="attr">#[derive(Debug)]
+</span><span class="kw">pub struct </span>Reader&lt;B&gt; {
+    buf: B,
+}
+
+<span class="kw">pub fn </span>new&lt;B&gt;(buf: B) -&gt; Reader&lt;B&gt; {
+    Reader { buf }
+}
+
+<span class="kw">impl</span>&lt;B: Buf&gt; Reader&lt;B&gt; {
+    <span class="doccomment">/// Gets a reference to the underlying `Buf`.
+    ///
+    /// It is inadvisable to directly read from the underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::Buf;
+    ///
+    /// let buf = b"hello world".reader();
+    ///
+    /// assert_eq!(b"hello world", buf.get_ref());
+    /// ```
+    </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>B {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.buf
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the underlying `Buf`.
+    ///
+    /// It is inadvisable to directly read from the underlying `Buf`.
+    </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>B {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.buf
+    }
+
+    <span class="doccomment">/// Consumes this `Reader`, returning the underlying value.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::Buf;
+    /// use std::io;
+    ///
+    /// let mut buf = b"hello world".reader();
+    /// let mut dst = vec![];
+    ///
+    /// io::copy(&amp;mut buf, &amp;mut dst).unwrap();
+    ///
+    /// let buf = buf.into_inner();
+    /// assert_eq!(0, buf.remaining());
+    /// ```
+    </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -&gt; B {
+        <span class="self">self</span>.buf
+    }
+}
+
+<span class="kw">impl</span>&lt;B: Buf + Sized&gt; io::Read <span class="kw">for </span>Reader&lt;B&gt; {
+    <span class="kw">fn </span>read(<span class="kw-2">&amp;mut </span><span class="self">self</span>, dst: <span class="kw-2">&amp;mut </span>[u8]) -&gt; io::Result&lt;usize&gt; {
+        <span class="kw">let </span>len = cmp::min(<span class="self">self</span>.buf.remaining(), dst.len());
+
+        Buf::copy_to_slice(<span class="kw-2">&amp;mut </span><span class="self">self</span>.buf, <span class="kw-2">&amp;mut </span>dst[<span class="number">0</span>..len]);
+        <span class="prelude-val">Ok</span>(len)
+    }
+}
+
+<span class="kw">impl</span>&lt;B: Buf + Sized&gt; io::BufRead <span class="kw">for </span>Reader&lt;B&gt; {
+    <span class="kw">fn </span>fill_buf(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; io::Result&lt;<span class="kw-2">&amp;</span>[u8]&gt; {
+        <span class="prelude-val">Ok</span>(<span class="self">self</span>.buf.chunk())
+    }
+    <span class="kw">fn </span>consume(<span class="kw-2">&amp;mut </span><span class="self">self</span>, amt: usize) {
+        <span class="self">self</span>.buf.advance(amt)
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/buf/take.rs.html

@@ -0,0 +1,375 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/take.rs`."><title>take.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a>
+<a href="#89" id="89">89</a>
+<a href="#90" id="90">90</a>
+<a href="#91" id="91">91</a>
+<a href="#92" id="92">92</a>
+<a href="#93" id="93">93</a>
+<a href="#94" id="94">94</a>
+<a href="#95" id="95">95</a>
+<a href="#96" id="96">96</a>
+<a href="#97" id="97">97</a>
+<a href="#98" id="98">98</a>
+<a href="#99" id="99">99</a>
+<a href="#100" id="100">100</a>
+<a href="#101" id="101">101</a>
+<a href="#102" id="102">102</a>
+<a href="#103" id="103">103</a>
+<a href="#104" id="104">104</a>
+<a href="#105" id="105">105</a>
+<a href="#106" id="106">106</a>
+<a href="#107" id="107">107</a>
+<a href="#108" id="108">108</a>
+<a href="#109" id="109">109</a>
+<a href="#110" id="110">110</a>
+<a href="#111" id="111">111</a>
+<a href="#112" id="112">112</a>
+<a href="#113" id="113">113</a>
+<a href="#114" id="114">114</a>
+<a href="#115" id="115">115</a>
+<a href="#116" id="116">116</a>
+<a href="#117" id="117">117</a>
+<a href="#118" id="118">118</a>
+<a href="#119" id="119">119</a>
+<a href="#120" id="120">120</a>
+<a href="#121" id="121">121</a>
+<a href="#122" id="122">122</a>
+<a href="#123" id="123">123</a>
+<a href="#124" id="124">124</a>
+<a href="#125" id="125">125</a>
+<a href="#126" id="126">126</a>
+<a href="#127" id="127">127</a>
+<a href="#128" id="128">128</a>
+<a href="#129" id="129">129</a>
+<a href="#130" id="130">130</a>
+<a href="#131" id="131">131</a>
+<a href="#132" id="132">132</a>
+<a href="#133" id="133">133</a>
+<a href="#134" id="134">134</a>
+<a href="#135" id="135">135</a>
+<a href="#136" id="136">136</a>
+<a href="#137" id="137">137</a>
+<a href="#138" id="138">138</a>
+<a href="#139" id="139">139</a>
+<a href="#140" id="140">140</a>
+<a href="#141" id="141">141</a>
+<a href="#142" id="142">142</a>
+<a href="#143" id="143">143</a>
+<a href="#144" id="144">144</a>
+<a href="#145" id="145">145</a>
+<a href="#146" id="146">146</a>
+<a href="#147" id="147">147</a>
+<a href="#148" id="148">148</a>
+<a href="#149" id="149">149</a>
+<a href="#150" id="150">150</a>
+<a href="#151" id="151">151</a>
+<a href="#152" id="152">152</a>
+<a href="#153" id="153">153</a>
+<a href="#154" id="154">154</a>
+<a href="#155" id="155">155</a>
+<a href="#156" id="156">156</a>
+<a href="#157" id="157">157</a>
+<a href="#158" id="158">158</a>
+<a href="#159" id="159">159</a>
+<a href="#160" id="160">160</a>
+<a href="#161" id="161">161</a>
+<a href="#162" id="162">162</a>
+<a href="#163" id="163">163</a>
+<a href="#164" id="164">164</a>
+<a href="#165" id="165">165</a>
+<a href="#166" id="166">166</a>
+<a href="#167" id="167">167</a>
+<a href="#168" id="168">168</a>
+<a href="#169" id="169">169</a>
+<a href="#170" id="170">170</a>
+<a href="#171" id="171">171</a>
+<a href="#172" id="172">172</a>
+<a href="#173" id="173">173</a>
+<a href="#174" id="174">174</a>
+<a href="#175" id="175">175</a>
+<a href="#176" id="176">176</a>
+<a href="#177" id="177">177</a>
+<a href="#178" id="178">178</a>
+<a href="#179" id="179">179</a>
+<a href="#180" id="180">180</a>
+<a href="#181" id="181">181</a>
+<a href="#182" id="182">182</a>
+<a href="#183" id="183">183</a>
+<a href="#184" id="184">184</a>
+<a href="#185" id="185">185</a>
+<a href="#186" id="186">186</a>
+<a href="#187" id="187">187</a></pre></div><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::Buf;
+
+<span class="kw">use </span>core::cmp;
+
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">use </span>std::io::IoSlice;
+
+<span class="doccomment">/// A `Buf` adapter which limits the bytes read from an underlying buffer.
+///
+/// This struct is generally created by calling `take()` on `Buf`. See
+/// documentation of [`take()`](Buf::take) for more details.
+</span><span class="attr">#[derive(Debug)]
+</span><span class="kw">pub struct </span>Take&lt;T&gt; {
+    inner: T,
+    limit: usize,
+}
+
+<span class="kw">pub fn </span>new&lt;T&gt;(inner: T, limit: usize) -&gt; Take&lt;T&gt; {
+    Take { inner, limit }
+}
+
+<span class="kw">impl</span>&lt;T&gt; Take&lt;T&gt; {
+    <span class="doccomment">/// Consumes this `Take`, returning the underlying value.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::{Buf, BufMut};
+    ///
+    /// let mut buf = b"hello world".take(2);
+    /// let mut dst = vec![];
+    ///
+    /// dst.put(&amp;mut buf);
+    /// assert_eq!(*dst, b"he"[..]);
+    ///
+    /// let mut buf = buf.into_inner();
+    ///
+    /// dst.clear();
+    /// dst.put(&amp;mut buf);
+    /// assert_eq!(*dst, b"llo world"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -&gt; T {
+        <span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Gets a reference to the underlying `Buf`.
+    ///
+    /// It is inadvisable to directly read from the underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::Buf;
+    ///
+    /// let buf = b"hello world".take(2);
+    ///
+    /// assert_eq!(11, buf.get_ref().remaining());
+    /// ```
+    </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the underlying `Buf`.
+    ///
+    /// It is inadvisable to directly read from the underlying `Buf`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::{Buf, BufMut};
+    ///
+    /// let mut buf = b"hello world".take(2);
+    /// let mut dst = vec![];
+    ///
+    /// buf.get_mut().advance(2);
+    ///
+    /// dst.put(&amp;mut buf);
+    /// assert_eq!(*dst, b"ll"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>T {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.inner
+    }
+
+    <span class="doccomment">/// Returns the maximum number of bytes that can be read.
+    ///
+    /// # Note
+    ///
+    /// If the inner `Buf` has fewer bytes than indicated by this method then
+    /// that is the actual number of available bytes.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::Buf;
+    ///
+    /// let mut buf = b"hello world".take(2);
+    ///
+    /// assert_eq!(2, buf.limit());
+    /// assert_eq!(b'h', buf.get_u8());
+    /// assert_eq!(1, buf.limit());
+    /// ```
+    </span><span class="kw">pub fn </span>limit(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        <span class="self">self</span>.limit
+    }
+
+    <span class="doccomment">/// Sets the maximum number of bytes that can be read.
+    ///
+    /// # Note
+    ///
+    /// If the inner `Buf` has fewer bytes than `lim` then that is the actual
+    /// number of available bytes.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::{Buf, BufMut};
+    ///
+    /// let mut buf = b"hello world".take(2);
+    /// let mut dst = vec![];
+    ///
+    /// dst.put(&amp;mut buf);
+    /// assert_eq!(*dst, b"he"[..]);
+    ///
+    /// dst.clear();
+    ///
+    /// buf.set_limit(3);
+    /// dst.put(&amp;mut buf);
+    /// assert_eq!(*dst, b"llo"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>set_limit(<span class="kw-2">&amp;mut </span><span class="self">self</span>, lim: usize) {
+        <span class="self">self</span>.limit = lim
+    }
+}
+
+<span class="kw">impl</span>&lt;T: Buf&gt; Buf <span class="kw">for </span>Take&lt;T&gt; {
+    <span class="kw">fn </span>remaining(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        cmp::min(<span class="self">self</span>.inner.remaining(), <span class="self">self</span>.limit)
+    }
+
+    <span class="kw">fn </span>chunk(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[u8] {
+        <span class="kw">let </span>bytes = <span class="self">self</span>.inner.chunk();
+        <span class="kw-2">&amp;</span>bytes[..cmp::min(bytes.len(), <span class="self">self</span>.limit)]
+    }
+
+    <span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cnt: usize) {
+        <span class="macro">assert!</span>(cnt &lt;= <span class="self">self</span>.limit);
+        <span class="self">self</span>.inner.advance(cnt);
+        <span class="self">self</span>.limit -= cnt;
+    }
+
+    <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize) -&gt; <span class="kw">crate</span>::Bytes {
+        <span class="macro">assert!</span>(len &lt;= <span class="self">self</span>.remaining(), <span class="string">"`len` greater than remaining"</span>);
+
+        <span class="kw">let </span>r = <span class="self">self</span>.inner.copy_to_bytes(len);
+        <span class="self">self</span>.limit -= len;
+        r
+    }
+
+    <span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+    </span><span class="kw">fn </span>chunks_vectored&lt;<span class="lifetime">'a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="self">self</span>, dst: <span class="kw-2">&amp;mut </span>[IoSlice&lt;<span class="lifetime">'a</span>&gt;]) -&gt; usize {
+        <span class="kw">if </span><span class="self">self</span>.limit == <span class="number">0 </span>{
+            <span class="kw">return </span><span class="number">0</span>;
+        }
+
+        <span class="kw">const </span>LEN: usize = <span class="number">16</span>;
+        <span class="kw">let </span><span class="kw-2">mut </span>slices: [IoSlice&lt;<span class="lifetime">'a</span>&gt;; LEN] = [IoSlice::new(<span class="kw-2">&amp;</span>[]); LEN];
+
+        <span class="kw">let </span>cnt = <span class="self">self
+            </span>.inner
+            .chunks_vectored(<span class="kw-2">&amp;mut </span>slices[..dst.len().min(LEN)]);
+        <span class="kw">let </span><span class="kw-2">mut </span>limit = <span class="self">self</span>.limit;
+        <span class="kw">for </span>(i, (dst, slice)) <span class="kw">in </span>dst[..cnt].iter_mut().zip(slices.iter()).enumerate() {
+            <span class="kw">if let </span><span class="prelude-val">Some</span>(buf) = slice.get(..limit) {
+                <span class="comment">// SAFETY: We could do this safely with `IoSlice::advance` if we had a larger MSRV.
+                </span><span class="kw">let </span>buf = <span class="kw">unsafe </span>{ std::mem::transmute::&lt;<span class="kw-2">&amp;</span>[u8], <span class="kw-2">&amp;</span><span class="lifetime">'a </span>[u8]&gt;(buf) };
+                <span class="kw-2">*</span>dst = IoSlice::new(buf);
+                <span class="kw">return </span>i + <span class="number">1</span>;
+            } <span class="kw">else </span>{
+                <span class="comment">// SAFETY: We could do this safely with `IoSlice::advance` if we had a larger MSRV.
+                </span><span class="kw">let </span>buf = <span class="kw">unsafe </span>{ std::mem::transmute::&lt;<span class="kw-2">&amp;</span>[u8], <span class="kw-2">&amp;</span><span class="lifetime">'a </span>[u8]&gt;(slice) };
+                <span class="kw-2">*</span>dst = IoSlice::new(buf);
+                limit -= slice.len();
+            }
+        }
+        cnt
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/buf/uninit_slice.rs.html

@@ -0,0 +1,515 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/uninit_slice.rs`."><title>uninit_slice.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a>
+<a href="#89" id="89">89</a>
+<a href="#90" id="90">90</a>
+<a href="#91" id="91">91</a>
+<a href="#92" id="92">92</a>
+<a href="#93" id="93">93</a>
+<a href="#94" id="94">94</a>
+<a href="#95" id="95">95</a>
+<a href="#96" id="96">96</a>
+<a href="#97" id="97">97</a>
+<a href="#98" id="98">98</a>
+<a href="#99" id="99">99</a>
+<a href="#100" id="100">100</a>
+<a href="#101" id="101">101</a>
+<a href="#102" id="102">102</a>
+<a href="#103" id="103">103</a>
+<a href="#104" id="104">104</a>
+<a href="#105" id="105">105</a>
+<a href="#106" id="106">106</a>
+<a href="#107" id="107">107</a>
+<a href="#108" id="108">108</a>
+<a href="#109" id="109">109</a>
+<a href="#110" id="110">110</a>
+<a href="#111" id="111">111</a>
+<a href="#112" id="112">112</a>
+<a href="#113" id="113">113</a>
+<a href="#114" id="114">114</a>
+<a href="#115" id="115">115</a>
+<a href="#116" id="116">116</a>
+<a href="#117" id="117">117</a>
+<a href="#118" id="118">118</a>
+<a href="#119" id="119">119</a>
+<a href="#120" id="120">120</a>
+<a href="#121" id="121">121</a>
+<a href="#122" id="122">122</a>
+<a href="#123" id="123">123</a>
+<a href="#124" id="124">124</a>
+<a href="#125" id="125">125</a>
+<a href="#126" id="126">126</a>
+<a href="#127" id="127">127</a>
+<a href="#128" id="128">128</a>
+<a href="#129" id="129">129</a>
+<a href="#130" id="130">130</a>
+<a href="#131" id="131">131</a>
+<a href="#132" id="132">132</a>
+<a href="#133" id="133">133</a>
+<a href="#134" id="134">134</a>
+<a href="#135" id="135">135</a>
+<a href="#136" id="136">136</a>
+<a href="#137" id="137">137</a>
+<a href="#138" id="138">138</a>
+<a href="#139" id="139">139</a>
+<a href="#140" id="140">140</a>
+<a href="#141" id="141">141</a>
+<a href="#142" id="142">142</a>
+<a href="#143" id="143">143</a>
+<a href="#144" id="144">144</a>
+<a href="#145" id="145">145</a>
+<a href="#146" id="146">146</a>
+<a href="#147" id="147">147</a>
+<a href="#148" id="148">148</a>
+<a href="#149" id="149">149</a>
+<a href="#150" id="150">150</a>
+<a href="#151" id="151">151</a>
+<a href="#152" id="152">152</a>
+<a href="#153" id="153">153</a>
+<a href="#154" id="154">154</a>
+<a href="#155" id="155">155</a>
+<a href="#156" id="156">156</a>
+<a href="#157" id="157">157</a>
+<a href="#158" id="158">158</a>
+<a href="#159" id="159">159</a>
+<a href="#160" id="160">160</a>
+<a href="#161" id="161">161</a>
+<a href="#162" id="162">162</a>
+<a href="#163" id="163">163</a>
+<a href="#164" id="164">164</a>
+<a href="#165" id="165">165</a>
+<a href="#166" id="166">166</a>
+<a href="#167" id="167">167</a>
+<a href="#168" id="168">168</a>
+<a href="#169" id="169">169</a>
+<a href="#170" id="170">170</a>
+<a href="#171" id="171">171</a>
+<a href="#172" id="172">172</a>
+<a href="#173" id="173">173</a>
+<a href="#174" id="174">174</a>
+<a href="#175" id="175">175</a>
+<a href="#176" id="176">176</a>
+<a href="#177" id="177">177</a>
+<a href="#178" id="178">178</a>
+<a href="#179" id="179">179</a>
+<a href="#180" id="180">180</a>
+<a href="#181" id="181">181</a>
+<a href="#182" id="182">182</a>
+<a href="#183" id="183">183</a>
+<a href="#184" id="184">184</a>
+<a href="#185" id="185">185</a>
+<a href="#186" id="186">186</a>
+<a href="#187" id="187">187</a>
+<a href="#188" id="188">188</a>
+<a href="#189" id="189">189</a>
+<a href="#190" id="190">190</a>
+<a href="#191" id="191">191</a>
+<a href="#192" id="192">192</a>
+<a href="#193" id="193">193</a>
+<a href="#194" id="194">194</a>
+<a href="#195" id="195">195</a>
+<a href="#196" id="196">196</a>
+<a href="#197" id="197">197</a>
+<a href="#198" id="198">198</a>
+<a href="#199" id="199">199</a>
+<a href="#200" id="200">200</a>
+<a href="#201" id="201">201</a>
+<a href="#202" id="202">202</a>
+<a href="#203" id="203">203</a>
+<a href="#204" id="204">204</a>
+<a href="#205" id="205">205</a>
+<a href="#206" id="206">206</a>
+<a href="#207" id="207">207</a>
+<a href="#208" id="208">208</a>
+<a href="#209" id="209">209</a>
+<a href="#210" id="210">210</a>
+<a href="#211" id="211">211</a>
+<a href="#212" id="212">212</a>
+<a href="#213" id="213">213</a>
+<a href="#214" id="214">214</a>
+<a href="#215" id="215">215</a>
+<a href="#216" id="216">216</a>
+<a href="#217" id="217">217</a>
+<a href="#218" id="218">218</a>
+<a href="#219" id="219">219</a>
+<a href="#220" id="220">220</a>
+<a href="#221" id="221">221</a>
+<a href="#222" id="222">222</a>
+<a href="#223" id="223">223</a>
+<a href="#224" id="224">224</a>
+<a href="#225" id="225">225</a>
+<a href="#226" id="226">226</a>
+<a href="#227" id="227">227</a>
+<a href="#228" id="228">228</a>
+<a href="#229" id="229">229</a>
+<a href="#230" id="230">230</a>
+<a href="#231" id="231">231</a>
+<a href="#232" id="232">232</a>
+<a href="#233" id="233">233</a>
+<a href="#234" id="234">234</a>
+<a href="#235" id="235">235</a>
+<a href="#236" id="236">236</a>
+<a href="#237" id="237">237</a>
+<a href="#238" id="238">238</a>
+<a href="#239" id="239">239</a>
+<a href="#240" id="240">240</a>
+<a href="#241" id="241">241</a>
+<a href="#242" id="242">242</a>
+<a href="#243" id="243">243</a>
+<a href="#244" id="244">244</a>
+<a href="#245" id="245">245</a>
+<a href="#246" id="246">246</a>
+<a href="#247" id="247">247</a>
+<a href="#248" id="248">248</a>
+<a href="#249" id="249">249</a>
+<a href="#250" id="250">250</a>
+<a href="#251" id="251">251</a>
+<a href="#252" id="252">252</a>
+<a href="#253" id="253">253</a>
+<a href="#254" id="254">254</a>
+<a href="#255" id="255">255</a>
+<a href="#256" id="256">256</a>
+<a href="#257" id="257">257</a></pre></div><pre class="rust"><code><span class="kw">use </span>core::fmt;
+<span class="kw">use </span>core::mem::MaybeUninit;
+<span class="kw">use </span>core::ops::{
+    Index, IndexMut, Range, RangeFrom, RangeFull, RangeInclusive, RangeTo, RangeToInclusive,
+};
+
+<span class="doccomment">/// Uninitialized byte slice.
+///
+/// Returned by `BufMut::chunk_mut()`, the referenced byte slice may be
+/// uninitialized. The wrapper provides safe access without introducing
+/// undefined behavior.
+///
+/// The safety invariants of this wrapper are:
+///
+///  1. Reading from an `UninitSlice` is undefined behavior.
+///  2. Writing uninitialized bytes to an `UninitSlice` is undefined behavior.
+///
+/// The difference between `&amp;mut UninitSlice` and `&amp;mut [MaybeUninit&lt;u8&gt;]` is
+/// that it is possible in safe code to write uninitialized bytes to an
+/// `&amp;mut [MaybeUninit&lt;u8&gt;]`, which this type prohibits.
+</span><span class="attr">#[repr(transparent)]
+</span><span class="kw">pub struct </span>UninitSlice([MaybeUninit&lt;u8&gt;]);
+
+<span class="kw">impl </span>UninitSlice {
+    <span class="doccomment">/// Creates a `&amp;mut UninitSlice` wrapping a slice of initialised memory.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::buf::UninitSlice;
+    ///
+    /// let mut buffer = [0u8; 64];
+    /// let slice = UninitSlice::new(&amp;mut buffer[..]);
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub fn </span>new(slice: <span class="kw-2">&amp;mut </span>[u8]) -&gt; <span class="kw-2">&amp;mut </span>UninitSlice {
+        <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut *</span>(slice <span class="kw">as </span><span class="kw-2">*mut </span>[u8] <span class="kw">as </span><span class="kw-2">*mut </span>[MaybeUninit&lt;u8&gt;] <span class="kw">as </span><span class="kw-2">*mut </span>UninitSlice) }
+    }
+
+    <span class="doccomment">/// Creates a `&amp;mut UninitSlice` wrapping a slice of uninitialised memory.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::buf::UninitSlice;
+    /// use core::mem::MaybeUninit;
+    ///
+    /// let mut buffer = [MaybeUninit::uninit(); 64];
+    /// let slice = UninitSlice::uninit(&amp;mut buffer[..]);
+    ///
+    /// let mut vec = Vec::with_capacity(1024);
+    /// let spare: &amp;mut UninitSlice = vec.spare_capacity_mut().into();
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub fn </span>uninit(slice: <span class="kw-2">&amp;mut </span>[MaybeUninit&lt;u8&gt;]) -&gt; <span class="kw-2">&amp;mut </span>UninitSlice {
+        <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut *</span>(slice <span class="kw">as </span><span class="kw-2">*mut </span>[MaybeUninit&lt;u8&gt;] <span class="kw">as </span><span class="kw-2">*mut </span>UninitSlice) }
+    }
+
+    <span class="kw">fn </span>uninit_ref(slice: <span class="kw-2">&amp;</span>[MaybeUninit&lt;u8&gt;]) -&gt; <span class="kw-2">&amp;</span>UninitSlice {
+        <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>(slice <span class="kw">as </span><span class="kw-2">*const </span>[MaybeUninit&lt;u8&gt;] <span class="kw">as </span><span class="kw-2">*const </span>UninitSlice) }
+    }
+
+    <span class="doccomment">/// Create a `&amp;mut UninitSlice` from a pointer and a length.
+    ///
+    /// # Safety
+    ///
+    /// The caller must ensure that `ptr` references a valid memory region owned
+    /// by the caller representing a byte slice for the duration of `'a`.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::buf::UninitSlice;
+    ///
+    /// let bytes = b"hello world".to_vec();
+    /// let ptr = bytes.as_ptr() as *mut _;
+    /// let len = bytes.len();
+    ///
+    /// let slice = unsafe { UninitSlice::from_raw_parts_mut(ptr, len) };
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub unsafe fn </span>from_raw_parts_mut&lt;<span class="lifetime">'a</span>&gt;(ptr: <span class="kw-2">*mut </span>u8, len: usize) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>UninitSlice {
+        <span class="kw">let </span>maybe_init: <span class="kw-2">&amp;mut </span>[MaybeUninit&lt;u8&gt;] =
+            core::slice::from_raw_parts_mut(ptr <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>, len);
+        <span class="self">Self</span>::uninit(maybe_init)
+    }
+
+    <span class="doccomment">/// Write a single byte at the specified offset.
+    ///
+    /// # Panics
+    ///
+    /// The function panics if `index` is out of bounds.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::buf::UninitSlice;
+    ///
+    /// let mut data = [b'f', b'o', b'o'];
+    /// let slice = unsafe { UninitSlice::from_raw_parts_mut(data.as_mut_ptr(), 3) };
+    ///
+    /// slice.write_byte(0, b'b');
+    ///
+    /// assert_eq!(b"boo", &amp;data[..]);
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub fn </span>write_byte(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize, byte: u8) {
+        <span class="macro">assert!</span>(index &lt; <span class="self">self</span>.len());
+
+        <span class="kw">unsafe </span>{ <span class="self">self</span>[index..].as_mut_ptr().write(byte) }
+    }
+
+    <span class="doccomment">/// Copies bytes from `src` into `self`.
+    ///
+    /// The length of `src` must be the same as `self`.
+    ///
+    /// # Panics
+    ///
+    /// The function panics if `src` has a different length than `self`.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::buf::UninitSlice;
+    ///
+    /// let mut data = [b'f', b'o', b'o'];
+    /// let slice = unsafe { UninitSlice::from_raw_parts_mut(data.as_mut_ptr(), 3) };
+    ///
+    /// slice.copy_from_slice(b"bar");
+    ///
+    /// assert_eq!(b"bar", &amp;data[..]);
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub fn </span>copy_from_slice(<span class="kw-2">&amp;mut </span><span class="self">self</span>, src: <span class="kw-2">&amp;</span>[u8]) {
+        <span class="kw">use </span>core::ptr;
+
+        <span class="macro">assert_eq!</span>(<span class="self">self</span>.len(), src.len());
+
+        <span class="kw">unsafe </span>{
+            ptr::copy_nonoverlapping(src.as_ptr(), <span class="self">self</span>.as_mut_ptr(), <span class="self">self</span>.len());
+        }
+    }
+
+    <span class="doccomment">/// Return a raw pointer to the slice's buffer.
+    ///
+    /// # Safety
+    ///
+    /// The caller **must not** read from the referenced memory and **must not**
+    /// write **uninitialized** bytes to the slice either.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::BufMut;
+    ///
+    /// let mut data = [0, 1, 2];
+    /// let mut slice = &amp;mut data[..];
+    /// let ptr = BufMut::chunk_mut(&amp;mut slice).as_mut_ptr();
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub fn </span>as_mut_ptr(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">*mut </span>u8 {
+        <span class="self">self</span>.<span class="number">0</span>.as_mut_ptr() <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_
+    </span>}
+
+    <span class="doccomment">/// Return a `&amp;mut [MaybeUninit&lt;u8&gt;]` to this slice's buffer.
+    ///
+    /// # Safety
+    ///
+    /// The caller **must not** read from the referenced memory and **must not** write
+    /// **uninitialized** bytes to the slice either. This is because `BufMut` implementation
+    /// that created the `UninitSlice` knows which parts are initialized. Writing uninitialized
+    /// bytes to the slice may cause the `BufMut` to read those bytes and trigger undefined
+    /// behavior.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::BufMut;
+    ///
+    /// let mut data = [0, 1, 2];
+    /// let mut slice = &amp;mut data[..];
+    /// unsafe {
+    ///     let uninit_slice = BufMut::chunk_mut(&amp;mut slice).as_uninit_slice_mut();
+    /// };
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub unsafe fn </span>as_uninit_slice_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>[MaybeUninit&lt;u8&gt;] {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.<span class="number">0
+    </span>}
+
+    <span class="doccomment">/// Returns the number of bytes in the slice.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use bytes::BufMut;
+    ///
+    /// let mut data = [0, 1, 2];
+    /// let mut slice = &amp;mut data[..];
+    /// let len = BufMut::chunk_mut(&amp;mut slice).len();
+    ///
+    /// assert_eq!(len, 3);
+    /// ```
+    </span><span class="attr">#[inline]
+    </span><span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        <span class="self">self</span>.<span class="number">0</span>.len()
+    }
+}
+
+<span class="kw">impl </span>fmt::Debug <span class="kw">for </span>UninitSlice {
+    <span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, fmt: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; fmt::Result {
+        fmt.debug_struct(<span class="string">"UninitSlice[...]"</span>).finish()
+    }
+}
+
+<span class="kw">impl</span>&lt;<span class="lifetime">'a</span>&gt; From&lt;<span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[u8]&gt; <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>UninitSlice {
+    <span class="kw">fn </span>from(slice: <span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[u8]) -&gt; <span class="self">Self </span>{
+        UninitSlice::new(slice)
+    }
+}
+
+<span class="kw">impl</span>&lt;<span class="lifetime">'a</span>&gt; From&lt;<span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[MaybeUninit&lt;u8&gt;]&gt; <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>UninitSlice {
+    <span class="kw">fn </span>from(slice: <span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[MaybeUninit&lt;u8&gt;]) -&gt; <span class="self">Self </span>{
+        UninitSlice::uninit(slice)
+    }
+}
+
+<span class="macro">macro_rules!</span> impl_index {
+    ($(<span class="macro-nonterminal">$t</span>:ty),<span class="kw-2">*</span>) =&gt; {
+        $(
+            <span class="kw">impl </span>Index&lt;<span class="macro-nonterminal">$t</span>&gt; <span class="kw">for </span>UninitSlice {
+                <span class="kw">type </span>Output = UninitSlice;
+
+                <span class="attr">#[inline]
+                </span><span class="kw">fn </span>index(<span class="kw-2">&amp;</span><span class="self">self</span>, index: <span class="macro-nonterminal">$t</span>) -&gt; <span class="kw-2">&amp;</span>UninitSlice {
+                    UninitSlice::uninit_ref(<span class="kw-2">&amp;</span><span class="self">self</span>.<span class="number">0</span>[index])
+                }
+            }
+
+            <span class="kw">impl </span>IndexMut&lt;<span class="macro-nonterminal">$t</span>&gt; <span class="kw">for </span>UninitSlice {
+                <span class="attr">#[inline]
+                </span><span class="kw">fn </span>index_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: <span class="macro-nonterminal">$t</span>) -&gt; <span class="kw-2">&amp;mut </span>UninitSlice {
+                    UninitSlice::uninit(<span class="kw-2">&amp;mut </span><span class="self">self</span>.<span class="number">0</span>[index])
+                }
+            }
+        )*
+    };
+}
+
+<span class="macro">impl_index!</span>(
+    Range&lt;usize&gt;,
+    RangeFrom&lt;usize&gt;,
+    RangeFull,
+    RangeInclusive&lt;usize&gt;,
+    RangeTo&lt;usize&gt;,
+    RangeToInclusive&lt;usize&gt;
+);
+</code></pre></div></section></main></body></html>

src/bytes/buf/vec_deque.rs.html

@@ -0,0 +1,81 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/vec_deque.rs`."><title>vec_deque.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a></pre></div><pre class="rust"><code><span class="kw">use </span>alloc::collections::VecDeque;
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">use </span>std::io;
+
+<span class="kw">use </span><span class="kw">super</span>::Buf;
+
+<span class="kw">impl </span>Buf <span class="kw">for </span>VecDeque&lt;u8&gt; {
+    <span class="kw">fn </span>remaining(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
+        <span class="self">self</span>.len()
+    }
+
+    <span class="kw">fn </span>chunk(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[u8] {
+        <span class="kw">let </span>(s1, s2) = <span class="self">self</span>.as_slices();
+        <span class="kw">if </span>s1.is_empty() {
+            s2
+        } <span class="kw">else </span>{
+            s1
+        }
+    }
+
+    <span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+    </span><span class="kw">fn </span>chunks_vectored&lt;<span class="lifetime">'a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">'a </span><span class="self">self</span>, dst: <span class="kw-2">&amp;mut </span>[io::IoSlice&lt;<span class="lifetime">'a</span>&gt;]) -&gt; usize {
+        <span class="kw">if </span><span class="self">self</span>.is_empty() || dst.is_empty() {
+            <span class="kw">return </span><span class="number">0</span>;
+        }
+
+        <span class="kw">let </span>(s1, s2) = <span class="self">self</span>.as_slices();
+        dst[<span class="number">0</span>] = io::IoSlice::new(s1);
+        <span class="kw">if </span>s2.is_empty() || dst.len() == <span class="number">1 </span>{
+            <span class="kw">return </span><span class="number">1</span>;
+        }
+
+        dst[<span class="number">1</span>] = io::IoSlice::new(s2);
+        <span class="number">2
+    </span>}
+
+    <span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cnt: usize) {
+        <span class="self">self</span>.drain(..cnt);
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/buf/writer.rs.html

@@ -0,0 +1,177 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/buf/writer.rs`."><title>writer.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a></pre></div><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::BufMut;
+
+<span class="kw">use </span>std::{cmp, io};
+
+<span class="doccomment">/// A `BufMut` adapter which implements `io::Write` for the inner value.
+///
+/// This struct is generally created by calling `writer()` on `BufMut`. See
+/// documentation of [`writer()`](BufMut::writer) for more
+/// details.
+</span><span class="attr">#[derive(Debug)]
+</span><span class="kw">pub struct </span>Writer&lt;B&gt; {
+    buf: B,
+}
+
+<span class="kw">pub fn </span>new&lt;B&gt;(buf: B) -&gt; Writer&lt;B&gt; {
+    Writer { buf }
+}
+
+<span class="kw">impl</span>&lt;B: BufMut&gt; Writer&lt;B&gt; {
+    <span class="doccomment">/// Gets a reference to the underlying `BufMut`.
+    ///
+    /// It is inadvisable to directly write to the underlying `BufMut`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::BufMut;
+    ///
+    /// let buf = Vec::with_capacity(1024).writer();
+    ///
+    /// assert_eq!(1024, buf.get_ref().capacity());
+    /// ```
+    </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>B {
+        <span class="kw-2">&amp;</span><span class="self">self</span>.buf
+    }
+
+    <span class="doccomment">/// Gets a mutable reference to the underlying `BufMut`.
+    ///
+    /// It is inadvisable to directly write to the underlying `BufMut`.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::BufMut;
+    ///
+    /// let mut buf = vec![].writer();
+    ///
+    /// buf.get_mut().reserve(1024);
+    ///
+    /// assert_eq!(1024, buf.get_ref().capacity());
+    /// ```
+    </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>B {
+        <span class="kw-2">&amp;mut </span><span class="self">self</span>.buf
+    }
+
+    <span class="doccomment">/// Consumes this `Writer`, returning the underlying value.
+    ///
+    /// # Examples
+    ///
+    /// ```rust
+    /// use bytes::BufMut;
+    /// use std::io;
+    ///
+    /// let mut buf = vec![].writer();
+    /// let mut src = &amp;b"hello world"[..];
+    ///
+    /// io::copy(&amp;mut src, &amp;mut buf).unwrap();
+    ///
+    /// let buf = buf.into_inner();
+    /// assert_eq!(*buf, b"hello world"[..]);
+    /// ```
+    </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -&gt; B {
+        <span class="self">self</span>.buf
+    }
+}
+
+<span class="kw">impl</span>&lt;B: BufMut + Sized&gt; io::Write <span class="kw">for </span>Writer&lt;B&gt; {
+    <span class="kw">fn </span>write(<span class="kw-2">&amp;mut </span><span class="self">self</span>, src: <span class="kw-2">&amp;</span>[u8]) -&gt; io::Result&lt;usize&gt; {
+        <span class="kw">let </span>n = cmp::min(<span class="self">self</span>.buf.remaining_mut(), src.len());
+
+        <span class="self">self</span>.buf.put_slice(<span class="kw-2">&amp;</span>src[..n]);
+        <span class="prelude-val">Ok</span>(n)
+    }
+
+    <span class="kw">fn </span>flush(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; io::Result&lt;()&gt; {
+        <span class="prelude-val">Ok</span>(())
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/fmt/debug.rs.html

@@ -0,0 +1,81 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/fmt/debug.rs`."><title>debug.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a></pre></div><pre class="rust"><code><span class="kw">use </span>core::fmt::{Debug, Formatter, <span class="prelude-ty">Result</span>};
+
+<span class="kw">use </span><span class="kw">super</span>::BytesRef;
+<span class="kw">use crate</span>::{Bytes, BytesMut};
+
+<span class="doccomment">/// Alternative implementation of `std::fmt::Debug` for byte slice.
+///
+/// Standard `Debug` implementation for `[u8]` is comma separated
+/// list of numbers. Since large amount of byte strings are in fact
+/// ASCII strings or contain a lot of ASCII strings (e. g. HTTP),
+/// it is convenient to print strings as ASCII when possible.
+</span><span class="kw">impl </span>Debug <span class="kw">for </span>BytesRef&lt;<span class="lifetime">'_</span>&gt; {
+    <span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; <span class="prelude-ty">Result </span>{
+        <span class="macro">write!</span>(f, <span class="string">"b\""</span>)<span class="question-mark">?</span>;
+        <span class="kw">for </span><span class="kw-2">&amp;</span>b <span class="kw">in </span><span class="self">self</span>.<span class="number">0 </span>{
+            <span class="comment">// https://doc.rust-lang.org/reference/tokens.html#byte-escapes
+            </span><span class="kw">if </span>b == <span class="string">b'\n' </span>{
+                <span class="macro">write!</span>(f, <span class="string">"\\n"</span>)<span class="question-mark">?</span>;
+            } <span class="kw">else if </span>b == <span class="string">b'\r' </span>{
+                <span class="macro">write!</span>(f, <span class="string">"\\r"</span>)<span class="question-mark">?</span>;
+            } <span class="kw">else if </span>b == <span class="string">b'\t' </span>{
+                <span class="macro">write!</span>(f, <span class="string">"\\t"</span>)<span class="question-mark">?</span>;
+            } <span class="kw">else if </span>b == <span class="string">b'\\' </span>|| b == <span class="string">b'"' </span>{
+                <span class="macro">write!</span>(f, <span class="string">"\\{}"</span>, b <span class="kw">as </span>char)<span class="question-mark">?</span>;
+            } <span class="kw">else if </span>b == <span class="string">b'\0' </span>{
+                <span class="macro">write!</span>(f, <span class="string">"\\0"</span>)<span class="question-mark">?</span>;
+            <span class="comment">// ASCII printable
+            </span>} <span class="kw">else if </span>(<span class="number">0x20</span>..<span class="number">0x7f</span>).contains(<span class="kw-2">&amp;</span>b) {
+                <span class="macro">write!</span>(f, <span class="string">"{}"</span>, b <span class="kw">as </span>char)<span class="question-mark">?</span>;
+            } <span class="kw">else </span>{
+                <span class="macro">write!</span>(f, <span class="string">"\\x{:02x}"</span>, b)<span class="question-mark">?</span>;
+            }
+        }
+        <span class="macro">write!</span>(f, <span class="string">"\""</span>)<span class="question-mark">?</span>;
+        <span class="prelude-val">Ok</span>(())
+    }
+}
+
+<span class="macro">fmt_impl!</span>(Debug, Bytes);
+<span class="macro">fmt_impl!</span>(Debug, BytesMut);
+</code></pre></div></section></main></body></html>

src/bytes/fmt/hex.rs.html

@@ -0,0 +1,55 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/fmt/hex.rs`."><title>hex.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a></pre></div><pre class="rust"><code><span class="kw">use </span>core::fmt::{Formatter, LowerHex, <span class="prelude-ty">Result</span>, UpperHex};
+
+<span class="kw">use </span><span class="kw">super</span>::BytesRef;
+<span class="kw">use crate</span>::{Bytes, BytesMut};
+
+<span class="kw">impl </span>LowerHex <span class="kw">for </span>BytesRef&lt;<span class="lifetime">'_</span>&gt; {
+    <span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; <span class="prelude-ty">Result </span>{
+        <span class="kw">for </span><span class="kw-2">&amp;</span>b <span class="kw">in </span><span class="self">self</span>.<span class="number">0 </span>{
+            <span class="macro">write!</span>(f, <span class="string">"{:02x}"</span>, b)<span class="question-mark">?</span>;
+        }
+        <span class="prelude-val">Ok</span>(())
+    }
+}
+
+<span class="kw">impl </span>UpperHex <span class="kw">for </span>BytesRef&lt;<span class="lifetime">'_</span>&gt; {
+    <span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; <span class="prelude-ty">Result </span>{
+        <span class="kw">for </span><span class="kw-2">&amp;</span>b <span class="kw">in </span><span class="self">self</span>.<span class="number">0 </span>{
+            <span class="macro">write!</span>(f, <span class="string">"{:02X}"</span>, b)<span class="question-mark">?</span>;
+        }
+        <span class="prelude-val">Ok</span>(())
+    }
+}
+
+<span class="macro">fmt_impl!</span>(LowerHex, Bytes);
+<span class="macro">fmt_impl!</span>(LowerHex, BytesMut);
+<span class="macro">fmt_impl!</span>(UpperHex, Bytes);
+<span class="macro">fmt_impl!</span>(UpperHex, BytesMut);
+</code></pre></div></section></main></body></html>

src/bytes/fmt/mod.rs.html

@@ -0,0 +1,31 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/fmt/mod.rs`."><title>mod.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a></pre></div><pre class="rust"><code><span class="macro">macro_rules!</span> fmt_impl {
+    (<span class="macro-nonterminal">$tr</span>:ident, <span class="macro-nonterminal">$ty</span>:ty) =&gt; {
+        <span class="kw">impl </span><span class="macro-nonterminal">$tr </span><span class="kw">for </span><span class="macro-nonterminal">$ty </span>{
+            <span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; <span class="prelude-ty">Result </span>{
+                <span class="macro-nonterminal">$tr::fmt</span>(<span class="kw-2">&amp;</span>BytesRef(<span class="self">self</span>.as_ref()), f)
+            }
+        }
+    };
+}
+
+<span class="kw">mod </span>debug;
+<span class="kw">mod </span>hex;
+
+<span class="doccomment">/// `BytesRef` is not a part of public API of bytes crate.
+</span><span class="kw">struct </span>BytesRef&lt;<span class="lifetime">'a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">'a </span>[u8]);
+</code></pre></div></section></main></body></html>

src/bytes/lib.rs.html

@@ -0,0 +1,439 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/lib.rs`."><title>lib.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../src-files.js"></script><script defer src="../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a>
+<a href="#89" id="89">89</a>
+<a href="#90" id="90">90</a>
+<a href="#91" id="91">91</a>
+<a href="#92" id="92">92</a>
+<a href="#93" id="93">93</a>
+<a href="#94" id="94">94</a>
+<a href="#95" id="95">95</a>
+<a href="#96" id="96">96</a>
+<a href="#97" id="97">97</a>
+<a href="#98" id="98">98</a>
+<a href="#99" id="99">99</a>
+<a href="#100" id="100">100</a>
+<a href="#101" id="101">101</a>
+<a href="#102" id="102">102</a>
+<a href="#103" id="103">103</a>
+<a href="#104" id="104">104</a>
+<a href="#105" id="105">105</a>
+<a href="#106" id="106">106</a>
+<a href="#107" id="107">107</a>
+<a href="#108" id="108">108</a>
+<a href="#109" id="109">109</a>
+<a href="#110" id="110">110</a>
+<a href="#111" id="111">111</a>
+<a href="#112" id="112">112</a>
+<a href="#113" id="113">113</a>
+<a href="#114" id="114">114</a>
+<a href="#115" id="115">115</a>
+<a href="#116" id="116">116</a>
+<a href="#117" id="117">117</a>
+<a href="#118" id="118">118</a>
+<a href="#119" id="119">119</a>
+<a href="#120" id="120">120</a>
+<a href="#121" id="121">121</a>
+<a href="#122" id="122">122</a>
+<a href="#123" id="123">123</a>
+<a href="#124" id="124">124</a>
+<a href="#125" id="125">125</a>
+<a href="#126" id="126">126</a>
+<a href="#127" id="127">127</a>
+<a href="#128" id="128">128</a>
+<a href="#129" id="129">129</a>
+<a href="#130" id="130">130</a>
+<a href="#131" id="131">131</a>
+<a href="#132" id="132">132</a>
+<a href="#133" id="133">133</a>
+<a href="#134" id="134">134</a>
+<a href="#135" id="135">135</a>
+<a href="#136" id="136">136</a>
+<a href="#137" id="137">137</a>
+<a href="#138" id="138">138</a>
+<a href="#139" id="139">139</a>
+<a href="#140" id="140">140</a>
+<a href="#141" id="141">141</a>
+<a href="#142" id="142">142</a>
+<a href="#143" id="143">143</a>
+<a href="#144" id="144">144</a>
+<a href="#145" id="145">145</a>
+<a href="#146" id="146">146</a>
+<a href="#147" id="147">147</a>
+<a href="#148" id="148">148</a>
+<a href="#149" id="149">149</a>
+<a href="#150" id="150">150</a>
+<a href="#151" id="151">151</a>
+<a href="#152" id="152">152</a>
+<a href="#153" id="153">153</a>
+<a href="#154" id="154">154</a>
+<a href="#155" id="155">155</a>
+<a href="#156" id="156">156</a>
+<a href="#157" id="157">157</a>
+<a href="#158" id="158">158</a>
+<a href="#159" id="159">159</a>
+<a href="#160" id="160">160</a>
+<a href="#161" id="161">161</a>
+<a href="#162" id="162">162</a>
+<a href="#163" id="163">163</a>
+<a href="#164" id="164">164</a>
+<a href="#165" id="165">165</a>
+<a href="#166" id="166">166</a>
+<a href="#167" id="167">167</a>
+<a href="#168" id="168">168</a>
+<a href="#169" id="169">169</a>
+<a href="#170" id="170">170</a>
+<a href="#171" id="171">171</a>
+<a href="#172" id="172">172</a>
+<a href="#173" id="173">173</a>
+<a href="#174" id="174">174</a>
+<a href="#175" id="175">175</a>
+<a href="#176" id="176">176</a>
+<a href="#177" id="177">177</a>
+<a href="#178" id="178">178</a>
+<a href="#179" id="179">179</a>
+<a href="#180" id="180">180</a>
+<a href="#181" id="181">181</a>
+<a href="#182" id="182">182</a>
+<a href="#183" id="183">183</a>
+<a href="#184" id="184">184</a>
+<a href="#185" id="185">185</a>
+<a href="#186" id="186">186</a>
+<a href="#187" id="187">187</a>
+<a href="#188" id="188">188</a>
+<a href="#189" id="189">189</a>
+<a href="#190" id="190">190</a>
+<a href="#191" id="191">191</a>
+<a href="#192" id="192">192</a>
+<a href="#193" id="193">193</a>
+<a href="#194" id="194">194</a>
+<a href="#195" id="195">195</a>
+<a href="#196" id="196">196</a>
+<a href="#197" id="197">197</a>
+<a href="#198" id="198">198</a>
+<a href="#199" id="199">199</a>
+<a href="#200" id="200">200</a>
+<a href="#201" id="201">201</a>
+<a href="#202" id="202">202</a>
+<a href="#203" id="203">203</a>
+<a href="#204" id="204">204</a>
+<a href="#205" id="205">205</a>
+<a href="#206" id="206">206</a>
+<a href="#207" id="207">207</a>
+<a href="#208" id="208">208</a>
+<a href="#209" id="209">209</a>
+<a href="#210" id="210">210</a>
+<a href="#211" id="211">211</a>
+<a href="#212" id="212">212</a>
+<a href="#213" id="213">213</a>
+<a href="#214" id="214">214</a>
+<a href="#215" id="215">215</a>
+<a href="#216" id="216">216</a>
+<a href="#217" id="217">217</a>
+<a href="#218" id="218">218</a>
+<a href="#219" id="219">219</a></pre></div><pre class="rust"><code><span class="attr">#![warn(missing_docs, missing_debug_implementations, rust_2018_idioms)]
+#![doc(test(
+    no_crate_inject,
+    attr(deny(warnings, rust_2018_idioms), allow(dead_code, unused_variables))
+))]
+#![no_std]
+#![cfg_attr(docsrs, feature(doc_cfg))]
+
+</span><span class="doccomment">//! Provides abstractions for working with bytes.
+//!
+//! The `bytes` crate provides an efficient byte buffer structure
+//! ([`Bytes`]) and traits for working with buffer
+//! implementations ([`Buf`], [`BufMut`]).
+//!
+//! # `Bytes`
+//!
+//! `Bytes` is an efficient container for storing and operating on contiguous
+//! slices of memory. It is intended for use primarily in networking code, but
+//! could have applications elsewhere as well.
+//!
+//! `Bytes` values facilitate zero-copy network programming by allowing multiple
+//! `Bytes` objects to point to the same underlying memory. This is managed by
+//! using a reference count to track when the memory is no longer needed and can
+//! be freed.
+//!
+//! A `Bytes` handle can be created directly from an existing byte store (such as `&amp;[u8]`
+//! or `Vec&lt;u8&gt;`), but usually a `BytesMut` is used first and written to. For
+//! example:
+//!
+//! ```rust
+//! use bytes::{BytesMut, BufMut};
+//!
+//! let mut buf = BytesMut::with_capacity(1024);
+//! buf.put(&amp;b"hello world"[..]);
+//! buf.put_u16(1234);
+//!
+//! let a = buf.split();
+//! assert_eq!(a, b"hello world\x04\xD2"[..]);
+//!
+//! buf.put(&amp;b"goodbye world"[..]);
+//!
+//! let b = buf.split();
+//! assert_eq!(b, b"goodbye world"[..]);
+//!
+//! assert_eq!(buf.capacity(), 998);
+//! ```
+//!
+//! In the above example, only a single buffer of 1024 is allocated. The handles
+//! `a` and `b` will share the underlying buffer and maintain indices tracking
+//! the view into the buffer represented by the handle.
+//!
+//! See the [struct docs](`Bytes`) for more details.
+//!
+//! # `Buf`, `BufMut`
+//!
+//! These two traits provide read and write access to buffers. The underlying
+//! storage may or may not be in contiguous memory. For example, `Bytes` is a
+//! buffer that guarantees contiguous memory, but a [rope] stores the bytes in
+//! disjoint chunks. `Buf` and `BufMut` maintain cursors tracking the current
+//! position in the underlying byte storage. When bytes are read or written, the
+//! cursor is advanced.
+//!
+//! [rope]: https://en.wikipedia.org/wiki/Rope_(data_structure)
+//!
+//! ## Relation with `Read` and `Write`
+//!
+//! At first glance, it may seem that `Buf` and `BufMut` overlap in
+//! functionality with [`std::io::Read`] and [`std::io::Write`]. However, they
+//! serve different purposes. A buffer is the value that is provided as an
+//! argument to `Read::read` and `Write::write`. `Read` and `Write` may then
+//! perform a syscall, which has the potential of failing. Operations on `Buf`
+//! and `BufMut` are infallible.
+
+</span><span class="kw">extern crate </span>alloc;
+
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">extern crate </span>std;
+
+<span class="kw">pub mod </span>buf;
+<span class="kw">pub use </span><span class="kw">crate</span>::buf::{Buf, BufMut};
+
+<span class="kw">mod </span>bytes;
+<span class="kw">mod </span>bytes_mut;
+<span class="kw">mod </span>fmt;
+<span class="kw">mod </span>loom;
+<span class="kw">pub use </span><span class="kw">crate</span>::bytes::Bytes;
+<span class="kw">pub use </span><span class="kw">crate</span>::bytes_mut::BytesMut;
+
+<span class="comment">// Optional Serde support
+</span><span class="attr">#[cfg(feature = <span class="string">"serde"</span>)]
+</span><span class="kw">mod </span>serde;
+
+<span class="attr">#[inline(never)]
+#[cold]
+</span><span class="kw">fn </span>abort() -&gt; ! {
+    <span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+    </span>{
+        std::process::abort();
+    }
+
+    <span class="attr">#[cfg(not(feature = <span class="string">"std"</span>))]
+    </span>{
+        <span class="kw">struct </span>Abort;
+        <span class="kw">impl </span>Drop <span class="kw">for </span>Abort {
+            <span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
+                <span class="macro">panic!</span>();
+            }
+        }
+        <span class="kw">let </span>_a = Abort;
+        <span class="macro">panic!</span>(<span class="string">"abort"</span>);
+    }
+}
+
+<span class="attr">#[inline(always)]
+#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">fn </span>saturating_sub_usize_u64(a: usize, b: u64) -&gt; usize {
+    <span class="kw">match </span>usize::try_from(b) {
+        <span class="prelude-val">Ok</span>(b) =&gt; a.saturating_sub(b),
+        <span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; <span class="number">0</span>,
+    }
+}
+
+<span class="attr">#[inline(always)]
+#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">fn </span>min_u64_usize(a: u64, b: usize) -&gt; usize {
+    <span class="kw">match </span>usize::try_from(a) {
+        <span class="prelude-val">Ok</span>(a) =&gt; usize::min(a, b),
+        <span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; b,
+    }
+}
+
+<span class="doccomment">/// Performs bounds checking of a range.
+///
+/// This is a spiritual copy of [core::slice::index::range] because that
+/// function is currently unstable.
+</span><span class="attr">#[inline(always)]
+#[track_caller]
+</span><span class="kw">fn </span>range(range: <span class="kw">impl </span>core::ops::RangeBounds&lt;usize&gt;, len: usize) -&gt; (usize, usize) {
+    <span class="kw">use </span>core::ops::Bound;
+
+    <span class="kw">let </span>begin = <span class="kw">match </span>range.start_bound() {
+        Bound::Included(<span class="kw-2">&amp;</span>n) =&gt; n,
+        Bound::Excluded(<span class="kw-2">&amp;</span>n) =&gt; n.checked_add(<span class="number">1</span>).expect(<span class="string">"out of range"</span>),
+        Bound::Unbounded =&gt; <span class="number">0</span>,
+    };
+
+    <span class="kw">let </span>end = <span class="kw">match </span>range.end_bound() {
+        Bound::Included(<span class="kw-2">&amp;</span>n) =&gt; n.checked_add(<span class="number">1</span>).expect(<span class="string">"out of range"</span>),
+        Bound::Excluded(<span class="kw-2">&amp;</span>n) =&gt; n,
+        Bound::Unbounded =&gt; len,
+    };
+
+    <span class="macro">assert!</span>(
+        begin &lt;= end,
+        <span class="string">"range start must not be greater than end: {:?} &lt;= {:?}"</span>,
+        begin,
+        end,
+    );
+    <span class="macro">assert!</span>(
+        end &lt;= len,
+        <span class="string">"range end out of bounds: {:?} &lt;= {:?}"</span>,
+        end,
+        len,
+    );
+
+    (begin, end)
+}
+
+<span class="doccomment">/// Error type for the `try_get_` methods of [`Buf`].
+/// Indicates that there were not enough remaining
+/// bytes in the buffer while attempting
+/// to get a value from a [`Buf`] with one
+/// of the `try_get_` methods.
+</span><span class="attr">#[derive(Debug, PartialEq, Eq)]
+</span><span class="kw">pub struct </span>TryGetError {
+    <span class="doccomment">/// The number of bytes necessary to get the value
+    </span><span class="kw">pub </span>requested: usize,
+
+    <span class="doccomment">/// The number of bytes available in the buffer
+    </span><span class="kw">pub </span>available: usize,
+}
+
+<span class="kw">impl </span>core::fmt::Display <span class="kw">for </span>TryGetError {
+    <span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>core::fmt::Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;(), core::fmt::Error&gt; {
+        <span class="macro">write!</span>(
+            f,
+            <span class="string">"Not enough bytes remaining in buffer to read value (requested {} but only {} available)"</span>,
+            <span class="self">self</span>.requested,
+            <span class="self">self</span>.available
+        )
+    }
+}
+
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">impl </span>std::error::Error <span class="kw">for </span>TryGetError {}
+
+<span class="attr">#[cfg(feature = <span class="string">"std"</span>)]
+</span><span class="kw">impl </span>From&lt;TryGetError&gt; <span class="kw">for </span>std::io::Error {
+    <span class="kw">fn </span>from(error: TryGetError) -&gt; <span class="self">Self </span>{
+        std::io::Error::new(std::io::ErrorKind::Other, error)
+    }
+}
+
+<span class="doccomment">/// Panic with a nice error message.
+</span><span class="attr">#[cold]
+</span><span class="kw">fn </span>panic_advance(error_info: <span class="kw-2">&amp;</span>TryGetError) -&gt; ! {
+    <span class="macro">panic!</span>(
+        <span class="string">"advance out of bounds: the len is {} but advancing by {}"</span>,
+        error_info.available, error_info.requested
+    );
+}
+
+<span class="attr">#[cold]
+</span><span class="kw">fn </span>panic_does_not_fit(size: usize, nbytes: usize) -&gt; ! {
+    <span class="macro">panic!</span>(
+        <span class="string">"size too large: the integer type can fit {} bytes, but nbytes is {}"</span>,
+        size, nbytes
+    );
+}
+</code></pre></div></section></main></body></html>

src/bytes/loom.rs.html

@@ -0,0 +1,67 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/loom.rs`."><title>loom.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../src-files.js"></script><script defer src="../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a></pre></div><pre class="rust"><code><span class="attr">#[cfg(not(all(test, loom)))]
+</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>sync {
+    <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>atomic {
+        <span class="attr">#[cfg(not(feature = <span class="string">"extra-platforms"</span>))]
+        </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">use </span>core::sync::atomic::{AtomicPtr, AtomicUsize, Ordering};
+        <span class="attr">#[cfg(feature = <span class="string">"extra-platforms"</span>)]
+        </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">use </span>extra_platforms::{AtomicPtr, AtomicUsize, Ordering};
+
+        <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">trait </span>AtomicMut&lt;T&gt; {
+            <span class="kw">fn </span>with_mut&lt;F, R&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, f: F) -&gt; R
+            <span class="kw">where
+                </span>F: FnOnce(<span class="kw-2">&amp;mut *mut </span>T) -&gt; R;
+        }
+
+        <span class="kw">impl</span>&lt;T&gt; AtomicMut&lt;T&gt; <span class="kw">for </span>AtomicPtr&lt;T&gt; {
+            <span class="kw">fn </span>with_mut&lt;F, R&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, f: F) -&gt; R
+            <span class="kw">where
+                </span>F: FnOnce(<span class="kw-2">&amp;mut *mut </span>T) -&gt; R,
+            {
+                f(<span class="self">self</span>.get_mut())
+            }
+        }
+    }
+}
+
+<span class="attr">#[cfg(all(test, loom))]
+</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>sync {
+    <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>atomic {
+        <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">use </span>loom::sync::atomic::{AtomicPtr, AtomicUsize, Ordering};
+
+        <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">trait </span>AtomicMut&lt;T&gt; {}
+    }
+}
+</code></pre></div></section></main></body></html>

src/bytes/serde.rs.html

@@ -0,0 +1,179 @@
+<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src/serde.rs`."><title>serde.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-405f8b29f52305f8.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.83.0-nightly (9b72238eb 2024-09-14)" data-channel="nightly" data-search-js="search-0cfde64e8ad3a7fe.js" data-settings-js="settings-7e3bb6c46e92e77c.js" ><script src="../../static.files/storage-29b1d5a9048d38fe.js"></script><script defer src="../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../src-files.js"></script><script defer src="../../static.files/main-14659ec02b58af51.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-40f72c9259523cb3.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers">
+<a href="#1" id="1">1</a>
+<a href="#2" id="2">2</a>
+<a href="#3" id="3">3</a>
+<a href="#4" id="4">4</a>
+<a href="#5" id="5">5</a>
+<a href="#6" id="6">6</a>
+<a href="#7" id="7">7</a>
+<a href="#8" id="8">8</a>
+<a href="#9" id="9">9</a>
+<a href="#10" id="10">10</a>
+<a href="#11" id="11">11</a>
+<a href="#12" id="12">12</a>
+<a href="#13" id="13">13</a>
+<a href="#14" id="14">14</a>
+<a href="#15" id="15">15</a>
+<a href="#16" id="16">16</a>
+<a href="#17" id="17">17</a>
+<a href="#18" id="18">18</a>
+<a href="#19" id="19">19</a>
+<a href="#20" id="20">20</a>
+<a href="#21" id="21">21</a>
+<a href="#22" id="22">22</a>
+<a href="#23" id="23">23</a>
+<a href="#24" id="24">24</a>
+<a href="#25" id="25">25</a>
+<a href="#26" id="26">26</a>
+<a href="#27" id="27">27</a>
+<a href="#28" id="28">28</a>
+<a href="#29" id="29">29</a>
+<a href="#30" id="30">30</a>
+<a href="#31" id="31">31</a>
+<a href="#32" id="32">32</a>
+<a href="#33" id="33">33</a>
+<a href="#34" id="34">34</a>
+<a href="#35" id="35">35</a>
+<a href="#36" id="36">36</a>
+<a href="#37" id="37">37</a>
+<a href="#38" id="38">38</a>
+<a href="#39" id="39">39</a>
+<a href="#40" id="40">40</a>
+<a href="#41" id="41">41</a>
+<a href="#42" id="42">42</a>
+<a href="#43" id="43">43</a>
+<a href="#44" id="44">44</a>
+<a href="#45" id="45">45</a>
+<a href="#46" id="46">46</a>
+<a href="#47" id="47">47</a>
+<a href="#48" id="48">48</a>
+<a href="#49" id="49">49</a>
+<a href="#50" id="50">50</a>
+<a href="#51" id="51">51</a>
+<a href="#52" id="52">52</a>
+<a href="#53" id="53">53</a>
+<a href="#54" id="54">54</a>
+<a href="#55" id="55">55</a>
+<a href="#56" id="56">56</a>
+<a href="#57" id="57">57</a>
+<a href="#58" id="58">58</a>
+<a href="#59" id="59">59</a>
+<a href="#60" id="60">60</a>
+<a href="#61" id="61">61</a>
+<a href="#62" id="62">62</a>
+<a href="#63" id="63">63</a>
+<a href="#64" id="64">64</a>
+<a href="#65" id="65">65</a>
+<a href="#66" id="66">66</a>
+<a href="#67" id="67">67</a>
+<a href="#68" id="68">68</a>
+<a href="#69" id="69">69</a>
+<a href="#70" id="70">70</a>
+<a href="#71" id="71">71</a>
+<a href="#72" id="72">72</a>
+<a href="#73" id="73">73</a>
+<a href="#74" id="74">74</a>
+<a href="#75" id="75">75</a>
+<a href="#76" id="76">76</a>
+<a href="#77" id="77">77</a>
+<a href="#78" id="78">78</a>
+<a href="#79" id="79">79</a>
+<a href="#80" id="80">80</a>
+<a href="#81" id="81">81</a>
+<a href="#82" id="82">82</a>
+<a href="#83" id="83">83</a>
+<a href="#84" id="84">84</a>
+<a href="#85" id="85">85</a>
+<a href="#86" id="86">86</a>
+<a href="#87" id="87">87</a>
+<a href="#88" id="88">88</a>
+<a href="#89" id="89">89</a></pre></div><pre class="rust"><code><span class="kw">use super</span>::{Bytes, BytesMut};
+<span class="kw">use </span>alloc::string::String;
+<span class="kw">use </span>alloc::vec::Vec;
+<span class="kw">use </span>core::{cmp, fmt};
+<span class="kw">use </span>serde::{de, Deserialize, Deserializer, Serialize, Serializer};
+
+<span class="macro">macro_rules!</span> serde_impl {
+    (<span class="macro-nonterminal">$ty</span>:ident, <span class="macro-nonterminal">$visitor_ty</span>:ident, <span class="macro-nonterminal">$from_slice</span>:ident, <span class="macro-nonterminal">$from_vec</span>:ident) =&gt; {
+        <span class="kw">impl </span>Serialize <span class="kw">for </span><span class="macro-nonterminal">$ty </span>{
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>serialize&lt;S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, serializer: S) -&gt; <span class="prelude-ty">Result</span>&lt;S::Ok, S::Error&gt;
+            <span class="kw">where
+                </span>S: Serializer,
+            {
+                serializer.serialize_bytes(<span class="kw-2">&amp;</span><span class="self">self</span>)
+            }
+        }
+
+        <span class="kw">struct </span><span class="macro-nonterminal">$visitor_ty</span>;
+
+        <span class="kw">impl</span>&lt;<span class="lifetime">'de</span>&gt; de::Visitor&lt;<span class="lifetime">'de</span>&gt; <span class="kw">for </span><span class="macro-nonterminal">$visitor_ty </span>{
+            <span class="kw">type </span>Value = <span class="macro-nonterminal">$ty</span>;
+
+            <span class="kw">fn </span>expecting(<span class="kw-2">&amp;</span><span class="self">self</span>, formatter: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">'_</span>&gt;) -&gt; fmt::Result {
+                formatter.write_str(<span class="string">"byte array"</span>)
+            }
+
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>visit_seq&lt;V&gt;(<span class="self">self</span>, <span class="kw-2">mut </span>seq: V) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>::Value, V::Error&gt;
+            <span class="kw">where
+                </span>V: de::SeqAccess&lt;<span class="lifetime">'de</span>&gt;,
+            {
+                <span class="kw">let </span>len = cmp::min(seq.size_hint().unwrap_or(<span class="number">0</span>), <span class="number">4096</span>);
+                <span class="kw">let </span><span class="kw-2">mut </span>values: Vec&lt;u8&gt; = Vec::with_capacity(len);
+
+                <span class="kw">while let </span><span class="prelude-val">Some</span>(value) = seq.next_element()<span class="question-mark">? </span>{
+                    values.push(value);
+                }
+
+                <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_vec</span>(values))
+            }
+
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>visit_bytes&lt;E&gt;(<span class="self">self</span>, v: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>::Value, E&gt;
+            <span class="kw">where
+                </span>E: de::Error,
+            {
+                <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_slice</span>(v))
+            }
+
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>visit_byte_buf&lt;E&gt;(<span class="self">self</span>, v: Vec&lt;u8&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>::Value, E&gt;
+            <span class="kw">where
+                </span>E: de::Error,
+            {
+                <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_vec</span>(v))
+            }
+
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>visit_str&lt;E&gt;(<span class="self">self</span>, v: <span class="kw-2">&amp;</span>str) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>::Value, E&gt;
+            <span class="kw">where
+                </span>E: de::Error,
+            {
+                <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_slice</span>(v.as_bytes()))
+            }
+
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>visit_string&lt;E&gt;(<span class="self">self</span>, v: String) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>::Value, E&gt;
+            <span class="kw">where
+                </span>E: de::Error,
+            {
+                <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_vec</span>(v.into_bytes()))
+            }
+        }
+
+        <span class="kw">impl</span>&lt;<span class="lifetime">'de</span>&gt; Deserialize&lt;<span class="lifetime">'de</span>&gt; <span class="kw">for </span><span class="macro-nonterminal">$ty </span>{
+            <span class="attr">#[inline]
+            </span><span class="kw">fn </span>deserialize&lt;D&gt;(deserializer: D) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="macro-nonterminal">$ty</span>, D::Error&gt;
+            <span class="kw">where
+                </span>D: Deserializer&lt;<span class="lifetime">'de</span>&gt;,
+            {
+                deserializer.deserialize_byte_buf(<span class="macro-nonterminal">$visitor_ty</span>)
+            }
+        }
+    };
+}
+
+<span class="macro">serde_impl!</span>(Bytes, BytesVisitor, copy_from_slice, from);
+<span class="macro">serde_impl!</span>(BytesMut, BytesMutVisitor, from, from_vec);
+</code></pre></div></section></main></body></html>

src/fmt/debug.rs

@@ -1,40 +0,0 @@
-use core::fmt::{Debug, Formatter, Result};
-
-use super::BytesRef;
-use crate::{Bytes, BytesMut};
-
-/// Alternative implementation of `std::fmt::Debug` for byte slice.
-///
-/// Standard `Debug` implementation for `[u8]` is comma separated
-/// list of numbers. Since large amount of byte strings are in fact
-/// ASCII strings or contain a lot of ASCII strings (e. g. HTTP),
-/// it is convenient to print strings as ASCII when possible.
-impl Debug for BytesRef<'_> {
-    fn fmt(&self, f: &mut Formatter<'_>) -> Result {
-        write!(f, "b\"")?;
-        for &b in self.0 {
-            // https://doc.rust-lang.org/reference/tokens.html#byte-escapes
-            if b == b'\n' {
-                write!(f, "\\n")?;
-            } else if b == b'\r' {
-                write!(f, "\\r")?;
-            } else if b == b'\t' {
-                write!(f, "\\t")?;
-            } else if b == b'\\' || b == b'"' {
-                write!(f, "\\{}", b as char)?;
-            } else if b == b'\0' {
-                write!(f, "\\0")?;
-            // ASCII printable
-            } else if (0x20..0x7f).contains(&b) {
-                write!(f, "{}", b as char)?;
-            } else {
-                write!(f, "\\x{:02x}", b)?;
-            }
-        }
-        write!(f, "\"")?;
-        Ok(())
-    }
-}
-
-fmt_impl!(Debug, Bytes);
-fmt_impl!(Debug, BytesMut);

src/fmt/hex.rs

@@ -1,27 +0,0 @@
-use core::fmt::{Formatter, LowerHex, Result, UpperHex};
-
-use super::BytesRef;
-use crate::{Bytes, BytesMut};
-
-impl LowerHex for BytesRef<'_> {
-    fn fmt(&self, f: &mut Formatter<'_>) -> Result {
-        for &b in self.0 {
-            write!(f, "{:02x}", b)?;
-        }
-        Ok(())
-    }
-}
-
-impl UpperHex for BytesRef<'_> {
-    fn fmt(&self, f: &mut Formatter<'_>) -> Result {
-        for &b in self.0 {
-            write!(f, "{:02X}", b)?;
-        }
-        Ok(())
-    }
-}
-
-fmt_impl!(LowerHex, Bytes);
-fmt_impl!(LowerHex, BytesMut);
-fmt_impl!(UpperHex, Bytes);
-fmt_impl!(UpperHex, BytesMut);

src/fmt/mod.rs

@@ -1,15 +0,0 @@
-macro_rules! fmt_impl {
-    ($tr:ident, $ty:ty) => {
-        impl $tr for $ty {
-            fn fmt(&self, f: &mut Formatter<'_>) -> Result {
-                $tr::fmt(&BytesRef(self.as_ref()), f)
-            }
-        }
-    };
-}
-
-mod debug;
-mod hex;
-
-/// `BytesRef` is not a part of public API of bytes crate.
-struct BytesRef<'a>(&'a [u8]);

src/lib.rs

@@ -1,219 +0,0 @@
-#![warn(missing_docs, missing_debug_implementations, rust_2018_idioms)]
-#![doc(test(
-    no_crate_inject,
-    attr(deny(warnings, rust_2018_idioms), allow(dead_code, unused_variables))
-))]
-#![no_std]
-#![cfg_attr(docsrs, feature(doc_cfg))]
-
-//! Provides abstractions for working with bytes.
-//!
-//! The `bytes` crate provides an efficient byte buffer structure
-//! ([`Bytes`]) and traits for working with buffer
-//! implementations ([`Buf`], [`BufMut`]).
-//!
-//! # `Bytes`
-//!
-//! `Bytes` is an efficient container for storing and operating on contiguous
-//! slices of memory. It is intended for use primarily in networking code, but
-//! could have applications elsewhere as well.
-//!
-//! `Bytes` values facilitate zero-copy network programming by allowing multiple
-//! `Bytes` objects to point to the same underlying memory. This is managed by
-//! using a reference count to track when the memory is no longer needed and can
-//! be freed.
-//!
-//! A `Bytes` handle can be created directly from an existing byte store (such as `&[u8]`
-//! or `Vec<u8>`), but usually a `BytesMut` is used first and written to. For
-//! example:
-//!
-//! ```rust
-//! use bytes::{BytesMut, BufMut};
-//!
-//! let mut buf = BytesMut::with_capacity(1024);
-//! buf.put(&b"hello world"[..]);
-//! buf.put_u16(1234);
-//!
-//! let a = buf.split();
-//! assert_eq!(a, b"hello world\x04\xD2"[..]);
-//!
-//! buf.put(&b"goodbye world"[..]);
-//!
-//! let b = buf.split();
-//! assert_eq!(b, b"goodbye world"[..]);
-//!
-//! assert_eq!(buf.capacity(), 998);
-//! ```
-//!
-//! In the above example, only a single buffer of 1024 is allocated. The handles
-//! `a` and `b` will share the underlying buffer and maintain indices tracking
-//! the view into the buffer represented by the handle.
-//!
-//! See the [struct docs](`Bytes`) for more details.
-//!
-//! # `Buf`, `BufMut`
-//!
-//! These two traits provide read and write access to buffers. The underlying
-//! storage may or may not be in contiguous memory. For example, `Bytes` is a
-//! buffer that guarantees contiguous memory, but a [rope] stores the bytes in
-//! disjoint chunks. `Buf` and `BufMut` maintain cursors tracking the current
-//! position in the underlying byte storage. When bytes are read or written, the
-//! cursor is advanced.
-//!
-//! [rope]: https://en.wikipedia.org/wiki/Rope_(data_structure)
-//!
-//! ## Relation with `Read` and `Write`
-//!
-//! At first glance, it may seem that `Buf` and `BufMut` overlap in
-//! functionality with [`std::io::Read`] and [`std::io::Write`]. However, they
-//! serve different purposes. A buffer is the value that is provided as an
-//! argument to `Read::read` and `Write::write`. `Read` and `Write` may then
-//! perform a syscall, which has the potential of failing. Operations on `Buf`
-//! and `BufMut` are infallible.
-
-extern crate alloc;
-
-#[cfg(feature = "std")]
-extern crate std;
-
-pub mod buf;
-pub use crate::buf::{Buf, BufMut};
-
-mod bytes;
-mod bytes_mut;
-mod fmt;
-mod loom;
-pub use crate::bytes::Bytes;
-pub use crate::bytes_mut::BytesMut;
-
-// Optional Serde support
-#[cfg(feature = "serde")]
-mod serde;
-
-#[inline(never)]
-#[cold]
-fn abort() -> ! {
-    #[cfg(feature = "std")]
-    {
-        std::process::abort();
-    }
-
-    #[cfg(not(feature = "std"))]
-    {
-        struct Abort;
-        impl Drop for Abort {
-            fn drop(&mut self) {
-                panic!();
-            }
-        }
-        let _a = Abort;
-        panic!("abort");
-    }
-}
-
-#[inline(always)]
-#[cfg(feature = "std")]
-fn saturating_sub_usize_u64(a: usize, b: u64) -> usize {
-    match usize::try_from(b) {
-        Ok(b) => a.saturating_sub(b),
-        Err(_) => 0,
-    }
-}
-
-#[inline(always)]
-#[cfg(feature = "std")]
-fn min_u64_usize(a: u64, b: usize) -> usize {
-    match usize::try_from(a) {
-        Ok(a) => usize::min(a, b),
-        Err(_) => b,
-    }
-}
-
-/// Performs bounds checking of a range.
-///
-/// This is a spiritual copy of [core::slice::index::range] because that
-/// function is currently unstable.
-#[inline(always)]
-#[track_caller]
-fn range(range: impl core::ops::RangeBounds<usize>, len: usize) -> (usize, usize) {
-    use core::ops::Bound;
-
-    let begin = match range.start_bound() {
-        Bound::Included(&n) => n,
-        Bound::Excluded(&n) => n.checked_add(1).expect("out of range"),
-        Bound::Unbounded => 0,
-    };
-
-    let end = match range.end_bound() {
-        Bound::Included(&n) => n.checked_add(1).expect("out of range"),
-        Bound::Excluded(&n) => n,
-        Bound::Unbounded => len,
-    };
-
-    assert!(
-        begin <= end,
-        "range start must not be greater than end: {:?} <= {:?}",
-        begin,
-        end,
-    );
-    assert!(
-        end <= len,
-        "range end out of bounds: {:?} <= {:?}",
-        end,
-        len,
-    );
-
-    (begin, end)
-}
-
-/// Error type for the `try_get_` methods of [`Buf`].
-/// Indicates that there were not enough remaining
-/// bytes in the buffer while attempting
-/// to get a value from a [`Buf`] with one
-/// of the `try_get_` methods.
-#[derive(Debug, PartialEq, Eq)]
-pub struct TryGetError {
-    /// The number of bytes necessary to get the value
-    pub requested: usize,
-
-    /// The number of bytes available in the buffer
-    pub available: usize,
-}
-
-impl core::fmt::Display for TryGetError {
-    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> Result<(), core::fmt::Error> {
-        write!(
-            f,
-            "Not enough bytes remaining in buffer to read value (requested {} but only {} available)",
-            self.requested,
-            self.available
-        )
-    }
-}
-
-#[cfg(feature = "std")]
-impl std::error::Error for TryGetError {}
-
-#[cfg(feature = "std")]
-impl From<TryGetError> for std::io::Error {
-    fn from(error: TryGetError) -> Self {
-        std::io::Error::new(std::io::ErrorKind::Other, error)
-    }
-}
-
-/// Panic with a nice error message.
-#[cold]
-fn panic_advance(error_info: &TryGetError) -> ! {
-    panic!(
-        "advance out of bounds: the len is {} but advancing by {}",
-        error_info.available, error_info.requested
-    );
-}
-
-#[cold]
-fn panic_does_not_fit(size: usize, nbytes: usize) -> ! {
-    panic!(
-        "size too large: the integer type can fit {} bytes, but nbytes is {}",
-        size, nbytes
-    );
-}

src/loom.rs

@@ -1,33 +0,0 @@
-#[cfg(not(all(test, loom)))]
-pub(crate) mod sync {
-    pub(crate) mod atomic {
-        #[cfg(not(feature = "extra-platforms"))]
-        pub(crate) use core::sync::atomic::{AtomicPtr, AtomicUsize, Ordering};
-        #[cfg(feature = "extra-platforms")]
-        pub(crate) use extra_platforms::{AtomicPtr, AtomicUsize, Ordering};
-
-        pub(crate) trait AtomicMut<T> {
-            fn with_mut<F, R>(&mut self, f: F) -> R
-            where
-                F: FnOnce(&mut *mut T) -> R;
-        }
-
-        impl<T> AtomicMut<T> for AtomicPtr<T> {
-            fn with_mut<F, R>(&mut self, f: F) -> R
-            where
-                F: FnOnce(&mut *mut T) -> R,
-            {
-                f(self.get_mut())
-            }
-        }
-    }
-}
-
-#[cfg(all(test, loom))]
-pub(crate) mod sync {
-    pub(crate) mod atomic {
-        pub(crate) use loom::sync::atomic::{AtomicPtr, AtomicUsize, Ordering};
-
-        pub(crate) trait AtomicMut<T> {}
-    }
-}

src/serde.rs

@@ -1,89 +0,0 @@
-use super::{Bytes, BytesMut};
-use alloc::string::String;
-use alloc::vec::Vec;
-use core::{cmp, fmt};
-use serde::{de, Deserialize, Deserializer, Serialize, Serializer};
-
-macro_rules! serde_impl {
-    ($ty:ident, $visitor_ty:ident, $from_slice:ident, $from_vec:ident) => {
-        impl Serialize for $ty {
-            #[inline]
-            fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
-            where
-                S: Serializer,
-            {
-                serializer.serialize_bytes(&self)
-            }
-        }
-
-        struct $visitor_ty;
-
-        impl<'de> de::Visitor<'de> for $visitor_ty {
-            type Value = $ty;
-
-            fn expecting(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
-                formatter.write_str("byte array")
-            }
-
-            #[inline]
-            fn visit_seq<V>(self, mut seq: V) -> Result<Self::Value, V::Error>
-            where
-                V: de::SeqAccess<'de>,
-            {
-                let len = cmp::min(seq.size_hint().unwrap_or(0), 4096);
-                let mut values: Vec<u8> = Vec::with_capacity(len);
-
-                while let Some(value) = seq.next_element()? {
-                    values.push(value);
-                }
-
-                Ok($ty::$from_vec(values))
-            }
-
-            #[inline]
-            fn visit_bytes<E>(self, v: &[u8]) -> Result<Self::Value, E>
-            where
-                E: de::Error,
-            {
-                Ok($ty::$from_slice(v))
-            }
-
-            #[inline]
-            fn visit_byte_buf<E>(self, v: Vec<u8>) -> Result<Self::Value, E>
-            where
-                E: de::Error,
-            {
-                Ok($ty::$from_vec(v))
-            }
-
-            #[inline]
-            fn visit_str<E>(self, v: &str) -> Result<Self::Value, E>
-            where
-                E: de::Error,
-            {
-                Ok($ty::$from_slice(v.as_bytes()))
-            }
-
-            #[inline]
-            fn visit_string<E>(self, v: String) -> Result<Self::Value, E>
-            where
-                E: de::Error,
-            {
-                Ok($ty::$from_vec(v.into_bytes()))
-            }
-        }
-
-        impl<'de> Deserialize<'de> for $ty {
-            #[inline]
-            fn deserialize<D>(deserializer: D) -> Result<$ty, D::Error>
-            where
-                D: Deserializer<'de>,
-            {
-                deserializer.deserialize_byte_buf($visitor_ty)
-            }
-        }
-    };
-}
-
-serde_impl!(Bytes, BytesVisitor, copy_from_slice, from);
-serde_impl!(BytesMut, BytesMutVisitor, from, from_vec);

static.files/COPYRIGHT-23e9bde6c69aea69.txt

@@ -0,0 +1,50 @@
+# REUSE-IgnoreStart
+
+These documentation pages include resources by third parties. This copyright
+file applies only to those resources. The following third party resources are
+included, and carry their own copyright notices and license terms:
+
+* Fira Sans (FiraSans-Regular.woff2, FiraSans-Medium.woff2):
+
+    Copyright (c) 2014, Mozilla Foundation https://mozilla.org/
+    with Reserved Font Name Fira Sans.
+
+    Copyright (c) 2014, Telefonica S.A.
+
+    Licensed under the SIL Open Font License, Version 1.1.
+    See FiraSans-LICENSE.txt.
+
+* rustdoc.css, main.js, and playpen.js:
+
+    Copyright 2015 The Rust Developers.
+    Licensed under the Apache License, Version 2.0 (see LICENSE-APACHE.txt) or
+    the MIT license (LICENSE-MIT.txt) at your option.
+
+* normalize.css:
+
+    Copyright (c) Nicolas Gallagher and Jonathan Neal.
+    Licensed under the MIT license (see LICENSE-MIT.txt).
+
+* Source Code Pro (SourceCodePro-Regular.ttf.woff2,
+    SourceCodePro-Semibold.ttf.woff2, SourceCodePro-It.ttf.woff2):
+
+    Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/),
+    with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark
+    of Adobe Systems Incorporated in the United States and/or other countries.
+
+    Licensed under the SIL Open Font License, Version 1.1.
+    See SourceCodePro-LICENSE.txt.
+
+* Source Serif 4 (SourceSerif4-Regular.ttf.woff2, SourceSerif4-Bold.ttf.woff2,
+    SourceSerif4-It.ttf.woff2):
+
+    Copyright 2014-2021 Adobe (http://www.adobe.com/), with Reserved Font Name
+    'Source'. All Rights Reserved. Source is a trademark of Adobe in the United
+    States and/or other countries.
+
+    Licensed under the SIL Open Font License, Version 1.1.
+    See SourceSerif4-LICENSE.md.
+
+This copyright file is intended to be distributed with rustdoc output.
+
+# REUSE-IgnoreEnd

static.files/FiraSans-LICENSE-db4b642586e02d97.txt

@@ -0,0 +1,98 @@
+// REUSE-IgnoreStart
+
+Digitized data copyright (c) 2012-2015, The Mozilla Foundation and Telefonica S.A.
+with Reserved Font Name < Fira >,
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+This license is copied below, and is also available with a FAQ at:
+http://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
+
+// REUSE-IgnoreEnd

static.files/LICENSE-APACHE-b91fa81cba47b86a.txt

@@ -0,0 +1,201 @@
+                              Apache License
+                        Version 2.0, January 2004
+                     http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+       Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+       stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+       that You distribute, all copyright, patent, trademark, and
+       attribution notices from the Source form of the Work,
+       excluding those notices that do not pertain to any part of
+       the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+       distribution, then any Derivative Works that You distribute must
+       include a readable copy of the attribution notices contained
+       within such NOTICE file, excluding those notices that do not
+       pertain to any part of the Derivative Works, in at least one
+       of the following places: within a NOTICE text file distributed
+       as part of the Derivative Works; within the Source form or
+       documentation, if provided along with the Derivative Works; or,
+       within a display generated by the Derivative Works, if and
+       wherever such third-party notices normally appear. The contents
+       of the NOTICE file are for informational purposes only and
+       do not modify the License. You may add Your own attribution
+       notices within Derivative Works that You distribute, alongside
+       or as an addendum to the NOTICE text from the Work, provided
+       that such additional attribution notices cannot be construed
+       as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+   To apply the Apache License to your work, attach the following
+   boilerplate notice, with the fields enclosed by brackets "[]"
+   replaced with your own identifying information. (Don't include
+   the brackets!)  The text should be enclosed in the appropriate
+   comment syntax for the file format. We also recommend that a
+   file or class name and description of purpose be included on the
+   same "printed page" as the copyright notice for easier
+   identification within third-party archives.
+
+Copyright [yyyy] [name of copyright owner]
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+	http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

static.files/LICENSE-MIT-65090b722b3f6c56.txt

@@ -1,5 +1,3 @@
-Copyright (c) 2018 Carl Lerche
-
 Permission is hereby granted, free of charge, to any
 person obtaining a copy of this software and associated
 documentation files (the "Software"), to deal in the

static.files/NanumBarunGothic-LICENSE-18c5adf4b52b4041.txt

@@ -0,0 +1,103 @@
+// REUSE-IgnoreStart
+
+Copyright (c) 2010, NAVER Corporation (https://www.navercorp.com/),
+
+with Reserved Font Name Nanum, Naver Nanum, NanumGothic, Naver NanumGothic,
+NanumMyeongjo, Naver NanumMyeongjo, NanumBrush, Naver NanumBrush, NanumPen,
+Naver NanumPen, Naver NanumGothicEco, NanumGothicEco, Naver NanumMyeongjoEco,
+NanumMyeongjoEco, Naver NanumGothicLight, NanumGothicLight, NanumBarunGothic,
+Naver NanumBarunGothic, NanumSquareRound, NanumBarunPen, MaruBuri
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+This license is copied below, and is also available with a FAQ at:
+http://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
+
+// REUSE-IgnoreEnd

static.files/SourceCodePro-LICENSE-d180d465a756484a.txt

@@ -0,0 +1,97 @@
+// REUSE-IgnoreStart
+
+Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries.
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+
+This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
+
+// REUSE-IgnoreEnd