i_slint_core::model

Struct SortModel

Source
pub struct SortModel<M, F>(/* private fields */)
where
    M: Model + 'static,
    F: SortHelper<M::Data> + 'static;
Expand description

Provides a sorted view of rows by another Model.

When the other Model is updated, the Sorted is updated accordingly.

Generic parameters:

  • M the type of the wrapped Model.
  • F a type that provides an order to model rows. It is constrained by the internal trait SortHelper, which is used to sort the model in ascending order if the model data supports it, or by a given sort function.

§Example

Here we have a VecModel holding crate::SharedStrings. It is then sorted into a SortModel.

let model = VecModel::from(vec![
    SharedString::from("Lorem"),
    SharedString::from("ipsum"),
    SharedString::from("dolor"),
]);

let sorted_model = SortModel::new(model, |lhs, rhs| lhs.to_lowercase().cmp(&rhs.to_lowercase()));

assert_eq!(sorted_model.row_data(0).unwrap(), SharedString::from("dolor"));
assert_eq!(sorted_model.row_data(1).unwrap(), SharedString::from("ipsum"));
assert_eq!(sorted_model.row_data(2).unwrap(), SharedString::from("Lorem"));

Alternatively you can use the shortcut ModelExt::sort_by.

let sorted_model = VecModel::from(vec![
    SharedString::from("Lorem"),
    SharedString::from("ipsum"),
    SharedString::from("dolor"),
]).sort_by(|lhs, rhs| lhs.to_lowercase().cmp(&rhs.to_lowercase()));

It is also possible to get a ascending sorted SortModel order for core::cmp::Ord type items.

let model = VecModel::from(vec![
    5,
    1,
    3,
]);

let sorted_model = SortModel::new_ascending(model);

assert_eq!(sorted_model.row_data(0).unwrap(), 1);
assert_eq!(sorted_model.row_data(1).unwrap(), 3);
assert_eq!(sorted_model.row_data(2).unwrap(), 5);

Alternatively you can use the shortcut ModelExt::sort.

let sorted_model = VecModel::from(vec![
    5,
    1,
    3,
]).sort();

If you want to modify the underlying VecModel you can give it a Rc of the SortModel:

let model = Rc::new(VecModel::from(vec![
    SharedString::from("Lorem"),
    SharedString::from("ipsum"),
    SharedString::from("dolor"),
]));

let sorted_model = SortModel::new(model.clone(), |lhs, rhs| lhs.to_lowercase().cmp(&rhs.to_lowercase()));

assert_eq!(sorted_model.row_data(0).unwrap(), SharedString::from("dolor"));
assert_eq!(sorted_model.row_data(1).unwrap(), SharedString::from("ipsum"));
assert_eq!(sorted_model.row_data(2).unwrap(), SharedString::from("Lorem"));

model.set_row_data(1, SharedString::from("opsom"));

assert_eq!(sorted_model.row_data(0).unwrap(), SharedString::from("dolor"));
assert_eq!(sorted_model.row_data(1).unwrap(), SharedString::from("Lorem"));
assert_eq!(sorted_model.row_data(2).unwrap(), SharedString::from("opsom"));

Implementations§

Source§

impl<M, F> SortModel<M, F>
where M: Model + 'static, F: FnMut(&M::Data, &M::Data) -> Ordering + 'static,

Source

pub fn new(wrapped_model: M, sort_function: F) -> Self
where F: FnMut(&M::Data, &M::Data) -> Ordering + 'static,

Creates a new SortModel based on the given wrapped_model and sorted by sort_function. Alternatively you can use ModelExt::sort_by on your Model.

Source

pub fn source_model(&self) -> &M

Returns a reference to the inner model

Source§

impl<M> SortModel<M, AscendingSortHelper>
where M: Model + 'static, M::Data: Ord,

Source

pub fn new_ascending(wrapped_model: M) -> Self
where M::Data: Ord,

Creates a new SortModel based on the given wrapped_model and sorted in ascending order. Alternatively you can use ModelExt::sort on your Model.

Source

pub fn reset(&self)

Manually reapply the sorting. You need to run this e.g. if the sort function depends on mutable state and it has changed.

Source

pub fn unsorted_row(&self, sorted_row: usize) -> usize

Gets the row index of the underlying unsorted model for a given sorted row index.

Trait Implementations§

Source§

impl<M, S> Model for SortModel<M, S>
where M: Model + 'static, S: SortHelper<M::Data>,

Source§

type Data = <M as Model>::Data

The model data: A model is a set of rows and each row has this data
Source§

fn row_count(&self) -> usize

The number of rows in the model
Source§

fn row_data(&self, row: usize) -> Option<Self::Data>

Returns the data for a particular row. Read more
Source§

fn set_row_data(&self, row: usize, data: Self::Data)

Sets the data for a particular row. Read more
Source§

fn model_tracker(&self) -> &dyn ModelTracker

The implementation should return a reference to its ModelNotify field. Read more
Source§

fn as_any(&self) -> &dyn Any

Return something that can be downcast’ed (typically self) Read more
Source§

fn iter(&self) -> ModelIterator<'_, Self::Data>
where Self: Sized,

Returns an iterator visiting all elements of the model.

Auto Trait Implementations§

§

impl<M, F> Freeze for SortModel<M, F>

§

impl<M, F> !RefUnwindSafe for SortModel<M, F>

§

impl<M, F> !Send for SortModel<M, F>

§

impl<M, F> !Sync for SortModel<M, F>

§

impl<M, F> Unpin for SortModel<M, F>

§

impl<M, F> !UnwindSafe for SortModel<M, F>

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<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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> ModelExt for T
where T: Model,

Source§

fn row_data_tracked(&self, row: usize) -> Option<Self::Data>

Convenience function that calls ModelTracker::track_row_data_changes before returning Model::row_data. Read more
Source§

fn map<F, U>(self, map_function: F) -> MapModel<Self, F>
where Self: Sized + 'static, F: Fn(Self::Data) -> U + 'static,

Returns a new Model where all elements are mapped by the function map_function. This is a shortcut for MapModel::new().
Source§

fn filter<F>(self, filter_function: F) -> FilterModel<Self, F>
where Self: Sized + 'static, F: Fn(&Self::Data) -> bool + 'static,

Returns a new Model where the elements are filtered by the function filter_function. This is a shortcut for FilterModel::new().
Source§

fn sort(self) -> SortModel<Self, AscendingSortHelper>
where Self: Sized + 'static, Self::Data: Ord,

Returns a new Model where the elements are sorted ascending. This is a shortcut for SortModel::new_ascending().
Source§

fn sort_by<F>(self, sort_function: F) -> SortModel<Self, F>
where Self: Sized + 'static, F: FnMut(&Self::Data, &Self::Data) -> Ordering + 'static,

Returns a new Model where the elements are sorted by the function sort_function. This is a shortcut for SortModel::new().
Source§

fn reverse(self) -> ReverseModel<Self>
where Self: Sized + 'static,

Returns a new Model where the elements are reversed. This is a shortcut for ReverseModel::new().
Source§

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

Source§

type Error = Infallible

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

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

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.