1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
use crate::{ListStore, TreeIter, TreeModel};
use glib::object::Cast;
use glib::translate::*;
use glib::{ToValue, Type, Value};
use libc::c_int;
use std::ptr;
impl ListStore {
#[doc(alias = "gtk_list_store_newv")]
#[doc(alias = "gtk_list_store_new")]
pub fn new(column_types: &[Type]) -> Self {
assert_initialized_main_thread!();
unsafe {
let mut column_types = column_types
.iter()
.map(|t| t.into_glib())
.collect::<Vec<_>>();
from_glib_full(ffi::gtk_list_store_newv(
column_types.len() as c_int,
column_types.as_mut_ptr(),
))
}
}
#[doc(alias = "gtk_list_store_insert_with_values")]
#[doc(alias = "gtk_list_store_insert_with_valuesv")]
pub fn insert_with_values(
&self,
position: Option<u32>,
columns_and_values: &[(u32, &dyn ToValue)],
) -> TreeIter {
unsafe {
assert!(
position.unwrap_or(0) <= i32::max_value() as u32,
"can't have more than {} rows",
i32::max_value()
);
let n_columns =
ffi::gtk_tree_model_get_n_columns(self.upcast_ref::<TreeModel>().to_glib_none().0)
as u32;
assert!(
columns_and_values.len() <= n_columns as usize,
"got values for {} columns but only {} columns exist",
columns_and_values.len(),
n_columns
);
for (column, value) in columns_and_values {
assert!(
*column < n_columns,
"got column {} which is higher than the number of columns {}",
*column,
n_columns
);
let type_ = from_glib(ffi::gtk_tree_model_get_column_type(
self.upcast_ref::<TreeModel>().to_glib_none().0,
*column as c_int,
));
assert!(
Value::type_transformable(value.value_type(), type_),
"column {} is of type {} but found value of type {}",
*column,
type_,
value.value_type()
);
}
let columns = columns_and_values
.iter()
.map(|(c, _)| *c)
.collect::<Vec<_>>();
let values = columns_and_values
.iter()
.map(|(_, v)| v.to_value())
.collect::<Vec<_>>();
let mut iter = TreeIter::uninitialized();
ffi::gtk_list_store_insert_with_valuesv(
self.to_glib_none().0,
iter.to_glib_none_mut().0,
position.map_or(-1, |n| n as c_int),
mut_override(columns.as_ptr() as *const c_int),
mut_override(values.as_ptr() as *const glib::gobject_ffi::GValue),
columns.len() as c_int,
);
iter
}
}
#[doc(alias = "gtk_list_store_reorder")]
pub fn reorder(&self, new_order: &[u32]) {
unsafe {
let count = ffi::gtk_tree_model_iter_n_children(
self.upcast_ref::<TreeModel>().to_glib_none().0,
ptr::null_mut(),
);
let safe_count = count as usize == new_order.len();
debug_assert!(
safe_count,
"Incorrect `new_order` slice length. Expected `{}`, found `{}`.",
count,
new_order.len()
);
let safe_values = new_order.iter().max().map_or(true, |&max| {
let max = max as i32;
max >= 0 && max < count
});
debug_assert!(
safe_values,
"Some `new_order` slice values are out of range. Maximum safe value: \
`{}`. The slice contents: `{:?}`",
count - 1,
new_order
);
if safe_count && safe_values {
ffi::gtk_list_store_reorder(
self.to_glib_none().0,
mut_override(new_order.as_ptr() as *const c_int),
);
}
}
}
#[doc(alias = "gtk_list_store_set")]
#[doc(alias = "gtk_list_store_set_valuesv")]
#[doc(alias = "gtk_list_store_set_valist")]
pub fn set(&self, iter: &TreeIter, columns_and_values: &[(u32, &dyn ToValue)]) {
unsafe {
let n_columns =
ffi::gtk_tree_model_get_n_columns(self.upcast_ref::<TreeModel>().to_glib_none().0)
as u32;
assert!(
columns_and_values.len() <= n_columns as usize,
"got values for {} columns but only {} columns exist",
columns_and_values.len(),
n_columns
);
for (column, value) in columns_and_values {
assert!(
*column < n_columns,
"got column {} which is higher than the number of columns {}",
*column,
n_columns
);
let type_ = from_glib(ffi::gtk_tree_model_get_column_type(
self.upcast_ref::<TreeModel>().to_glib_none().0,
*column as c_int,
));
assert!(
Value::type_transformable(value.value_type(), type_),
"column {} is of type {} but found value of type {}",
*column,
type_,
value.value_type()
);
}
let columns = columns_and_values
.iter()
.map(|(c, _)| *c)
.collect::<Vec<_>>();
let values = columns_and_values
.iter()
.map(|(_, v)| v.to_value())
.collect::<Vec<_>>();
ffi::gtk_list_store_set_valuesv(
self.to_glib_none().0,
mut_override(iter.to_glib_none().0),
mut_override(columns.as_ptr() as *const c_int),
mut_override(values.as_ptr() as *const glib::gobject_ffi::GValue),
columns.len() as c_int,
);
}
}
#[doc(alias = "gtk_list_store_set_column_types")]
pub fn set_column_types(&self, types: &[glib::Type]) {
unsafe {
let types_ptr: Vec<glib::ffi::GType> = types.iter().map(|t| t.into_glib()).collect();
ffi::gtk_list_store_set_column_types(
self.to_glib_none().0,
types.len() as i32,
mut_override(types_ptr.as_ptr()),
)
}
}
#[doc(alias = "gtk_list_store_set_value")]
pub fn set_value(&self, iter: &TreeIter, column: u32, value: &Value) {
unsafe {
let columns =
ffi::gtk_tree_model_get_n_columns(self.upcast_ref::<TreeModel>().to_glib_none().0)
as u32;
assert!(
column < columns,
"got column {} which is higher than the number of columns {}",
column,
columns
);
let type_ = from_glib(ffi::gtk_tree_model_get_column_type(
self.upcast_ref::<TreeModel>().to_glib_none().0,
column as c_int,
));
assert!(
Value::type_transformable(value.type_(), type_),
"column {} is of type {} but found value of type {}",
column,
type_,
value.type_()
);
ffi::gtk_list_store_set_value(
self.to_glib_none().0,
mut_override(iter.to_glib_none().0),
column as c_int,
mut_override(value.to_glib_none().0),
);
}
}
}
