ultimatepp/uppsrc/GridCtrl/GridSort.cpp
unodgs 2d8da64a08 Fixed ReSort(), DoMin/DoMax now works for dates
git-svn-id: svn://ultimatepp.org/upp/trunk@1633 f0d560ea-af0d-0410-9eb7-867de7ffcac7
2009-10-17 20:29:08 +00:00

230 lines
3.8 KiB
C++

#include "GridCtrl.h"
NAMESPACE_UPP
/*
bool GridCtrl::operator<(const Vector<Value>& a, const Vector<Value>& b)
{
for(int i = 0; i < SortOrder.GetCount(); i++)
{
if(sortMode)
return (StdValueCompare((*a.items)[a.id][sortCol].val, (*b.items)[b.id][sortCol].val, 0) < 0);
else
return a.id < b.id;
}
}
*/
void GridCtrl::GSort(int scol)
{
int col;
int cnt = sortOrder.GetCount();
if(cnt == 0)
return;
if(scol < 0)
scol = cnt - 1;
col = sortOrder[scol];
//int order = 1;
int order = hitems[col].sortmode;
/* dla trybu multisort nie mozna w ten sposob
sortowac dla pierwszej kolumny */
if(cnt > 1 && scol != 0)
{
int match = 1;
int is = fixed_rows;
for(int i = fixed_rows + 1; i < total_rows; i++)
{
int n = vitems[i].id;
int m = vitems[is].id;
bool found = true;
for(int j = 0; j < scol; j++)
{
int k = sortOrder[j];
if(items[n][k].val != items[m][k].val)
{
found = false;
break;
}
}
if(found)
{
match++;
continue;
}
else
{
if(match > 1)
GSort(col, order, is, match);
match = 1;
is = i;
}
}
if(match > 1)
GSort(col, order, is, match);
}
else
GSort(col, order, fixed_rows);
}
void GridCtrl::GSort(int col, int order, int from, int count)
{
if(count == 0)
return;
ItemRect::sortCol = col;
ItemRect::sortMode = (order != 0);
VItems::Iterator its, ite;
its = vitems.Begin() + from;
if(count < 0)
ite = vitems.End();
else
ite = its + count;
if(order < 2)
Upp::Sort(its, ite, StdLess<ItemRect>());
else
Upp::Sort(its, ite, StdGreater<ItemRect>());
}
void GridCtrl::Multisort()
{
GSort(-1, 0, fixed_rows);
for(int i = 0; i < sortOrder.GetCount(); i++)
GSort(i);
}
int GridCtrl::InMultisort(int col)
{
for(int i = 0; i < sortOrder.GetCount(); i++)
if(col == sortOrder[i])
return i;
return -1;
}
void GridCtrl::ClearMultisort(int n)
{
for(int i = n; i < sortOrder.GetCount(); i++)
{
int c = GetIdCol(sortOrder[i], true);
hitems[c].sortmode = 0;
hitems[c].sortcol = 0;
}
sortOrder.Clear();
}
bool GridCtrl::IsSorted()
{
return sortOrder.GetCount() > 0;
}
void GridCtrl::MarkSort(int col, int sort_mode, bool refresh)
{
sortCol = col;
hitems[col].sortmode = sort_mode;
hitems[col].sortcol = sortOrder.GetCount();
if(refresh)
RefreshTop();
}
void GridCtrl::MarkSort(int col, int sort_mode)
{
MarkSort(fixed_cols + col, sort_mode, true);
}
void GridCtrl::MarkSort(Id id, int sort_mode)
{
MarkSort(aliases.Get(id), sort_mode, true);
}
GridCtrl& GridCtrl::Sort(int sort_col, int sort_mode, bool multisort, bool repaint)
{
int col = GetIdCol(sort_col + fixed_cols);
if(col < 0)
return *this;
if(!multisort)
ClearMultisort();
sortOrder.Add(col);
MarkSort(col, sort_mode, false);
GSort();
UpdateCursor();
if(repaint)
Repaint(false, true);
return *this;
}
GridCtrl& GridCtrl::Sort(Id id, int sort_mode, bool multisort, bool repaint)
{
return Sort(aliases.Get(id) - fixed_cols, sort_mode, multisort, repaint);
}
GridCtrl& GridCtrl::MultiSort(int sort_col, int sort_mode)
{
return Sort(sort_col, sort_mode, true);
}
GridCtrl& GridCtrl::MultiSort(Id id, int sort_mode)
{
return Sort(aliases.Get(id) - fixed_cols, sort_mode, true);
}
void GridCtrl::ClearSort()
{
Sort(0, SORT_ID);
}
void GridCtrl::ReSort()
{
Multisort();
Repaint(false, true);
}
Vector<Id> GridCtrl::GetSortOrderId() const
{
Vector<Id> v;
for(int i = 0; i < sortOrder.GetCount(); i++)
v.Add(aliases.GetKey(sortOrder[i]));
return v;
}
Vector<GridCtrl::SortOrder> GridCtrl::GetSortOrder() const
{
Vector<SortOrder> v;
for(int i = 0; i < sortOrder.GetCount(); i++)
{
int c = sortOrder[i];
SortOrder& s = v.Add();
s.id = c;
s.name = aliases.GetKey(c);
s.ascending = hitems[c].IsSortAsc();
s.descending = hitems[c].IsSortDsc();
}
return v;
}
END_UPP_NAMESPACE