Crates.io | str_overlap |
lib.rs | str_overlap |
version | 0.4.3 |
source | src |
created_at | 2020-10-15 06:57:22.246839 |
updated_at | 2021-02-04 23:43:22.102931 |
description | Methods for finding the overlap between two string slices. |
homepage | |
repository | https://github.com/Anders429/str_overlap |
max_upload_size | |
id | 299905 |
size | 25,444 |
This crate provides methods for finding the overlap between two string slices.
An overlap is here defined as the largest substring contained both at the end of one string slice and the beginning of another string slice.
To use this crate, bring the
Overlap
trait into scope. This
will provide str
s with two methods:
overlap_start
- Finds the overlap at the start of the string slice and the end of another.overlap_end
- Finds the overlap at the end of the string slice and the start of another.use str_overlap::Overlap;
assert_eq!("bcd".overlap_start("abc"), "bc");
assert_eq!("abc".overlap_end("bcd"), "bc");
The return value of these methods is a string slice, borrowed from the string the method is called on. The two methods allows the caller to choose who owns the resulting string slice.
To use this crate, call the provided overlap
function with two string slices in the left and
right positions.
use str_overlap::overlap;
assert_eq!(overlap("abc", "bcd"), "bc");
Note that the positions of the string slices matter. The overlap found is the largest substring at both the end of the left string slice and the beginning of the right string slice.
The overlap
function has temporal complexity O(n) in the worst case (where no overlap is found),
where n is the length of the first string parameter.
This crate is guaranteed to compile on stable rustc 1.0.0
and up.
This project is licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.