beetplayerproxy.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

#include <QModelIndex>
#include "beetplayerproxy.h"

#include <QDebug>

BeetPlayerProxy::BeetPlayerProxy(QObject *parent) : QSortFilterProxyModel(parent) {
}

bool BeetPlayerProxy::filterAcceptsRow(int source_row, const QModelIndex &source_parent) const{
    if(filterRegExp().isEmpty()){
        return true;
    }
    QRegExp filter = filterRegExp();
    QModelIndex curIdx = sourceModel()->index(source_row, 0, source_parent);
    return recurseChildren(curIdx);
}

bool BeetPlayerProxy::recurseChildren(QModelIndex parent) const{
    static bool retval = false;
    if(parent.data().toString().contains(filterRegExp())){
        qDebug() << "found:" << parent.data();
        retval = true;
    }else{
        retval = false;
    }
    for(int i = 0; i < sourceModel()->rowCount(parent); ++i){
        QModelIndex cur = sourceModel()->index(i, 0, parent);
        //qDebug() << cur.data();
        if(cur.data().toString().contains(filterRegExp())){
            retval = true;
        }
        if(sourceModel()->hasChildren(cur)){
            recurseChildren(cur);
        }
    }
    return retval;
}

bool BeetPlayerProxy::hasValidChild(QModelIndex parent) const{
    QModelIndex curIdx = parent;
    if(curIdx.isValid()){
        if(curIdx.data().toString().contains(filterRegExp())){
            qDebug() << "found:" << curIdx.data();
            return true;
        }
        qDebug() << parent.data() << sourceModel()->rowCount(curIdx);
        for(int i = 0; i < sourceModel()->rowCount(curIdx); ++i){
            curIdx = sourceModel()->index(i, 0, curIdx);
            //qDebug() << "in for:" << curIdx.data() << i;
            if(sourceModel()->hasChildren(curIdx)){
                hasValidChild(curIdx);
            }
        }
    }
    return false;
}