view pixmaps/bigsmile.xpm @ 842:2804dc8e9ba0

[gaim-migrate @ 852] HTML widget is faster, more stable :) oh my cs teacher would be so proud. here's a description of the old algorithm and my new improved one: old algorithm: print as much text as we can. then try printing the rest of it. with at 4000 character message, this usually leads to a stack about 200 functions deep. depending on the amound of memory you have, this may have lead to a segfault. new algorithm: if we can print it all, print it all. if we can't { if we've already printed stuff on this line then finish printing the line. print the first half of the stuff, then the second half. } this usually leads to a stack no deeper than about 20 functions. it also causes the widget to be much faster. committer: Tailor Script <[e-mail]>

/* XPM */
static char * bigsmile_xpm[] = {
"19 19 7 1",
" 	c None",
".	c #000000",
"+	c #CCCC00",
"@	c #FFFF00",
"#	c #333300",
"$	c #CCCC33",
"%	c #FFFFFF",
"      .......      ",
"    ..+@@@@@+..    ",
"   .+@@@@@@@@@+.   ",
"  .@@@@@@@@@@@@@.  ",
" .+@....@@@....@+. ",
" .@#.$$..@..$$.#@. ",
".+.@@@@@@@@@@@@@.+.",
".@..@@@@@@@@@@@..@.",
".@.%.@@@@@@@@@.%.@.",
".@.%..@@@@@@@..%.@.",
".@.%.%.......%.%.@.",
".@...%.%%.%%.%...@.",
".+.%.%.%%.%%.%.%.+.",
" ..%...........%.. ",
" .+..%.%%.%%.%..+. ",
"  .+.%.%%.%%.%.@.  ",
"   .+.........+.   ",
"    ..+@@@@@+..    ",
"      .......      "};