kolibrios-fun/programs/cmm/lib/list_box.h
Kirill Lipatov (Leency) 13b0501d78 New Downloader v0.4
git-svn-id: svn://kolibrios.org@4662 a494cfbc-eb01-0410-851d-a64ba20cac60
2014-03-17 23:10:13 +00:00

152 lines
2.4 KiB
C

//list_box
struct llist
{
int x, y, w, h, min_h, line_h, text_y;
int column_max;
int count, visible, first, current;
int active;
void ClearList();
int ProcessKey(dword key);
int MouseOver(int xx, yy);
int ProcessMouse(int xx, yy);
int KeyDown();
int KeyUp();
int KeyHome();
int KeyEnd();
void SetSizes(int xx, yy, ww, hh, min_hh, line_hh);
int MouseScroll(dword scroll_state);
//void debug_values();
};
/*
void llist::debug_values()
{
debug("current: ");
debugi(current);
debug("first: ");
debugi(first);
debug("visible: ");
debugi(visible);
debug("count: ");
debugi(count);
}
*/
void llist::ClearList()
{
count = visible = first = current = 0;
}
void llist::SetSizes(int xx, yy, ww, hh, min_hh, line_hh)
{
x = xx;
y = yy;
w = ww;
h = hh;
min_h = min_hh;
line_h = line_hh;
text_y = line_hh / 2 - 4;
visible = h / line_h;
if (visible > count) visible=count;
}
int llist::MouseScroll(dword scroll_state)
{
if (count<=visible) return 0;
if (scroll_state == 65535)
{
if (first == 0) return 0;
if (first > 3) first -= 2; else first=0;
return 1;
}
if (scroll_state == 1)
{
if (visible+first+3 >= count) first = count - visible; else first+=2;
return 1;
}
return 0;
}
int llist::MouseOver(int xx, yy)
{
if (xx>x) && (xx<x+w) && (yy>y) && (yy<y+h) return 1;
return 0;
}
int llist::ProcessMouse(int xx, yy)
{
int current_temp;
if (MouseOver(xx, yy))
{
current_temp = yy - y / line_h + first;
if (current_temp != current) && (current_temp<count)
{
current = current_temp;
return 1;
}
}
return 0;
}
int llist::ProcessKey(dword key)
{
switch(key)
{
case 177: return KeyDown();
case 178: return KeyUp();
case 180: return KeyHome();
case 181: return KeyEnd();
}
return 0;
}
int llist::KeyDown()
{
if (current-first+1<visible)
{
if (current+1>=count) return 0;
current++;
}
else
{
if (visible+first>=count) return 0;
first++;
current++;
}
return 1;
}
int llist::KeyUp()
{
if (current>first)
{
current--;
}
else
{
if (first==0) return 0;
first--;
current--;
}
return 1;
}
int llist::KeyHome()
{
if (current==0) && (first==0) return 0;
current=0;
first=0;
return 1;
}
int llist::KeyEnd()
{
if (current==count-1) && (first==count-visible) return 0;
current=count-1;
first=count-visible;
return 1;
}