pub trait ReusableSearchProblem {
type Node: Hash + PartialEq + Eq + Clone;
type Cost: PartialOrd + Zero + Clone;
type Iter: Iterator<Item=(Self::Node, Self::Cost)>;
fn heuristic(&self, &Self::Node, &Self::Node) -> Self::Cost;
fn neighbors(&mut self, &Self::Node) -> Self::Iter;
fn estimate_length(&self, _a: &Self::Node, _b: &Self::Node) -> Option<u32> { ... }
fn search(&mut self, start: Self::Node, end: Self::Node) -> ReuseSearchInstance<Self, Self::Node> { ... }
}
Associated Types
Required Methods
Provided Methods
Implementors
Keyboard shortcuts
- ?
- Show this help dialog
- S
- Focus the search field
- ⇤
- Move up in search results
- ⇥
- Move down in search results
- ⏎
- Go to active search result
Search tricks
Prefix searches with a type followed by a colon (e.g.
fn:
) to restrict the search to a given type.
Accepted types are: fn
, mod
,
struct
, enum
,
trait
, typedef
(or
tdef
).