This is a tracking issue for the RFC "Needle API (née Pattern API)" (rust-lang/rfcs#2500).
Feature gates:
#![feature(needle)] (the traits and method in core::needle itself, and impl of these traits)#![feature(str_find_range)] (find_range, rfind_range, match_ranges and rmatch_ranges methods for str)#![feature(mut_str_needle_methods)] (split_mut, matches_mut, trim_mut etc for str)#![feature(slice_needle_methods)] (find, matches, trim_matches, replace, split etc for [T])#![feature(os_str_needle_methods)] (find, matches etc for OsStr)Steps:
Currently, due to Implied bounds rfcs#2089 and/or RFC: Associated type bounds of form MyTrait<AssociatedType: Bounds> rfcs#2289 not being implemented, using a Haystack in any algorithm would need to a redundant where clause.
Naive vs. fast algorithm for T: !Ord
Should we represent SharedHaystack using a more general concept of "cheaply cloneable"?
With a benefit of simplified API, do we want to merge Consumer and Searcher into a single trait?
Stabilization should require RFC 1672 (disjointness based on associated types).
tesuji, MarkTanashchuk, elichai, tuguzT and Rustacian
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4