Searched defs:SparseArray (Results 1 - 2 of 2) sorted by relevance

/external/regex-re2/util/
H A Dsparse_array.h7 // SparseArray<T>(m) is a map from integers in [0, m) to T values.
27 // change after visiting. Thus SparseArray can be a convenient
30 // The SparseArray implementation is NOT thread-safe. It is up to the
35 // The SparseArray interface does not present all the usual STL bells and
55 // SparseArray uses a vector dense_ and an array sparse_to_dense_, both of
90 // destroyed when the SparseArray destructor is called.
100 class SparseArray { class in namespace:re2
102 SparseArray();
103 SparseArray(int max_size);
104 ~SparseArray();
232 SparseArray<Value>::SparseArray() function in class:re2::SparseArray
417 template<typename Value> SparseArray<Value>::SparseArray(int max_size) { function in class:re2::SparseArray
[all...]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/
H A DSparseArray.java36 public class SparseArray<E> { class
41 * Creates a new SparseArray containing no mappings.
43 public SparseArray() { method in class:SparseArray
48 * Creates a new SparseArray containing no mappings that will not
52 public SparseArray(int initialCapacity) { method in class:SparseArray
102 // Log.e("SparseArray", "gc start with " + mSize);
125 // Log.e("SparseArray", "gc end with " + mSize);
160 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
169 // Log.e("SparseArray", "move " + (mSize - i));
181 * Returns the number of key-value mappings that this SparseArray
[all...]

Completed in 99 milliseconds