|
Lines 988-994
Link Here
|
| 988 |
void OutputWindow::sort_cb(Fl_Widget* o, void*v) { |
988 |
void OutputWindow::sort_cb(Fl_Widget* o, void*v) { |
| 989 |
OutputWindow* d = (OutputWindow*)(o->window()); |
989 |
OutputWindow* d = (OutputWindow*)(o->window()); |
| 990 |
int (*compare)(const Node*, const Node*); |
990 |
int (*compare)(const Node*, const Node*); |
| 991 |
switch ((int)v) { |
991 |
switch ((long)v) { |
| 992 |
case 's': compare = largestfirst; break; |
992 |
case 's': compare = largestfirst; break; |
| 993 |
case 'r': compare = smallestfirst; break; |
993 |
case 'r': compare = smallestfirst; break; |
| 994 |
case 'a': compare = alphabetical; break; |
994 |
case 'a': compare = alphabetical; break; |
|
Lines 1001-1007
Link Here
|
| 1001 |
|
1001 |
|
| 1002 |
void OutputWindow::columns_cb(Fl_Widget* o, void*v) { |
1002 |
void OutputWindow::columns_cb(Fl_Widget* o, void*v) { |
| 1003 |
OutputWindow* d = (OutputWindow*)(o->window()); |
1003 |
OutputWindow* d = (OutputWindow*)(o->window()); |
| 1004 |
int n = (int)v; |
1004 |
int n = (long)v; |
| 1005 |
::ncols = n; |
1005 |
::ncols = n; |
| 1006 |
if (n == d->ncols) return; |
1006 |
if (n == d->ncols) return; |
| 1007 |
if (d->current_depth > d->root_depth+n-1) { |
1007 |
if (d->current_depth > d->root_depth+n-1) { |
