HomeSort by relevance Sort by last modified time
    Searched full:previous (Results 826 - 850 of 9167) sorted by null

<<31323334353637383940>>

  /development/samples/training/threadsample/src/com/example/android/threadsample/
DisplayActivity.java 109 * move to the previous state of the Fragment being displayed.
115 // Gets the previous global stack count
128 * If the current stack count is less than the previous, something was popped off the stack
255 // Gets the previous state of the fullscreen indicator
258 // Sets the fullscreen flag to its previous state
261 // Gets the previous backstack entry count.
430 // If the photo Fragment exists from a previous display
500 // If the instance exists from a previous display
521 // Pops the back stack to show the previous Fragment state
  /external/aac/libSBRdec/src/
psdec.h 258 SCHAR aIidPrevFrameIndex[NO_HI_RES_IID_BINS]; /*!< The IID index for previous frame */
259 SCHAR aIccPrevFrameIndex[NO_HI_RES_ICC_BINS]; /*!< The ICC index for previous frame */
291 FIXP_DBL aPrevNrgBin[NO_MID_RES_BINS]; /*!< energy of previous frame */
292 FIXP_DBL aPrevPeakDiffBin[NO_MID_RES_BINS]; /*!< peak difference of previous frame */
294 SCHAR aPowerPrevScal[NO_MID_RES_BINS]; /*!< Last power value (each bin) of previous frame */
296 FIXP_DBL h11rPrev[NO_IID_GROUPS]; /*!< previous calculated h(xy) coefficients */
297 FIXP_DBL h12rPrev[NO_IID_GROUPS]; /*!< previous calculated h(xy) coefficients */
298 FIXP_DBL h21rPrev[NO_IID_GROUPS]; /*!< previous calculated h(xy) coefficients */
299 FIXP_DBL h22rPrev[NO_IID_GROUPS]; /*!< previous calculated h(xy) coefficients */
  /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/sampling/
AbstractStepInterpolator.java 32 * previous and the current grid points (dense output).</p>
61 /** global previous time */
67 /** soft previous time */
220 * Copy the current time into the previous time, hence preparing the
273 * Get the previous global grid point time.
274 * @return previous global grid point time
291 * Get the previous soft grid point time.
292 * @return previous soft grid point time
328 * (theta is zero at the previous time step and one at the current time step)
  /external/clang/lib/Sema/
SemaDecl.cpp     [all...]
  /external/icu/icu4c/source/i18n/
collationbuilder.h 96 * The node's previous and next indexes must not be set yet.
247 static inline int64_t nodeFromPreviousIndex(int32_t previous) {
248 return (int64_t)previous << 28;
286 static inline int64_t changeNodePreviousIndex(int64_t node, int32_t previous) {
287 return (node & INT64_C(0xffff00000fffffff)) | nodeFromPreviousIndex(previous);
316 * without previous index, leaving room in root primary nodes for 32-bit primary weights.
327 * Root primary nodes have 32-bit weights but do not have previous indexes.
328 * All other nodes have at most 16-bit weights and do have previous indexes.
386 * - index to the previous node: 20 bits 47..28
collationrootelements.cpp 39 // secTer = last secondary & tertiary for the previous primary
51 // p > elements[index] which is the previous primary.
92 // Found p itself. Return the previous primary.
93 // See if p is at the end of a previous range.
96 // p is not at the end of a range. Look for the previous primary.
108 // Return the previous range primary.
  /libcore/luni/src/main/java/java/text/
BreakIterator.java 56 * {@code first()}, {@code last()}, {@code next()}, and {@code previous()} that
69 * beginning of the text and the user calls {@code previous()}.</li>
137 * for (int start = boundary.previous(); start != BreakIterator.DONE; end = start, start = boundary
138 * .previous()) {
165 * int start = boundary.previous();
178 * int start = boundary.previous();
226 * This constant is returned by iterate methods like {@code previous()} or
432 * Sets this iterator's current position to the previous boundary before the
438 public abstract int previous(); method in class:BreakIterator
  /external/guava/guava/src/com/google/common/util/concurrent/
AbstractService.java 258 State previous = state();
259 switch (previous) {
277 throw new AssertionError("isStoppable is incorrectly implemented, saw: " + previous);
279 throw new AssertionError("Unexpected state: " + previous);
423 State previous = snapshot.state;
424 if (previous != STOPPING && previous != RUNNING) {
426 "Cannot notifyStopped() when the service is " + previous);
431 terminated(previous);
448 State previous = state()
    [all...]
  /external/tinyxml/
tinyxml.cpp 368 const TiXmlNode* TiXmlNode::IterateChildren( const TiXmlNode* previous ) const
370 if ( !previous )
376 assert( previous->parent == this );
377 return previous->NextSibling();
381 TiXmlNode* TiXmlNode::IterateChildren( TiXmlNode* previous )
383 if ( !previous )
389 assert( previous->parent == this );
390 return previous->NextSibling();
394 const TiXmlNode* TiXmlNode::IterateChildren( const char * val, const TiXmlNode* previous ) const
396 if ( !previous )
    [all...]
  /cts/hostsidetests/appsecurity/src/com/android/cts/appsecurity/
AppSecurityTests.java 115 // cleanup test apps that might be installed from previous partial test run
142 // cleanup test app that might be installed from previous partial test run
166 // cleanup test app that might be installed from previous partial test run
196 // cleanup test app that might be installed from previous partial test run
227 // cleanup test app that might be installed from previous partial test run
260 // cleanup test app that might be installed from previous partial test run
  /external/libvpx/libvpx/vp8/encoder/
picklpf.c 162 /* Start the search at the previous frame filter level unless it is
173 /* Get the err using the previous frame's filter value. */
277 /* Start search at previous frame filter level */
300 /* Start the search at the previous frame filter level unless it is
357 /* Was it actually better than the previous best? */
380 /* Was it better than the previous best? */
  /external/llvm/docs/
ReleaseProcess.rst 22 * Test and benchmark the previous release
24 * Test and benchmark each release candidate, comparing to the previous release and candidates
119 It should have no new regressions, compared to the previous release or release candidate. You don't need to fix
138 on the previous release.
142 * Download the previous release sources from http://llvm.org/releases/download.html.
197 previous release, follow the rules below:
  /external/valgrind/helgrind/tests/
annotate_rwlock.stderr.exp 24 This conflicts with a previous write of size 4 by thread #x
41 This conflicts with a previous write of size 4 by thread #x
58 This conflicts with a previous read of size 4 by thread #x
75 This conflicts with a previous read of size 4 by thread #x
92 This conflicts with a previous read of size 4 by thread #x
114 This conflicts with a previous read of size 4 by thread #x
  /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/
structs.h 151 /* Previous frame length (in ms) */
154 /* Previous RTP timestamp from received
158 /* Send timestamp for previous packet (in ms using timeGetTime()) */
161 /* Arrival time for previous packet (in ms using timeGetTime()) */
164 /* rate of previous packet, derived from RTP timestamps (in bits/s) */
232 /* boolean, flags if previous packet exceeded B.N. */
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/
picklpf.c 162 /* Start the search at the previous frame filter level unless it is
173 /* Get the err using the previous frame's filter value. */
277 /* Start search at previous frame filter level */
300 /* Start the search at the previous frame filter level unless it is
357 /* Was it actually better than the previous best? */
380 /* Was it better than the previous best? */
  /libcore/luni/src/test/java/libcore/java/util/concurrent/
CopyOnWriteArrayListTest.java 228 assertEquals("e", i.previous());
233 assertEquals("d", i.previous());
238 assertEquals("c", i.previous());
243 assertEquals("b", i.previous());
248 assertEquals("a", i.previous());
254 i.previous();
  /external/icu/icu4c/source/common/unicode/
chariter.h 251 * for(c=it.last(); c!=CharacterIterator::DONE; c=it.previous()) {
266 * // get the previous code unit
267 * UChar u=it.previous();
306 * for(UChar c = iter.last(); c != CharacterIterator.DONE; c = iter.previous()) {
325 * c = iter.previous()) {}
432 * This can be used to begin an iteration with previous().
450 * iteration with previous() or previous32().
515 * Advances to the previous code unit in the iteration range
518 * @return the previous code unit.
521 virtual UChar previous(void) = 0
    [all...]
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/
RBBIAPITest.java 292 * Testing the methods lastt(), previous(), and preceding() of RuleBasedBreakIterator
297 logln("Testing last(),previous(), preceding() with custom rules");
305 q = wordIter1.previous();
308 q = wordIter1.previous();
313 q = wordIter1.previous();
327 q = sentIter1.previous();
330 q = sentIter1.previous();
337 p = sentIter1.previous();
340 errln("ERROR: previous()/preceding() at starting position returned #"
349 q = lineIter1.previous();
    [all...]
  /art/tools/dexfuzz/src/dexfuzz/rawdex/
ClassDataItem.java 91 // Only need to increment one, as all the others are diffed from the previous.
103 // Only need to increment one, as all the others are diffed from the previous.
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/
SimpleRealPointChecker.java 73 final RealPointValuePair previous,
75 final double[] p = previous.getPoint();
SimpleVectorialPointChecker.java 73 final VectorialPointValuePair previous,
75 final double[] p = previous.getPointRef();
SimpleVectorialValueChecker.java 73 final VectorialPointValuePair previous,
75 final double[] p = previous.getValueRef();
  /external/chromium-trace/trace-viewer/tracing/third_party/closure_linter/closure_linter/common/
tokens_test.py 40 neighbor_tokens[i].previous = neighbor_tokens[prev_index]
50 # First token in file (has no previous).
  /external/clang/test/Sema/
function.c 9 void func(const char*); // expected-note {{previous declaration is here}}
16 void h(); // expected-note {{previous declaration is here}}
types.c 30 int __int128; // expected-error {{cannot combine with previous}} expected-warning {{does not declare anything}}
48 extern int j[sizeof(enum e)]; // expected-note {{previous definition}}

Completed in 395 milliseconds

<<31323334353637383940>>