Mercurial > pidgin.yaz

comparison src/gtkblist.c @ 5439:66e875239458

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[gaim-migrate @ 5821] remove debug stuff. committer: Tailor Script <tailor@pidgin.im>
author Sean Egan <seanegan@gmail.com>
date Sun, 18 May 2003 21:18:52 +0000
parents 6e7ba9efd1f4
children e1cc0c67e123
comparison
equal deleted inserted replaced
5438:6e7ba9efd1f4 5439:66e875239458
2228 gtk_tree_model_get_value (GTK_TREE_MODEL(gtkblist->treemodel), &more_z, NODE_COLUMN, &val); 2228 gtk_tree_model_get_value (GTK_TREE_MODEL(gtkblist->treemodel), &more_z, NODE_COLUMN, &val);
2229 n = g_value_get_pointer(&val); 2229 n = g_value_get_pointer(&val);
2230 2230
2231 if (n && GAIM_BLIST_NODE_IS_BUDDY(n)) { 2231 if (n && GAIM_BLIST_NODE_IS_BUDDY(n)) {
2232 struct buddy *new = (struct buddy*)node, *it = (struct buddy*)n; 2232 struct buddy *new = (struct buddy*)node, *it = (struct buddy*)n;
2233 printf("Add %s (%d) before %s (%d)... ", new->name, new->idle, it->name, it->idle);
2234 /* This is the worst if statement ever. */ 2233 /* This is the worst if statement ever. */
2235 if ((it->present < new->present) || 2234 if ((it->present < new->present) ||
2236 ((it->present == new->present) && (it->uc & UC_UNAVAILABLE) > (new->uc & UC_UNAVAILABLE)) || 2235 ((it->present == new->present) && (it->uc & UC_UNAVAILABLE) > (new->uc & UC_UNAVAILABLE)) ||
2237 ((it->present == new->present) && ((it->uc & UC_UNAVAILABLE) == (new->uc & UC_UNAVAILABLE)) && 2236 ((it->present == new->present) && ((it->uc & UC_UNAVAILABLE) == (new->uc & UC_UNAVAILABLE)) &&
2238 ((it->idle && !new->idle) || (it->idle && (it->idle < new->idle)))) || 2237 ((it->idle && !new->idle) || (it->idle && (it->idle < new->idle)))) ||
2239 ((it->present == new->present) && (it->uc & UC_UNAVAILABLE) == (new->uc & UC_UNAVAILABLE) && (it->idle == new->idle) && 2238 ((it->present == new->present) && (it->uc & UC_UNAVAILABLE) == (new->uc & UC_UNAVAILABLE) && (it->idle == new->idle) &&
2240 (gaim_utf8_strcasecmp(gaim_get_buddy_alias((struct buddy*)node), gaim_get_buddy_alias((struct buddy*)n)) < 0))) 2239 (gaim_utf8_strcasecmp(gaim_get_buddy_alias((struct buddy*)node), gaim_get_buddy_alias((struct buddy*)n)) < 0)))
2241 { 2240 {
2242 printf("yes\n");
2243 gtk_tree_store_insert_before(gtkblist->treemodel, &iter, &groupiter, &more_z); 2241 gtk_tree_store_insert_before(gtkblist->treemodel, &iter, &groupiter, &more_z);
2244 newpath = gtk_tree_model_get_path(GTK_TREE_MODEL(gtkblist->treemodel), &iter); 2242 newpath = gtk_tree_model_get_path(GTK_TREE_MODEL(gtkblist->treemodel), &iter);
2245 gtknode->row = gtk_tree_row_reference_new(GTK_TREE_MODEL(gtkblist->treemodel), newpath); 2243 gtknode->row = gtk_tree_row_reference_new(GTK_TREE_MODEL(gtkblist->treemodel), newpath);
2246 gtk_tree_path_free(newpath); 2244 gtk_tree_path_free(newpath);
2247 return iter; 2245 return iter;
2248 } 2246 }
2249 printf("no\n");
2250 g_value_unset(&val); 2247 g_value_unset(&val);
2251 } 2248 }
2252 } while (gtk_tree_model_iter_next (GTK_TREE_MODEL(gtkblist->treemodel), &more_z)); 2249 } while (gtk_tree_model_iter_next (GTK_TREE_MODEL(gtkblist->treemodel), &more_z));
2253 2250
2254 gtk_tree_store_append(gtkblist->treemodel, &iter, &groupiter); 2251 gtk_tree_store_append(gtkblist->treemodel, &iter, &groupiter);