pub struct Beam<'a, I, N, E, Ty, Ix, F> {
pub direction: Direction,
/* private fields */
}
Expand description
The Beam search strategy implementation
This strategy has a limit of candidate routes at all times. For example, keeps the 3 best routes and all the others get discarded
Fields§
§direction: Direction
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<'a, I, N, E, Ty, Ix, F> RefUnwindSafe for Beam<'a, I, N, E, Ty, Ix, F>where E: RefUnwindSafe, F: RefUnwindSafe, I: RefUnwindSafe, Ix: RefUnwindSafe, N: RefUnwindSafe, Ty: RefUnwindSafe,
impl<'a, I, N, E, Ty, Ix, F> !Send for Beam<'a, I, N, E, Ty, Ix, F>
impl<'a, I, N, E, Ty, Ix, F> !Sync for Beam<'a, I, N, E, Ty, Ix, F>
impl<'a, I, N, E, Ty, Ix, F> Unpin for Beam<'a, I, N, E, Ty, Ix, F>where F: Unpin, Ix: Unpin,
impl<'a, I, N, E, Ty, Ix, F> UnwindSafe for Beam<'a, I, N, E, Ty, Ix, F>where E: RefUnwindSafe, F: UnwindSafe, I: RefUnwindSafe, Ix: UnwindSafe + RefUnwindSafe, N: RefUnwindSafe, Ty: RefUnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more