pub struct IntegerField<T, N> { /* private fields */ }query only.Expand description
A typed handle for a fixed-width integer field N on T.
Only the ten portable fixed-width Rust integer primitives have authoring methods.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> = __private::integer_field("row", "count");
let _ = field.eq(7_i64);Implementations§
Source§impl<T> IntegerField<T, i8>
impl<T> IntegerField<T, i8>
Sourcepub fn eq(self, value: i8) -> FilterExpr<T>
pub fn eq(self, value: i8) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = i8>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = i8>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = i8>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = i8>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: i8) -> FilterExpr<T>
pub fn lt(self, bound: i8) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: i8) -> FilterExpr<T>
pub fn lte(self, bound: i8) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: i8) -> FilterExpr<T>
pub fn gt(self, bound: i8) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: i8) -> FilterExpr<T>
pub fn gte(self, bound: i8) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, i16>
impl<T> IntegerField<T, i16>
Sourcepub fn eq(self, value: i16) -> FilterExpr<T>
pub fn eq(self, value: i16) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = i16>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = i16>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = i16>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = i16>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: i16) -> FilterExpr<T>
pub fn lt(self, bound: i16) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: i16) -> FilterExpr<T>
pub fn lte(self, bound: i16) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: i16) -> FilterExpr<T>
pub fn gt(self, bound: i16) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: i16) -> FilterExpr<T>
pub fn gte(self, bound: i16) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, i32>
impl<T> IntegerField<T, i32>
Sourcepub fn eq(self, value: i32) -> FilterExpr<T>
pub fn eq(self, value: i32) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = i32>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = i32>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = i32>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = i32>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: i32) -> FilterExpr<T>
pub fn lt(self, bound: i32) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: i32) -> FilterExpr<T>
pub fn lte(self, bound: i32) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: i32) -> FilterExpr<T>
pub fn gt(self, bound: i32) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: i32) -> FilterExpr<T>
pub fn gte(self, bound: i32) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, i64>
impl<T> IntegerField<T, i64>
Sourcepub fn eq(self, value: i64) -> FilterExpr<T>
pub fn eq(self, value: i64) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = i64>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = i64>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = i64>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = i64>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: i64) -> FilterExpr<T>
pub fn lt(self, bound: i64) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: i64) -> FilterExpr<T>
pub fn lte(self, bound: i64) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: i64) -> FilterExpr<T>
pub fn gt(self, bound: i64) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: i64) -> FilterExpr<T>
pub fn gte(self, bound: i64) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, i128>
impl<T> IntegerField<T, i128>
Sourcepub fn eq(self, value: i128) -> FilterExpr<T>
pub fn eq(self, value: i128) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = i128>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = i128>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = i128>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = i128>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: i128) -> FilterExpr<T>
pub fn lt(self, bound: i128) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: i128) -> FilterExpr<T>
pub fn lte(self, bound: i128) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: i128) -> FilterExpr<T>
pub fn gt(self, bound: i128) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: i128) -> FilterExpr<T>
pub fn gte(self, bound: i128) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, u8>
impl<T> IntegerField<T, u8>
Sourcepub fn eq(self, value: u8) -> FilterExpr<T>
pub fn eq(self, value: u8) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = u8>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = u8>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = u8>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = u8>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: u8) -> FilterExpr<T>
pub fn lt(self, bound: u8) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: u8) -> FilterExpr<T>
pub fn lte(self, bound: u8) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: u8) -> FilterExpr<T>
pub fn gt(self, bound: u8) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: u8) -> FilterExpr<T>
pub fn gte(self, bound: u8) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, u16>
impl<T> IntegerField<T, u16>
Sourcepub fn eq(self, value: u16) -> FilterExpr<T>
pub fn eq(self, value: u16) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = u16>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = u16>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = u16>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = u16>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: u16) -> FilterExpr<T>
pub fn lt(self, bound: u16) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: u16) -> FilterExpr<T>
pub fn lte(self, bound: u16) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: u16) -> FilterExpr<T>
pub fn gt(self, bound: u16) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: u16) -> FilterExpr<T>
pub fn gte(self, bound: u16) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, u32>
impl<T> IntegerField<T, u32>
Sourcepub fn eq(self, value: u32) -> FilterExpr<T>
pub fn eq(self, value: u32) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = u32>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = u32>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = u32>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = u32>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: u32) -> FilterExpr<T>
pub fn lt(self, bound: u32) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: u32) -> FilterExpr<T>
pub fn lte(self, bound: u32) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: u32) -> FilterExpr<T>
pub fn gt(self, bound: u32) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: u32) -> FilterExpr<T>
pub fn gte(self, bound: u32) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, u64>
impl<T> IntegerField<T, u64>
Sourcepub fn eq(self, value: u64) -> FilterExpr<T>
pub fn eq(self, value: u64) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = u64>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = u64>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = u64>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = u64>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: u64) -> FilterExpr<T>
pub fn lt(self, bound: u64) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: u64) -> FilterExpr<T>
pub fn lte(self, bound: u64) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: u64) -> FilterExpr<T>
pub fn gt(self, bound: u64) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: u64) -> FilterExpr<T>
pub fn gte(self, bound: u64) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);Source§impl<T> IntegerField<T, u128>
impl<T> IntegerField<T, u128>
Sourcepub fn eq(self, value: u128) -> FilterExpr<T>
pub fn eq(self, value: u128) -> FilterExpr<T>
Compare with one exact fixed-width integer value.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
assert_eq!(field.eq(1), field.eq(1));Sourcepub fn is_in(self, values: impl IntoIterator<Item = u128>) -> FilterExpr<T>
pub fn is_in(self, values: impl IntoIterator<Item = u128>) -> FilterExpr<T>
Test membership in an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.is_in([1, 2]);Sourcepub fn not_in(self, values: impl IntoIterator<Item = u128>) -> FilterExpr<T>
pub fn not_in(self, values: impl IntoIterator<Item = u128>) -> FilterExpr<T>
Test exclusion from an ordered set of fixed-width integers.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.not_in([1, 2]);Sourcepub fn lt(self, bound: u128) -> FilterExpr<T>
pub fn lt(self, bound: u128) -> FilterExpr<T>
Test that the field is below a bound.
Ordering exists for integers and not for text or booleans, so a comparison that has no meaning for a field’s type does not compile.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lt(10);Sourcepub fn lte(self, bound: u128) -> FilterExpr<T>
pub fn lte(self, bound: u128) -> FilterExpr<T>
Test that the field is at or below a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.lte(10);Sourcepub fn gt(self, bound: u128) -> FilterExpr<T>
pub fn gt(self, bound: u128) -> FilterExpr<T>
Test that the field is above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gt(1);Sourcepub fn gte(self, bound: u128) -> FilterExpr<T>
pub fn gte(self, bound: u128) -> FilterExpr<T>
Test that the field is at or above a bound.
§Examples
use libtmux::query::IntegerField;
use libtmux::query::__private;
struct Row;
let field: IntegerField<Row, i64> =
__private::integer_field("row", "count");
let _ = field.gte(1);