| /external/parameter-framework/parameter/ |
| Subsystem.cpp | 211 // The list is parsed in reverse order because it has been filled from the leaf to the trunk
214 list<const CConfigurableElement*>::const_reverse_iterator it; local
215 for (it = configurableElementPath.rbegin(); it != configurableElementPath.rend(); ++it) {
218 static_cast<const CInstanceConfigurableElement*>(*it);
231 list<CSubsystemObject*>::const_iterator it; local
232 for (it = _subsystemObjectList.begin(); it != _subsystemObjectList.end(); ++it) {
252 std::vector<CSubsystemObjectCreator*>::const_iterator it; local
[all...] |
| /external/pdfium/samples/ |
| image_diff.cc | 174 RgbaToCountMap::iterator it = baseline_histogram.find(actual_rgba); local
175 if (it != baseline_histogram.end() && it->second > 0)
176 it->second--;
247 decided it's too complicated. We may use it in the future if it looks useful
|
| /external/protobuf/gtest/test/ |
| gtest-param-test_test.cc | 132 typename ParamGenerator<T>::iterator it = generator.begin(); local
134 ASSERT_FALSE(it == generator.end())
139 EXPECT_TRUE(expected_values[i] == *it)
142 << ", *it is " << PrintValue(*it)
143 << ", and 'it' is an iterator created with the copy constructor.\n";
144 it++;
146 EXPECT_TRUE(it == generator.end())
154 it = generator.begin();
156 ASSERT_FALSE(it == generator.end()
173 typename ParamGenerator<T>::iterator it = generator.begin(); local
191 ParamGenerator<int>::iterator it = gen.begin(); local
292 ParamGenerator<DogAdder>::iterator it = gen.begin(); local
325 ParamGenerator<IntWrapper>::iterator it = gen.begin(); local
[all...] |
| /external/protobuf/src/google/protobuf/ |
| descriptor_database.cc | 90 // If the symbol name is invalid it could break our lookup algorithm (which
103 // Apparently the map is currently empty. Just insert and be done with it.
118 // to increment it.
154 // The extension is fully-qualified. We can use it as a lookup key in
201 typename map<pair<string, int>, Value >::const_iterator it = local
205 for (; it != by_extension_.end() && it->first.first == containing_type;
206 ++it) {
207 output->push_back(it->first.second);
348 // Try to just read it directly
[all...] |
| repeated_field_unittest.cc | 35 // TODO(kenton): Improve this unittest to bring it up to the standards of
192 // to it until it re-allocates its space.
1066 RepeatedPtrField<string>::const_iterator it = local
1069 EXPECT_EQ(*it, "n");
1070 EXPECT_TRUE(it == proto_array_.begin() + 3);
1227 RepeatedPtrField<string>::pointer_iterator it = local
1238 RepeatedPtrField<string>::const_pointer_iterator it = local
[all...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| map_util.h | 57 // Returns a const reference to the value associated with the given key if it
64 // * It has a side-effect of inserting missing keys
65 // * It is not thread-safe (even when it is not inserting, it can still
67 // * It invalidates iterators (when it chooses to resize)
68 // * It default constructs a value object even if it doesn't need to
70 // This version assumes the key is printable, and includes it in the fatal lo
76 typename Collection::const_iterator it = collection.find(key); local
86 typename Collection::iterator it = collection.find(key); local
96 typename Collection::const_iterator it = collection.find(key); local
106 typename Collection::iterator it = collection.find(key); local
126 typename Collection::const_iterator it = collection.find(key); local
139 typename Collection::const_iterator it = collection.find(key); local
151 typename Collection::iterator it = collection.find(key); local
168 typename Collection::const_iterator it = collection.find(key); local
183 typename Collection::iterator it = collection.find(key); local
196 typename Collection::const_iterator it = collection.find(key); local
210 typename Collection::const_iterator it = collection.find(key); local
223 typename Collection::const_iterator it = collection.find(key); local
666 typename Collection::iterator it = collection->find(key); local
[all...] |
| /external/sfntly/cpp/src/sfntly/table/bitmap/ |
| bitmap_size_table.cc | 375 Ptr<BitmapSizeTable::Builder::BitmapGlyphInfoIterator> it; local
376 it.Attach(GetIterator());
377 while (it->HasNext()) {
379 info.Attach(it->Next());
516 IndexSubTableFormat1::Builder::BitmapGlyphInfoIterator* it = local
519 return it->HasNext();
523 IndexSubTableFormat2::Builder::BitmapGlyphInfoIterator* it = local
526 return it->HasNext();
530 IndexSubTableFormat3::Builder::BitmapGlyphInfoIterator* it = local
533 return it->HasNext()
537 IndexSubTableFormat4::Builder::BitmapGlyphInfoIterator* it = local
544 IndexSubTableFormat5::Builder::BitmapGlyphInfoIterator* it = local
563 IndexSubTableFormat1::Builder::BitmapGlyphInfoIterator* it = local
570 IndexSubTableFormat2::Builder::BitmapGlyphInfoIterator* it = local
577 IndexSubTableFormat3::Builder::BitmapGlyphInfoIterator* it = local
584 IndexSubTableFormat4::Builder::BitmapGlyphInfoIterator* it = local
591 IndexSubTableFormat5::Builder::BitmapGlyphInfoIterator* it = local
[all...] |
| index_sub_table_format4.cc | 146 Ptr<IndexSubTableFormat4::Builder::BitmapGlyphInfoIterator> it = local
148 return it.Detach();
|
| index_sub_table_format5.cc | 108 IntegerList::iterator it = std::find(glyph_array->begin(), local
111 if (it == glyph_array->end()) {
114 return (it - glyph_array->begin()) * ImageSize();
119 Ptr<IndexSubTableFormat5::Builder::BitmapGlyphInfoIterator> it = local
121 return it.Detach();
|
| /external/v8/src/ |
| allocation-tracker.cc | 129 RangeMap::const_iterator it = ranges_.upper_bound(addr); local
130 if (it == ranges_.end()) return 0;
131 if (it->second.start <= addr) {
132 return it->second.trace_node_id;
153 for (RangeMap::iterator it = ranges_.begin(); it != ranges_.end(); ++it) {
154 PrintF("[%p - %p] => %u\n", it->second.start, it->first,
155 it->second.trace_node_id)
162 RangeMap::iterator it = ranges_.upper_bound(start); local
[all...] |
| disassembler.cc | 59 // print as code offset, if it seems reasonable
104 RelocIterator* it = NULL; local
106 it = new RelocIterator(converter.code());
129 } else if (it != NULL && !it->done() && it->rinfo()->pc() == pc &&
130 it->rinfo()->rmode() == RelocInfo::INTERNAL_REFERENCE) {
149 if (it != NULL) {
150 while (!it->done() && it->rinfo()->pc() < pc)
[all...] |
| /external/vogar/src/vogar/tasks/ |
| TaskQueue.java | 196 for (Iterator<Task> it = tasks.iterator(); it.hasNext(); ) {
197 Task potentiallyUnblocked = it.next();
199 it.remove();
|
| /external/webrtc/src/modules/audio_processing/ |
| audio_processing_impl.cc | 165 std::list<ProcessingComponent*>::iterator it; local
166 for (it = component_list_.begin(); it != component_list_.end(); it++) {
167 int err = (*it)->Initialize();
569 std::list<ProcessingComponent*>::const_iterator it; local
570 for (it = component_list_.begin(); it != component_list_.end(); it++) {
571 if ((*it)->is_component_enabled())
[all...] |
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPNode.java | 7 // of the Adobe license agreement accompanying it.
356 * <em>Note:</em> take care to use it.remove(), as the flag are not adjusted in that case.
382 * <em>Note:</em> take care to use it.remove(), as the flag are not adjusted in that case.
388 final Iterator it = getQualifier().iterator(); local
394 return it.hasNext();
399 return it.next();
444 * qualifier )into and add it to the destination node.
452 for (Iterator it = iterateChildren(); it.hasNext();)
454 XMPNode child = (XMPNode) it.next()
[all...] |
| /frameworks/av/media/libstagefright/ |
| AudioSource.cpp | 141 List<MediaBuffer *>::iterator it; local
143 it = mBuffersReceived.begin();
144 (*it)->release();
145 mBuffersReceived.erase(it);
|
| TimedEventQueue.cpp | 123 List<QueueItem>::iterator it = mQueue.begin(); local
124 while (it != mQueue.end() && realtime_us >= (*it).realtime_us) {
125 ++it;
133 if (it == mQueue.begin()) {
141 mQueue.insert(it, item);
169 // if MatchesEventID found a match, it will have set id to 0
181 List<QueueItem>::iterator it = mQueue.begin(); local
182 while (it != mQueue.end()) {
183 if (!(*predicate)(cookie, (*it).event))
242 List<QueueItem>::iterator it = mQueue.begin(); local
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/ |
| SoftMPEG4.cpp | 128 List<BufferInfo *>::iterator it = outQueue.begin(); local
129 while ((*it)->mHeader != outHeader) {
130 ++it;
133 BufferInfo *outInfo = *it;
135 outQueue.erase(it);
232 // The PV decoder is lying to us, sometimes it'll claim to only have
233 // consumed a subset of the buffer when it clearly consumed all of it.
234 // ignore whatever it says...
277 List<BufferInfo *>::iterator it = outQueue.begin() local
[all...] |
| /frameworks/av/media/libstagefright/mpeg2ts/ |
| AnotherPacketSource.cpp | 98 List<sp<ABuffer> >::iterator it = mBuffers.begin(); local
99 while (it != mBuffers.end()) {
100 sp<ABuffer> buffer = *it;
110 ++it;
316 List<sp<ABuffer> >::iterator it = mBuffers.begin(); local
317 while (it != mBuffers.end()) {
318 sp<ABuffer> oldBuffer = *it;
323 it = mBuffers.erase(it);
327 ++it;
385 List<sp<ABuffer> >::iterator it; local
479 List<sp<ABuffer> >::iterator it; local
524 List<sp<ABuffer> >::iterator it; local
583 List<sp<ABuffer> >::iterator it; local
[all...] |
| /frameworks/av/media/libstagefright/rtsp/ |
| AMPEG4ElementaryAssembler.cpp | 215 List<sp<ABuffer> >::iterator it = queue->begin(); local
216 while (it != queue->end()) {
217 if ((uint32_t)(*it)->int32Data() >= mNextExpectedSeqNo) {
221 it = queue->erase(it);
345 for (List<AUHeader>::iterator it = headers.begin();
346 it != headers.end(); ++it) {
347 const AUHeader &header = *it;
|
| /frameworks/av/services/audiopolicy/engineconfigurable/wrapper/ |
| ParameterManagerWrapper.cpp | 226 typename std::map<string, T *>::iterator it = elementsMap.find(name); local
227 ALOG_ASSERT(it != elementsMap.end(), "Element " << name << " not found");
228 return it->second;
235 typename std::map<string, T *>::const_iterator it = elementsMap.find(name); local
236 ALOG_ASSERT(it != elementsMap.end(), "Element " << name << " not found");
237 return it->second;
|
| /frameworks/av/services/camera/libcameraservice/device3/ |
| Camera3Stream.cpp | 533 List<wp<Camera3StreamBufferListener> >::iterator it, end; local
542 for (it = mBufferListenerList.begin(), end = mBufferListenerList.end();
543 it != end;
544 ++it) {
546 sp<Camera3StreamBufferListener> listener = it->promote();
699 List<wp<Camera3StreamBufferListener> >::iterator it, end; local
700 for (it = mBufferListenerList.begin(), end = mBufferListenerList.end();
701 it != end;
703 if (*it == listener) {
707 it++
718 List<wp<Camera3StreamBufferListener> >::iterator it, end; local
[all...] |
| Camera3ZslStream.cpp | 158 List<sp<RingBufferConsumer::PinnedBufferItem> >::iterator it, end; local
159 it = mInputBufferQueue.begin();
163 if (it == end) {
168 bufferItem = *it;
169 mInputBufferQueue.erase(it);
178 * in which case we reassign it to acquire_fence
210 Vector<sp<PinnedBufferItem> >::iterator it, end; local
211 for (it = mBuffersInFlight.begin(), end = mBuffersInFlight.end();
212 it != end;
213 ++it) {
[all...] |
| /frameworks/base/core/java/android/util/ |
| ArraySet.java | 35 * that may contain large numbers of items. It is generally slower than a traditional
41 * standard Java containers it will shrink its array as items are removed from it. Currently
43 * item, it may reduce the capacity to better match the current size. In the future an
65 * list; the second entry is a pointer to the int[] hash code array for it.
222 * will grow once items are added to it.
306 * @return Returns the index of the value if it exists, else a negative integer.
330 * Adds the specified object to this set. The set is not modified if it
438 // Shrunk enough to reduce size of arrays. We don't allow it to
529 * set, it checks to make sure the value also exists in the other set
681 Iterator<?> it = collection.iterator(); local
[all...] |
| /frameworks/base/services/tests/servicestests/src/com/android/server/job/ |
| JobStoreTest.java | 102 Iterator<JobStatus> it = jobStatusSet.iterator(); local
103 JobStatus loaded1 = it.next();
104 JobStatus loaded2 = it.next();
|
| /frameworks/base/tools/layoutlib/bridge/src/android/text/ |
| OptimizingLineBreaker.java | 48 // This can be true only if it's an empty paragraph.
69 for (ListIterator<Integer> it = active.listIterator(); it.hasNext();
71 int pos = it.next();
76 // because of the way tab characters work, this makes it computationally
96 it.remove();
|
