HomeSort by relevance Sort by last modified time
    Searched full:prev (Results 926 - 950 of 3406) sorted by null

<<31323334353637383940>>

  /development/samples/Support4Demos/src/com/example/android/supportv4/app/
FragmentDialogSupport.java 75 Fragment prev = getSupportFragmentManager().findFragmentByTag("dialog"); local
76 if (prev != null) {
77 ft.remove(prev);
  /external/chromium_org/base/i18n/
break_iterator.h 50 // // Region [iter.prev(), iter.pos()) contains a word.
109 // Returns the string between prev() and pos().
115 size_t prev() const { return prev_; } function in class:base::i18n::BreakIterator
  /external/chromium_org/net/disk_cache/memory/
mem_entry_impl.h 69 MemEntryImpl* prev() const { function in class:disk_cache::MemEntryImpl
77 void set_prev(MemEntryImpl* prev) {
78 prev_ = prev;
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/
javascript.js 194 function JSLexical(indented, column, type, align, prev, info) {
198 this.prev = prev;
206 for (var cx = state.context; cx; cx = cx.prev) {
265 cx.state.context = {prev: cx.state.context, vars: cx.state.localVars};
270 cx.state.context = cx.state.context.prev;
283 if (state.lexical.prev) {
286 state.lexical = state.lexical.prev;
580 if (c == poplex) lexical = lexical.prev;
583 if (lexical.type == "stat" && firstChar == "}") lexical = lexical.prev;
    [all...]
  /external/chromium_org/third_party/icu/source/common/
ustrcase.c 216 int32_t prev, titleStart, titleLimit, idx, destIndex, length; local
232 prev=0;
236 while(prev<srcLength) {
256 * In this implementation, segment [prev..index[ into 3 parts:
257 * a) uncased characters (copy as-is) [prev..titleStart[
261 if(prev<idx) {
262 /* find and copy uncased characters [prev..titleStart[ */
263 titleStart=titleLimit=prev;
271 * only uncased characters in [prev..index[
281 length=titleStart-prev;
    [all...]
  /external/chromium_org/third_party/leveldatabase/src/table/
merger.cc 85 virtual void Prev() {
100 child->Prev();
110 current_->Prev();
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.h 68 Edge *prev[2]; member in class:nv50_ir::Graph::Edge
82 t = e = ((rev && first) ? first->prev[d] : first);
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
  /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/
tabtest.c 71 int i, prev = -1, bad = 0; local
78 if((*tmp)->ext_nid < prev) bad = 1;
79 prev = (*tmp)->ext_nid;
  /external/chromium_org/third_party/opus/src/src/
opus_private.h 52 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev);
53 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev);
54 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev);
  /external/chromium_org/third_party/skia/tools/
CrashHandler.cpp 74 void (*prev)(int) = signal(kSignals[i], handler);
75 if (prev != SIG_DFL) {
76 signal(kSignals[i], prev);
  /external/chromium_org/third_party/tcmalloc/chromium/src/
page_heap.cc 260 Span* prev = GetDescriptor(p-1); local
261 if (prev != NULL && prev->location != Span::IN_USE) {
263 ASSERT(prev->start + prev->length == p);
264 const Length len = prev->length;
265 if (prev->location == Span::ON_RETURNED_FREELIST) {
271 stats_.committed_bytes += prev->length << kPageShift;
273 RemoveFromFreeList(prev);
274 DeleteSpan(prev);
    [all...]
  /external/harfbuzz_ng/src/
hb-utf-private.hh 110 prev (const uint8_t *text, function in struct:hb_utf_t
172 prev (const uint16_t *text, function in struct:hb_utf_t
230 prev (const uint32_t *text, function in struct:hb_utf_t
  /external/icu/icu4c/source/common/
ustrcase.cpp 171 int32_t prev, titleStart, titleLimit, idx, destIndex, length; local
188 prev=0;
192 while(prev<srcLength) {
212 * In this implementation, segment [prev..index[ into 3 parts:
213 * a) uncased characters (copy as-is) [prev..titleStart[
217 if(prev<idx) {
218 /* find and copy uncased characters [prev..titleStart[ */
219 titleStart=titleLimit=prev;
227 * only uncased characters in [prev..index[
237 length=titleStart-prev;
    [all...]
  /external/icu/icu4c/source/i18n/
collationruleparser.cpp 298 UChar32 prev = -1; local
313 prev = c;
318 if(prev < 0) {
329 if(c < prev) {
333 // range prev-c
335 while(++prev <= c) {
336 if(!nfd.isInert(prev)) {
340 if(U_IS_SURROGATE(prev)) {
344 if(0xfffd <= prev && prev <= 0xffff)
    [all...]
  /external/libopus/src/
opus_private.h 52 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev);
53 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev);
54 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev);
  /external/libselinux/src/
stringrep.c 161 struct discover_class_node *cur = discover_class_cache, *prev = NULL; local
172 prev = cur;
175 free(prev);
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.h 68 Edge *prev[2]; member in class:nv50_ir::Graph::Edge
82 t = e = ((rev && first) ? first->prev[d] : first);
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
  /external/openssl/crypto/x509v3/
tabtest.c 71 int i, prev = -1, bad = 0; local
78 if((*tmp)->ext_nid < prev) bad = 1;
79 prev = (*tmp)->ext_nid;
  /external/owasp/sanitizer/tools/findbugs/doc/manual/
installing.html 3 <title>Chapter&nbsp;2.&nbsp;Installing FindBugs&#8482;</title><meta name="generator" content="DocBook XSL Stylesheets V1.76.1"><link rel="home" href="index.html" title="FindBugs&#8482; Manual"><link rel="up" href="index.html" title="FindBugs&#8482; Manual"><link rel="prev" href="introduction.html" title="Chapter&nbsp;1.&nbsp;Introduction"><link rel="next" href="building.html" title="Chapter&nbsp;3.&nbsp;Building FindBugs&#8482; from Source"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter&nbsp;2.&nbsp;Installing <span class="application">FindBugs</span>&#8482;</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="introduction.html">Prev</a>&nbsp;</td><th width="60%" align="center">&nbsp;</th><td width="20%" align="right">&nbsp;<a accesskey="n" href="building.html">Next</a></td></tr></table><hr></div><div class="chapter" title="Chapter&nbsp;2.&nbsp;Installing FindBugs&#8482;"><div class="titlepage"><div><div><h2 class="title"><a name="installing"></a>Chapter&nbsp;2.&nbsp;Installing <span class="application">FindBugs</span>&#8482;</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="installing.html#d0e98">1. Extracting the Distribution</a></span></dt></dl></div><p>
29 </p></div></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="introduction.html">Prev</a>&nbsp;</td><td width="20%" align="center">&nbsp;</td><td width="40%" align="right">&nbsp;<a acc (…)
introduction.html 3 <title>Chapter&nbsp;1.&nbsp;Introduction</title><meta name="generator" content="DocBook XSL Stylesheets V1.76.1"><link rel="home" href="index.html" title="FindBugs&#8482; Manual"><link rel="up" href="index.html" title="FindBugs&#8482; Manual"><link rel="prev" href="index.html" title="FindBugs&#8482; Manual"><link rel="next" href="installing.html" title="Chapter&nbsp;2.&nbsp;Installing FindBugs&#8482;"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter&nbsp;1.&nbsp;Introduction</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="index.html">Prev</a>&nbsp;</td><th width="60%" align="center">&nbsp;</th><td width="20%" align="right">&nbsp;<a accesskey="n" href="installing.html">Next</a></td></tr></table><hr></div><div class="chapter" title="Chapter&nbsp;1.&nbsp;Introduction"><div class="titlepage"><div><div><h2 class="title"><a name="introduction"></a>Chapter&nbsp;1.&nbsp;Introduction</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="introduction.html#d0e67">1. Requirements</a></span></dt></dl></div><p> <span class="application">FindBugs</span>&#8482; is a program to find bugs in Java programs. It looks for instances
12 To analyze very large projects, more memory may be needed.</p></div></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="index.html">Prev</a>&nbsp;</td><td width="20%" align="center">&nbsp;</td><td width="40%" align="right">&nbsp;<a acc (…)
rejarForAnalysis.html 3 <title>Chapter&nbsp;11.&nbsp;Using rejarForAnalysis</title><meta name="generator" content="DocBook XSL Stylesheets V1.76.1"><link rel="home" href="index.html" title="FindBugs&#8482; Manual"><link rel="up" href="index.html" title="FindBugs&#8482; Manual"><link rel="prev" href="annotations.html" title="Chapter&nbsp;10.&nbsp;Annotations"><link rel="next" href="datamining.html" title="Chapter&nbsp;12.&nbsp;Data mining of bugs with FindBugs&#8482;"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter&nbsp;11.&nbsp;Using rejarForAnalysis</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="annotations.html">Prev</a>&nbsp;</td><th width="60%" align="center">&nbsp;</th><td width="20%" align="right">&nbsp;<a accesskey="n" href="datamining.html">Next</a></td></tr></table><hr></div><div class="chapter" title="Chapter&nbsp;11.&nbsp;Using rejarForAnalysis"><div class="titlepage"><div><div><h2 class="title"><a name="rejarForAnalysis"></a>Chapter&nbsp;11.&nbsp;Using rejarForAnalysis</h2></div></div></div><p>
33 </p></dd></dl></div></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="annotations.html">Prev</a>&nbsp;</td><td width="20%" align="center">&nbsp;</td><td width="40%" align="right">&nbsp;<a acc (…)
  /external/qemu/distrib/libselinux/src/
stringrep.c 161 struct discover_class_node *cur = discover_class_cache, *prev = NULL; local
172 prev = cur;
175 free(prev);
  /external/skia/tools/
CrashHandler.cpp 74 void (*prev)(int) = signal(kSignals[i], handler);
75 if (prev != SIG_DFL) {
76 signal(kSignals[i], prev);
  /external/valgrind/main/perf/
many-loss-records.c 93 struct Chunk *prev = NULL; local
99 new->child = prev;
100 prev = new;
  /external/wpa_supplicant_8/src/ap/
ap_config.c 25 struct hostapd_vlan *vlan, *prev; local
28 prev = NULL;
30 prev = vlan;
32 os_free(prev);
367 struct hostapd_radius_attr *prev; local
370 prev = attr;
372 wpabuf_free(prev->val);
373 os_free(prev);
399 struct hostapd_wpa_psk *psk, *prev; local
407 prev = psk
    [all...]

Completed in 1877 milliseconds

<<31323334353637383940>>