pub struct BytesFilter<B, I = Builtin> { /* private fields */ }Expand description
The VARIABLE-WIDTH bytes filter — generic over the column’s byte storage type B (Vec<u8>, a
Bytes newtype), mirroring polarsync’s ByteaFilter<I>, and over the WIRE READING I its
operands cross under. Equality, ordering, membership, and byte-substring
contains/not_contains — and no affix operators, which a byte column has no use for.
Bound-free struct; the AsRef<[u8]> belongs on the lowering impls. new()/Default + the
opt_accessor! getter and writers per slot.
§The FIXED width is a different TYPE, not a parameter on this one
FixedBytesFilter<B, N, I> is the N-byte column’s filter, and the two
differ in their SLOTS rather than in what a lowering does with them: a BLOB has
instr/position/LOCATE and a BINARY(32) has none of them, so the fixed type simply does
not carry the substring pair.
This crate carried the width as a shape PARAMETER — BytesFilter<B, Variable | Fixed<N>, I>,
ten slots for both, and a crossing that refused two of them by reading a monomorphized const.
What that arrangement published was a fixed-width input object advertising a contains field
that every request setting it was refused for. A door that always refuses is a door a schema
should not have; the split is that sentence made structural, and the refusal it replaces
(BytesCrossingError::FixedSubstring) is DELETED rather than moved — an unknown field is the
wire’s own validation and it fires before any of this crate’s code runs.
§The SECOND parameter, and what it is for
I names the reading the operands cross the wire under — see BytesWire —
and it is what lets a DECLARING crate give its own byte newtype a wire face. The framework’s wire
face is ONE generic row over I, so there is no second row for coherence to hit and the
PARAMETER renames nothing: Builtin carries bytes::Bytes under BytesFilter, which is the
roster’s bytes row with the derivation applied — see roster.
It DEFAULTS, so BytesFilter<Vec<u8>> is BytesFilter<Vec<u8>, Builtin>.
Implementations§
Source§impl<B, I> BytesFilter<B, I>
impl<B, I> BytesFilter<B, I>
Sourcepub const fn is_empty(&self) -> bool
pub const fn is_empty(&self) -> bool
True while NO operator slot is set — so a lowering would emit nothing for this field.
Inherent, not the backend traits’ provided is_empty: “is anything set” is a property of the
FILTER, identical on every backend, and asking it should not make a caller name a dialect (with
two families compiled, f.is_empty() through the traits is E0283). The inherent method wins
method resolution, so every call site reads the same either way.
Sourcepub fn update_eq(&mut self, value: Option<B>) -> &mut Self
pub fn update_eq(&mut self, value: Option<B>) -> &mut Self
Assign the raw eq option (in place).
Sourcepub fn update_ne(&mut self, value: Option<B>) -> &mut Self
pub fn update_ne(&mut self, value: Option<B>) -> &mut Self
Assign the raw ne option (in place).
Sourcepub fn update_gt(&mut self, value: Option<B>) -> &mut Self
pub fn update_gt(&mut self, value: Option<B>) -> &mut Self
Assign the raw gt option (in place).
Sourcepub fn update_gte(&mut self, value: Option<B>) -> &mut Self
pub fn update_gte(&mut self, value: Option<B>) -> &mut Self
Assign the raw gte option (in place).
Sourcepub fn update_lt(&mut self, value: Option<B>) -> &mut Self
pub fn update_lt(&mut self, value: Option<B>) -> &mut Self
Assign the raw lt option (in place).
Sourcepub fn update_lte(&mut self, value: Option<B>) -> &mut Self
pub fn update_lte(&mut self, value: Option<B>) -> &mut Self
Assign the raw lte option (in place).
Sourcepub const fn contains(&self) -> Option<&B>
pub const fn contains(&self) -> Option<&B>
The contains operand, or None while the operator is absent.
Sourcepub fn with_contains(self, value: B) -> Self
pub fn with_contains(self, value: B) -> Self
Set contains to Some(value) (consuming).
Sourcepub fn set_contains(&mut self, value: B) -> &mut Self
pub fn set_contains(&mut self, value: B) -> &mut Self
Set contains to Some(value) (in place).
Sourcepub fn maybe_contains(self, value: Option<B>) -> Self
pub fn maybe_contains(self, value: Option<B>) -> Self
Assign the raw contains option (consuming).
Sourcepub fn update_contains(&mut self, value: Option<B>) -> &mut Self
pub fn update_contains(&mut self, value: Option<B>) -> &mut Self
Assign the raw contains option (in place).
Sourcepub const fn not_contains(&self) -> Option<&B>
pub const fn not_contains(&self) -> Option<&B>
The not_contains operand, or None while the operator is absent.
Sourcepub fn with_not_contains(self, value: B) -> Self
pub fn with_not_contains(self, value: B) -> Self
Set not_contains to Some(value) (consuming).
Sourcepub fn set_not_contains(&mut self, value: B) -> &mut Self
pub fn set_not_contains(&mut self, value: B) -> &mut Self
Set not_contains to Some(value) (in place).
Sourcepub fn maybe_not_contains(self, value: Option<B>) -> Self
pub fn maybe_not_contains(self, value: Option<B>) -> Self
Assign the raw not_contains option (consuming).
Sourcepub fn update_not_contains(&mut self, value: Option<B>) -> &mut Self
pub fn update_not_contains(&mut self, value: Option<B>) -> &mut Self
Assign the raw not_contains option (in place).
Sourcepub fn in_(&self) -> Option<&[B]>
pub fn in_(&self) -> Option<&[B]>
The in_ operands, or None while the operator is absent.
A PRESENT but empty list is not the same as an absent operator: the first asks for no
rows, the second for every row, so Some(&[]) and None say different things.
Sourcepub fn set_in_(&mut self, value: impl Into<Box<[B]>>) -> &mut Self
pub fn set_in_(&mut self, value: impl Into<Box<[B]>>) -> &mut Self
Set in_ to Some(value) (in place).
Sourcepub fn maybe_in_(self, value: Option<impl Into<Box<[B]>>>) -> Self
pub fn maybe_in_(self, value: Option<impl Into<Box<[B]>>>) -> Self
Assign the in_ list option (consuming).
Sourcepub fn update_in_(&mut self, value: Option<impl Into<Box<[B]>>>) -> &mut Self
pub fn update_in_(&mut self, value: Option<impl Into<Box<[B]>>>) -> &mut Self
Assign the in_ list option (in place).
Sourcepub fn not_in(&self) -> Option<&[B]>
pub fn not_in(&self) -> Option<&[B]>
The not_in operands, or None while the operator is absent.
A PRESENT but empty list is not the same as an absent operator: the first asks for no
rows, the second for every row, so Some(&[]) and None say different things.
Sourcepub fn with_not_in(self, value: impl Into<Box<[B]>>) -> Self
pub fn with_not_in(self, value: impl Into<Box<[B]>>) -> Self
Set not_in to Some(value) (consuming).
Sourcepub fn set_not_in(&mut self, value: impl Into<Box<[B]>>) -> &mut Self
pub fn set_not_in(&mut self, value: impl Into<Box<[B]>>) -> &mut Self
Set not_in to Some(value) (in place).
Sourcepub fn maybe_not_in(self, value: Option<impl Into<Box<[B]>>>) -> Self
pub fn maybe_not_in(self, value: Option<impl Into<Box<[B]>>>) -> Self
Assign the not_in list option (consuming).
Sourcepub fn update_not_in(&mut self, value: Option<impl Into<Box<[B]>>>) -> &mut Self
pub fn update_not_in(&mut self, value: Option<impl Into<Box<[B]>>>) -> &mut Self
Assign the not_in list option (in place).
Sourcepub const fn is_referential(&self) -> bool
pub const fn is_referential(&self) -> bool
True when this filter’s ONLY set operator is a plain eq or a plain in_ — the shape a
relation may rewrite onto the PARENT’s foreign key instead of running a subquery.
Sound only under referential integrity: every fk references an existing child row, so
fk IN (SELECT key FROM child WHERE key = v) is exactly fk = v. A negated shape
(ne/not_in) is NOT equivalent under dangling references, an ordering operator does not
name a single child row, and a byte-substring match names a set of them — so none of them ever
collapses.
The kind that answers with the fewest reservations, and the last of the four to be asked. A
byte eq is bitwise on every backend — no collation, no case fold — so the assumption the
collapse makes about two columns comparing alike is the assumption a byte column cannot get
wrong, where TextFilter::is_referential carries that question as a recorded one. The
omission was a legacy-wire artifact: text answered and bytes did not, which had the order
backwards.
Sourcepub fn try_map<C, E, F>(self, f: F) -> Result<BytesFilter<C, I>, E>
pub fn try_map<C, E, F>(self, f: F) -> Result<BytesFilter<C, I>, E>
Convert every set operand with f, keeping the operator set exactly as it stands — see
ScalarFilter::try_map for what this primitive is for and what it promises about lists.
Trait Implementations§
Source§impl<B: Clone, I> Clone for BytesFilter<B, I>
impl<B: Clone, I> Clone for BytesFilter<B, I>
Source§impl<B: Debug, I> Debug for BytesFilter<B, I>
impl<B: Debug, I> Debug for BytesFilter<B, I>
Source§impl<B, I> Default for BytesFilter<B, I>
impl<B, I> Default for BytesFilter<B, I>
Source§impl<B, I> EqualsFilter<B> for BytesFilter<B, I>
The bound’s row: new() and the inherent with_eq, reached where the kind is a parameter rather
than a spelling.
impl<B, I> EqualsFilter<B> for BytesFilter<B, I>
The bound’s row: new() and the inherent with_eq, reached where the kind is a parameter rather
than a spelling.
Source§impl<B, I> GraphqlFilter for BytesFilter<B, I>
impl<B, I> GraphqlFilter for BytesFilter<B, I>
impl<B, I> InputObjectType for BytesFilter<B, I>
async-graphql only.Source§impl<B, I> InputType for BytesFilter<B, I>
Available on crate feature async-graphql only.The VARIABLE WIRE FACE — ONE generic impl over the reading, where this crate carried a single
concrete registration and four byte vocabularies had none at all.
impl<B, I> InputType for BytesFilter<B, I>
async-graphql only.The VARIABLE WIRE FACE — ONE generic impl over the reading, where this crate carried a single concrete registration and four byte vocabularies had none at all.
§What one row buys that one concrete row could not
Vec<u8> was registered and bytes::Bytes, the smol_bytes trio and [u8; N] were not — each
wanting a concrete impl only this crate could write, and none of them having been asked for. A
DECLARING crate’s own digest was worse off than that: impl InputType for BytesFilter<Sum> is
E0117 there, and a generic row here would have overlapped the concrete one (E0119). Every row
is a BytesWire row on Builtin now, so the framework’s absences are one
line each and a declarer’s own operand joins by writing that trait on a marker it owns.
§The NAME is the reading’s, undecorated
A blob publishes exactly what its row says. The width that used to decorate this name belongs to
FixedBytesFilter now and is spelled at that face, which is why the pair a shape-blind name
would have put under one GraphQL type is two types under two names — and why neither of them has
to ask the other what it published.
The rest of the reasoning is ScalarFilter’s, one kind over: the NAME comes from the reading,
the bound is the reading and not B: InputType, and B: Send + Sync is InputType’s own
supertrait reaching the operand through the ten slots.
Source§fn parse(value: Option<Value>) -> InputValueResult<Self>
fn parse(value: Option<Value>) -> InputValueResult<Self>
The SHORTHAND LAW at the byte face — rule ①, a bare value under eq, crossing the reading’s
carrier exactly as the longhand’s does.
Source§type RawValueType = BytesFilter<B, I>
type RawValueType = BytesFilter<B, I>
Source§fn create_type_info(registry: &mut Registry) -> String
fn create_type_info(registry: &mut Registry) -> String
Source§fn as_raw_value(&self) -> Option<&Self::RawValueType>
fn as_raw_value(&self) -> Option<&Self::RawValueType>
Source§fn qualified_type_name() -> String
fn qualified_type_name() -> String
Source§impl<B, I> NullableFace for BytesFilter<B, I>
Available on crate feature async-graphql only.The NULLABLE row — the two pieces Nullable’s own blanket assembles this kind’s twin from.
impl<B, I> NullableFace for BytesFilter<B, I>
async-graphql only.The NULLABLE row — the two pieces Nullable’s own blanket assembles this kind’s twin from.
Source§fn bare_fields(registry: &mut Registry) -> IndexMap<String, MetaInputValue>
fn bare_fields(registry: &mut Registry) -> IndexMap<String, MetaInputValue>
isNull appended.Source§impl<B: PartialEq, I> PartialEq for BytesFilter<B, I>
impl<B: PartialEq, I> PartialEq for BytesFilter<B, I>
Source§impl<D, V, I, Db> ToDatabaseComparison<V, Db> for BytesFilter<D, I>
Available on crate feature sqlx only.The lowering promise is stated as the COMPARISON’s own bound, for the reason
SqlTextComparison’s row gives: this kind lowers through three
concrete per-dialect impls, so there is no generic bound list to restate — only the fact that
the dialect in hand has one of them.
impl<D, V, I, Db> ToDatabaseComparison<V, Db> for BytesFilter<D, I>
sqlx only.The lowering promise is stated as the COMPARISON’s own bound, for the reason
SqlTextComparison’s row gives: this kind lowers through three
concrete per-dialect impls, so there is no generic bound list to restate — only the fact that
the dialect in hand has one of them.
Source§type Comparison = SqlBytesComparison<V, Db>
type Comparison = SqlBytesComparison<V, Db>
V and lowering for Db.Source§impl<D, V: MongoCarrier, I> ToDatabaseComparison<V, Mongo> for BytesFilter<D, I>
Available on crate feature mongo only.One backend, so one row — and the header naming Mongo concretely is what keeps it from
overlapping the SQL one, for the coherence reason
MongoScalarComparison’s row records.
impl<D, V: MongoCarrier, I> ToDatabaseComparison<V, Mongo> for BytesFilter<D, I>
mongo only.One backend, so one row — and the header naming Mongo concretely is what keeps it from
overlapping the SQL one, for the coherence reason
MongoScalarComparison’s row records.
The bound is the LOWERING’s and it is exactly the carrier. Nothing here derives a value from an
operand the way a LIKE pattern or a $regex does, so a byte column asks for no
AsRef<[u8]> — the one bound MongoTextComparison’s row carries
that this does not, and the same place the SQL family’s three bytes impls land.
The WIDTH is not stated here. What decides a refusal is the crossing’s bound rather than the
lowering’s, and the crossing is deliberately not an item bound on this map — see
ToDatabaseComparison for why that promise cannot travel with the projection.
Source§type Comparison = MongoBytesComparison<V>
type Comparison = MongoBytesComparison<V>
V and lowering for Db.Source§impl<D, V: TryFrom<D>, I> TryFromFilter<BytesFilter<D, I>> for MongoBytesComparison<V>
Available on crate feature mongo only.The BLOB’s crossing with no declared converter: the storage type’s own TryFrom.
impl<D, V: TryFrom<D>, I> TryFromFilter<BytesFilter<D, I>> for MongoBytesComparison<V>
mongo only.The BLOB’s crossing with no declared converter: the storage type’s own TryFrom.
Its error is MongoBytesCrossingError, so the identity crossing reaches
Infallible in the Operand
half alone: MongoBytesCrossingError<Infallible> keeps two inhabited variants, because neither
refusal has anything to do with converting.
It calls the GATE rather than the public entry, so the identity path pays nothing for the normalisation that entry’s bound needs.
Source§type Error = MongoBytesCrossingError<<V as TryFrom<D>>::Error>
type Error = MongoBytesCrossingError<<V as TryFrom<D>>::Error>
Source§fn try_from_filter(filter: BytesFilter<D, I>) -> Result<Self, Self::Error>
fn try_from_filter(filter: BytesFilter<D, I>) -> Result<Self, Self::Error>
filter into this comparison, or report why an operand could not follow.Source§impl<D, V, I, Db> TryFromFilter<BytesFilter<D, I>> for SqlBytesComparison<V, Db>where
V: TryFrom<D>,
Available on crate feature sqlx only.The crossing with no declared converter: the storage type’s own TryFrom.
impl<D, V, I, Db> TryFromFilter<BytesFilter<D, I>> for SqlBytesComparison<V, Db>where
V: TryFrom<D>,
sqlx only.The crossing with no declared converter: the storage type’s own TryFrom.
Its error is the CONVERTER’s, like every other kind’s in this family. It was
BytesCrossingError<V::Error> while a fixed column’s substring refusal lived here — an error
with a second inhabited variant even at Infallible, which meant
the identity crossing over a blob genuinely could not fail and the type would not say so. It says
so now, for both kinds, because there is nothing left to refuse.
Source§impl<B, C, I> TryMapFilter<B, C> for BytesFilter<B, I>
The bound’s row.
impl<B, C, I> TryMapFilter<B, C> for BytesFilter<B, I>
The bound’s row.
Auto Trait Implementations§
impl<B, I> Freeze for BytesFilter<B, I>
impl<B, I> RefUnwindSafe for BytesFilter<B, I>where
Option<B>: RefUnwindSafe,
Option<Box<[B]>>: RefUnwindSafe,
PhantomData<fn() -> I>: RefUnwindSafe,
impl<B, I> Send for BytesFilter<B, I>
impl<B, I> Sync for BytesFilter<B, I>
impl<B, I> Unpin for BytesFilter<B, I>
impl<B, I> UnsafeUnpin for BytesFilter<B, I>
impl<B, I> UnwindSafe for BytesFilter<B, I>
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
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,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<C> FlattenFace for Cwhere
C: NullableFace,
impl<C> FlattenFace for Cwhere
C: NullableFace,
Source§fn flat_read<F>(
object: &IndexMap<Name, ConstValue>,
) -> Result<C, InputValueError<F>>where
F: InputType,
Available on crate feature async-graphql only.
fn flat_read<F>(
object: &IndexMap<Name, ConstValue>,
) -> Result<C, InputValueError<F>>where
F: InputType,
async-graphql only.The object is CLONED, and the clone is the honest cost of splicing: the component’s parser takes an owned value, and the host’s other fields are read off the same object either side of this call. Handing the last splice the owned map would save one clone in the one-splice case and make the emission depend on which field came last.
Source§fn flat_fields(registry: &mut Registry) -> IndexMap<String, MetaInputValue>
fn flat_fields(registry: &mut Registry) -> IndexMap<String, MetaInputValue>
async-graphql only.Source§fn flat_values(&self) -> IndexMap<Name, ConstValue>
fn flat_values(&self) -> IndexMap<Name, ConstValue>
async-graphql only.Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.Source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.Source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.Source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.Source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.Source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.Source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.Source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.impl<T> Fruit for T
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§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 moreSource§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.Source§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> SearchOptionsFace for Twhere
T: InputType,
Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.