/* Extensive GtkListStore tests. * Copyright ( C ) 2007 Imendio AB * Authors : Kristian Rietveld < kris @ imendio . com > * * This library is free software ; you can redistribute it and / or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation ; either * version 2 of the License , or ( at your option ) any later version . * * This library is distributed in the hope that it will be useful , * but WITHOUT ANY WARRANTY ; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the GNU * Lesser General Public License for more details . * * You should have received a copy of the GNU Lesser General Public * License along with this library . If not , see < http : //www.gnu.org/licenses/>.
/* To do: * - Test implementations of the interfaces : DnD , sortable , buildable * and the tree model interface itself ? * - Need to check if the emitted signals are right . * - Needs analysis with the code coverage tool once it is there .
#include <gtk/gtk.h>
#include "treemodel.h"
static inline gboolean
iters_equal (GtkTreeIter *a,
GtkTreeIter *b)
{
if (a->stamp != b->stamp)
return FALSE ;
if (a->user_data != b->user_data)
return FALSE ;
/* user_data2 and user_data3 are not used in GtkListStore */
return TRUE ;
}
static gboolean
iter_position (GtkListStore *store,
GtkTreeIter *iter,
int n)
{
gboolean ret =
TRUE ;
GtkTreePath *path;
path = gtk_tree_model_get_path (GTK_TREE_MODEL (store), iter);
if (!path)
return FALSE ;
if (gtk_tree_path_get_indices (path)[
0 ] != n)
ret =
FALSE ;
gtk_tree_path_free (path);
return ret;
}
/* * Fixture
typedef struct
{
GtkTreeIter iter[
5 ];
GtkListStore *store;
} ListStore;
static void
list_store_setup (ListStore *fixture,
gconstpointer test_data)
{
int i;
fixture->store = gtk_list_store_new (
1 , G_TYPE_INT);
for (i =
0 ; i <
5 ; i++)
{
gtk_list_store_insert (fixture->store, &fixture->iter[i], i);
gtk_list_store_set (fixture->store, &fixture->iter[i],
0 , i, -
1 );
}
}
static void
list_store_teardown (ListStore *fixture,
gconstpointer test_data)
{
g_object_unref (fixture->store);
}
/* * The actual tests .
static void
check_model (ListStore *fixture,
int *new_order,
int skip)
{
int i;
GtkTreePath *path;
path = gtk_tree_path_new ();
gtk_tree_path_down (path);
/* Check validity of the model and validity of the iters-persistent * claim .
for (i =
0 ; i <
5 ; i++)
{
GtkTreeIter iter;
if (i == skip)
continue ;
/* The saved iterator at new_order[i] should match the iterator * at i .
gtk_tree_model_get_iter (GTK_TREE_MODEL (fixture->store),
&iter, path);
g_assert_true (gtk_list_store_iter_is_valid (fixture->store, &iter));
g_assert_true (iters_equal (&iter, &fixture->iter[new_order[i]]));
gtk_tree_path_next (path);
}
gtk_tree_path_free (path);
}
/* insertion */
static void
list_store_test_insert_high_values (
void )
{
GtkTreeIter iter, iter2;
GtkTreeIter iter_copy;
GtkListStore *store;
store = gtk_list_store_new (
1 , G_TYPE_INT);
gtk_list_store_insert (store, &iter,
1234 );
g_assert_true (gtk_list_store_iter_is_valid (store, &iter));
g_assert_cmpint (gtk_tree_model_iter_n_children (GTK_TREE_MODEL (store), NULL), ==,
1 )
;0 ));765 );2 );/* Walk over the model */ 0 ));1 ));1 ));1 ));0 ));static void void )1 , G_TYPE_INT);1 );0 ));2 );/* Walk over the model */ 0 ));1 ));1 ));1 ));0 ));static void void )1 , G_TYPE_INT);1 );0 ));2 );/* Walk over the model */ 0 ));1 ));1 ));1 ));0 ));static void void )1 , G_TYPE_INT);3 );1 ));1 ));/* Walk over the model */ 0 ));1 ));2 ));2 ));2 ));1 ));0 ));static void void )1 , G_TYPE_INT);/* move_after NULL is basically a prepend */ 2 );/* Walk over the model */ 0 ));1 ));0 ));1 ));1 ));0 ));static void void )1 , G_TYPE_INT);3 );1 ));1 ));/* Walk over the model */ 0 ));1 ));2 ));1 ));2 ));2 ));1 ));0 ));static void void )1 , G_TYPE_INT);/* move_before NULL is basically an append */ 2 );/* Walk over the model */ 0 ));1 ));1 ));1 ));0 ));/* setting values */ static void void )/* https://bugzilla.gnome.org/show_bug.cgi?id=677649 */ 1 , G_TYPE_LONG);42 );0 , &value);/* removal */ static void int new_order[5 ] = { -1 , 1 , 2 , 3 , 4 };/* Remove node at 0 */ 0 , -1 );0 ]));1 ]));0 );static void int new_order[5 ] = { 0 , 1 , -1 , 3 , 4 };/* Remove node at 2 */ 2 , -1 );2 ]));3 ]));2 );static void int new_order[5 ] = { 0 , 1 , 2 , 3 , -1 };/* Remove node at 4 */ 4 , -1 );4 ]));4 );static void int i;L), ==, 0 );for (i = 0 ; i < 5 ; i++)/* reorder */ static void int new_order[5 ] = { 4 , 1 , 0 , 2 , 3 };1 );/* swapping */ static void /* We swap nodes 0 and 1 at the beginning */ int new_order[5 ] = { 1 , 0 , 2 , 3 , 4 };nbsp;"0" ));nbsp;"1" ));1 );static void /* We swap nodes 2 and 3 in the middle that are next to each other */ int new_order[5 ] = { 0 , 1 , 3 , 2 , 4 };nbsp;"2" ));nbsp;"3" ));1 );static void /* We swap nodes 1 and 3 in the middle that are apart from each other */ int new_order[5 ] = { 0 , 3 , 2 , 1 , 4 };nbsp;"1" ));nbsp;"3" ));1 );static void /* We swap nodes 3 and 4 at the end */ int new_order[5 ] = { 0 , 1 , 2 , 4 , 3 };nbsp;"3" ));nbsp;"4" ));1 );static void void )1 , G_TYPE_INT);/* Check if swap on a store with a single node does not corrupt * the store . /* move after */ static void /* We move node 0 after 2 */ int new_order[5 ] = { 1 , 2 , 0 , 3 , 4 };nbsp;"0" ));nbsp;"2" ));1 );static void /* We move node 2 after 3 */ int new_order[5 ] = { 0 , 1 , 3 , 2 , 4 };nbsp;"2" ));nbsp;"3" ));1 );static void /* We move node 1 after 3 */ int new_order[5 ] = { 0 , 2 , 3 , 1 , 4 };nbsp;"1" ));nbsp;"3" ));1 );static void /* We move node 2 after 4 */ int new_order[5 ] = { 0 , 1 , 3 , 4 , 2 };nbsp;"2" ));nbsp;"4" ));1 );static void /* We move node 4 after 1 */ int new_order[5 ] = { 0 , 1 , 4 , 2 , 3 };nbsp;"4" ));nbsp;"1" ));1 );static void /* We move 0 after 4, this will cause both the head and tail ends to * change . int new_order[5 ] = { 1 , 2 , 3 , 4 , 0 };nbsp;"0" ));nbsp;"4" ));1 );static void /* We move node 2, NULL should prepend */ int new_order[5 ] = { 2 , 0 , 1 , 3 , 4 };nbsp;"2" ));1 );static void void )1 , G_TYPE_INT);/* Check if move-after on a store with a single node does not corrupt * the store . /* move before */ static void /* We move node 3 before 2 */ int new_order[5 ] = { 0 , 1 , 3 , 2 , 4 };nbsp;"3" ));nbsp;"2" ));1 );static void /* We move node 1 before 3 */ int new_order[5 ] = { 0 , 2 , 1 , 3 , 4 };nbsp;"1" ));nbsp;"3" ));1 );static void /* We move node 2 before 0 */ int new_order[5 ] = { 2 , 0 , 1 , 3 , 4 };nbsp;"2" ));nbsp;"0" ));1 );static void /* We move node 4 before 2 (replace end) */ int new_order[5 ] = { 0 , 1 , 4 , 2 , 3 };nbsp;"4" ));nbsp;"2" ));1 );static void /* We move node 4 before 0 */ int new_order[5 ] = { 4 , 0 , 1 , 2 , 3 };nbsp;"4" ));nbsp;"0" ));1 );static void /* We move node 2, NULL should append */ int new_order[5 ] = { 0 , 1 , 3 , 4 , 2 };nbsp;"2" ));1 );static void void )1 , G_TYPE_INT);/* Check if move-before on a store with a single node does not corrupt * the store . /* iter invalidation */ static void 0 );static void 4 , -1 );0 );static void 0 );static void 0 ));0 );static void 0 );/* main */ void void )/* insertion */ "/ListStore/insert-high-values" ,"/ListStore/append" ,"/ListStore/prepend" ,"/ListStore/insert-after" ,"/ListStore/insert-after-NULL" ,"/ListStore/insert-before" ,"/ListStore/insert-before-NULL" ,/* setting values (FIXME) */ "/ListStore/set-gvalue-to-transform" ,/* removal */ "/ListStore/remove-begin" , ListStore, NULL,"/ListStore/remove-middle" , ListStore, NULL,"/ListStore/remove-end" , ListStore, NULL,"/ListStore/clear" , ListStore, NULL,/* reordering */ "/ListStore/reorder" , ListStore, NULL,/* swapping */ "/ListStore/swap-begin" , ListStore, NULL,"/ListStore/swap-middle-next" , ListStore, NULL,"/ListStore/swap-middle-apart" , ListStore, NULL,"/ListStore/swap-end" , ListStore, NULL,"/ListStore/swap-single" ,/* moving */ "/ListStore/move-after-from-start" , ListStore, NULL,"/ListStore/move-after-next" , ListStore, NULL,"/ListStore/move-after-apart" , ListStore, NULL,"/ListStore/move-after-end" , ListStore, NULL,"/ListStore/move-after-from-end" , ListStore, NULL,"/ListStore/move-after-change-ends" , ListStore, NULL,"/ListStore/move-after-NULL" , ListStore, NULL,"/ListStore/move-after-single" ,"/ListStore/move-before-next" , ListStore, NULL,"/ListStore/move-before-apart" , ListStore, NULL,"/ListStore/move-before-to-start" , ListStore, NULL,"/ListStore/move-before-from-end" , ListStore, NULL,"/ListStore/move-before-change-ends" , ListStore, NULL,"/ListStore/move-before-NULL" , ListStore, NULL,"/ListStore/move-before-single" ,/* iter invalidation */ "/ListStore/iter-prev-invalid" , ListStore, NULL,"/ListStore/iter-next-invalid" , ListStore, NULL,"/ListStore/iter-children-invalid" , ListStore, NULL,"/ListStore/iter-nth-child-invalid" , ListStore, NULL,"/ListStore/iter-parent-invalid" , ListStore, NULL, Messung V0.5 in Prozent C=97 H=96 G=96
¤ Diese beiden folgenden Angebotsgruppen bietet das Unternehmen0.18Angebot
(Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können 2026-07-02)
¤ *Eine klare Vorstellung vom Zielzustand
