HomeSort by relevance Sort by last modified time
    Searched full:sequences (Results 276 - 300 of 1326) sorted by null

<<11121314151617181920>>

  /system/core/fastboot/
fastboot_protocol.txt 100 * Command parameters are indicated by printf-style escape sequences.
  /system/core/libcutils/
strdup8to16.c 24 * on invalid sequences
  /external/icu4c/common/
ustrtrns.cpp 434 * Inline processing of UTF-8 byte sequences:
436 * Byte sequences for the most common characters are handled inline in
440 * between 2- and 3-byte sequences (0xe0).
771 * resynchronization after illegal sequences.
819 * resynchronization after illegal sequences.
874 * resynchronization after illegal sequences.
904 * resynchronization after illegal sequences.
    [all...]
ubidiln.c 468 /* loop for all sequences of runs */
774 /* loop for all sequences of levels to reorder at the current maxLevel */
782 break; /* no more such sequences */
808 break; /* no more such sequences */
837 /* loop for all sequences of levels to reorder at the current maxLevel */
868 break; /* no more such sequences */
    [all...]
  /external/icu4c/tools/toolutil/
ucmstate.c 835 * if all sequences from this state are unassigned, returns the
861 printf(" all-unassigned sequences from prefix 0x%02lx state %ld use %ld bytes\n"
    [all...]
  /external/protobuf/src/google/protobuf/stubs/
strutil.h 191 // Copies "source" to "dest", rewriting C-style escape sequences
196 // are always shorter than the original escaped sequences). It's
200 // It allows hex sequences \xhh, or generally \xhhhhh with an
205 // It also allows escape sequences of the form \uhhhh (exactly four
249 // C-style escape sequences. This is very useful for preparing query
  /external/chromium/testing/gtest/include/gtest/
gtest-param-test.h 218 // Range() returns generators providing sequences of values in a range.
228 // * The generated sequences never include end. For example, Range(1, 5)
237 // Elements in the resulting sequences will also have that type.
238 // * Condition start < end must be satisfied in order for resulting sequences
257 // - returns a generator producing sequences with elements from
260 // - returns a generator producing sequences with elements from
263 // - returns a generator producing sequences with elements from
334 // - returns a generator producing sequences with elements v1, v2, ..., vN.
    [all...]
  /external/gtest/include/gtest/
gtest-param-test.h 217 // Range() returns generators providing sequences of values in a range.
227 // * The generated sequences never include end. For example, Range(1, 5)
236 // Elements in the resulting sequences will also have that type.
237 // * Condition start < end must be satisfied in order for resulting sequences
256 // - returns a generator producing sequences with elements from
259 // - returns a generator producing sequences with elements from
262 // - returns a generator producing sequences with elements from
336 // - returns a generator producing sequences with elements v1, v2, ..., vN.
    [all...]
  /external/libvpx/libvpx/third_party/googletest/src/include/gtest/
gtest-param-test.h 218 // Range() returns generators providing sequences of values in a range.
228 // * The generated sequences never include end. For example, Range(1, 5)
237 // Elements in the resulting sequences will also have that type.
238 // * Condition start < end must be satisfied in order for resulting sequences
257 // - returns a generator producing sequences with elements from
260 // - returns a generator producing sequences with elements from
263 // - returns a generator producing sequences with elements from
333 // - returns a generator producing sequences with elements v1, v2, ..., vN.
    [all...]
  /external/llvm/utils/unittest/googletest/include/gtest/
gtest-param-test.h 217 // Range() returns generators providing sequences of values in a range.
227 // * The generated sequences never include end. For example, Range(1, 5)
236 // Elements in the resulting sequences will also have that type.
237 // * Condition start < end must be satisfied in order for resulting sequences
256 // - returns a generator producing sequences with elements from
259 // - returns a generator producing sequences with elements from
262 // - returns a generator producing sequences with elements from
338 // - returns a generator producing sequences with elements v1, v2, ..., vN.
    [all...]
  /external/open-vcdiff/gtest/include/gtest/
gtest-param-test.h 185 // Range() returns generators providing sequences of values in a range.
195 // * The generated sequences never include end. For example, Range(1, 5)
204 // Elements in the resulting sequences will also have that type.
205 // * Condition start < end must be satisfied in order for resulting sequences
224 // - returns a generator producing sequences with elements from
227 // - returns a generator producing sequences with elements from
230 // - returns a generator producing sequences with elements from
301 // - returns a generator producing sequences with elements v1, v2, ..., vN.
    [all...]
  /external/protobuf/gtest/include/gtest/
gtest-param-test.h 182 // Range() returns generators providing sequences of values in a range.
192 // * The generated sequences never include end. For example, Range(1, 5)
201 // Elements in the resulting sequences will also have that type.
202 // * Condition start < end must be satisfied in order for resulting sequences
221 // - returns a generator producing sequences with elements from
224 // - returns a generator producing sequences with elements from
227 // - returns a generator producing sequences with elements from
298 // - returns a generator producing sequences with elements v1, v2, ..., vN.
    [all...]
  /external/apache-harmony/regex/src/test/java/org/apache/harmony/tests/java/util/regex/
Pattern2Test.java 224 // Test \n, \t, \r, \f, \e, \a sequences
241 // Test \\u and \\x sequences
252 // Test invalid unicode sequences
277 // Test invalid hex sequences
302 // Test \0 (octal) sequences (1, 2 and 3 digit)
313 // Test invalid octal sequences
    [all...]
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 361 assertFalse("unexpected: sequences are equal", b);
416 assertFalse("sequences are equal i=" + i, b);
  /external/apache-http/src/org/apache/http/message/
BasicTokenIterator.java 42 * This implementation parses <tt>#token<tt> sequences as
345 * <tt>#token</tt> sequences. The end of a header value will
  /external/chromium/googleurl/src/
url_canon_path.cc 270 // Handle escape sequences.
297 // sequences, while Firefox, IE6, and Safari all pass it through
  /external/icu4c/i18n/unicode/
coleitr.h 218 * Return the maximum length of any expansion sequences that end with the
221 * @return maximum size of the expansion sequences ending with the collation
ucoleitr.h 247 * Get the maximum length of any expansion sequences that end with the
252 * @return maximum size of the expansion sequences ending with the collation
  /external/icu4c/test/testdata/
ssearch.xml 243 of matching only full combining sequences
295 <!-- Long combining sequences -->
  /external/jsilver/src/com/google/clearsilver/jsilver/syntax/
StructuralWhitespaceStripper.java 47 * Detects sequences of commands corresponding to a line in the template containing only structural
99 * A regex snippet to match sequences of inline whitespace. The easiest way to define this is as
VarOptimizer.java 76 * It also optimizes sequences of escaped expressions into a single escaped sequence.
287 * sequences of escapers.
  /external/stlport/src/
c_locale.h 280 * Compares the two sequences [s1, s1 + n1) and [s2, s2 + n2). Neither
282 * aren't special. If the two sequences are the same up through
  /external/webkit/LayoutTests/fast/js/resources/
json2-es5-compat.js 205 // sequences.
429 // Unicode characters with escape sequences. JavaScript handles many characters
  /external/webkit/PerformanceTests/SunSpider/hosted/
json2.js 214 // sequences.
433 // Unicode characters with escape sequences. JavaScript handles many characters
  /ndk/sources/cxx-stl/stlport/src/
c_locale.h 280 * Compares the two sequences [s1, s1 + n1) and [s2, s2 + n2). Neither
282 * aren't special. If the two sequences are the same up through

Completed in 1008 milliseconds

<<11121314151617181920>>