Struct Search

pub struct Search<G: Graph> { /* private fields */ }

The search algorithm.

Implementations

impl<G: Graph> Search<G>

pub fn new(graph: G, search_nodes: impl IntoIterator<Item = G::Node>) -> Self

Construct a new search. The provided graph represents the universe of all nodes, and nodes represents a subset of that universe to search in. Only elements from nodes will be returned by success_bounds and failure_bounds.

For example, graph might correspond to the entire source control directed acyclic graph, and nodes might correspond to a recent range of commits where the first one is passing and the last one is failing.

pub fn success_bounds(&self) -> Result<HashSet<G::Node>, G::Error>

Get the currently known bounds on the success nodes.

FIXME: O(n) complexity.

pub fn failure_bounds(&self) -> Result<HashSet<G::Node>, G::Error>

Get the currently known bounds on the failure nodes.

FIXME: O(n) complexity.

pub fn search<'a, S: Strategy<G>>( &'a self, strategy: &'a S, ) -> Result<LazySolution<'_, G::Node, SearchError<G::Node, G::Error, S::Error>>, SearchError<G::Node, G::Error, S::Error>>

Summarize the current search progress and suggest the next node(s) to search. The caller is responsible for calling notify with the result.

pub fn notify( &mut self, node: G::Node, status: Status, ) -> Result<(), NotifyError<G::Node, G::Error>>

Update the search state with the result of a search.

Trait Implementations

impl<G: Clone + Graph> Clone for Search<G>

where G::Node: Clone,

fn clone(&self) -> Search<G>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: Debug + Graph> Debug for Search<G>

where G::Node: Debug,

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

Formats the value using the given formatter.