HomeSort by relevance Sort by last modified time
    Searched full:last (Results 626 - 650 of 22121) sorted by null

<<21222324252627282930>>

  /external/curl/docs/libcurl/
curl_formadd.3 141 last argument in such an array must always be \fBCURLFORM_END\fP.
162 struct curl_httppost* last = NULL;
177 curl_formadd(&post, &last, CURLFORM_COPYNAME, "name",
181 curl_formadd(&post, &last, CURLFORM_COPYNAME, "htmlcode",
186 curl_formadd(&post, &last, CURLFORM_COPYNAME, "name_for_ptrcontent",
190 curl_formadd(&post, &last, CURLFORM_PTRNAME, namebuffer,
195 curl_formadd(&post, &last, CURLFORM_COPYNAME, "html_code_with_hole",
201 curl_formadd(&post, &last, CURLFORM_COPYNAME, "picture",
205 curl_formadd(&post, &last, CURLFORM_COPYNAME, "picture",
210 curl_formadd(&post, &last, CURLFORM_COPYNAME, "pictures"
    [all...]
  /external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base.tests/src/com/ibm/icu/tests/
BreakIteratorTest.java 85 * Test method for 'com.ibm.icu.text.BreakIterator.last()'
88 assertEquals(text.length(), cbr.last());
89 assertEquals(text.length(), wbr.last());
90 assertEquals(text.length(), lbr.last());
91 assertEquals(text.length(), sbr.last());
107 cbr.last();
108 wbr.last();
109 lbr.last();
110 sbr.last();
135 cbr.last();
    [all...]
  /external/regex-re2/re2/
unicode.py 96 These are of the form '<Name, First>' or '<Name, Last>'.
99 code value in the range and one for the last.
101 and the second is '<Name, Last>'.
104 '<Name, Last>' => ('Name', 'Last')
111 pair: name and ('First', 'Last', or None)
114 match = re.match("<(.*), (First|Last)>", s)
159 expect_last = None # tag expected for "Last" line in multiline range
188 # If the last line gave the First code in a range,
189 # this one had better give the Last one
    [all...]
  /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/
InsnList.java 63 * The last instruction in this list. May be <tt>null</tt>.
65 private AbstractInsnNode last; field in class:InsnList
93 * Returns the last instruction in this list.
95 * @return the last instruction in this list, or <tt>null</tt> if the list
99 return last;
230 last = insn;
264 if (last == null) {
266 last = insn;
268 last.next = insn;
269 insn.prev = last;
    [all...]
  /external/webrtc/webrtc/modules/rtp_rtcp/source/
rtp_format_h264_unittest.cc 91 bool last = false; local
94 ASSERT_TRUE(packetizer->NextPacket(packet.get(), &length, &last));
96 EXPECT_EQ(i == expected_sizes.size() - 1, last) << "FUA index: " << i;
100 EXPECT_FALSE(packetizer->NextPacket(packet.get(), &length, &last));
164 bool last = false;
165 ASSERT_TRUE(packetizer->NextPacket(packet, &length, &last));
167 EXPECT_TRUE(last);
170 EXPECT_FALSE(packetizer->NextPacket(packet, &length, &last));
194 bool last = false; local
195 ASSERT_TRUE(packetizer->NextPacket(packet, &length, &last));
231 bool last = false; local
266 bool last = false; local
318 bool last = false; local
    [all...]
  /external/valgrind/coregrind/
m_options.c 337 HChar const* last = VG_(clo_trace_children_skip); local
339 while (*last) {
342 HChar const* first = consume_commas(last);
343 last = consume_field(first);
344 if (first == last)
346 vg_assert(last > first);
349 patt = VG_(calloc)("m_options.swttc.1", last - first + 1, 1);
350 VG_(memcpy)(patt, first, last - first);
351 vg_assert(patt[last-first] == 0);
362 HChar const* last = VG_(clo_trace_children_skip_by_arg) local
    [all...]
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
vlc_decode.cpp 875 pTcoef->last = (uint) tab->last; //(tab->val >> 16) & 1;
884 //if (((tab->run<<8)|(tab->level)|(tab->last<<16)) == VLC_ESCAPE_CODE)
922 pTcoef->last = (uint)tab->last; //(tab->val >> 16) & 1;
926 if ((pTcoef->last == 0 && pTcoef->run > 14) || (pTcoef->last == 1 && pTcoef->run > 20))
930 pTcoef->level = pTcoef->level + intra_max_level[pTcoef->last][pTcoef->run];
974 pTcoef->last = (uint)tab->last; //(tab->val >> 16) & 1
    [all...]
  /frameworks/base/tools/aapt2/
ResourceTable.cpp 43 const auto last = packages.end(); local
44 auto iter = std::lower_bound(packages.begin(), last, name,
46 if (iter != last && name == (*iter)->name) {
75 const auto last = packages.end(); local
76 auto iter = std::lower_bound(packages.begin(), last, name,
78 if (iter != last && name == (*iter)->name) {
88 const auto last = types.end(); local
89 auto iter = std::lower_bound(types.begin(), last, type, lessThanType);
90 if (iter != last && (*iter)->type == type) {
97 const auto last = types.end() local
106 const auto last = entries.end(); local
116 auto last = entries.end(); local
    [all...]
  /bionic/libc/bionic/
pthread_barrier.cpp 111 // with the last thread entering the barrier, and a happens-before relation between the last
119 // the last thread leaving the previous cycle, so we can read correct wait_count below.
134 // the barrier with the last thread entering the barrier.
146 // Use release operation here to synchronize between the last thread entering the
152 // Use acquire operation here to synchronize between the last thread entering the
173 // Use acquire operation here to synchronize with the last thread leaving the barrier.
  /external/chromium-trace/catapult/third_party/pipeline/pipeline/ui/
jquery.treeview.min.js 15 */;(function($){$.extend($.fn,{swapClass:function(c1,c2){var c1Elements=this.filter('.'+c1);this.filter('.'+c2).removeClass(c2).addClass(c1);c1Elements.removeClass(c1).addClass(c2);return this;},replaceClass:function(c1,c2){return this.filter('.'+c1).removeClass(c1).addClass(c2).end();},hoverClass:function(className){className=className||"hover";return this.hover(function(){$(this).addClass(className);},function(){$(this).removeClass(className);});},heightToggle:function(animated,callback){animated?this.animate({height:"toggle"},animated,callback):this.each(function(){jQuery(this)[jQuery(this).is(":hidden")?"show":"hide"]();if(callback)callback.apply(this,arguments);});},heightHide:function(animated,callback){if(animated){this.animate({height:"hide"},animated,callback);}else{this.hide();if(callback)this.each(callback);}},prepareBranches:function(settings){if(!settings.prerendered){this.filter(":last-child:not(ul)").addClass(CLASSES.last);this.filter((settings.collapsed?"":"."+CLASSES.closed)+":not(."+CLASSES.open+")").find(">ul").hide();}return this.filter(":has(>ul)");},applyClasses:function(settings,toggler){this.filter(":has(>ul):not(:has(>a))").find(">span").click(function(event){toggler.apply($(this).next());}).add($("a",this)).hoverClass();if(!settings.prerendered){this.filter(":has(>ul:hidden)").addClass(CLASSES.expandable).replaceClass(CLASSES.last,CLASSES.lastExpandable);this.not(":has(>ul:hidden)").addClass(CLASSES.collapsable).replaceClass(CLASSES.last,CLASSES.lastCollapsable);this.prepend("<div class=\""+CLASSES.hitarea+"\"/>").find("div."+CLASSES.hitarea).each(function(){var classes="";$.each($(this).parent().attr("class").split(" "),function(){classes+=this+"-hitarea ";});$(this).addClass(classes);});}this.find("div."+CLASSES.hitarea).click(toggler);},treeview:function(settings){settings=$.extend({cookieId:"treeview"},settings);if(settings.add){return this.trigger("add",[settings.add]);}if(settings.toggle){var callback=settings.toggle;settings.toggle=function(){return callback.apply($(this).parent()[0],arguments);};}function treeController(tree,control){function handler(filter){return function(){toggler.apply($("div."+CLASSES.hitarea,tree).filter(function(){return filter?$(this).parent("."+filter).length:true;}));return false;};}$("a:eq(0)",control).click(handler(CLASSES.collapsable));$("a:eq(1)",control).click(handler(CLASSES.expandable));$("a:eq(2)",control).click(handler());}function toggler(){$(this).parent().find(">.hitarea").swapClass(CLASSES.collapsableHitarea,CLASSES.expandableHitarea).swapClass(CLASSES.lastCollapsableHitarea,CLASSES.lastExpandableHitarea).end().swapClass(CLASSES.collapsable,CLASSES.expandable).swapClass(CLASSES.lastCollapsable,CLASSES.lastExpandable).find(">ul").heightToggle(settings.animated,settings.toggle);if(settings.unique){$(this).parent().siblings().find(">.hitarea").replaceClass(CLASSES.collapsableHitarea,CLASSES.expandableHitarea).replaceClass(CLASSES.lastCollapsableHitarea,CLASSES.lastExpandableHitarea).end().replaceClass(CLASSES.collapsable,CLASSES.expandable).replaceClass(CLASSES.lastCollapsable,CLASSES.lastExpandable).find(">ul").heightHide(settings.animated,settings.toggle);}}function serialize(){function binary(arg){return arg?1:0;}var data=[];branches.each(function(i,e){data[i]=$(e).is(":has(>ul:visible)")?1:0;});$.cookie(settings.cookieId,data.join(""));}function deserialize(){var stored=$.cookie(settings.cookieId);if(stored){var data=stored.split("");branches.each(function(i,e){$(e).find(">ul")[parseInt(data[i])?"show":"hide"]();});}}this.addClass("treeview");var branches=this.find("li").prepareBranches(settings);switch(settings.persist){case"cookie":var toggleCallback=settings.toggle;settings.toggle=function(){serialize();if(toggleCallback){toggleCallback.apply(this,arguments);}};deserialize();break;case"location":var current=this.find("a").filter(function(){return this.href.toLowerCase()==location.href.toLowerCase();});if(current.length){current.addClass("selected").parents("ul, li").add(current.next()).show();}break;}branches.applyClasses(settings,toggler);if(settings.control){treeController(this,settings.control);$(settings.control).show();}return this.bind("add",function(event,branches){$(branches).prev().removeClass(CLASSES.last).removeClass(CLASSES.lastCollapsable).removeClass(CLASSES.lastExpandable).find(">.hitarea").removeClass(CLASSES.lastCollapsableHitarea).removeClass(CLASSES.lastExpandableHitarea);$(branches).find("li").andSelf().prepareBranches(settings).applyClasses(settings,toggler);});}});var CLASSES=$.fn.treeview.classes={open:"open",closed:"closed",expandable:"expandable",expandableHitarea:"expandable-hitarea",lastExpandableHitarea:"lastExpandable-hitarea",collapsable:"collapsable",collapsableHitarea:"collapsable-hitarea",lastCollapsableHitarea:"lastCollapsable-hitarea",lastCollapsable:"lastCollapsable",lastExpandable:"lastExpandable",last:"last",hitarea:"hitarea"};$.fn.Treeview=$.fn.treeview;})(jQuery)
  /external/clang/test/CXX/temp/temp.param/
p11-0x.cpp 25 // template parameter pack, it shall be the last template-parameter.
26 template<typename ...Types, // expected-error{{template parameter pack must be the last template parameter}}
30 template<typename ...Types, // expected-error{{template parameter pack must be the last template parameter}}
34 template<int ...Values, // expected-error{{template parameter pack must be the last template parameter}}
37 template<int ...Values, // expected-error{{template parameter pack must be the last template parameter}}
41 template<template<typename> class ...Templates, // expected-error{{template parameter pack must be the last template parameter}}
44 template<template<typename> class ...Templates, // expected-error{{template parameter pack must be the last template parameter}}
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_symbolizer_libbacktrace.cc 90 SymbolizedStack *last; member in struct:__sanitizer::__anon9309::SymbolizeCodeCallbackArg
94 CHECK(last);
99 last->next = cur;
100 last = cur;
103 CHECK_EQ(addr, last->info.address);
104 return &last->info;
161 data.last = stack;
  /external/easymock/src/org/easymock/
MockControl.java 137 * Records that the mock object will expect the last method call once, and
142 * called on the mock object before, or if the last method
152 * Records that the mock object will expect the last method call once, and
161 * if the last method called on the mock cannot throw the
173 * Records that the mock object will expect the last method call once, and
180 * called on the mock object before. or if the last method
190 * Records that the mock object will expect the last method call a fixed
197 * called on the mock object before, or if the last method
207 * Records that the mock object will expect the last method call a fixed
218 * if the last method called on the mock cannot throw the
    [all...]
  /external/freetype/src/cache/
ftcmru.c 37 FTC_MruNode last = first->prev; local
59 last->next = node;
61 node->prev = last;
83 FTC_MruNode prev, next, last; local
108 last = first->prev;
110 last->next = node;
114 node->prev = last;
  /external/google-breakpad/src/client/mac/tests/
BreakpadFramework_Test.mm 57 // to communicate to test cases the properites of the last
199 @"Last exception type not initialized correctly.");
201 @"Last exception code not initialized correctly.");
203 @"Last exception thread is not initialized correctly.");
209 @"Last exception type is not 0 for on demand");
211 @"Last exception code is not 0 for on demand");
213 @"Last exception thread is not mach_thread_self() "
  /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/analysis/
SourceNodeImpl.java 44 * Make sure that the internal buffer can keep lines from first to last.
50 * @param last
51 * last line number or {@link ISourceNode#UNKNOWN_LINE}
53 public void ensureCapacity(final int first, final int last) {
54 if (first == UNKNOWN_LINE || last == UNKNOWN_LINE) {
59 lines = new LineImpl[last - first + 1];
62 final int newLast = Math.max(getLastLine(), last);
  /external/libcxx/include/
numeric 22 accumulate(InputIterator first, InputIterator last, T init);
26 accumulate(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);
39 partial_sum(InputIterator first, InputIterator last, OutputIterator result);
43 partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
47 adjacent_difference(InputIterator first, InputIterator last, OutputIterator result);
51 adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
54 void iota(ForwardIterator first, ForwardIterator last, T value);
  /external/mesa3d/src/mesa/program/
prog_cache.c 48 struct cache_item *last; member in struct:gl_program_cache
88 cache->last = NULL;
114 cache->last = NULL;
177 if (cache->last &&
178 memcmp(cache->last->key, key, keysize) == 0) {
179 return cache->last->program;
187 cache->last = c;
  /external/proguard/src/proguard/classfile/util/
MethodLinker.java 84 // Get the last method in the chain.
105 // Get the last methods in the both chains.
112 // Merge the two chains, with the library members last.
126 * Finds the last class member in the linked list of related class members.
128 * @return the last class member in the linked list.
144 * Finds the last visitor accepter in the linked list of visitors.
146 * @return the last method in the linked list.
  /external/toybox/toys/pending/
last.c 0 /* last.c - Show listing of last logged in users.
8 USE_LAST(NEWTOY(last, "f:W", TOYFLAG_BIN))
10 config LAST
11 bool "last"
14 usage: last [-W] [-f FILE]
16 Show listing of last logged in users.
  /frameworks/av/include/media/stagefright/
CameraSourceTimeLapse.h 57 // last read frame with the same time stamp frequently. This keeps the
71 // Real timestamp of the last encoded time lapse frame
90 // True if stop() is waiting for camera to get idle, i.e. for the last
99 // to false. Once in this mode read() return a copy of the last read frame
108 // Stores a copy of the MediaBuffer read in the last read() call after
112 // Status code for last read.
172 // the time stamp to be one frame time ahead of the last encoded
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
numeric 22 accumulate(InputIterator first, InputIterator last, T init);
26 accumulate(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);
39 partial_sum(InputIterator first, InputIterator last, OutputIterator result);
43 partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
47 adjacent_difference(InputIterator first, InputIterator last, OutputIterator result);
51 adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
54 void iota(ForwardIterator first, ForwardIterator last, T value);
  /packages/apps/UnifiedEmail/src/org/apache/commons/io/filefilter/
AgeFileFilter.java 100 * a certain File (whose last modification time will be used as reference).
102 * @param cutoffReference the file whose last modification
111 * of a certain File (whose last modification time will be used as
114 * @param cutoffReference the file whose last modification
125 * Checks to see if the last modification of the file matches cutoff
128 * If last modification time equals cutoff and newer files are required,
130 * If last modification time equals cutoff and older files are required,
  /prebuilts/go/darwin-x86/test/chan/
sieve2.go 83 last := first
88 if first == last {
96 last.Value = e
97 if last.Next() == first {
99 last.Link(ring.New(n))
102 last = last.Next()
  /prebuilts/go/linux-x86/test/chan/
sieve2.go 83 last := first
88 if first == last {
96 last.Value = e
97 if last.Next() == first {
99 last.Link(ring.New(n))
102 last = last.Next()

Completed in 2195 milliseconds

<<21222324252627282930>>