Skip to main content

BytesFilter

Struct BytesFilter 

Source
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>

Source

pub const fn new() -> Self

The empty filter — no operator set.

Source

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.

Source

pub const fn eq(&self) -> Option<&B>

The eq operand, or None while the operator is absent.

Source

pub fn with_eq(self, value: B) -> Self

Set eq to Some(value) (consuming).

Source

pub fn set_eq(&mut self, value: B) -> &mut Self

Set eq to Some(value) (in place).

Source

pub fn maybe_eq(self, value: Option<B>) -> Self

Assign the raw eq option (consuming).

Source

pub fn update_eq(&mut self, value: Option<B>) -> &mut Self

Assign the raw eq option (in place).

Source

pub const fn ne(&self) -> Option<&B>

The ne operand, or None while the operator is absent.

Source

pub fn with_ne(self, value: B) -> Self

Set ne to Some(value) (consuming).

Source

pub fn set_ne(&mut self, value: B) -> &mut Self

Set ne to Some(value) (in place).

Source

pub fn maybe_ne(self, value: Option<B>) -> Self

Assign the raw ne option (consuming).

Source

pub fn update_ne(&mut self, value: Option<B>) -> &mut Self

Assign the raw ne option (in place).

Source

pub const fn gt(&self) -> Option<&B>

The gt operand, or None while the operator is absent.

Source

pub fn with_gt(self, value: B) -> Self

Set gt to Some(value) (consuming).

Source

pub fn set_gt(&mut self, value: B) -> &mut Self

Set gt to Some(value) (in place).

Source

pub fn maybe_gt(self, value: Option<B>) -> Self

Assign the raw gt option (consuming).

Source

pub fn update_gt(&mut self, value: Option<B>) -> &mut Self

Assign the raw gt option (in place).

Source

pub const fn gte(&self) -> Option<&B>

The gte operand, or None while the operator is absent.

Source

pub fn with_gte(self, value: B) -> Self

Set gte to Some(value) (consuming).

Source

pub fn set_gte(&mut self, value: B) -> &mut Self

Set gte to Some(value) (in place).

Source

pub fn maybe_gte(self, value: Option<B>) -> Self

Assign the raw gte option (consuming).

Source

pub fn update_gte(&mut self, value: Option<B>) -> &mut Self

Assign the raw gte option (in place).

Source

pub const fn lt(&self) -> Option<&B>

The lt operand, or None while the operator is absent.

Source

pub fn with_lt(self, value: B) -> Self

Set lt to Some(value) (consuming).

Source

pub fn set_lt(&mut self, value: B) -> &mut Self

Set lt to Some(value) (in place).

Source

pub fn maybe_lt(self, value: Option<B>) -> Self

Assign the raw lt option (consuming).

Source

pub fn update_lt(&mut self, value: Option<B>) -> &mut Self

Assign the raw lt option (in place).

Source

pub const fn lte(&self) -> Option<&B>

The lte operand, or None while the operator is absent.

Source

pub fn with_lte(self, value: B) -> Self

Set lte to Some(value) (consuming).

Source

pub fn set_lte(&mut self, value: B) -> &mut Self

Set lte to Some(value) (in place).

Source

pub fn maybe_lte(self, value: Option<B>) -> Self

Assign the raw lte option (consuming).

Source

pub fn update_lte(&mut self, value: Option<B>) -> &mut Self

Assign the raw lte option (in place).

Source

pub const fn contains(&self) -> Option<&B>

The contains operand, or None while the operator is absent.

Source

pub fn with_contains(self, value: B) -> Self

Set contains to Some(value) (consuming).

Source

pub fn set_contains(&mut self, value: B) -> &mut Self

Set contains to Some(value) (in place).

Source

pub fn maybe_contains(self, value: Option<B>) -> Self

Assign the raw contains option (consuming).

Source

pub fn update_contains(&mut self, value: Option<B>) -> &mut Self

Assign the raw contains option (in place).

Source

pub const fn not_contains(&self) -> Option<&B>

The not_contains operand, or None while the operator is absent.

Source

pub fn with_not_contains(self, value: B) -> Self

Set not_contains to Some(value) (consuming).

Source

pub fn set_not_contains(&mut self, value: B) -> &mut Self

Set not_contains to Some(value) (in place).

Source

pub fn maybe_not_contains(self, value: Option<B>) -> Self

Assign the raw not_contains option (consuming).

Source

pub fn update_not_contains(&mut self, value: Option<B>) -> &mut Self

Assign the raw not_contains option (in place).

Source

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.

Source

pub fn with_in_(self, value: impl Into<Box<[B]>>) -> Self

Set in_ to Some(value) (consuming).

Source

pub fn set_in_(&mut self, value: impl Into<Box<[B]>>) -> &mut Self

Set in_ to Some(value) (in place).

Source

pub fn maybe_in_(self, value: Option<impl Into<Box<[B]>>>) -> Self

Assign the in_ list option (consuming).

Source

pub fn update_in_(&mut self, value: Option<impl Into<Box<[B]>>>) -> &mut Self

Assign the in_ list option (in place).

Source

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.

Source

pub fn with_not_in(self, value: impl Into<Box<[B]>>) -> Self

Set not_in to Some(value) (consuming).

Source

pub fn set_not_in(&mut self, value: impl Into<Box<[B]>>) -> &mut Self

Set not_in to Some(value) (in place).

Source

pub fn maybe_not_in(self, value: Option<impl Into<Box<[B]>>>) -> Self

Assign the not_in list option (consuming).

Source

pub fn update_not_in(&mut self, value: Option<impl Into<Box<[B]>>>) -> &mut Self

Assign the not_in list option (in place).

Source

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.

Source

pub fn try_map<C, E, F>(self, f: F) -> Result<BytesFilter<C, I>, E>
where F: FnMut(B) -> Result<C, 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>

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<B: Debug, I> Debug for BytesFilter<B, I>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<B, I> Default for BytesFilter<B, I>

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
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.

Source§

fn equals(value: B) -> Self

The empty filter with its equality operator set to value — this column is exactly this.
Source§

impl<B, I> GraphqlFilter for BytesFilter<B, I>

Source§

fn is_empty(&self) -> bool

True while NO operator slot is set — so a lowering would emit nothing for this field.
Source§

impl<B, I> InputObjectType for BytesFilter<B, I>
where B: Send + Sync, I: BytesWire<B>, I::Carrier: InputType,

Available on crate feature async-graphql only.
Source§

impl<B, I> InputType for BytesFilter<B, I>
where B: Send + Sync, I: BytesWire<B>, I::Carrier: InputType,

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.

§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>

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>

The raw type used for validator. Read more
Source§

fn type_name() -> Cow<'static, str>

Type the name.
Source§

fn create_type_info(registry: &mut Registry) -> String

Create type information in the registry and return qualified typename.
Source§

fn to_value(&self) -> Value

Convert to a Value for introspection.
Source§

fn as_raw_value(&self) -> Option<&Self::RawValueType>

Returns a reference to the raw value.
Source§

fn qualified_type_name() -> String

Qualified typename.
Source§

impl<B, I> NullableFace for BytesFilter<B, I>
where B: Send + Sync, I: BytesWire<B>, I::Carrier: InputType,

Available on crate feature 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>

This face’s input fields, in the order it publishes them — the list the nullable twin registers with isNull appended.
Source§

fn bare_values(&self) -> IndexMap<Name, Value>

This face’s rendered slots, in that same order — the map the nullable twin renders with isNull appended.
Source§

impl<B: PartialEq, I> PartialEq for BytesFilter<B, I>

Source§

fn eq(&self, other: &Self) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
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.

Source§

type Comparison = SqlBytesComparison<V, Db>

The comparison a filter of this kind crosses into, holding 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.

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>

The comparison a filter of this kind crosses into, holding 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.

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>

Why a filter’s operands did not become storage values.
Source§

fn try_from_filter(filter: BytesFilter<D, I>) -> Result<Self, Self::Error>

Cross 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.

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§

type Error = <V as TryFrom<D>>::Error

Why a filter’s operands did not become storage values.
Source§

fn try_from_filter(filter: BytesFilter<D, I>) -> Result<Self, Self::Error>

Cross filter into this comparison, or report why an operand could not follow.
Source§

impl<B, C, I> TryMapFilter<B, C> for BytesFilter<B, I>

The bound’s row.

Source§

type Mapped = BytesFilter<C, I>

This kind carrying V where Self carries D.
Source§

fn try_map_filter<E, F>(self, f: F) -> Result<Self::Mapped, E>
where F: FnMut(B) -> Result<C, E>,

Convert every operand with f, keeping the operator set exactly as it stands. Read more

Auto Trait Implementations§

§

impl<B, I> Freeze for BytesFilter<B, I>
where Option<B>: Freeze, Option<Box<[B]>>: Freeze, PhantomData<fn() -> I>: Freeze,

§

impl<B, I> RefUnwindSafe for BytesFilter<B, I>

§

impl<B, I> Send for BytesFilter<B, I>
where Option<B>: Send, Option<Box<[B]>>: Send, PhantomData<fn() -> I>: Send,

§

impl<B, I> Sync for BytesFilter<B, I>
where Option<B>: Sync, Option<Box<[B]>>: Sync, PhantomData<fn() -> I>: Sync,

§

impl<B, I> Unpin for BytesFilter<B, I>
where Option<B>: Unpin, Option<Box<[B]>>: Unpin, PhantomData<fn() -> I>: Unpin,

§

impl<B, I> UnsafeUnpin for BytesFilter<B, I>

§

impl<B, I> UnwindSafe for BytesFilter<B, I>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Conv for T

Source§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
Source§

impl<T> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts 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>

Converts 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)

Converts &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)

Converts &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
where T: Any + Send,

Source§

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

Source§

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Send + Sync>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync> ⓘ

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<C> FlattenFace for C
where 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.

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>

Available on crate feature async-graphql only.
The fields this component contributes to its host’s registration.
Source§

fn flat_values(&self) -> IndexMap<Name, ConstValue>

Available on crate feature async-graphql only.
The rendered slots this component contributes to its host’s render, in the order it publishes them.
Source§

impl<T> FmtForward for T

Source§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
Source§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
Source§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
Source§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
Source§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
Source§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
Source§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
Source§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
Source§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Fruit for T
where T: Send + Downcast,

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts 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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts 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
Source§

impl<T> Pipe for T
where T: ?Sized,

Source§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
Source§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
Source§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
Source§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows 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
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows 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
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
Source§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> SearchOptionsFace for T
where T: InputType,

Source§

impl<T> State<Identity> for T

Source§

type Output = T

The type Self projects to.
Source§

impl<T> Tap for T

Source§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
Source§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
Source§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
Source§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
Source§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
Source§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
Source§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
Source§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
Source§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
Source§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .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
where Self: BorrowMut<B>, B: ?Sized,

Calls .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
where Self: AsRef<R>, R: ?Sized,

Calls .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
where Self: AsMut<R>, R: ?Sized,

Calls .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
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
Source§

impl<F, V, Db> ToCrossedComparison<V, Db> for F

Source§

fn cross( self, ) -> Result<<F as ToDatabaseComparison<V, Db>>::Comparison, Box<dyn Error + Send + Sync>>

Cross this filter into the comparison the map names for it. Read more
Source§

fn empty() -> <F as ToDatabaseComparison<V, Db>>::Comparison

The EMPTY comparison of this kind: what a column the client said nothing about lowers to. Read more
Source§

impl<F, V, Db> ToFlattenedComparison<V, Db> for F

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> TryConv for T

Source§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more