i = position - i;
while (i < position + query_n_items)
{
+ g_assert (item != NULL);
if (item->widget)
{
g_queue_push_tail (released, item->widget);
g_assert_not_reached ();
item = gtk_rb_tree_node_get_next (next);
}
- else
+ else
{
item = next;
}
if (offset > 0)
{
+ g_assert (item != NULL);
new_item = gtk_rb_tree_insert_before (self->items, item);
new_item->n_items = offset;
item->n_items -= offset;
for (i = 0; i < query_n_items; i++)
{
+ g_assert (item != NULL);
if (item->n_items > 1)
{
new_item = gtk_rb_tree_insert_before (self->items, item);