cave-story-solaris/external/fltk/examples/tree-custom-sort.cxx
Clownacy ac465d29b4 Mean CMake dependency overhaul
I'm taking a page from Dolphin's book, and including copies of each
dependency's source code. This combines the ease of use of including
pre-built libraries instead of needing to navigate a package manager
 - as is (or was) the case for MSVC - with the portability of using
packages. Granted, this method's more of a jack of all trades,
master of none, since it's *less* user-friendly than prebuilt
packages (compilation times), and you don't get the per-distro
compatibility fixes you'd get from a package manager.

You can still use system libs if you want. In fact, it's still the
default behaviour: compiling the libs manually is just a fallback.
I'll add an option to force-enable this soon, however, since it's a
nicer way to produce static MSYS2 builds than the hackish nightmare
that I was using before. Not to mention, having my own copy of the
sources means I can provide my own fixes and tweaks your package
manager may not. For example, I can combine MSYS2's FreeType
subpixel rendering with vcpkg's fix for SDL2 exporting its symbols
in static builds.
2019-04-26 01:52:02 +01:00

81 lines
2.3 KiB
C++

//
// "$Id$"
//
// Simple Fl_Tree custom (numeric) sort example. - erco 12/16/2013
// Demonstrates custom sorting of Fl_Tree items.
//
// Copyright 2013 Greg Ercolano.
// Copyright 1998-2010 by Bill Spitzak and others.
//
// This library is free software. Distribution and use rights are outlined in
// the file "COPYING" which should have been included with this file. If this
// file is missing or damaged, see the license at:
//
// http://www.fltk.org/COPYING.php
//
// Please report all bugs and problems on the following page:
//
// http://www.fltk.org/str.php
//
#include <stdio.h>
#include <stdlib.h> /* qsort(3), srand(3).. */
#include <time.h> /* time(2) */
#include <FL/Fl.H>
#include <FL/Fl_Double_Window.H>
#include <FL/Fl_Tree.H>
#include <FL/Fl_Button.H>
Fl_Tree *G_tree = 0;
// Resort the tree
void MySortCallback(Fl_Widget*, void *data) {
int dir = int(fl_intptr_t(data)); // forward or reverse
Fl_Tree_Item *i = G_tree->root();
// Bubble sort
for ( int ax=0; ax<i->children(); ax++ ) {
for ( int bx=ax+1; bx<i->children(); bx++ ) {
long a; sscanf(i->child(ax)->label(), "%ld", &a);
long b; sscanf(i->child(bx)->label(), "%ld", &b);
switch ( dir ) {
case 1: if ( a > b ) { i->swap_children(ax, bx); } break; // fwd
case -1: if ( a < b ) { i->swap_children(ax, bx); } break; // rev
}
}
}
G_tree->redraw();
}
int main(int argc, char *argv[]) {
// Randomize the random number generator
time_t tval; time(&tval);
srand((unsigned)tval);
// Create window with tree
Fl::scheme("gtk+");
Fl_Double_Window *win = new Fl_Double_Window(250, 600, "Numeric Sort Tree");
win->begin();
{
G_tree = new Fl_Tree(10, 10, win->w()-20, win->h()-60);
G_tree->showroot(0);
// Add 200 random numbers to the tree
char word[50];
for ( int t=0; t<200; t++ ) {
sprintf(word, "%ld", long((float(rand()) / RAND_MAX) * 1000000));
G_tree->add(word);
}
// Add some sort buttons
Fl_Button *but;
but = new Fl_Button(10, win->h()-40,80,20,"Fwd"); but->callback(MySortCallback, (void*) 1);
but = new Fl_Button(20+80,win->h()-40,80,20,"Rev"); but->callback(MySortCallback, (void*)-1);
}
win->end();
win->resizable(win);
win->show(argc, argv);
return(Fl::run());
}
//
// End of "$Id$".
//