char buf[256];
snprintf(buf, 256, "(type == %d) FROM BOUQUET \"%s\" ORDER BY bouquet", tmp.data[0], str.c_str());
tmp.path = buf;
- eDebug("read bouquet %s", tmp.toString().c_str());
}
list.push_back(tmp);
e = &list.back();
if ( pos != std::string::npos )
{
str.erase(0, pos+14);
- eDebug("str now %s", str.c_str());
pos = str.find('"');
if ( pos != std::string::npos )
str.erase(pos);
else
str.clear();
- eDebug("str now %s", str.c_str());
}
if (str.empty())
{
RESULT eDVBDB::startQuery(ePtr<iDVBChannelListQuery> &query, eDVBChannelQuery *q, const eServiceReference &source)
{
if ( q && q->m_bouquet_name.length() )
- {
- eDebug("bouquet");
query = new eDVBDBBouquetQuery(this, source, q);
- }
else
query = new eDVBDBQuery(this, source, q);
return 0;
/* we had only one sub expression */
if (end_of_exp == end)
{
- eDebug("only one sub expression");
+// eDebug("only one sub expression");
return 0;
}
std::string current_token;
std::string bouquet_name;
- eDebug("splitting %s....", query.c_str());
+// eDebug("splitting %s....", query.c_str());
unsigned int i = 0;
const char *splitchars="()";
int quotemode = 0, lastsplit = 0, lastalnum = 0;
return -1;
}
- eDebug("sort by %d", sort);
+// eDebug("sort by %d", sort);
/* now we recursivly parse that. */
int r = parseExpression(res, tokens.begin(), tokens.end());
res->m_bouquet_name = bouquet_name;
}
- eDebug("return: %d", r);
+// eDebug("return: %d", r);
return r;
}