/external/chromium_org/third_party/libaddressinput/src/cpp/test/ |
H A D | address_validator_test.cc | 192 expected_.insert(std::make_pair(COUNTRY, MISSING_REQUIRED_FIELD)); 202 expected_.insert(std::make_pair(COUNTRY, UNKNOWN_VALUE)); 226 expected_.insert(std::make_pair(ADMIN_AREA, MISSING_REQUIRED_FIELD)); 227 expected_.insert(std::make_pair(LOCALITY, MISSING_REQUIRED_FIELD)); 228 expected_.insert(std::make_pair(STREET_ADDRESS, MISSING_REQUIRED_FIELD)); 229 expected_.insert(std::make_pair(POSTAL_CODE, INVALID_FORMAT)); 252 expected_.insert(std::make_pair(STREET_ADDRESS, MISSING_REQUIRED_FIELD)); 253 expected_.insert(std::make_pair(POSTAL_CODE, INVALID_FORMAT)); 254 expected_.insert(std::make_pair(LOCALITY, MISSING_REQUIRED_FIELD)); 286 expected_.insert(st [all...] |
/external/chromium_org/third_party/skia/bench/ |
H A D | GrOrderedSetBench.cpp | 46 set.insert(fData[j]); 80 fSet.insert(rand.nextU() % NUM_ELEMENTS); 120 fSet.insert(rand.nextU() % NUM_ELEMENTS); 129 testSet.insert(*s);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBBoxHierarchy.h | 52 virtual void insert(void* data, const SkRect& bounds, bool defer = false) = 0;
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDLineIntersection.cpp | 118 insert(iA, t, a[iA]); 123 insert(t, iB, b[iB]); 198 insert(iA, aNearB[iA], a[iA]); 203 insert(bNearA[iB], iB, b[iB]); 252 insert(t, (double) flipped, leftPt); 257 insert(t, (double) !flipped, rightPt); 261 insert((double) index, flipped ? 1 - t : t, line[index]); 284 insert(t, (double) flipped, leftPt); 289 insert(t, (double) !flipped, rightPt); 293 insert((doubl [all...] |
/external/chromium_org/tools/deep_memory_profiler/visualizer/ |
H A D | run_tests.py | 20 sys.path.insert(0, sys.argv.pop(1))
|
/external/clang/include/clang/Tooling/ |
H A D | FileMatchTrie.h | 69 void insert(StringRef NewPath);
|
/external/libcxx/test/containers/associative/multimap/multimap.ops/ |
H A D | find.pass.cpp | 185 m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 )); 186 m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 )); 187 m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 )); 188 m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 )); 189 m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 )); 190 m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 )); 191 m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 )); 192 m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 )); 193 m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
|
/external/libcxx/test/containers/associative/multiset/ |
H A D | lower_bound.pass.cpp | 197 m.insert ( V::make ( 5 )); 198 m.insert ( V::make ( 5 )); 199 m.insert ( V::make ( 5 )); 200 m.insert ( V::make ( 7 )); 201 m.insert ( V::make ( 7 )); 202 m.insert ( V::make ( 7 )); 203 m.insert ( V::make ( 9 )); 204 m.insert ( V::make ( 9 )); 205 m.insert ( V::make ( 9 ));
|
H A D | upper_bound.pass.cpp | 196 m.insert ( V::make ( 5 )); 197 m.insert ( V::make ( 5 )); 198 m.insert ( V::make ( 5 )); 199 m.insert ( V::make ( 7 )); 200 m.insert ( V::make ( 7 )); 201 m.insert ( V::make ( 7 )); 202 m.insert ( V::make ( 9 )); 203 m.insert ( V::make ( 9 )); 204 m.insert ( V::make ( 9 ));
|
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | insert_iter_iter_iter.pass.cpp | 14 // iterator insert(const_iterator position, Iter first, Iter last); 27 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const bool*>(a), 43 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a), 60 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const bool*>(a), 76 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a),
|
/external/llvm/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 23 FailedTestsCache.insert(Changes); 36 ((idx < N) ? LHS : RHS).insert(*it); 93 ComplementSets.insert(ComplementSets.end(), Sets.begin(), it); 94 ComplementSets.insert(ComplementSets.end(), it + 1, Sets.end());
|
/external/skia/bench/ |
H A D | GrOrderedSetBench.cpp | 46 set.insert(fData[j]); 80 fSet.insert(rand.nextU() % NUM_ELEMENTS); 120 fSet.insert(rand.nextU() % NUM_ELEMENTS); 129 testSet.insert(*s);
|
/external/skia/src/core/ |
H A D | SkBBoxHierarchy.h | 52 virtual void insert(void* data, const SkIRect& bounds, bool defer = false) = 0;
|
H A D | SkQuadTree.cpp | 57 void SkQuadTree::insert(Node* node, Entry* entry) { function in class:SkQuadTree 62 this->insert(node->fChildren[kTopLeft], entry); 65 this->insert(node->fChildren[kTopRight], entry); 68 this->insert(node->fChildren[kBottomLeft], entry); 71 this->insert(node->fChildren[kBottomRight], entry); 109 this->insert(node, entries.pop()); 156 void SkQuadTree::insert(void* data, const SkIRect& bounds, bool) { function in class:SkQuadTree 167 this->insert(fRoot, entry); 217 this->insert(fRoot, fDeferred.pop());
|
/external/skia/src/pathops/ |
H A D | SkDLineIntersection.cpp | 118 insert(iA, t, a[iA]); 123 insert(t, iB, b[iB]); 195 insert(iA, aNearB[iA], a[iA]); 200 insert(bNearA[iB], iB, b[iB]); 249 insert(t, (double) flipped, leftPt); 254 insert(t, (double) !flipped, rightPt); 258 insert((double) index, flipped ? 1 - t : t, line[index]); 281 insert(t, (double) flipped, leftPt); 286 insert(t, (double) !flipped, rightPt); 290 insert((doubl [all...] |
/external/stlport/test/eh/ |
H A D | test_hash_map.cpp | 55 testMultiMap.insert( x ); 56 testMultiMap2.insert( TestMultiMap::value_type() ); 102 testMap.insert( x ); 103 testMap2.insert( TestMap::value_type() );
|
H A D | test_hash_set.cpp | 51 testMultiSet.insert( x ); 52 testMultiSet2.insert( TestMultiSet::value_type() ); 98 testSet.insert( x ); 99 testSet2.insert( TestSet::value_type() );
|
H A D | test_map.cpp | 59 testMultiMap.insert( x ); 60 testMultiMap2.insert( TestMultiMap::value_type() ); 107 testMap.insert( x ); 108 testMap2.insert( TestMap::value_type() );
|
H A D | test_set.cpp | 48 testMultiSet.insert( x ); 49 testMultiSet2.insert( TestMultiSet::value_type() ); 82 testSet.insert( x ); 83 testSet2.insert( TestSet::value_type() );
|
/external/stlport/test/unit/ |
H A D | map_test.cpp | 64 pair<maptype::iterator, bool> p = m.insert(pair<const char, int>('c', 100)); 70 p = m.insert(pair<const char, int>('c', 100)); 83 m.insert(pair<const char, int>('X', 10)); // Standard way. 86 m.insert(pair<const char, int>('X', 20)); // jbuck: standard way 89 m.insert(pair<const char, int>('Y', 32)); // jbuck: standard way 281 mint1.insert(MapInt::value_type(i, i)); 286 mint2.insert(MapInt::value_type(i, i)); 342 cont.insert(value(Key(1), 1)); 343 cont.insert(value(Key(2), 2)); 344 cont.insert(valu [all...] |
H A D | mvctor_test.cpp | 108 bit_vec.insert(bit_vec.end(), 5, false); 174 //Check the insert range method. 190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end()); 191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front()); 192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front()); 220 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end()); 221 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front()); 222 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front()); 327 //Check the insert value(s) 339 vect_deque.insert(vect_dequ [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _deque.h | 286 iterator insert(iterator __pos, const value_type& __x = _Tp()) { 288 iterator insert(iterator __pos, const value_type& __x) { 292 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x)); 296 iterator insert(iterator __pos) { 299 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator)); 303 void insert(iterator __pos, size_type __n, const value_type& __x) { 306 _M_non_dbg_impl.insert(__pos._M_iterator, __n, __x); 311 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { 317 _M_non_dbg_impl.insert(__pos._M_iterator, 323 void insert(iterato [all...] |
H A D | _vector.h | 274 iterator insert(iterator __pos, const _Tp& __x = _Tp()) { 276 iterator insert(iterator __pos, const _Tp& __x) { 280 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x)); 284 iterator insert(iterator __pos) 285 { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } 291 void insert(iterator __pos, 296 _M_non_dbg_impl.insert(__pos._M_iterator, 302 void insert (iterator __pos, 307 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last); 313 void insert(iterato [all...] |
/external/stlport/stlport/stl/pointers/ |
H A D | _vector.h | 176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:vector 178 iterator insert(iterator __pos, const value_type& __x) 180 { return cast_traits::to_value_type_ptr(_M_impl.insert(cast_traits::to_storage_type_ptr(__pos), 185 iterator insert(iterator __pos) function in class:vector 186 { return _M_impl.insert(cast_traits::to_storage_type_ptr(__pos)); } 196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) function in class:vector 197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } 199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { function in class:vector 200 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), cast_traits::to_storage_type_cptr(__first), 205 void insert (iterato function in class:vector [all...] |
/external/srec/tools/grxmlcompile/ |
H A D | grxmldoc.cpp | 91 m_NodeKeyWords.insert(make_pair("grammar", NodeTypeGrammar)); 92 m_NodeKeyWords.insert(make_pair("rule", NodeTypeRule)); 93 m_NodeKeyWords.insert(make_pair("ruleref", NodeTypeRuleReference)); 94 m_NodeKeyWords.insert(make_pair("one-of", NodeTypeOneOf)); 95 m_NodeKeyWords.insert(make_pair("item", NodeTypeItem)); 96 m_NodeKeyWords.insert(make_pair("tag", NodeTypeTag)); 97 m_NodeKeyWords.insert(make_pair("count", NodeTypeCount)); 98 m_NodeKeyWords.insert(make_pair("meta", NodeTypeMeta)); 381 m_MetaKeyValPairs.insert(meta_name,meta_value); 390 m_MetaKeyValPairs.insert(meta_nam [all...] |