Struct smoothed_online_convex_optimization::breakpoints::Breakpoints [−][src]
pub struct Breakpoints {
pub bs: Vec<N64>,
pub next: Option<Arc<dyn Fn(f64) -> (Option<f64>, Option<f64>) + Send + Sync>>,
}
Expand description
Sorted non-continuous or non-smooth points of a function.
Fields
bs: Vec<N64>
Finite vector of breakpoints.
next: Option<Arc<dyn Fn(f64) -> (Option<f64>, Option<f64>) + Send + Sync>>
Function which given a breakpoint returns the previous and next breakpoints (until there are none), respectively. The function is called to obtain the next breakpoint until the piecewise integrals converge to $0$ or the entire integral was integrated.
Implementations
Generate breakpoints from a finite vector of breakpoints $bs$.
Trait Implementations
type Dict = PyClassDummySlot
type Dict = PyClassDummySlot
Specify this class has #[pyclass(dict)]
or not.
type WeakRef = PyClassDummySlot
type WeakRef = PyClassDummySlot
Specify this class has #[pyclass(weakref)]
or not.
type BaseNativeType = PyAny
type BaseNativeType = PyAny
The closest native ancestor. This is PyAny
by default, and when you declare
#[pyclass(extends=PyDict)]
, it’s PyDict
. Read more
#[pyclass(subclass)]
#[pyclass(extends=…)]
type ThreadChecker = ThreadCheckerStub<Breakpoints>
type ThreadChecker = ThreadCheckerStub<Breakpoints>
This handles following two situations: Read more
type AsRefTarget = PyCell<Self>
type AsRefTarget = PyCell<Self>
Utility type to make Py::as_ref work.
PyTypeObject instance for this type.
Checks if object
is an instance of this type or a subclass of this type.
Checks if object
is an instance of this type.
Auto Trait Implementations
impl !RefUnwindSafe for Breakpoints
impl Send for Breakpoints
impl Sync for Breakpoints
impl Unpin for Breakpoints
impl !UnwindSafe for Breakpoints
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
Returns the safe abstraction over the type object.
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.