#include <creaImageIOWxTreeView.h>
#include <creaImageIOGimmickView.h>
#include <creaImageIOSystem.h>
#include <wx/splitter.h>
#include <wx/gdicmn.h>
#include <boost/date_time/gregorian/gregorian.hpp>
#include <creaImageIOGimmick.h>
Go to the source code of this file.
Namespaces | |
namespace | creaImageIO |
Functions | |
int wxCALLBACK | CompareFunctionStrings (long item1, long item2, long sortData) |
Comparing function for ordering algorithm. Takes parameters as strings. | |
int wxCALLBACK | CompareFunctionInts (long item1, long item2, long sortData) |
Comparing function for ordering algorithm. Takes parameters as ints. |
int wxCALLBACK CompareFunctionInts | ( | long | item1, | |
long | item2, | |||
long | sortData | |||
) |
Comparing function for ordering algorithm. Takes parameters as ints.
Definition at line 53 of file creaImageIOWxTreeView.cpp.
References creaImageIO::ItemData::attr.
Referenced by creaImageIO::WxTreeView::SortLevel().
{ creaImageIO::ItemData* data1 = (creaImageIO::ItemData*)item1; creaImageIO::ItemData* data2 = (creaImageIO::ItemData*)item2; const std::string& s1(*(data1->attr)); const std::string& s2(*(data2->attr)); int val1=atoi(s1.c_str()); int val2=atoi(s2.c_str()); if(sortData==1) { // inverse the order if (val1 < val2) return 1; if (val1 > val2) return -1; return 0; } else { if (val1 < val2) return -1; if (val1 > val2) return 1; return 0; } }
int wxCALLBACK CompareFunctionStrings | ( | long | item1, | |
long | item2, | |||
long | sortData | |||
) |
Comparing function for ordering algorithm. Takes parameters as strings.
Definition at line 21 of file creaImageIOWxTreeView.cpp.
References creaImageIO::ItemData::attr.
Referenced by creaImageIO::WxTreeView::SortLevel().
{ creaImageIO::ItemData* data1 = (creaImageIO::ItemData*)item1; creaImageIO::ItemData* data2 = (creaImageIO::ItemData*)item2; const std::string& s1(*(data1->attr)); const std::string& s2(*(data2->attr)); if(sortData==1) { // inverse the order if (s1 < s2) return 1; if (s1 > s2) return -1; return 0; } else { if (s1 < s2) return -1; if (s1 > s2) return 1; return 0; } }