Struct ListStore

Source

pub struct ListStore { /* private fields */ }

👎Deprecated: Since 4.10

Expand description

Use Gio::ListStore instead A list-like data structure that can be used with the TreeView.

The ListStore object is a list model for use with a TreeView widget. It implements the TreeModel interface, and consequentialy, can use all of the methods available there. It also implements the TreeSortable interface so it can be sorted by the view. Finally, it also implements the tree drag and drop interfaces.

The ListStore can accept most GTypes as a column type, though it can’t accept all custom types. Internally, it will keep a copy of data passed in (such as a string or a boxed pointer). Columns that accept GObjects are handled a little differently. The ListStore will keep a reference to the object instead of copying the value. As a result, if the object is modified, it is up to the application writer to call TreeModelExt::row_changed() to emit the row_changed signal. This most commonly affects lists with gdk::Textures stored.

An example for creating a simple list store:

⚠️ The following code is in c ⚠️

enum {
  COLUMN_STRING,
  COLUMN_INT,
  COLUMN_BOOLEAN,
  N_COLUMNS
};

{
  GtkListStore *list_store;
  GtkTreePath *path;
  GtkTreeIter iter;
  int i;

  list_store = gtk_list_store_new (N_COLUMNS,
                                   G_TYPE_STRING,
                                   G_TYPE_INT,
                                   G_TYPE_BOOLEAN);

  for (i = 0; i < 10; i++)
    {
      char *some_data;

      some_data = get_some_data (i);

      // Add a new row to the model
      gtk_list_store_append (list_store, &iter);
      gtk_list_store_set (list_store, &iter,
                          COLUMN_STRING, some_data,
                          COLUMN_INT, i,
                          COLUMN_BOOLEAN,  FALSE,
                          -1);

      // As the store will keep a copy of the string internally,
      // we free some_data.
      g_free (some_data);
    }

  // Modify a particular row
  path = gtk_tree_path_new_from_string ("4");
  gtk_tree_model_get_iter (GTK_TREE_MODEL (list_store),
                           &iter,
                           path);
  gtk_tree_path_free (path);
  gtk_list_store_set (list_store, &iter,
                      COLUMN_BOOLEAN, TRUE,
                      -1);
}

ListStore is deprecated since GTK 4.10, and should not be used in newly written code. You should use Gio::ListStore instead, and the various list models provided by GTK.

§Performance Considerations

Internally, the ListStore was originally implemented with a linked list with a tail pointer. As a result, it was fast at data insertion and deletion, and not fast at random data access. The ListStore sets the GTK_TREE_MODEL_ITERS_PERSIST flag, which means that TreeIters can be cached while the row exists. Thus, if access to a particular row is needed often and your code is expected to run on older versions of GTK, it is worth keeping the iter around.

§Atomic Operations

It is important to note that only the methods gtk_list_store_insert_with_values() and gtk_list_store_insert_with_valuesv() are atomic, in the sense that the row is being appended to the store and the values filled in in a single operation with regard to TreeModel signaling. In contrast, using e.g. gtk_list_store_append() and then gtk_list_store_set() will first create a row, which triggers the GtkTreeModel::row-inserted signal on ListStore. The row, however, is still empty, and any signal handler connecting to GtkTreeModel::row-inserted on this particular store should be prepared for the situation that the row might be empty. This is especially important if you are wrapping the ListStore inside a TreeModelFilter and are using a TreeModelFilterVisibleFunc. Using any of the non-atomic operations to append rows to the ListStore will cause the TreeModelFilterVisibleFunc to be visited with an empty row first; the function must be prepared for that.

§GtkListStore as GtkBuildable

The GtkListStore implementation of the Buildable interface allows to specify the model columns with a <columns> element that may contain multiple <column> elements, each specifying one model column. The “type” attribute specifies the data type for the column.

Additionally, it is possible to specify content for the list store in the UI definition, with the <data> element. It can contain multiple <row> elements, each specifying to content for one row of the list model. Inside a <row>, the <col> elements specify the content for individual cells.

Note that it is probably more common to define your models in the code, and one might consider it a layering violation to specify the content of a list store in a UI definition, data, not presentation, and common wisdom is to separate the two, as far as possible.

An example of a UI Definition fragment for a list store:

<object class="GtkListStore">
  <columns>
    <column type="gchararray"/>
    <column type="gchararray"/>
    <column type="gint"/>
  </columns>
  <data>
    <row>
      <col id="0">John</col>
      <col id="1">Doe</col>
      <col id="2">25</col>
    </row>
    <row>
      <col id="0">Johan</col>
      <col id="1">Dahlin</col>
      <col id="2">50</col>
    </row>
  </data>
</object>

§Implements

[trait@glib::ObjectExt], BuildableExt, TreeDragDestExt, TreeDragSourceExt, TreeModelExt, TreeSortableExt, TreeModelExtManual, TreeSortableExtManual

GLib type: GObject with reference counted clone semantics.

Struct ListStoreCopy item path

§Performance Considerations

§Atomic Operations

§GtkListStore as GtkBuildable

§Implements

Implementations§

impl ListStore

pub fn append(&self) -> TreeIter

§Deprecated since 4.10

§Returns

§iter

pub fn clear(&self)

§Deprecated since 4.10

pub fn insert(&self, position: i32) -> TreeIter

§Deprecated since 4.10

§position

§Returns

§iter

pub fn insert_after(&self, sibling: Option<&TreeIter>) -> TreeIter

§Deprecated since 4.10

§sibling

§Returns

§iter

pub fn insert_before(&self, sibling: Option<&TreeIter>) -> TreeIter

§Deprecated since 4.10

§sibling

§Returns

§iter

pub fn iter_is_valid(&self, iter: &TreeIter) -> bool

§Deprecated since 4.10

§iter

§Returns

pub fn move_after(&self, iter: &TreeIter, position: Option<&TreeIter>)

§Deprecated since 4.10

§iter

§position

pub fn move_before(&self, iter: &TreeIter, position: Option<&TreeIter>)

§Deprecated since 4.10

§iter

§position

pub fn prepend(&self) -> TreeIter

§Deprecated since 4.10

§Returns

§iter

pub fn remove(&self, iter: &TreeIter) -> bool

§Deprecated since 4.10

§iter

§Returns

pub fn swap(&self, a: &TreeIter, b: &TreeIter)

§Deprecated since 4.10

§a

§b

impl ListStore

pub fn new(column_types: &[Type]) -> Self

§Deprecated since 4.10

§Returns

pub fn insert_with_values( &self, position: Option<u32>, columns_and_values: &[(u32, &dyn ToValue)], ) -> TreeIter

§Deprecated since 4.10

§position

§columns

§values

§Returns

§iter

pub fn reorder(&self, new_order: &[u32])

§Deprecated since 4.10

§new_order

pub fn set(&self, iter: &TreeIter, columns_and_values: &[(u32, &dyn ToValue)])

§Deprecated since 4.10

§iter

pub fn set_column_types(&self, types: &[Type])

§Deprecated since 4.10

§types

pub fn set_value(&self, iter: &TreeIter, column: u32, value: &Value)

§Deprecated since 4.10

§iter

§column

§value

Trait Implementations§

impl Clone for ListStore

fn clone(&self) -> Self

Struct ListStore

§`iter`

§`position`

§`iter`

§`sibling`

§`iter`

§`sibling`

§`iter`

§`iter`

§`iter`

§`position`

§`iter`

§`position`

§`iter`

§`iter`

§`a`

§`b`

§`position`

§`columns`

§`values`

§`iter`

§`new_order`

§`iter`

§`types`

§`iter`

§`column`

§`value`

fn hash<H>(&self, state: &mut H)
where H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

fn max(self, other: Self) -> Self
where Self: Sized,

fn min(self, other: Self) -> Self
where Self: Sized,

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

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

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

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

impl<O> BuildableExt for O
where O: IsA<Buildable>,

impl<T> Cast for T
where T: ObjectType,

fn upcast<T>(self) -> T
where T: ObjectType, Self: IsA<T>,

fn upcast_ref<T>(&self) -> &T
where T: ObjectType, Self: IsA<T>,

fn downcast<T>(self) -> Result<T, Self>
where T: ObjectType, Self: MayDowncastTo<T>,

fn downcast_ref<T>(&self) -> Option<&T>
where T: ObjectType, Self: MayDowncastTo<T>,

fn dynamic_cast<T>(self) -> Result<T, Self>
where T: ObjectType,

fn dynamic_cast_ref<T>(&self) -> Option<&T>
where T: ObjectType,

unsafe fn unsafe_cast<T>(self) -> T
where T: ObjectType,

unsafe fn unsafe_cast_ref<T>(&self) -> &T
where T: ObjectType,

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