view pixmaps/join.xpm @ 5438:6e7ba9efd1f4

[gaim-migrate @ 5820] I wrote sort-by-status. Index: src/gtkblist.c =================================================================== RCS file: /cvsroot/gaim/gaim/src/gtkblist.c,v retrieving revision 1.28 diff -u -r1.28 gtkblist.c --- src/gtkblist.c 18 May 2003 07:54:53 -0000 1.28 +++ src/gtkblist.c 18 May 2003 21:13:36 -0000 @@ -1319,11 +1320,11 @@ void gaim_gtk_blist_setup_sort_methods() { - gaim_gtk_blist_sort_method_reg("None", sort_method_none); - gaim_gtk_blist_sort_method_reg("Alphabetical", sort_method_alphabetical); - gaim_gtk_blist_sort_method_reg("By status", sort_method_status); - gaim_gtk_blist_sort_method_reg("By log size", sort_method_log); - gaim_gtk_blist_sort_method_set(sort_method[0] ? sort_method : "None"); + gaim_gtk_blist_sort_method_reg(_("None"), sort_method_none); + gaim_gtk_blist_sort_method_reg(_("Alphabetical"), sort_method_alphabetical); + gaim_gtk_blist_sort_method_reg(_("By status"), sort_method_status); + gaim_gtk_blist_sort_method_reg(_("By log size"), sort_method_log); + gaim_gtk_blist_sort_method_set(sort_method[0] ? sort_method : _("None")); } @@ -2229,15 +2230,23 @@ if (n && GAIM_BLIST_NODE_IS_BUDDY(n)) { struct buddy *new = (struct buddy*)node, *it = (struct buddy*)n; - - if (it->idle > new->idle) + printf("Add %s (%d) before %s (%d)... ", new->name, new->idle, it->name, it->idle); + + /* This is the worst if statement ever. */ + if ((it->present < new->present) || + ((it->present == new->present) && (it->uc & UC_UNAVAILABLE) > (new->uc & UC_UNAVAILABLE)) || + ((it->present == new->present) && ((it->uc & UC_UNAVAILABLE) == (new->uc & UC_UNAVAILABLE)) && + ((it->idle && !new->idle) || (it->idle && (it->idle < new->idle)))) || + + ((it->present == new->present) && (it->uc & UC_UNAVAILABLE) == (new->uc & UC_UNAVAILABLE) && (it->idle == new->idle) && + (gaim_utf8_strcasecmp(gaim_get_buddy_alias((struct buddy*)node), gaim_get_buddy_alias((struct buddy*)n)) < 0))) { - printf("Inserting %s before %s\n", new->name, it->name); + printf("yes\n"); gtk_tree_store_insert_before(gtkblist->treemodel, &iter, &groupiter, &more_z); newpath = gtk_tree_model_get_path(GTK_TREE_MODEL(gtkblist->treemodel), &iter); gtknode->row = gtk_tree_row_reference_new(GTK_TREE_MODEL(gtkblist->treemodel), newpath); gtk_tree_path_free(newpath); return iter; } + printf("no\n"); g_value_unset(&val); } } while (gtk_tree_model_iter_next (GTK_TREE_MODEL(gtkblist->treemodel), &more_z)); committer: Tailor Script <tailor@pidgin.im>
author Sean Egan <seanegan@gmail.com>
date Sun, 18 May 2003 21:17:31 +0000
parents 725ffb93aedc
children
line wrap: on
line source

/* XPM */
static char * join_xpm[] = {
"24 24 41 1",
" 	c None",
".	c #212121",
"+	c #EAD4CB",
"@	c #E3C5BA",
"#	c #DBB4A4",
"$	c #EEDED7",
"%	c #FAF7F5",
"&	c #F2E5E1",
"*	c #D2AC99",
"=	c #000000",
"-	c #8D9E7C",
";	c #CDD9C2",
">	c #DEE6D7",
",	c #DAE2D1",
"'	c #9BAD89",
")	c #B79382",
"!	c #707D63",
"~	c #B4C6A2",
"{	c #ACC098",
"]	c #636E57",
"^	c #AB8A7A",
"/	c #E4E9DD",
"(	c #657158",
"_	c #C49F8D",
":	c #C3D1B5",
"<	c #808F70",
"[	c #4C5442",
"}	c #58634E",
"|	c #E6EBE0",
"1	c #D4DDC9",
"2	c #CAD7BE",
"3	c #90A17F",
"4	c #5F6A53",
"5	c #535C49",
"6	c #E9EDE4",
"7	c #616D56",
"8	c #A8BC95",
"9	c #7C8B6E",
"0	c #4C5443",
"a	c #B6C2AA",
"b	c #5E6953",
"                        ",
"                        ",
"                        ",
"                        ",
"                        ",
"                        ",
"             ...        ",
"           ..+@#..      ",
"           .$%&@*.      ",
"       =======+#**.     ",
"       =-;>,'=###).     ",
"        =!~{]=##*^.     ",
"      ==/;{(]=#*_.      ",
"    ==/;:{<[}=))..      ",
"   =|12{{34=5=..        ",
"    =6{{{7= ==          ",
"     =>890=             ",
"      =a]=              ",
"       =b=              ",
"        =               ",
"                        ",
"                        ",
"                        ",
"                        "};