Struct Search 

pub struct Search { /* private fields */ }

A pattern, with its case sensitivity already decided.

Implementations

impl Search

pub fn new(pattern: impl Into<String>) -> Self

Compile a pattern. Empty is legal and matches nothing, which is what makes n with no previous search a no-op rather than a jump to row 0.

pub fn pattern(&self) -> &str

pub fn is_empty(&self) -> bool

pub fn matches(&self, haystack: &str) -> bool

Whether this text contains the pattern anywhere.

pub fn spans(&self, haystack: &str) -> Vec<(usize, usize)>

Byte ranges of every match, for highlighting.

Offsets are into haystack exactly as given, not into a lowercased copy. Case folding can change a string’s byte length, İ lowercases to two chars, so folding first and reusing the resulting offsets would slice the original in the wrong place and eventually panic on a char boundary. Scanning char by char costs more and is always right, and this only ever runs over the rows actually on screen.

Trait Implementations

impl Clone for Search

fn clone(&self) -> Search

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Search

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Search

fn default() -> Search

Returns the “default value” for a type.

impl Eq for Search

impl PartialEq for Search

fn eq(&self, other: &Search) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Search