mirrors/neutrino
1
0
Fork 0
mirror of https://github.com/tuxbox-neutrino/neutrino.git synced 2025-08-29 16:31:11 +02:00
Code Issues Packages Projects Releases Wiki Activity

channellist: refactor to avoid duplicated code

Browse Source 
Conflicts:
	src/gui/channellist.cpp
This commit is contained in:
Stefan Seyfried
2013-03-25 14:06:16 +01:00
committed by [CST] Focus
parent e3e333582c
commit 0d318fd296
1 changed files with 7 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
src/gui/channellist.cpp
View File

@@ -735,36 +735,17 @@ int CChannelList::show()
} }
actzap = updateSelection(new_selected); actzap = updateSelection(new_selected);
} }
else if (msg == (neutrino_msg_t)g_settings.key_bouquet_up) { else if (msg == (neutrino_msg_t)g_settings.key_bouquet_up ||
msg == (neutrino_msg_t)g_settings.key_bouquet_down) {
if (!bouquetList->Bouquets.empty()) { if (!bouquetList->Bouquets.empty()) {
bool found = true; bool found = true;
uint32_t nNext = (bouquetList->getActiveBouquetNumber()+1) % bouquetList->Bouquets.size(); int dir = msg == (neutrino_msg_t)g_settings.key_bouquet_up ? 1 : -1;
int b_size = bouquetList->Bouquets.size();
int nNext = (bouquetList->getActiveBouquetNumber() + b_size + dir) % b_size;
if(bouquetList->Bouquets[nNext]->channelList->isEmpty() ) { if(bouquetList->Bouquets[nNext]->channelList->isEmpty() ) {
found = false; found = false;
nNext = nNext < bouquetList->Bouquets.size()-1 ? nNext+1 : 0; nNext = (nNext + b_size + dir) % b_size;
for(uint32_t i = nNext; i < bouquetList->Bouquets.size(); i++) { for (int i = nNext; i < b_size; i++) {
if( !bouquetList->Bouquets[i]->channelList->isEmpty() ) {
found = true;
nNext = i;
break;
}
}
}
if(found) {
bouquetList->activateBouquet(nNext, false);
res = bouquetList->showChannelList();
loop = false;
}
}
}
else if (msg == (neutrino_msg_t)g_settings.key_bouquet_down) {
if (!bouquetList->Bouquets.empty()) {
bool found = true;
int nNext = (bouquetList->getActiveBouquetNumber()+bouquetList->Bouquets.size()-1) % bouquetList->Bouquets.size();
if(bouquetList->Bouquets[nNext]->channelList->isEmpty() ) {
found = false;
nNext = nNext > 0 ? nNext-1 : bouquetList->Bouquets.size()-1;
for(int i = nNext; i > 0; i--) {
if( !bouquetList->Bouquets[i]->channelList->isEmpty() ) { if( !bouquetList->Bouquets[i]->channelList->isEmpty() ) {
found = true; found = true;
nNext = i; nNext = i;