Lines Matching +full:ci +full:- +full:crate
5 [](https://github.com/B…
8 Dual-licensed under MIT or the [UNLICENSE](https://unlicense.org/).
18 * The top-level module provides routines for searching for 1, 2 or 3 bytes
22 * The `memmem` sub-module provides forward and reverse substring search
26 is exactly what you want when searching either UTF-8 or arbitrary bytes.
31 `std` feature if you want to use it in a `#![no_std]` crate:
35 memchr = { version = "2", default-features = false }
44 `memchr` is a routine that is part of libc, although this crate does not use
49 available in this crate, then enabling the `libc` feature will use libc's
52 The rest of the functions in this crate, e.g., `memchr2` or `memrchr3` and the
53 substring search routines, will always use the implementations in this crate.
61 This crate's minimum supported `rustc` version is `1.41.1`.
63 The current policy is that the minimum Rust version required to use this crate
64 can be increased in minor version updates. For example, if `crate 1.0` requires
65 Rust 1.20.0, then `crate 1.0.z` for all values of `z` will also require Rust
66 1.20.0 or newer. However, `crate 1.y` for `y > 0` may require a newer minimum
69 In general, this crate will be conservative with respect to the minimum
75 Given the complexity of the code in this crate, along with the pervasive use
76 of `unsafe`, this crate has an extensive testing strategy. It combines multiple
79 * Hand-written tests.
80 * Exhaustive-style testing meant to exercise all possible branching and offset
83 * Fuzz testing through [`cargo fuzz`](https://github.com/rust-fuzz/cargo-fuzz).
92 At time of writing, this crate's implementation of substring search actually
96 [Rabin-Karp](https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm)
97 is used to reduce latency. Rabin-Karp has very small overhead and can often
100 ["Generic SIMD"](http://0x80.pl/articles/simd-strfind.html#algorithm-1-generic-simd)
104 [Two-Way](https://en.wikipedia.org/wiki/Two-way_string-matching_algorithm)