Struct Settings
pub struct Settings {
pub flags: SettingsFlags,
pub config: SettingsConfig,
pub observation: Option<Box<SettingsObservation>>,
}http and std only.Fields§
§flags: SettingsFlags§config: SettingsConfig§observation: Option<Box<SettingsObservation>>Optional bounded wire observation. Semantic configuration is independent.
Implementations§
§impl Settings
impl Settings
pub fn ack() -> Settings
pub fn with_config(self, config: SettingsConfig) -> Settings
pub fn set_config(&mut self, config: SettingsConfig) -> &mut Settings
pub fn merge(&mut self, other: Settings)
pub fn from_ordered_entries(entries: Box<[Setting]>) -> Result<Settings, Error>
pub fn from_ordered_entries(entries: Box<[Setting]>) -> Result<Settings, Error>
Build a SETTINGS frame from validated entries in their original wire order.
Unlike SettingsConfig, this retains unknown identifiers and repeated
occurrences. Any later semantic configuration change discards the exact
sequence so stale wire values cannot override the new configuration.
pub fn to_literal(&self) -> Result<Settings, Error>
pub fn to_literal(&self) -> Result<Settings, Error>
Produce a validated literal non-ACK frame, retaining complete observed order.
Reject incomplete observations or semantic changes made after observation. Without an observation, preserve the explicitly configured fields and order.
pub fn load(head: Head, payload: &[u8]) -> Result<Settings, Error>
pub fn load_observed(
head: Head,
payload: &[u8],
observe: bool,
) -> Result<Settings, Error>
pub fn load_observed( head: Head, payload: &[u8], observe: bool, ) -> Result<Settings, Error>
Decode semantic settings without allocating optional observation data. When enabled, at most 256 ordered occurrences are retained. Exceeding the observation limit does not reject otherwise valid peer settings.
pub fn encode(&self, dst: &mut BytesMut)
pub fn encoded_entries(&self) -> impl Iterator<Item = Setting> + Clone
pub fn encoded_entries(&self) -> impl Iterator<Item = Setting> + Clone
Iterate over the ordered entries this frame will encode, without copying.
A current literal replay retains duplicate and unknown occurrences.
Otherwise entries follow the semantic configuration’s explicit/default
order. This is the outgoing representation, not an incomplete observation.
Semantic SettingsConfig equality deliberately ignores this order.
Trait Implementations§
§impl<'de> Deserialize<'de> for Settings
impl<'de> Deserialize<'de> for Settings
§fn deserialize<__D>(
__deserializer: __D,
) -> Result<Settings, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<Settings, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
impl Eq for Settings
§impl Serialize for Settings
impl Serialize for Settings
§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl StructuralPartialEq for Settings
Auto Trait Implementations§
impl Freeze for Settings
impl RefUnwindSafe for Settings
impl Send for Settings
impl Sync for Settings
impl Unpin for Settings
impl UnsafeUnpin for Settings
impl UnwindSafe for Settings
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§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 Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
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> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a rama_grpc::Request§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§fn and<P, B, E>(self, other: P) -> And<T, P>
fn and<P, B, E>(self, other: P) -> And<T, P>
Policy that returns Action::Follow only if self and other return
Action::Follow. Read more