HomeSort by relevance Sort by last modified time
    Searched full:second (Results 451 - 475 of 16670) sorted by null

<<11121314151617181920>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/
assign_copy.pass.cpp 64 assert(i->second == "one");
67 assert(i->second == "four");
70 assert(i->second == "two");
73 assert(i->second == "four");
76 assert(i->second == "three");
79 assert(i->second == "four");
141 assert(i->second == "one");
144 assert(i->second == "four");
147 assert(i->second == "two");
150 assert(i->second == "four")
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/formatting/
AndroidXmlFormattingStrategyTest.java 86 " <second/>\n" +
92 " <second/>\n",
97 " <second/>\n" +
114 " <second/>\n" +
122 " <second/>\n",
127 " <second/>\n" +
143 " <second/>]\n" +
151 " <second/>",
156 " <second/>\n" +
213 " <second/>\r\n"
    [all...]
  /system/extras/tests/lib/testUtil/
testUtil.c 102 // second, is later than the time pointed to by first.
104 const struct timespec *second)
109 assert(second != NULL);
111 assert(second->tv_nsec >= 0 && second->tv_nsec < nSecsPerSec);
112 rv.tv_sec = second->tv_sec - first->tv_sec;
113 if (second->tv_nsec >= first->tv_nsec) {
114 rv.tv_nsec = second->tv_nsec - first->tv_nsec;
116 rv.tv_nsec = (second->tv_nsec + nSecsPerSec) - first->tv_nsec;
125 // second, is later than the time pointed to by first
    [all...]
  /system/webservd/libwebserv/
dbus_protocol_handler.cc 86 ports.insert(pair.second->port());
93 protocols.insert(pair.second->protocol());
100 fingerprint = pair.second->certificate_fingerprint();
119 pair.second->AddRequestHandlerAsync(
126 pair.second),
149 for (const auto& pair : p->second.remote_handler_ids) {
151 pair.second,
164 pair.second.url,
165 pair.second.method,
182 pair.second.remote_handler_ids.clear()
    [all...]
  /external/ceres-solver/include/ceres/
ordered_groups.h 68 if (it->second == group) {
73 group_to_elements_[it->second].erase(element);
74 if (group_to_elements_[it->second].size() == 0) {
75 group_to_elements_.erase(it->second);
127 new_group_to_elements[it->first] = it->second;
131 for (typename set<T>::const_iterator element_it = it->second.begin();
132 element_it != it->second.end();
136 new_group_to_elements[new_group_id] = it->second;
150 return it->second;
163 return (it == group_to_elements_.end()) ? 0 : it->second.size()
    [all...]
  /external/libchrome/base/trace_event/
trace_event_memory_overhead.cc 38 it->second.count += count;
39 it->second.allocated_size_in_bytes += allocated_size_in_bytes;
40 it->second.resident_size_in_bytes += resident_size_in_bytes;
129 return it->second.count;
134 AddOrCreateInternal(it.first, it.second.count,
135 it.second.allocated_size_in_bytes,
136 it.second.resident_size_in_bytes);
147 it.second.allocated_size_in_bytes);
149 it.second.resident_size_in_bytes);
151 MemoryAllocatorDump::kUnitsObjects, it.second.count)
    [all...]
  /external/libcxx/test/std/containers/unord/unord.multimap/
rehash.pass.cpp 31 assert(std::distance(eq.first, eq.second) == 2);
34 assert(i->second == "one");
37 assert(i->second == "four");
39 assert(std::distance(eq.first, eq.second) == 2);
42 assert(i->second == "two");
45 assert(i->second == "four");
48 assert(std::distance(eq.first, eq.second) == 1);
51 assert(i->second == "three");
53 assert(std::distance(eq.first, eq.second) == 1);
56 assert(i->second == "four")
    [all...]
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
emplace_hint.pass.cpp 41 assert(r->second == Emplaceable());
46 assert(r->second == Emplaceable(5, 6));
53 assert(r->second == Emplaceable(6, 7));
57 assert(r->second == Emplaceable());
60 assert(r->second == Emplaceable(5, 6));
73 assert(r->second == Emplaceable());
78 assert(r->second == Emplaceable(5, 6));
85 assert(r->second == Emplaceable(6, 7));
89 assert(r->second == Emplaceable());
92 assert(r->second == Emplaceable(5, 6))
    [all...]
  /external/libgdx/gdx/test/com/badlogic/gdx/math/
IntersectorTest.java 84 boolean second = (triangleEquals(base, 0, 3, secondWay[0]) && triangleEquals(base, 9, 3, secondWay[1]))
86 assertTrue("Either first or second way must be right (first: " + first + ", second: " + second + ")", first ^ second);
104 boolean second = (triangleEquals(base, 0, 3, secondWay[0]) && triangleEquals(base, 9, 3, secondWay[1]))
106 assertTrue("Either first or second way must be right (first: " + first + ", second: " + second + ")", first ^ second);
    [all...]
  /external/vboot_reference/utility/
bmpblk_utility.cc 114 it->second.filename.c_str(),
115 it->second.offset,
116 it->second.data.tag,
117 it->second.data.format);
127 it->second.image_names[k].c_str(),
128 it->second.data.images[k].x,
129 it->second.data.images[k].y,
130 it->second.data.images[k].image_info_offset);
395 it->second.filename.c_str());
397 const string &content = read_image_file(it->second.filename.c_str())
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/
FileWriterTest.java 67 String second = "The second String for testing."; local
68 fileWriter.write(second);
72 char[] out = new char[first.length() + second.length() + 10];
75 assertEquals(first + second, new String(out, 0, length));
83 second = "The second String for testing.";
84 fileWriter.write(second);
88 out = new char[first.length() + second.length() + 10];
91 assertEquals(second, new String(out, 0, length))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
rehash.pass.cpp 31 assert(std::distance(eq.first, eq.second) == 2);
34 assert(i->second == "one");
37 assert(i->second == "four");
39 assert(std::distance(eq.first, eq.second) == 2);
42 assert(i->second == "two");
45 assert(i->second == "four");
48 assert(std::distance(eq.first, eq.second) == 1);
51 assert(i->second == "three");
53 assert(std::distance(eq.first, eq.second) == 1);
56 assert(i->second == "four")
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/
emplace_hint.pass.cpp 41 assert(r->second == Emplaceable());
46 assert(r->second == Emplaceable(5, 6));
53 assert(r->second == Emplaceable(6, 7));
57 assert(r->second == Emplaceable());
60 assert(r->second == Emplaceable(5, 6));
73 assert(r->second == Emplaceable());
78 assert(r->second == Emplaceable(5, 6));
85 assert(r->second == Emplaceable(6, 7));
89 assert(r->second == Emplaceable());
92 assert(r->second == Emplaceable(5, 6))
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
equal_test.cpp 46 CPPUNIT_ASSERT( (range.second - numbers) == 8 );
58 CPPUNIT_ASSERT( (range.second - v.begin()) == 9 );
59 for (; range.first != range.second; ++range.first)
63 CPPUNIT_ASSERT( range.first == range.second );
97 CPPUNIT_ASSERT( (range.second - chars) == 22 );
98 for (; range.first != range.second; ++range.first)
102 CPPUNIT_ASSERT( (range.second - range.first) == 1 );
122 CPPUNIT_ASSERT( p.first != p.second );
124 CPPUNIT_ASSERT( p.second != tv.end() );
126 CPPUNIT_ASSERT( *p.second == 6 )
    [all...]
  /ndk/tests/device/test-stlport/unit/
equal_test.cpp 46 CPPUNIT_ASSERT( (range.second - numbers) == 8 );
58 CPPUNIT_ASSERT( (range.second - v.begin()) == 9 );
59 for (; range.first != range.second; ++range.first)
63 CPPUNIT_ASSERT( range.first == range.second );
97 CPPUNIT_ASSERT( (range.second - chars) == 22 );
98 for (; range.first != range.second; ++range.first)
102 CPPUNIT_ASSERT( (range.second - range.first) == 1 );
122 CPPUNIT_ASSERT( p.first != p.second );
124 CPPUNIT_ASSERT( p.second != tv.end() );
126 CPPUNIT_ASSERT( *p.second == 6 )
    [all...]
  /external/chromium-trace/catapult/third_party/flot/
jquery.flot.selection.min.js 7 (function($){function init(plot){var selection={first:{x:-1,y:-1},second:{x:-1,y:-1},show:false,active:false};var savedhandlers={};var mouseUpHandler=null;function onMouseMove(e){if(selection.active){updateSelection(e);plot.getPlaceholder().trigger("plotselecting",[getSelection()])}}function onMouseDown(e){if(e.which!=1)return;document.body.focus();if(document.onselectstart!==undefined&&savedhandlers.onselectstart==null){savedhandlers.onselectstart=document.onselectstart;document.onselectstart=function(){return false}}if(document.ondrag!==undefined&&savedhandlers.ondrag==null){savedhandlers.ondrag=document.ondrag;document.ondrag=function(){return false}}setSelectionPos(selection.first,e);selection.active=true;mouseUpHandler=function(e){onMouseUp(e)};$(document).one("mouseup",mouseUpHandler)}function onMouseUp(e){mouseUpHandler=null;if(document.onselectstart!==undefined)document.onselectstart=savedhandlers.onselectstart;if(document.ondrag!==undefined)document.ondrag=savedhandlers.ondrag;selection.active=false;updateSelection(e);if(selectionIsSane())triggerSelectedEvent();else{plot.getPlaceholder().trigger("plotunselected",[]);plot.getPlaceholder().trigger("plotselecting",[null])}return false}function getSelection(){if(!selectionIsSane())return null;if(!selection.show)return null;var r={},c1=selection.first,c2=selection.second;$.each(plot.getAxes(),function(name,axis){if(axis.used){var p1=axis.c2p(c1[axis.direction]),p2=axis.c2p(c2[axis.direction]);r[name]={from:Math.min(p1,p2),to:Math.max(p1,p2)}}});return r}function triggerSelectedEvent(){var r=getSelection();plot.getPlaceholder().trigger("plotselected",[r]);if(r.xaxis&&r.yaxis)plot.getPlaceholder().trigger("selected",[{x1:r.xaxis.from,y1:r.yaxis.from,x2:r.xaxis.to,y2:r.yaxis.to}])}function clamp(min,value,max){return value<min?min:value>max?max:value}function setSelectionPos(pos,e){var o=plot.getOptions();var offset=plot.getPlaceholder().offset();var plotOffset=plot.getPlotOffset();pos.x=clamp(0,e.pageX-offset.left-plotOffset.left,plot.width());pos.y=clamp(0,e.pageY-offset.top-plotOffset.top,plot.height());if(o.selection.mode=="y")pos.x=pos==selection.first?0:plot.width();if(o.selection.mode=="x")pos.y=pos==selection.first?0:plot.height()}function updateSelection(pos){if(pos.pageX==null)return;setSelectionPos(selection.second,pos);if(selectionIsSane()){selection.show=true;plot.triggerRedrawOverlay()}else clearSelection(true)}function clearSelection(preventEvent){if(selection.show){selection.show=false;plot.triggerRedrawOverlay();if(!preventEvent)plot.getPlaceholder().trigger("plotunselected",[])}}function extractRange(ranges,coord){var axis,from,to,key,axes=plot.getAxes();for(var k in axes){axis=axes[k];if(axis.direction==coord){key=coord+axis.n+"axis";if(!ranges[key]&&axis.n==1)key=coord+"axis";if(ranges[key]){from=ranges[key].from;to=ranges[key].to;break}}}if(!ranges[key]){axis=coord=="x"?plot.getXAxes()[0]:plot.getYAxes()[0];from=ranges[coord+"1"];to=ranges[coord+"2"]}if(from!=null&&to!=null&&from>to){var tmp=from;from=to;to=tmp}return{from:from,to:to,axis:axis}}function setSelection(ranges,preventEvent){var axis,range,o=plot.getOptions();if(o.selection.mode=="y"){selection.first.x=0;selection.second.x=plot.width()}else{range=extractRange(ranges,"x");selection.first.x=range.axis.p2c(range.from);selection.second.x=range.axis.p2c(range.to)}if(o.selection.mode=="x"){selection.first.y=0;selection.second.y=plot.height()}else{range=extractRange(ranges,"y");selection.first.y=range.axis.p2c(range.from);selection.second.y=range.axis.p2c(range.to)}selection.show=true;plot.triggerRedrawOverlay();if(!preventEvent&&selectionIsSane())triggerSelectedEvent()}function selectionIsSane(){var minSize=plot.getOptions().selection.minSize;return Math.abs(selection.second.x-selection.first.x)>=minSize&&Math.abs(selection.second.y-selection.first.y)>=minSize}plot.clearSelection=clearSelection;plot.setSelection=setSelection;plot.getSelection=getSelection;plot.hooks.bindEvents.push(function(plot,eventHolder){var o=plot.getOptions();if(o.selection.mode!=null){eventHolder.mousemove(onMouseMove);eventHolder.mousedown(onMouseDown)}});plot.hooks.drawOverlay.push(function(plot,ctx){if(selection.show&&selectionIsSane()){var plotOffset=plot.getPlotOffset();var o=plot.getOptions();ctx.save();ctx.translate(plotOffset.left,plotOffset.top);var c=$.color.parse(o.selection.color);ctx.strokeStyle=c.scale("a",.8).toString();ctx.lineWidth=1;ctx.lineJoin=o.selection.shape;ctx.fillStyle=c.scale("a",.4).toString();var x=Math.min(selection.first.x,selection.second.x)+.5,y=Math.min(selection.first.y,selection.second.y)+.5,w=Math.abs(selection.second.x-selection. (…)
    [all...]
  /external/google-breakpad/src/processor/
range_map-inl.h 79 // AddressType other_base = iterator_base->second.base();
91 if (iterator_high->second.base() <= high) {
99 // AddressType other_base = iterator_high->second.base();
133 if (address < iterator->second.base())
136 *entry = iterator->second.entry();
138 *entry_base = iterator->second.base();
140 *entry_size = iterator->first - iterator->second.base() + 1;
167 *entry = iterator->second.entry();
169 *entry_base = iterator->second.base();
171 *entry_size = iterator->first - iterator->second.base() + 1
    [all...]
  /external/libcxx/test/std/containers/associative/map/map.modifiers/
try.emplace.pass.cpp 78 assert(!r.second); // was not inserted
85 assert(r.second); // was inserted
88 assert(r.first->second.get() == 3); // value
93 assert(r.second); // was inserted
96 assert(r.first->second.get() == 5); // value
101 assert(r.second); // was inserted
104 assert(r.first->second.get() == -1); // value
120 assert(!r.second); // was not inserted
128 assert(r.second); // was inserted
132 assert(r.first->second.get() == 4); // valu
    [all...]
insert_iter_iter.pass.cpp 44 assert(m.begin()->second == 1);
46 assert(next(m.begin())->second == 1);
48 assert(next(m.begin(), 2)->second == 1);
70 assert(m.begin()->second == 1);
72 assert(next(m.begin())->second == 1);
74 assert(next(m.begin(), 2)->second == 1);
  /external/llvm/include/llvm/ADT/
MapVector.h 78 unsigned &I = Result.first->second;
79 if (Result.second) {
83 return Vector[I].second;
88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second;
94 unsigned &I = Result.first->second;
95 if (Result.second) {
96 Vector.push_back(std::make_pair(KV.first, KV.second));
111 (Vector.begin() + Pos->second);
117 (Vector.begin() + Pos->second);
    [all...]
  /external/vulkan-validation-layers/layers/
vk_layer_table.cpp 42 return it->second;
51 it->second);
57 return it->second;
64 fprintf(stderr, "destroy device dispatch_table: map: %p, key: %p, table: %p\n", &map, key, it->second);
77 fprintf(stderr, "destroy instance dispatch_table: map: %p, key: %p, table: %p\n", &map, key, it->second);
96 it->second);
102 return it->second;
112 it->second);
118 return it->second;
159 fprintf(stderr, "Instance: map: %p, key: %p, table: %p\n", &map, key, it->second);
    [all...]
  /system/connectivity/shill/
fake_store.cc 46 const auto& required_value = required_property_name_and_value.second;
48 if (group_it == group.end() || group_it->second != required_value) {
97 const auto& group_settings = group_name_and_settings.second;
111 const auto& group_settings = group_name_and_settings.second;
131 auto& group_settings = group_name_and_settings->second;
221 const auto& group_settings = group_name_and_settings->second;
228 if (!property_name_and_value->second.IsTypeCompatible<T>()) {
233 << property_name_and_value->second.GetUndecoratedTypeName()
239 return property_name_and_value->second.GetValue(out);
254 auto& group_settings = group_name_and_settings->second;
    [all...]
  /external/libchrome/base/metrics/
statistics_recorder.cc 64 if (!callback_iterator->second.is_null())
70 } else if (histogram == it->second) {
76 it->second->histogram_name()) << "hash collision";
77 histogram_to_return = it->second;
108 checksum_matching_list = ranges_it->second;
197 DCHECK_EQ(entry.first, entry.second->name_hash());
198 output->push_back(entry.second);
212 for (const auto& range_entry : *entry.second) {
229 DCHECK_EQ(name, it->second->histogram_name()) << "hash collision";
230 return it->second;
    [all...]
  /external/libcxx/test/std/containers/unord/unord.map/
equal_range_const.pass.cpp 43 assert(std::distance(r.first, r.second) == 1);
45 assert(r.first->second == "thirty");
47 assert(std::distance(r.first, r.second) == 0);
68 assert(std::distance(r.first, r.second) == 1);
70 assert(r.first->second == "thirty");
72 assert(std::distance(r.first, r.second) == 0);
equal_range_non_const.pass.cpp 43 assert(std::distance(r.first, r.second) == 1);
45 assert(r.first->second == "thirty");
47 assert(std::distance(r.first, r.second) == 0);
68 assert(std::distance(r.first, r.second) == 1);
70 assert(r.first->second == "thirty");
72 assert(std::distance(r.first, r.second) == 0);

Completed in 1766 milliseconds

<<11121314151617181920>>