HomeSort by relevance Sort by last modified time
    Searched defs:it (Results 226 - 250 of 2313) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/eigen/test/
stable_norm.cpp 38 int ibeta, it, iemin, iemax; local
41 it = std::numeric_limits<RealScalar>::digits; // number of base-beta digits in mantissa
45 VERIFY( (!(iemin > 1 - 2*it || 1+it>iemax || (it==2 && ibeta<5) || (it<=4 && ibeta <= 3 ) || it<2))
  /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/
insert_or_assign.pass.cpp 148 M::const_iterator it = m.find(2); local
151 r = m.insert_or_assign(it, 2, std::move(mv1));
158 r = m.insert_or_assign(it, 3, std::move(mv2));
171 M::const_iterator it = std::next(m.cbegin()); local
175 r = m.insert_or_assign(it, std::move(mvkey1), std::move(mv1));
184 r = m.insert_or_assign(it, std::move(mvkey2), std::move(mv2));
try.emplace.pass.cpp 146 M::const_iterator it = m.find(2); local
151 r = m.try_emplace(it, i, std::move(mv1));
158 r = m.try_emplace(it, 3, std::move(mv1));
172 M::const_iterator it = std::next(m.cbegin()); local
176 r = m.try_emplace(it, std::move(mvkey1), std::move(mv1));
183 r = m.try_emplace(it, std::move(mvkey2), std::move(mv1));
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
erase_const_iter.pass.cpp 135 I it = m.find(a); local
136 if (it != m.end())
137 m.erase(it);
  /external/llvm/unittests/ADT/
DenseMapTest.cpp 129 // two-phase name lookup, it also doesn't require the typename. Deal with
154 typename TypeParam::iterator it = this->Map.begin(); local
155 EXPECT_EQ(this->getKey(), it->first);
156 EXPECT_EQ(this->getValue(), it->second);
157 ++it;
158 EXPECT_TRUE(it == this->Map.end());
321 for (typename TypeParam::iterator it = this->Map.begin();
322 it != this->Map.end(); ++it)
323 visited[visitedIndex[it->first]] = true
333 typename TypeParam::iterator it = this->Map.begin(); local
    [all...]
  /external/ltrace/
filter.c 5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
10 * This program is distributed in the hope that it will be useful, but
40 struct filter_rule *it; local
41 for (it = filt->rules; it != NULL; ) {
42 struct filter_rule *next = it->next;
43 filter_rule_destroy(it);
44 it = next;
151 struct filter_rule *it; local
170 struct filter_rule *it; local
    [all...]
  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_fence.c 111 struct nouveau_fence *it; local
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
124 screen->fence.tail = it;
  /external/mesa3d/src/gallium/drivers/nv50/
nv50_context.c 207 struct nouveau_list *it; local
209 for (it = list->next; it != list; it = it->next) {
210 struct nouveau_bufref *ref = (struct nouveau_bufref *)it;
  /external/mesa3d/src/gallium/drivers/nvc0/
nvc0_context.c 213 struct nouveau_list *it; local
215 for (it = list->next; it != list; it = it->next) {
216 struct nouveau_bufref *ref = (struct nouveau_bufref *)it;
  /external/nist-sip/java/gov/nist/javax/sip/header/
AllowEventsList.java 104 ListIterator<String> it = methods.listIterator(); local
105 while (it.hasNext()) {
107 allowEvents.setEventType((String) it.next());
AllowList.java 82 for ( Iterator<Allow> it = this.hlist.iterator(); it.hasNext();) {
83 Allow a = (Allow)it.next();
106 ListIterator<String> it = methods.listIterator(); local
107 while (it.hasNext()) {
109 allow.setMethod((String) it.next());
Server.java 63 ListIterator it = productTokens.listIterator(); local
65 while (it.hasNext()) {
66 tokens.append((String) it.next());
67 if (it.hasNext())
143 * CVS: then name the system in this line, otherwise delete it.
151 * CVS: If you have not had it reviewed then delete this line.
178 * CVS: then name the system in this line, otherwise delete it.
186 * CVS: If you have not had it reviewed then delete this line.
UserAgent.java 61 ListIterator it = productTokens.listIterator(); local
63 while (it.hasNext()) {
64 tokens.append((String) it.next());
158 * CVS: then name the system in this line, otherwise delete it.
166 * CVS: If you have not had it reviewed then delete this line.
196 * CVS: then name the system in this line, otherwise delete it.
204 * CVS: If you have not had it reviewed then delete this line.
  /external/opencv3/samples/cpp/
filestorage.cpp 23 << "For example, how to create a class and have it serialize, but also how to use it to read and write matrices.\n"
125 FileNodeIterator it = n.begin(), it_end = n.end(); local
126 for (; it != it_end; ++it)
128 cout << (string)*it << "\n";
image.cpp 14 "It shows reading of images, converting to planes and merging back, color conversion\n"
40 Mat img = cv::cvarrToMat(iplimg); // cv::Mat replaces the CvMat and IplImage, but it's easy to convert
59 vector<Mat> planes; // Vector is template vector class, similar to STL's vector. It can store matrices too.
64 MatIterator_<uchar> it = planes[0].begin<uchar>(), it_end = planes[0].end<uchar>(); local
65 for(; it != it_end; ++it)
67 double v = *it*1.7 + rand()%21-10;
68 *it = saturate_cast<uchar>(v*v/255.);
93 // it's easy to pass the new matrices to the functions that only work with IplImage or CvMat:
102 // Mat::convertTo() replaces cvConvertScale. One must explicitly specify the output matrix type (we keep it intact - planes[1].type()
    [all...]
  /external/opencv3/samples/cpp/tutorial_code/core/file_input_output/
file_input_output.cpp 14 << "The output file may be either XML (xml) or YAML (yml/yaml). You can even compress it by "
17 << "For example: - create a class and have it serialized" << endl
18 << " - use it to read and write matrices." << endl;
122 FileNodeIterator it = n.begin(), it_end = n.end(); // Go through the node local
123 for (; it != it_end; ++it)
124 cout << (string)*it << endl;
  /external/opencv3/samples/cpp/tutorial_code/core/interoperability_with_OpenCV_1/
interoperability_with_OpenCV_1.cpp 11 using namespace cv; // The new C++ interface API is inside this namespace. Import it.
66 #if 1 // change it to 0 if you want to see a blurred and noisy version of this processing
70 MatIterator_<uchar> it = planes[0].begin<uchar>(), it_end = planes[0].end<uchar>(); local
71 for(; it != it_end; ++it)
73 double v = *it * 1.7 + rand()%21 - 10;
74 *it = saturate_cast<uchar>(v*v/255);
120 // One must explicitly specify the output matrix type (we keep it intact - planes[1].type())
  /external/pdfium/core/src/fxge/ge/
fx_ge_linux.cpp 87 auto it = m_FontList.find(LinuxGpFontList[index].NameArr[i]); local
88 if (it != m_FontList.end()) {
89 return it->second;
95 auto it = m_FontList.find(g_LinuxGbFontList[i]); local
96 if (it != m_FontList.end()) {
97 return it->second;
103 auto it = m_FontList.find(g_LinuxB5FontList[i]); local
104 if (it != m_FontList.end()) {
105 return it->second;
111 auto it = m_FontList.find(g_LinuxHGFontList[i]) local
    [all...]
  /external/protobuf/src/google/protobuf/compiler/java/
java_field.cc 200 const map<string, string>::const_iterator it = local
202 if (it != variables.end() && !it->second.empty()) {
  /external/v8/src/runtime/
runtime-forin.cc 50 LookupIterator it = local
53 for (; it.IsFound(); it.Next()) {
54 switch (it.state()) {
60 result = JSProxy::GetPropertyAttributes(&it);
64 Handle<JSProxy> proxy = it.GetHolder<JSProxy>();
75 return it.GetName();
79 result = JSObject::GetPropertyAttributesWithInterceptor(&it);
81 if (result.FromJust() != ABSENT) return it.GetName();
85 if (it.HasAccess()) continue
    [all...]
  /external/vixl/src/vixl/a64/
decoder-a64.h 152 std::list<DecoderVisitor*>::iterator it; local
153 for (it = visitors_.begin(); it != visitors_.end(); it++) {
154 VIXL_ASSERT((*it)->IsConstVisitor());
  /external/vulkan-validation-layers/libs/vkjson/
vkjson_unittest.cc 86 auto it = device2.formats.find(kv.first); local
87 EXPECT(it != device2.formats.end());
88 EXPECT(!memcmp(&kv.second, &it->second, sizeof(kv.second)));
  /external/webrtc/webrtc/modules/audio_coding/neteq/
decoder_database_unittest.cc 136 // Get the decoder info struct and check it too.
145 // Expect not to delete the decoder when removing it from the database, since
146 // it was declared externally.
184 PacketList::iterator it = packet_list.begin(); local
185 while (it != packet_list.end()) {
187 it = packet_list.erase(it);
dtmf_buffer.cc 20 // longer required, this #define should be removed (and the code that it
89 // bit stream using the ParseEvent method above before inserting it in the
92 // is not known when the first packet describing it is sent. To deal with that,
94 // event as it is being created (typically, as the user is pressing the key).
107 DtmfList::iterator it = buffer_.begin(); local
108 while (it != buffer_.end()) {
109 if (MergeEvents(it, event)) {
113 ++it;
122 DtmfList::iterator it = buffer_.begin(); local
123 while (it != buffer_.end())
    [all...]
  /external/webrtc/webrtc/modules/audio_coding/neteq/test/
RTPchange.cc 118 std::vector<NETEQTEST_RTPpacket *>::iterator it; local
119 for (it = packet_vec.begin(); it != packet_vec.end(); it++) {
121 if ((*it)->writeToFile(out_file) < 0) {
126 delete *it;

Completed in 5070 milliseconds

1 2 3 4 5 6 7 8 91011>>