Struct ModelDecoderLimits
pub struct ModelDecoderLimits {Show 15 fields
pub json: JsonDecoderLimits,
pub max_nodes: usize,
pub max_edges: usize,
pub max_expression_nodes: usize,
pub max_expression_roots: usize,
pub max_pure_operator_definitions: usize,
pub max_pure_operator_formals: usize,
pub max_pure_operator_calculus_nodes: usize,
pub max_pure_operator_application_arguments: usize,
pub max_model_view_members: usize,
pub max_model_boundary: usize,
pub max_value_shape_rank: usize,
pub max_value_shape_components: usize,
pub max_transaction_ops: usize,
pub max_transaction_preconditions: usize,
}Description
Semantic work budgets shared by the current Model and Model transaction.
Fields§
§json: JsonDecoderLimitsCommon JSON syntax admission.
max_nodes: usizeMaximum Semantic Kernel nodes in one Model envelope.
max_edges: usizeMaximum graph edges in one Model envelope.
max_expression_nodes: usizeMaximum expression nodes summed across one Model or transaction.
max_expression_roots: usizeMaximum expression roots summed across one Model or transaction.
max_pure_operator_definitions: usizeMaximum pure-operator definitions summed across expressions.
max_pure_operator_formals: usizeMaximum pure-operator formals summed across definitions.
max_pure_operator_calculus_nodes: usizeMaximum exact component-calculus nodes summed across definitions.
max_pure_operator_application_arguments: usizeMaximum ordered arguments summed across pure-operator applications.
max_model_view_members: usizeMaximum Semantic Model members.
max_model_boundary: usizeMaximum model-root boundary Ports.
max_value_shape_rank: usizeMaximum rank of one exact Semantic Model value shape.
max_value_shape_components: usizeMaximum checked scalar components in one Semantic Model value shape.
max_transaction_ops: usizeMaximum ordered operations in one Model transaction.
max_transaction_preconditions: usizeMaximum atomic preconditions in one Model transaction.
Trait Implementations§
§impl Clone for ModelDecoderLimits
impl Clone for ModelDecoderLimits
§impl Debug for ModelDecoderLimits
impl Debug for ModelDecoderLimits
§impl Default for ModelDecoderLimits
impl Default for ModelDecoderLimits
§fn default() -> ModelDecoderLimits
fn default() -> ModelDecoderLimits
§impl PartialEq for ModelDecoderLimits
impl PartialEq for ModelDecoderLimits
§fn eq(&self, other: &ModelDecoderLimits) -> bool
fn eq(&self, other: &ModelDecoderLimits) -> bool
self and other values to be equal, and is used by ==.impl Copy for ModelDecoderLimits
impl Eq for ModelDecoderLimits
impl StructuralPartialEq for ModelDecoderLimits
Auto Trait Implementations§
impl Freeze for ModelDecoderLimits
impl RefUnwindSafe for ModelDecoderLimits
impl Send for ModelDecoderLimits
impl Sync for ModelDecoderLimits
impl Unpin for ModelDecoderLimits
impl UnsafeUnpin for ModelDecoderLimits
impl UnwindSafe for ModelDecoderLimits
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.