aboutsummaryrefslogtreecommitdiffstats
path: root/tools/dicttool/compat/android/util/SparseArray.java
blob: 9efbd39c7b9bc9dbd5b81799d6083020a2f8da75 (about) (plain) (blame)
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
/*
 * Copyright (C) 2013 The Android Open Source Project
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package android.util;

import java.util.ArrayList;
import java.util.Collections;

public class SparseArray<E> {
    private final ArrayList<Integer> mKeys;
    private final ArrayList<E> mValues;

    public SparseArray() {
        this(10);
    }

    public SparseArray(final int initialCapacity) {
        mKeys = new ArrayList<>(initialCapacity);
        mValues = new ArrayList<>(initialCapacity);
    }

    public int size() {
        return mKeys.size();
    }

    public void clear() {
        mKeys.clear();
        mValues.clear();
    }

    public void put(final int key, final E value) {
        final int index = Collections.binarySearch(mKeys, key);
        if (index >= 0) {
            mValues.set(index, value);
            return;
        }
        final int insertIndex = ~index;
        mKeys.add(insertIndex, key);
        mValues.add(insertIndex, value);
    }

    public E get(final int key) {
        return get(key, null);
    }

    public E get(final int key, final E valueIfKeyNotFound) {
        final int index = Collections.binarySearch(mKeys, key);
        if (index >= 0) {
            return mValues.get(index);
        }
        return valueIfKeyNotFound;
    }

    public int indexOfKey(final int key) {
        return mKeys.indexOf(key);
    }

    public int indexOfValue(final E value) {
        return mValues.indexOf(value);
    }

    public int keyAt(final int index) {
        return mKeys.get(index);
    }

    public E valueAt(final int index) {
        return mValues.get(index);
    }
}