| /external/webkit/JavaScriptCore/runtime/ |
| StructureTransitionTable.h | 42 typedef std::pair<RefPtr<UString::Rep>, unsigned> Key;
59 typedef std::pair<FirstTraits::TraitType, SecondTraits::TraitType > TraitType;
71 typedef std::pair<Structure*, Structure*> Transition;
|
| WeakGCMap.h | 54 pair<iterator, bool> set(const KeyType&, const MappedType&);
97 pair<typename HashMap<KeyType, MappedType>::iterator, bool> WeakGCMap<KeyType, MappedType>::set(const KeyType& key, const MappedType& value)
100 pair<iterator, bool> result = m_map.add(key, value);
|
| /frameworks/base/core/java/android/provider/ |
| SyncStateContract.java | 27 import android.util.Pair;
122 public static Pair<Uri, byte[]> getWithUri(ContentProviderClient provider, Uri uri,
130 return Pair.create(ContentUris.withAppendedId(uri, rowId), blob);
|
| /frameworks/base/docs/html/sdk/api_diff/5/changes/ |
| pkg_android.util.html | 84 <A NAME="Pair"></A>
85 <nobr><A HREF="../../../../reference/android/util/Pair.html" target="_top"><code>Pair</code></A></nobr>
|
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| umemory.h | 122 /// \brief Creates a temporary buffer pair from \p p and \p n
124 /// The size in the returned pair is set to 0 if the allocation is unsuccessful.
128 inline pair<T*, ptrdiff_t> make_temporary_buffer (void* p, size_t n, const T* ptype)
|
| /external/icu4c/common/ |
| ustring.c | 41 /* the leading edge of the match is in the middle of a surrogate pair */
45 /* the trailing edge of the match is in the middle of a surrogate pair */
86 break; /* no match because surrogate pair is split */
134 break; /* no match because surrogate pair is split */
172 break; /* no match because surrogate pair is split */
197 /* make sure to not find half of a surrogate pair */
221 /* find supplementary code point as surrogate pair */
241 /* make sure to not find half of a surrogate pair */
261 /* too short for a surrogate pair */
264 /* find supplementary code point as surrogate pair */
[all...] |
| /dalvik/docs/ |
| dalvik-bytecode.html | 153 <td><code>A:</code> destination register pair (4 bits)<br/>
154 <code>B:</code> source register pair (4 bits)</td>
155 <td>Move the contents of one register-pair to another.
159 must arrange for both halves of a register pair to be read before
166 <td><code>A:</code> destination register pair (8 bits)<br/>
167 <code>B:</code> source register pair (16 bits)</td>
168 <td>Move the contents of one register-pair to another.
177 <td><code>A:</code> destination register pair (16 bits)<br/>
178 <code>B:</code> source register pair (16 bits)</td>
179 <td>Move the contents of one register-pair to another
[all...] |
| /external/stlport/stlport/stl/ |
| _set.h | 168 pair<iterator,bool> insert(const value_type& __x)
204 pair<iterator, iterator> equal_range(const _KT& __x)
207 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const
375 pair<iterator, iterator> equal_range(const _KT& __x) { return _M_t.equal_range(__x); }
377 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { return _M_t.equal_range(__x); }
|
| _tree.h | 458 pair<iterator,bool> insert_unique(const value_type& __x);
503 pair<iterator,iterator> __p = equal_range(__x);
597 pair<const_iterator, const_iterator> __p = equal_range(__x);
609 pair<iterator,iterator> equal_range(const _KT& __x)
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
612 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
615 pair<iterator,iterator> equal_range_unique(const _KT& __x) {
616 pair<iterator, iterator> __p;
628 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const
[all...] |
| _map.h | 57 typedef pair<_STLP_CONST _Key, _Tp> value_type;
188 pair<iterator,bool> insert(const value_type& __x)
225 pair<iterator,iterator> equal_range(const _KT& __x)
228 pair<const_iterator,const_iterator> equal_range(const _KT& __x) const
250 typedef pair<_STLP_CONST _Key, _Tp> value_type;
400 pair<iterator,iterator> equal_range(const _KT& __x)
403 pair<const_iterator,const_iterator> equal_range(const _KT& __x) const
|
| _hash_set.h | 181 pair<iterator, bool> insert(const value_type& __obj)
193 pair<iterator, bool> insert_noresize(const value_type& __obj)
205 pair<iterator, iterator> equal_range(const _KT& __key)
208 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
387 pair<iterator, iterator> equal_range(const _KT& __key)
390 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
|
| _hashtable.h | 407 pair<iterator, bool> insert_unique(const value_type& __obj) {
420 pair<iterator, bool> insert_unique_noresize(const value_type& __obj);
534 pair<iterator, iterator> equal_range(const _KT& __key) {
535 typedef pair<iterator, iterator> _Pii;
550 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const {
551 typedef pair<const_iterator, const_iterator> _Pii;
|
| /external/svox/pico/lib/ |
| picokfst.c | 61 picoos_int32 nrClasses; /* nr of pair/transition classes in FST; class is in [1..nrClasses] */
63 picoos_int32 termClass; /* pair class of terminator symbol pair; probably obsolete */
64 picoos_int32 alphaHashTabSize; /* size of pair alphabet hash table */
65 picoos_int32 alphaHashTabPos; /* absolute address of the start of the pair alphabet */
|
| /external/webkit/JavaScriptCore/wtf/ |
| HashSet.h | 78 // The return value is a pair of an interator to the new value's location,
80 pair<iterator, bool> add(const ValueType&);
88 template<typename T, typename HashTranslator> pair<iterator, bool> add(const T&);
208 pair<typename HashSet<T, U, V>::iterator, bool> HashSet<T, U, V>::add(const ValueType& value)
215 pair<typename HashSet<Value, HashFunctions, Traits>::iterator, bool>
|
| TCPackedCache.h | 33 // This file provides a minimal cache that can hold a <key, value> pair
47 // some <key, value> pair; the class provides no way to mark a cache
73 // void Put(K key, V value) { a_[H(key)] = pair<K, V>(key, value); }
74 // V GetOrDefault(K key, V default) { const pair<K, V> &p = a_[H(key)]; ... }
87 // 2. Has(key) will return false if no <key, value> pair with that key
|
| HashTable.h | 265 // swap pairs by component, in case of pair members that specialize swap
266 template<typename T, typename U> inline void swap(pair<T, U>& a, pair<T, U>& b)
317 pair<iterator, bool> add(const ValueType& value) { return add<KeyType, ValueType, IdentityTranslatorType>(Extractor::extract(value), value); }
322 template<typename T, typename Extra, typename HashTranslator> pair<iterator, bool> add(const T& key, const Extra&);
323 template<typename T, typename Extra, typename HashTranslator> pair<iterator, bool> addPassingHashCode(const T& key, const Extra&);
362 typedef pair<ValueType*, bool> LookupType;
363 typedef pair<LookupType, unsigned> FullLookupType;
627 inline pair<typename HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::iterator, bool> HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::add(const T& key, const Extra& extra)
700 pair<iterator, bool> p = std::make_pair(find(enteredKey), true)
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| factor-weight.h | 61 // pair<W, W> Value() const;
73 pair<W, W> Value() const { return make_pair(W::One(), W::One()); } // unused
89 pair< StringWeight<L, S>, StringWeight<L, S> > Value() const {
117 pair< GallicWeight<L, W, S>, GallicWeight<L, W, S> > Value() const {
247 element_map_.insert(pair<const Element, StateId>(e, s));
269 const pair<Weight, Weight> &p = fit.Value();
285 const pair<Weight, Weight> &p = fit.Value();
|
| equivalent.h | 165 hash_map<typename Arc::Label, pair<MappedId, MappedId> >
171 deque<pair<MappedId, MappedId> > q;
219 const pair<MappedId, MappedId> &p = arc_iter->second;
|
| /prebuilt/sdk/tools/linux/ |
| aidl | |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| ValueEncoder.java | 334 for (NameValuePair pair : pairs) {
335 CstUtf8 name = pair.getName();
337 Constant value = pair.getValue();
500 for (NameValuePair pair : annotation.getNameValuePairs()) {
501 stringIds.intern(pair.getName());
502 addContents(file, pair.getValue());
|
| /external/apache-http/src/org/apache/http/message/ |
| BasicHeaderValueFormatter.java | 311 * Formats a name-value pair.
313 * @param nvp the name-value pair to format
319 * @return the formatted name-value pair
359 * Estimates the length of a formatted name-value pair.
361 * @param nvp the name-value pair to format, or <code>null</code>
380 * Actually formats the value of a name-value pair.
|
| /external/clearsilver/util/ |
| dict.h | 119 * Description: Updates the <id>/<value> pair into <dict>.
121 * Input: dict - dictionary to add pair to.
138 * Input: dict - dictionary to add pair to.
|
| /external/opencore/engines/2way/src/ |
| pv_2way_datapath.h | 111 * Specifies a pair of node ports that describe a data connection and the status of the ports.
169 CPV2WayPortPair *iPortPair; // The out port will be the iSrcPort of the port pair
170 // The in port will be the iDestPort of the port pair
|
| /frameworks/base/core/java/android/database/ |
| CursorJoiner.java | 236 * then returns 0. Otherwise returns the comparison result of the first non-matching pair
237 * of values, -1 if the first of the pair is less than the second of the pair or 1 if it
|
| /frameworks/base/include/utils/ |
| KeyedVector.h | 159 key_value_pair_t<KEY,VALUE> pair(key, value);
160 mVector.remove(pair);
161 return mVector.add(pair);
|
