HomeSort by relevance Sort by last modified time
    Searched full:pair (Results 151 - 175 of 1449) sorted by null

1 2 3 4 5 67 8 91011>>

  /development/simulator/app/
MessageStream.h 4 // High-level message stream that sits on top of a pair of Pipes. Useful
46 kTypeConfig, // send a name=value pair to peer
66 * Send a "name=value" pair.
71 * Send a command/arg pair.
  /external/bluetooth/bluez/src/
hcid.conf 20 # once - Pair once and deny successive attempts
  /external/bluetooth/glib/gio/inotify/
inotify-kernel.h 32 struct ik_event_s *pair; member in struct:ik_event_s
inotify-path.c 348 if (!event->pair)
365 event->pair->name &&
366 strcmp (sub->filename, event->pair->name))
373 if (sub->filename && !event->pair->name)
381 event_callback (event->pair, sub);
401 if (event->pair)
402 pair_dir_list = g_hash_table_lookup (wd_dir_hash, GINT_TO_POINTER (event->pair->wd));
  /external/icu4c/common/
unifilt.cpp 52 // surrogate pair -- then backup by 2 (keep offset pointing at
  /external/proguard/src/proguard/classfile/visitor/
NamedFieldVisitor.java 28 * a name and descriptor pair.
NamedMethodVisitor.java 28 * a name and descriptor pair.
  /external/skia/src/core/
SkFlattenable.cpp 215 struct Pair {
221 static Pair gPairs[MAX_PAIR_COUNT];
241 const Pair* pairs = gPairs;
251 const Pair* pairs = gPairs;
  /external/srec/tools/thirdparty/OpenFst/
README 20 # Note long compile on algo_test and pair-arc.so (many templates)
  /external/stlport/test/unit/
equal_test.cpp 44 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2);
56 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2);
95 pair<char*, char*> range = equal_range((char*)chars, (char*)chars + count, 'q', less<char>());
107 pair<vector<Test>::iterator, vector<Test>::iterator> p;
hash_test.cpp 93 pair<maptype::iterator, bool> p = m.insert(pair<const char, crope>('c', crope("100")));
97 p = m.insert(pair<const char, crope>('c', crope("100")));
119 m.insert(pair<const char,int>('X', 10)); // Standard way.
122 m.insert(pair<const char,int>('X', 20)); // jbuck: standard way
125 m.insert(pair<const char,int>('Y', 32)); // jbuck: standard way
209 pair<hashType::iterator,hashType::iterator> range = h.equal_range( i->first );
230 pair<hashType::iterator,hashType::iterator> range = h.equal_range(mIter->first);
302 pair<hash_set<int, hash<int>, equal_to<int> >::iterator, bool> p = s.insert(42);
  /external/webkit/JavaScriptCore/wtf/
HashCountedSet.h 58 // the return value is a pair of an interator to the new value's location,
60 std::pair<iterator, bool> add(const ValueType&);
145 inline std::pair<typename HashCountedSet<Value, HashFunctions, Traits>::iterator, bool> HashCountedSet<Value, HashFunctions, Traits>::add(const ValueType &value)
147 pair<iterator, bool> result = m_impl.add(value, 0);
HashFunctions.h 140 static unsigned hash(const std::pair<T, U>& p)
144 static bool equal(const std::pair<T, U>& a, const std::pair<T, U>& b)
175 template<typename T, typename U> struct DefaultHash<std::pair<T, U> > { typedef PairHash<T, U> Hash; };
HashTraits.h 31 using std::pair;
93 struct PairHashTraits : GenericHashTraits<pair<typename FirstTraitsArg::TraitType, typename SecondTraitsArg::TraitType> > {
96 typedef pair<typename FirstTraits::TraitType, typename SecondTraits::TraitType> TraitType;
108 struct HashTraits<pair<First, Second> > : public PairHashTraits<HashTraits<First>, HashTraits<Second> > { };
ListHashSet.h 95 // the return value is a pair of an iterator to the new value's location,
97 pair<iterator, bool> add(const ValueType&);
99 pair<iterator, bool> insertBefore(const ValueType& beforeValue, const ValueType& newValue);
100 pair<iterator, bool> insertBefore(iterator it, const ValueType&);
470 pair<typename ListHashSet<T, U>::iterator, bool> ListHashSet<T, U>::add(const ValueType &value)
473 pair<typename ImplType::iterator, bool> result = m_impl.template add<ValueType, NodeAllocator*, Translator>(value, m_allocator.get());
480 pair<typename ListHashSet<T, U>::iterator, bool> ListHashSet<T, U>::insertBefore(iterator it, const ValueType& newValue)
483 pair<typename ImplType::iterator, bool> result = m_impl.template add<ValueType, NodeAllocator*, Translator>(newValue, m_allocator.get());
491 pair<typename ListHashSet<T, U>::iterator, bool> ListHashSet<T, U>::insertBefore(const ValueType& beforeValue, const ValueType& newValue)
  /external/webkit/WebCore/svg/
SVGFontElement.cpp 100 static unsigned parseUnicodeRange(const UChar* characters, unsigned length, pair<unsigned, unsigned>& range)
163 static bool parseUnicodeRangeList(const UChar* characters, unsigned length, Vector<pair<unsigned, unsigned> >& ranges)
173 pair<unsigned, unsigned> range;
200 Vector<pair<unsigned, unsigned> > ranges;
  /external/webkit/WebKitTools/Scripts/webkitperl/VCSUtils_unittest/
gitdiff2svndiff.pl 82 foreach my $pair (@lineEndingPairs) {
83 my $gitLine = $gitLines[$i] . $pair->[1];
84 my $expected = $svnLines[$i] . $pair->[1];
86 $title .= " [line-end: \"$pair->[0]\"]";
  /frameworks/base/opengl/tools/glgen/src/
GLESCodeEmitter.java 24 * argument to a pair of arguments "<type>[] data, int offset".
  /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/
Node.java 19 /** This pair of methods are used to inform the node of its
  /external/webkit/WebCore/platform/text/
AtomicString.cpp 90 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<const char*, CStringTranslator>(c);
188 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<UCharBuffer, UCharBufferTranslator>(buf);
191 // The boolean in the pair tells us if that is so.
208 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<UCharBuffer, UCharBufferTranslator>(buf);
211 // The boolean in the pair tells us if that is so.
256 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<HashAndCharacters, HashAndCharactersTranslator>(buffer);
273 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<HashAndCharacters, HashAndCharactersTranslator>(buffer);
  /frameworks/base/media/java/android/media/
ExifInterface.java 338 String [] pair; local
339 pair = parts[0].split("/");
340 int degrees = (int) (Float.parseFloat(pair[0].trim())
341 / Float.parseFloat(pair[1].trim()));
343 pair = parts[1].split("/");
344 int minutes = (int) ((Float.parseFloat(pair[0].trim())
345 / Float.parseFloat(pair[1].trim())));
347 pair = parts[2].split("/");
348 float seconds = Float.parseFloat(pair[0].trim())
349 / Float.parseFloat(pair[1].trim())
    [all...]
  /external/bluetooth/glib/docs/reference/glib/tmpl/
hash_tables.sgml 43 To call a function for each key and value pair use g_hash_table_foreach()
200 It is called with each key/value pair, together with the @user_data parameter
288 It is called with each key/value pair, together with the @user_data parameter
290 It should return %TRUE if the key/value pair should be removed from the
297 @Returns: %TRUE if the key/value pair should be removed from the #GHashTable.
  /external/ipsec-tools/src/racoon/
ipsec_doi.c 184 struct prop_pair **pair; local
186 /* get proposal pair */
187 pair = get_proppair(sa, IPSECDOI_TYPE_PH1);
188 if (pair == NULL)
192 newsa = get_ph1approval(iph1, pair);
194 free_proppair(pair);
209 get_ph1approval(iph1, pair)
211 struct prop_pair **pair;
225 if (pair[i] == NULL)
227 for (s = pair[i]; s; s = s->next)
892 struct prop_pair **pair; local
1290 struct prop_pair **pair = NULL; local
1631 struct prop_pair **pair, *p; local
1691 struct prop_pair **pair = NULL; local
    [all...]
  /external/stlport/stlport/stl/
_uninitialized.h 161 pair<_InputIter, _ForwardIter>
168 return pair<_InputIter, _ForwardIter>(__first, __cur);
171 _STLP_RET_AFTER_THROW((pair<_InputIter, _ForwardIter>(__first, __cur)))
176 inline pair<_InputIter, _ForwardIterator>
183 inline pair<_InputIter, _ForwardIterator>
191 inline pair<_RandomAccessIter, _ForwardIter>
195 return pair<_RandomAccessIter, _ForwardIter>(__last, uninitialized_copy(__first, __last, __result));
200 inline pair<_InputIter, _ForwardIter>
209 inline pair<_InputIter, _ForwardIter>
_unordered_map.h 48 typedef pair<_STLP_CONST key_type, data_type> value_type;
133 pair<iterator,bool> insert(const value_type& __obj)
164 pair<iterator, iterator> equal_range(const _KT& __key)
167 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
190 #if defined (__DMC__) // disable operator==(pair<x,unordered_map>, pair<x,unordered_map>)
216 typedef pair<_STLP_CONST key_type, data_type> value_type;
324 pair<iterator, iterator> equal_range(const _KT& __key)
327 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const

Completed in 257 milliseconds

1 2 3 4 5 67 8 91011>>