| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| regex_constants.h | 77 * sequence shall be performed without regard to case.
83 * container sequence, no sub-expression matches are to be stored in the
160 * Matching a regular expression against a sequence of characters [first,
199 * The first character in the sequence [first, last) is treated as though it
206 * The last character in the sequence [first, last) is treated as though it
213 * The expression \\b is not matched against the sub-sequence
219 * The expression \\b should not be matched against the sub-sequence
231 * The expression does not match an empty sequence.
236 * The expression only matches a sub-sequence that begins at first .
285 * container sequence being searched that do not match the regula
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/debug/ |
| functions.h | 184 // Can't check if an input iterator sequence is sorted, because we
185 // can't step through the sequence.
192 // Can verify if a forward iterator sequence is in fact sorted using
210 // Can't check if an input iterator sequence is sorted, because we can't step
211 // through the sequence.
218 // Can verify if a forward iterator sequence is in fact sorted using
236 // Determine if a sequence is sorted.
244 // Verify that the < operator for elements in the sequence is a
330 // Determine if a sequence is partitioned w.r.t. this element.
355 // Determine if a sequence is partitioned w.r.t. this element
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| regex_constants.h | 77 * sequence shall be performed without regard to case.
83 * container sequence, no sub-expression matches are to be stored in the
160 * Matching a regular expression against a sequence of characters [first,
199 * The first character in the sequence [first, last) is treated as though it
206 * The last character in the sequence [first, last) is treated as though it
213 * The expression \\b is not matched against the sub-sequence
219 * The expression \\b should not be matched against the sub-sequence
231 * The expression does not match an empty sequence.
236 * The expression only matches a sub-sequence that begins at first .
285 * container sequence being searched that do not match the regula
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/debug/ |
| functions.h | 191 // Can't check if an input iterator sequence is sorted, because we
192 // can't step through the sequence.
199 // Can verify if a forward iterator sequence is in fact sorted using
217 // Can't check if an input iterator sequence is sorted, because we can't step
218 // through the sequence.
225 // Can verify if a forward iterator sequence is in fact sorted using
243 // Determine if a sequence is sorted.
251 // Verify that the < operator for elements in the sequence is a
337 // Determine if a sequence is partitioned w.r.t. this element.
362 // Determine if a sequence is partitioned w.r.t. this element
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| regex_constants.h | 84 * sequence shall be performed without regard to case.
90 * container sequence, no sub-expression matches are to be stored in the
167 * Matching a regular expression against a sequence of characters [first,
206 * The first character in the sequence [first, last) is treated as though it
213 * The last character in the sequence [first, last) is treated as though it
220 * The expression \\b is not matched against the sub-sequence
226 * The expression \\b should not be matched against the sub-sequence
238 * The expression does not match an empty sequence.
243 * The expression only matches a sub-sequence that begins at first .
292 * container sequence being searched that do not match the regula
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| losertree.h | 65 /** @brief index of the source sequence. */
123 * @brief Initializes the sequence "source" with the element "key".
126 * @param source index of the source sequence
150 * @return the index of the sequence with the smallest element.
210 * the previously smallest element's sequence.
218 // no dummy sequence can ever be at the top!
315 // no dummy sequence can ever be at the top!
439 // no dummy sequence can ever be at the top!
519 // no dummy sequence can ever be at the top!
547 * No guarding is done, therefore not a single input sequence mus
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/base/super/com/google/common/base/ |
| Splitter.java | 238 * input sequence consists of nothing but separators).
306 * Splits {@code sequence} into string components and makes them available
309 * @param sequence the sequence of characters to split
312 public Iterable<String> split(final CharSequence sequence) {
313 checkNotNull(sequence);
317 return spliterator(sequence);
322 private Iterator<String> spliterator(CharSequence sequence) {
323 return strategy.iterator(this, sequence);
371 * Splits {@code sequence} into substrings, splits each substring int
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| gimple.def | 136 BODY is the sequence of statements in the scope. */
141 sequence of statements that handle these types. */
146 sequence of statements to execute on failure. */
178 EVAL is the sequence of statements to execute on entry to GIMPLE_TRY.
180 CLEANUP is the sequence of statements to execute according to
202 is rewritten as a sequence of two codes in gimplification:
221 BODY is the sequence of statements that are inside the critical section. */
262 BODY is the sequence of statements to execute in the master section. */
266 BODY is the sequence of statements to execute in the ordered section. */
274 BODY is a the sequence of statements to be executed by all threads
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| gimple.def | 136 BODY is the sequence of statements in the scope. */
141 sequence of statements that handle these types. */
146 sequence of statements to execute on failure. */
178 EVAL is the sequence of statements to execute on entry to GIMPLE_TRY.
180 CLEANUP is the sequence of statements to execute according to
202 is rewritten as a sequence of two codes in gimplification:
221 BODY is the sequence of statements that are inside the critical section. */
262 BODY is the sequence of statements to execute in the master section. */
266 BODY is the sequence of statements to execute in the ordered section. */
274 BODY is a the sequence of statements to be executed by all threads
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| gimple.def | 136 BODY is the sequence of statements in the scope. */
141 sequence of statements that handle these types. */
146 sequence of statements to execute on failure. */
178 EVAL is the sequence of statements to execute on entry to GIMPLE_TRY.
180 CLEANUP is the sequence of statements to execute according to
202 is rewritten as a sequence of two codes in gimplification:
221 BODY is the sequence of statements that are inside the critical section. */
262 BODY is the sequence of statements to execute in the master section. */
266 BODY is the sequence of statements to execute in the ordered section. */
274 BODY is a the sequence of statements to be executed by all threads
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| gimple.def | 136 BODY is the sequence of statements in the scope. */
141 sequence of statements that handle these types. */
146 sequence of statements to execute on failure. */
178 EVAL is the sequence of statements to execute on entry to GIMPLE_TRY.
180 CLEANUP is the sequence of statements to execute according to
202 is rewritten as a sequence of two codes in gimplification:
221 BODY is the sequence of statements that are inside the critical section. */
262 BODY is the sequence of statements to execute in the master section. */
266 BODY is the sequence of statements to execute in the ordered section. */
274 BODY is a the sequence of statements to be executed by all threads
[all...] |
| /external/chromium_org/remoting/host/ |
| heartbeat_sender.cc | 34 const char kSequenceIdAttr[] = "sequence-id";
41 const char kExpectedSequenceIdTag[] = "expected-sequence-id";
187 // The sequence ID sent in the previous heartbeat was not what the server
188 // expected, so send another heartbeat with the expected sequence ID.
222 // Setting the sequence ID may be a symptom of a temporary server-side
225 // But the server will usually set the sequence ID when it receives the first
231 HOST_LOG << "The heartbeat sequence ID has been set more than once: "
|
| /external/chromium_org/third_party/libjingle/source/talk/media/base/ |
| rtpdump.h | 85 // Get the payload type, sequence number, timestampe, and SSRC of the RTP
140 // RTP sequence number and the RTP timestamp properly. RtpDumpLoopReader can
150 // count, timestamps, and sequence number, of the input stream.
158 // packet. If the dumped packet is a RTP packet, update its RTP sequence
163 // How much to increase the elapsed time, RTP sequence number, RTP timestampe
171 // dump timestamp, and different RTP sequence number.
174 // The elapsed time, RTP sequence number, and RTP timestamp of the first and
|
| /external/llvm/docs/ |
| YamlIO.rst | 24 A sequence is a list of items where each item starts with a leading dash ('-').
29 # a sequence
34 You can combine mappings and sequences by indenting. For example a sequence
35 of mappings in which one of the mapping values is itself a sequence:
39 # a sequence of mappings with one key's value being a sequence
54 Sequence" in which you put comma separated sequence elements into square
60 # a sequence of mappings with one key's value being a flow sequence
[all...] |
| /external/chromium_org/ui/compositor/ |
| layer_animator_unittest.cc | 104 LayerAnimationSequence* sequence) OVERRIDE {
109 LayerAnimationSequence* sequence) OVERRIDE {
114 LayerAnimationSequence* sequence) OVERRIDE {
130 virtual void ProgressAnimation(LayerAnimationSequence* sequence,
132 EXPECT_TRUE(HasAnimation(sequence));
133 LayerAnimator::ProgressAnimation(sequence, now);
140 // The test layer animation sequence updates a live instances count when it is
1565 LayerAnimationSequence* sequence = new LayerAnimationSequence( local
1727 LayerAnimationSequence* sequence = new LayerAnimationSequence( local
1764 LayerAnimationSequence* sequence = new LayerAnimationSequence( local
1794 LayerAnimationSequence* sequence = new LayerAnimationSequence( local
1825 LayerAnimationSequence* sequence = new LayerAnimationSequence( local
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/ |
| replace.hpp | 40 The result is a modified copy of the input. It is returned as a sequence
92 The input sequence is modified in-place.
118 The result is a modified copy of the input. It is returned as a sequence
167 with the format string. The input sequence is modified in-place.
191 The result is a modified copy of the input. It is returned as a sequence
244 with the format string. Input sequence is modified in-place.
271 The result is a modified copy of the input. It is returned as a sequence
320 with the format string. Input sequence is modified in-place.
344 The result is a modified copy of the input. It is returned as a sequence
397 with the format string.The input sequence is modified in-place
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/ |
| nvc0_query.c | 39 uint32_t sequence; member in struct:nvc0_query
151 q->data[0] = 0; /* initialize sequence */
167 PUSH_DATA (push, q->sequence);
197 q->data[0] = q->sequence; /* initialize sequence */
199 q->data[4] = q->sequence + 1; /* for comparison COND_MODE */
202 q->sequence++;
263 q->sequence++;
288 /* PRIMS_DROPPED doesn't write sequence, use a ZERO query to sync on */
329 if (q->data[0] == q->sequence)
[all...] |
| /external/mesa3d/src/gallium/drivers/nvc0/ |
| nvc0_query.c | 39 uint32_t sequence; member in struct:nvc0_query
151 q->data[0] = 0; /* initialize sequence */
167 PUSH_DATA (push, q->sequence);
197 q->data[0] = q->sequence; /* initialize sequence */
199 q->data[4] = q->sequence + 1; /* for comparison COND_MODE */
202 q->sequence++;
263 q->sequence++;
288 /* PRIMS_DROPPED doesn't write sequence, use a ZERO query to sync on */
329 if (q->data[0] == q->sequence)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/ |
| nv50_query.c | 41 uint32_t sequence; member in struct:nv50_query
137 PUSH_DATA (push, q->sequence);
164 q->data[0] = q->sequence++; /* the previously used one */
219 q->sequence++;
226 q->sequence++;
242 return q->ready || (!q->is64bit && (q->data[0] == q->sequence));
276 case PIPE_QUERY_OCCLUSION_COUNTER: /* u32 sequence, u32 count, u64 time */
290 case PIPE_QUERY_TIMESTAMP_DISJOINT: /* u32 sequence, u32 0, u64 time */
318 PUSH_DATA (push, q->sequence);
|
| /external/mesa3d/src/gallium/drivers/nv50/ |
| nv50_query.c | 41 uint32_t sequence; member in struct:nv50_query
137 PUSH_DATA (push, q->sequence);
164 q->data[0] = q->sequence++; /* the previously used one */
219 q->sequence++;
226 q->sequence++;
242 return q->ready || (!q->is64bit && (q->data[0] == q->sequence));
276 case PIPE_QUERY_OCCLUSION_COUNTER: /* u32 sequence, u32 count, u64 time */
290 case PIPE_QUERY_TIMESTAMP_DISJOINT: /* u32 sequence, u32 0, u64 time */
318 PUSH_DATA (push, q->sequence);
|
| /external/srtp/crypto/replay/ |
| rdbx.c | 52 * A receiver reconstructs the index i of a packet with sequence
68 * A xtd_seq_num_t is essentially a sequence number for which some of
70 * rollover counter and a sequence number; the sequence number is the
83 * sequence number that has been received, and the bitmask indicates
114 * known-to-be-good received xtd_seq_num_t) and a sequence number s
155 // local index is (1, 100) and next sequence is 65530, the wrong updated
322 * given an rdbx and a sequence number s (from a newly arrived packet),
334 * if the sequence number and rollover counter in the rdbx are
|
| /external/tremolo/Tremolo/ |
| dsp.c | 60 v->sequence=-1;
258 it reads the last two marked pages in proper sequence */
260 /* if we're out of sequence, dump granpos tracking until we sync back up */
261 if(vd->sequence==-1 || vd->sequence+1 != op->packetno-3){
262 /* out of sequence; lose count */
267 vd->sequence=op->packetno;
268 vd->sequence=vd->sequence-3;
|
| /libcore/luni/src/main/java/java/security/cert/ |
| X509Certificate.java | 37 * Certificate ::= SEQUENCE {
42 * TBSCertificate ::= SEQUENCE {
85 * Validity ::= SEQUENCE {
154 * RDNSequence ::= SEQUENCE OF RelativeDistinguishedName
158 * AttributeTypeAndValue ::= SEQUENCE {
210 * RDNSequence ::= SEQUENCE OF RelativeDistinguishedName
214 * AttributeTypeAndValue ::= SEQUENCE {
384 * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName
418 * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName
|
| /external/apache-harmony/auth/src/test/java/common/org/apache/harmony/auth/tests/internal/kerberos/v5/ |
| KerberosErrorMessageTest.java | 62 // SEQUENCE
173 // SEQUENCE
186 // SEQUENCE OF
223 // SEQUENCE
236 // SEQUENCE OF
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| TBSCertList.java | 20 * TBSCertList ::= SEQUENCE {
27 * revokedCertificates SEQUENCE OF SEQUENCE {
53 throw new IllegalArgumentException("Bad sequence size: " + seq.size());
174 throw new IllegalArgumentException("Bad sequence size: " + seq.size());
|
