6b69ebcae0
This might have made sense if the algorithm could use `searchWords` to skip having to look at `searchIndex`, but since it always does a substring check on both the stock word and the normalizedName, it doesn't seem to help performance anyway.
24 lines
548 B
Rust
24 lines
548 B
Rust
pub struct SuperWaker;
|
|
|
|
impl SuperWaker {
|
|
pub fn local_waker_from_nonlocal() {}
|
|
pub fn local_waker_frm_nonlocal() {}
|
|
pub fn some_method() {}
|
|
pub fn some_other_method() {}
|
|
pub fn waker_non_local() {}
|
|
pub fn from_non_local() {}
|
|
}
|
|
|
|
pub struct SuperWakerTask;
|
|
|
|
impl SuperWakerTask {
|
|
pub fn local_waker_from_nonlocal() {}
|
|
pub fn local_waker_frm_nonlocal() {}
|
|
pub fn some_method() {}
|
|
pub fn some_other_method() {}
|
|
pub fn waker_non_local() {}
|
|
pub fn from_non_local() {}
|
|
}
|
|
|
|
pub fn m_y_substringmatching() {}
|