SparseLongArray.java revision b993f41eb2f165425dfdf0f93ea0b1e354eca837
1021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov/* 2021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Copyright (C) 2011 The Android Open Source Project 3021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * 4021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Licensed under the Apache License, Version 2.0 (the "License"); 5021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * you may not use this file except in compliance with the License. 6021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * You may obtain a copy of the License at 7021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * 8021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * http://www.apache.org/licenses/LICENSE-2.0 9021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * 10021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Unless required by applicable law or agreed to in writing, software 11021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * distributed under the License is distributed on an "AS IS" BASIS, 12021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * See the License for the specific language governing permissions and 14021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * limitations under the License. 15021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 16021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 17021078554b902179442a345a9d080a165c3b5139Svetoslav Ganovpackage android.util; 18021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 19021078554b902179442a345a9d080a165c3b5139Svetoslav Ganovimport com.android.internal.util.ArrayUtils; 20021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 21021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov/** 22021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * SparseLongArrays map integers to longs. Unlike a normal array of longs, 23b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * there can be gaps in the indices. It is intended to be more memory efficient 24b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * than using a HashMap to map Integers to Longs, both because it avoids 25b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * auto-boxing keys and values and its data structure doesn't rely on an extra entry object 26b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * for each mapping. 27b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * 28b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * <p>Note that this container keeps its mappings in an array data structure, 29b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * using a binary search to find keys. The implementation is not intended to be appropriate for 30b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * data structures 31b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * that may contain large numbers of items. It is generally slower than a traditional 32b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * HashMap, since lookups require a binary search and adds and removes require inserting 33b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * and deleting entries in the array. For containers holding up to hundreds of items, 34b993f41eb2f165425dfdf0f93ea0b1e354eca837Dianne Hackborn * the performance difference is not significant, less than 50%.</p> 35021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 36021078554b902179442a345a9d080a165c3b5139Svetoslav Ganovpublic class SparseLongArray implements Cloneable { 37f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn static final long[] EMPTY_LONGS = new long[0]; 38021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 39021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov private int[] mKeys; 40021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov private long[] mValues; 41021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov private int mSize; 42021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 43021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 44021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Creates a new SparseLongArray containing no mappings. 45021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 46021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public SparseLongArray() { 47021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov this(10); 48021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 49021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 50021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 51021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Creates a new SparseLongArray containing no mappings that will not 52021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * require any additional memory allocation to store the specified 53f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn * number of mappings. If you supply an initial capacity of 0, the 54f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn * sparse array will be initialized with a light-weight representation 55f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn * not requiring any additional array allocations. 56021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 57021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public SparseLongArray(int initialCapacity) { 58f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn if (initialCapacity == 0) { 59f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn mKeys = SparseArray.EMPTY_INTS; 60f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn mValues = EMPTY_LONGS; 61f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn } else { 62f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn initialCapacity = ArrayUtils.idealLongArraySize(initialCapacity); 63f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn mKeys = new int[initialCapacity]; 64f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn mValues = new long[initialCapacity]; 65f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn } 66021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mSize = 0; 67021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 68021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 69021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov @Override 70021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public SparseLongArray clone() { 71021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov SparseLongArray clone = null; 72021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov try { 73021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov clone = (SparseLongArray) super.clone(); 74021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov clone.mKeys = mKeys.clone(); 75021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov clone.mValues = mValues.clone(); 76021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } catch (CloneNotSupportedException cnse) { 77021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /* ignore */ 78021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 79021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return clone; 80021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 81021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 82021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 83021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Gets the long mapped from the specified key, or <code>0</code> 84021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * if no such mapping has been made. 85021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 86021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public long get(int key) { 87021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return get(key, 0); 88021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 89021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 90021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 91021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Gets the long mapped from the specified key, or the specified value 92021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * if no such mapping has been made. 93021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 94021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public long get(int key, long valueIfKeyNotFound) { 95f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn int i = SparseArray.binarySearch(mKeys, mSize, key); 96021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 97021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (i < 0) { 98021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return valueIfKeyNotFound; 99021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } else { 100021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return mValues[i]; 101021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 102021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 103021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 104021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 105021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Removes the mapping from the specified key, if there was any. 106021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 107021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public void delete(int key) { 108f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn int i = SparseArray.binarySearch(mKeys, mSize, key); 109021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 110021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (i >= 0) { 111021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov removeAt(i); 112021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 113021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 114021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 115021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 116021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Removes the mapping at the given index. 117021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 118021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public void removeAt(int index) { 119021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); 120021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1)); 121021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mSize--; 122021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 123021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 124021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 125021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Adds a mapping from the specified key to the specified value, 126021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * replacing the previous mapping from the specified key if there 127021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * was one. 128021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 129021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public void put(int key, long value) { 130f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn int i = SparseArray.binarySearch(mKeys, mSize, key); 131021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 132021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (i >= 0) { 133021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mValues[i] = value; 134021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } else { 135021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov i = ~i; 136021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 137021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (mSize >= mKeys.length) { 138021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov growKeyAndValueArrays(mSize + 1); 139021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 140021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 141021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (mSize - i != 0) { 142021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i); 143021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov System.arraycopy(mValues, i, mValues, i + 1, mSize - i); 144021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 145021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 146021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mKeys[i] = key; 147021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mValues[i] = value; 148021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mSize++; 149021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 150021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 151021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 152021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 153021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Returns the number of key-value mappings that this SparseIntArray 154021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * currently stores. 155021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 156021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public int size() { 157021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return mSize; 158021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 159021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 160021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 161021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Given an index in the range <code>0...size()-1</code>, returns 162021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * the key from the <code>index</code>th key-value mapping that this 163021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * SparseLongArray stores. 164021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 165021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public int keyAt(int index) { 166021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return mKeys[index]; 167021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 168021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 169021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 170021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Given an index in the range <code>0...size()-1</code>, returns 171021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * the value from the <code>index</code>th key-value mapping that this 172021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * SparseLongArray stores. 173021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 174021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public long valueAt(int index) { 175021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return mValues[index]; 176021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 177021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 178021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 179021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Returns the index for which {@link #keyAt} would return the 180021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * specified key, or a negative number if the specified 181021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * key is not mapped. 182021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 183021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public int indexOfKey(int key) { 184f4bf0ae2a7c2d9d92c5c8abdb82baa53b4c9ccdaDianne Hackborn return SparseArray.binarySearch(mKeys, mSize, key); 185021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 186021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 187021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 188021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Returns an index for which {@link #valueAt} would return the 189021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * specified key, or a negative number if no keys map to the 190021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * specified value. 191021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Beware that this is a linear search, unlike lookups by key, 192021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * and that multiple keys can map to the same value and this will 193021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * find only one of them. 194021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 195021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public int indexOfValue(long value) { 196021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov for (int i = 0; i < mSize; i++) 197021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (mValues[i] == value) 198021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return i; 199021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 200021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return -1; 201021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 202021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 203021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 204021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Removes all key-value mappings from this SparseIntArray. 205021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 206021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public void clear() { 207021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mSize = 0; 208021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 209021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 210021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov /** 211021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * Puts a key/value pair into the array, optimizing for the case where 212021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov * the key is greater than all existing keys in the array. 213021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov */ 214021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov public void append(int key, long value) { 215021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (mSize != 0 && key <= mKeys[mSize - 1]) { 216021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov put(key, value); 217021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov return; 218021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 219021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 220021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov int pos = mSize; 221021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov if (pos >= mKeys.length) { 222021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov growKeyAndValueArrays(pos + 1); 223021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 224021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 225021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mKeys[pos] = key; 226021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mValues[pos] = value; 227021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mSize = pos + 1; 228021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 229021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 230021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov private void growKeyAndValueArrays(int minNeededSize) { 231021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov int n = ArrayUtils.idealLongArraySize(minNeededSize); 232021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 233021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov int[] nkeys = new int[n]; 234021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov long[] nvalues = new long[n]; 235021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 236021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length); 237021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov System.arraycopy(mValues, 0, nvalues, 0, mValues.length); 238021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov 239021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mKeys = nkeys; 240021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov mValues = nvalues; 241021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov } 242021078554b902179442a345a9d080a165c3b5139Svetoslav Ganov} 243