aboutsummaryrefslogtreecommitdiffstats
path: root/OpenKeychain/src/main/java/org/sufficientlysecure/keychain/util/FilterCursorWrapper.java
blob: d06f2ab6561e1022d6df319b1bda91bdc3a36a73 (plain)
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
 * Copyright (C) 2015 Dominik Schürmann <dominik@dominikschuermann.de>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

package org.sufficientlysecure.keychain.util;


import android.database.Cursor;
import android.database.CursorWrapper;

public abstract class FilterCursorWrapper extends CursorWrapper {
    private int[] mIndex;
    private int mCount = 0;
    private int mPos = 0;

    public abstract boolean isVisible(Cursor cursor);

    public FilterCursorWrapper(Cursor cursor) {
        super(cursor);
        mCount = super.getCount();
        mIndex = new int[mCount];
        for (int i = 0; i < mCount; i++) {
            super.moveToPosition(i);
            if (isVisible(cursor)) {
                mIndex[mPos++] = i;
            }
        }
        mCount = mPos;
        mPos = 0;
        super.moveToFirst();
    }

    @Override
    public boolean move(int offset) {
        return this.moveToPosition(mPos + offset);
    }

    @Override
    public boolean moveToNext() {
        return this.moveToPosition(mPos + 1);
    }

    @Override
    public boolean moveToPrevious() {
        return this.moveToPosition(mPos - 1);
    }

    @Override
    public boolean moveToFirst() {
        return this.moveToPosition(0);
    }

    @Override
    public boolean moveToLast() {
        return this.moveToPosition(mCount - 1);
    }

    @Override
    public boolean moveToPosition(int position) {
        if (position >= mCount || position < 0) {
            return false;
        }
        return super.moveToPosition(mIndex[position]);
    }

    @Override
    public int getCount() {
        return mCount;
    }

    public int getHiddenCount() {
        return super.getCount() - mCount;
    }

    @Override
    public int getPosition() {
        return mPos;
    }

}