1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/media/omx-plugin/include/ics/utils/KeyedVector.h Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,201 @@
1.4 +/*
1.5 + * Copyright (C) 2005 The Android Open Source Project
1.6 + *
1.7 + * Licensed under the Apache License, Version 2.0 (the "License");
1.8 + * you may not use this file except in compliance with the License.
1.9 + * You may obtain a copy of the License at
1.10 + *
1.11 + * http://www.apache.org/licenses/LICENSE-2.0
1.12 + *
1.13 + * Unless required by applicable law or agreed to in writing, software
1.14 + * distributed under the License is distributed on an "AS IS" BASIS,
1.15 + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
1.16 + * See the License for the specific language governing permissions and
1.17 + * limitations under the License.
1.18 + */
1.19 +
1.20 +#ifndef ANDROID_KEYED_VECTOR_H
1.21 +#define ANDROID_KEYED_VECTOR_H
1.22 +
1.23 +#include <assert.h>
1.24 +#include <stdint.h>
1.25 +#include <sys/types.h>
1.26 +
1.27 +#include <utils/SortedVector.h>
1.28 +#include <utils/TypeHelpers.h>
1.29 +#include <utils/Errors.h>
1.30 +
1.31 +// ---------------------------------------------------------------------------
1.32 +
1.33 +namespace android {
1.34 +
1.35 +template <typename KEY, typename VALUE>
1.36 +class KeyedVector
1.37 +{
1.38 +public:
1.39 + typedef KEY key_type;
1.40 + typedef VALUE value_type;
1.41 +
1.42 + inline KeyedVector();
1.43 +
1.44 + /*
1.45 + * empty the vector
1.46 + */
1.47 +
1.48 + inline void clear() { mVector.clear(); }
1.49 +
1.50 + /*!
1.51 + * vector stats
1.52 + */
1.53 +
1.54 + //! returns number of items in the vector
1.55 + inline size_t size() const { return mVector.size(); }
1.56 + //! returns wether or not the vector is empty
1.57 + inline bool isEmpty() const { return mVector.isEmpty(); }
1.58 + //! returns how many items can be stored without reallocating the backing store
1.59 + inline size_t capacity() const { return mVector.capacity(); }
1.60 + //! setst the capacity. capacity can never be reduced less than size()
1.61 + inline ssize_t setCapacity(size_t size) { return mVector.setCapacity(size); }
1.62 +
1.63 + /*!
1.64 + * accessors
1.65 + */
1.66 + const VALUE& valueFor(const KEY& key) const;
1.67 + const VALUE& valueAt(size_t index) const;
1.68 + const KEY& keyAt(size_t index) const;
1.69 + ssize_t indexOfKey(const KEY& key) const;
1.70 +
1.71 + /*!
1.72 + * modifing the array
1.73 + */
1.74 +
1.75 + VALUE& editValueFor(const KEY& key);
1.76 + VALUE& editValueAt(size_t index);
1.77 +
1.78 + /*!
1.79 + * add/insert/replace items
1.80 + */
1.81 +
1.82 + ssize_t add(const KEY& key, const VALUE& item);
1.83 + ssize_t replaceValueFor(const KEY& key, const VALUE& item);
1.84 + ssize_t replaceValueAt(size_t index, const VALUE& item);
1.85 +
1.86 + /*!
1.87 + * remove items
1.88 + */
1.89 +
1.90 + ssize_t removeItem(const KEY& key);
1.91 + ssize_t removeItemsAt(size_t index, size_t count = 1);
1.92 +
1.93 +private:
1.94 + SortedVector< key_value_pair_t<KEY, VALUE> > mVector;
1.95 +};
1.96 +
1.97 +// ---------------------------------------------------------------------------
1.98 +
1.99 +/**
1.100 + * Variation of KeyedVector that holds a default value to return when
1.101 + * valueFor() is called with a key that doesn't exist.
1.102 + */
1.103 +template <typename KEY, typename VALUE>
1.104 +class DefaultKeyedVector : public KeyedVector<KEY, VALUE>
1.105 +{
1.106 +public:
1.107 + inline DefaultKeyedVector(const VALUE& defValue = VALUE());
1.108 + const VALUE& valueFor(const KEY& key) const;
1.109 +
1.110 +private:
1.111 + VALUE mDefault;
1.112 +};
1.113 +
1.114 +// ---------------------------------------------------------------------------
1.115 +
1.116 +template<typename KEY, typename VALUE> inline
1.117 +KeyedVector<KEY,VALUE>::KeyedVector()
1.118 +{
1.119 +}
1.120 +
1.121 +template<typename KEY, typename VALUE> inline
1.122 +ssize_t KeyedVector<KEY,VALUE>::indexOfKey(const KEY& key) const {
1.123 + return mVector.indexOf( key_value_pair_t<KEY,VALUE>(key) );
1.124 +}
1.125 +
1.126 +template<typename KEY, typename VALUE> inline
1.127 +const VALUE& KeyedVector<KEY,VALUE>::valueFor(const KEY& key) const {
1.128 + ssize_t i = indexOfKey(key);
1.129 + assert(i>=0);
1.130 + return mVector.itemAt(i).value;
1.131 +}
1.132 +
1.133 +template<typename KEY, typename VALUE> inline
1.134 +const VALUE& KeyedVector<KEY,VALUE>::valueAt(size_t index) const {
1.135 + return mVector.itemAt(index).value;
1.136 +}
1.137 +
1.138 +template<typename KEY, typename VALUE> inline
1.139 +const KEY& KeyedVector<KEY,VALUE>::keyAt(size_t index) const {
1.140 + return mVector.itemAt(index).key;
1.141 +}
1.142 +
1.143 +template<typename KEY, typename VALUE> inline
1.144 +VALUE& KeyedVector<KEY,VALUE>::editValueFor(const KEY& key) {
1.145 + ssize_t i = indexOfKey(key);
1.146 + assert(i>=0);
1.147 + return mVector.editItemAt(i).value;
1.148 +}
1.149 +
1.150 +template<typename KEY, typename VALUE> inline
1.151 +VALUE& KeyedVector<KEY,VALUE>::editValueAt(size_t index) {
1.152 + return mVector.editItemAt(index).value;
1.153 +}
1.154 +
1.155 +template<typename KEY, typename VALUE> inline
1.156 +ssize_t KeyedVector<KEY,VALUE>::add(const KEY& key, const VALUE& value) {
1.157 + return mVector.add( key_value_pair_t<KEY,VALUE>(key, value) );
1.158 +}
1.159 +
1.160 +template<typename KEY, typename VALUE> inline
1.161 +ssize_t KeyedVector<KEY,VALUE>::replaceValueFor(const KEY& key, const VALUE& value) {
1.162 + key_value_pair_t<KEY,VALUE> pair(key, value);
1.163 + mVector.remove(pair);
1.164 + return mVector.add(pair);
1.165 +}
1.166 +
1.167 +template<typename KEY, typename VALUE> inline
1.168 +ssize_t KeyedVector<KEY,VALUE>::replaceValueAt(size_t index, const VALUE& item) {
1.169 + if (index<size()) {
1.170 + mVector.editItemAt(index).value = item;
1.171 + return index;
1.172 + }
1.173 + return BAD_INDEX;
1.174 +}
1.175 +
1.176 +template<typename KEY, typename VALUE> inline
1.177 +ssize_t KeyedVector<KEY,VALUE>::removeItem(const KEY& key) {
1.178 + return mVector.remove(key_value_pair_t<KEY,VALUE>(key));
1.179 +}
1.180 +
1.181 +template<typename KEY, typename VALUE> inline
1.182 +ssize_t KeyedVector<KEY, VALUE>::removeItemsAt(size_t index, size_t count) {
1.183 + return mVector.removeItemsAt(index, count);
1.184 +}
1.185 +
1.186 +// ---------------------------------------------------------------------------
1.187 +
1.188 +template<typename KEY, typename VALUE> inline
1.189 +DefaultKeyedVector<KEY,VALUE>::DefaultKeyedVector(const VALUE& defValue)
1.190 + : mDefault(defValue)
1.191 +{
1.192 +}
1.193 +
1.194 +template<typename KEY, typename VALUE> inline
1.195 +const VALUE& DefaultKeyedVector<KEY,VALUE>::valueFor(const KEY& key) const {
1.196 + ssize_t i = indexOfKey(key);
1.197 + return i >= 0 ? KeyedVector<KEY,VALUE>::valueAt(i) : mDefault;
1.198 +}
1.199 +
1.200 +}; // namespace android
1.201 +
1.202 +// ---------------------------------------------------------------------------
1.203 +
1.204 +#endif // ANDROID_KEYED_VECTOR_H
