Struct ArrayCol 

pub struct ArrayCol<T> { /* private fields */ }

A Vec<T>-typed column (Postgres array).

Implementations

impl<T> ArrayCol<T>

pub const fn new(name: &'static str) -> Self

pub fn asc(&self) -> OrderExpr<T>

SQL ORDER BY ... ASC. Postgres array ordering is element-wise lexicographic — rarely what the user wants, but well-defined.

pub fn desc(&self) -> OrderExpr<T>

SQL ORDER BY ... DESC.

pub fn contains<V: Into<Value>>(&self, elem: V) -> Predicate<T>

SQL col @> ARRAY[elem] (Postgres contains).

Returns true if every element of ARRAY[elem] is present in the column’s array — i.e. elem appears in the array. Use Self::contains_all when checking multiple elements at once.

Postgres-only. ArrayCol is system-check-gated against SQLite, so the SQL fragment this emits only ever renders against a PostgresQueryBuilder.

pub fn contains_all<I, V>(&self, elems: I) -> Predicate<T>

where I: IntoIterator<Item = V>, V: Into<Value>,

SQL col @> ARRAY[elems...] (Postgres contains-all).

Returns true if every element of elems is present in the column’s array. An empty elems returns vacuously true (the empty set is contained by every set), which Postgres also reports — but the renderer requires at least one element to produce a typed ARRAY[...] literal; passing an empty iterator returns a tautology predicate (1 = 1).

pub fn contained_by<I, V>(&self, elems: I) -> Predicate<T>

where I: IntoIterator<Item = V>, V: Into<Value>,

SQL col <@ ARRAY[elems...] (Postgres contained-by).

Returns true if every element of the column’s array is in elems — i.e. the column is a subset of the supplied set.

pub fn overlaps<I, V>(&self, elems: I) -> Predicate<T>

where I: IntoIterator<Item = V>, V: Into<Value>,

SQL col && ARRAY[elems...] (Postgres overlaps).

Returns true if the column’s array and elems share at least one element.