| /libcore/luni/src/test/java/libcore/java/net/ |
| OldURITest.java | 70 "http://host/a%path#frag", // invalid escape sequence in path
71 "http://host/a%#frag", // incomplete escape sequence in path
76 "http:///path#fr%ag", // invalid escape sequence in fragment,
78 "http://host/path#frag%", // incomplete escape sequence in
83 "http://host?query%ag", // invalid escape sequence in query, no
85 "http:///path?query%", // incomplete escape sequence in query,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/src/support/win32/ |
| support.cpp | 65 // Returns >= 0: the number of wide characters found in the multi byte sequence src (of src_size_bytes),
68 // Returns (size_t) -1: an incomplete sequence encountered.
115 // into the multi byte character sequence buffer stored at dst which must be dst_size_bytes bytes in size.
116 // Returns >= 0: the number of bytes in the sequence sequence converted frome *src, excluding the null terminator.
141 // If result is zero there is no error and char_size contains the size of the multi-byte-sequence converted.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| checkers.h | 43 * @param begin Begin iterator of sequence.
44 * @param end End iterator of sequence.
80 * @param begin Begin iterator of sequence.
81 * @param end End iterator of sequence.
121 * @param begin Begin iterator of sequence.
122 * @param end End iterator of sequence.
|
| search.h | 46 * @param elements Begin iterator of sequence to search for.
47 * @param length Length of sequence to search for.
72 * @param begin1 Begin iterator of first sequence.
73 * @param end1 End iterator of first sequence.
74 * @param begin2 Begin iterator of second sequence.
75 * @param end2 End iterator of second sequence.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| search.h | 45 * @param __elements Begin iterator of sequence to search for.
46 * @param __length Length of sequence to search for.
71 * @param __begin1 Begin iterator of first sequence.
72 * @param __end1 End iterator of first sequence.
73 * @param __begin2 Begin iterator of second sequence.
74 * @param __end2 End iterator of second sequence.
|
| /external/chromium/net/base/ |
| x509_cert_types_mac_unittest.cc | 9 // 0:d=0 hl=2 l= 95 cons: SEQUENCE
11 // 4:d=2 hl=2 l= 9 cons: SEQUENCE
15 // 17:d=2 hl=2 l= 21 cons: SEQUENCE
19 // 42:d=2 hl=2 l= 53 cons: SEQUENCE
33 // 0:d=0 hl=2 l= 125 cons: SEQUENCE
35 // 4:d=2 hl=2 l= 9 cons: SEQUENCE
39 // 17:d=2 hl=2 l= 20 cons: SEQUENCE
43 // 41:d=2 hl=2 l= 41 cons: SEQUENCE
47 // 86:d=2 hl=2 l= 39 cons: SEQUENCE
63 // 0:d=0 hl=3 l= 174 cons: SEQUENCE
[all...] |
| /external/icu4c/common/unicode/ |
| utf8.h | 77 * @param leadByte The first byte of a UTF-8 sequence. Must be 0..0xff.
86 * Counts the trail bytes for a UTF-8 lead byte of a valid UTF-8 sequence.
93 * @param leadByte The first byte of a UTF-8 sequence. Must be 0..0xff.
214 * byte sequence.
238 * If the offset points to an illegal UTF-8 byte sequence, then
266 * If the offset points to an illegal UTF-8 byte sequence, then
271 * and U+FFFD returned for an ill-formed sequence.
297 * The offset may point to the lead byte of a multi-byte sequence,
298 * in which case the macro will read the whole sequence.
300 * or an illegal UTF-8 sequence
[all...] |
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| Utf8.java | 59 * byte sequence is definitely not well-formed, {@link #COMPLETE} if it is
60 * well-formed in the absence of additional input, or if the byte sequence
71 * State value indicating that the byte sequence is well-formed and
77 * State value indicating that the byte sequence is definitely not
103 * UTF-8 byte sequence.
114 * well-formed UTF-8 byte sequence. The range of bytes to be
127 * malformed, or incomplete UTF-8 byte sequence. The range of bytes
135 * @return {@link #MALFORMED} if the partial byte sequence is
137 * (no additional input needed), or if the byte sequence is
147 // We look for a well-formed sequence consisting of bytes fro
[all...] |
| /external/chromium_org/ash/wm/ |
| session_state_animator.cc | 62 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence( local
67 sequence->AddObserver(observer);
68 animator->StartAnimation(sequence);
79 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence( local
84 sequence->AddObserver(observer);
85 animator->StartAnimation(sequence);
100 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence( local
103 sequence->AddObserver(observer);
104 animator->StartAnimation(sequence);
115 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence local
131 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence( local
186 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence( local
218 ui::LayerAnimationSequence* sequence = new ui::LayerAnimationSequence( local
[all...] |
| /dalvik/dx/tests/121-sccp/ |
| expected.txt | 27 end sequence
56 end sequence
75 end sequence
101 end sequence
122 end sequence
150 end sequence
179 end sequence
198 end sequence
224 end sequence
245 end sequence
[all...] |
| /external/chromium/third_party/libjingle/source/talk/session/phone/ |
| rtpdump.cc | 213 // sequence number and timestamp.
221 // Get the RTP sequence number and timestamp of the dump packet.
227 // Set the timestamps and sequence number for the first dump packet.
264 // Get the old RTP sequence number and timestamp.
265 uint16 sequence = 0; local
266 packet->GetRtpSeqNum(&sequence);
269 // Increase the RTP sequence number and timestamp.
270 sequence += loop_count_ * rtp_seq_num_increase_;
272 // Write the updated sequence number and timestamp back to the RTP packet.
274 buffer.WriteUInt16(sequence);
[all...] |
| /external/kernel-headers/original/linux/ |
| dccp.h | 16 * @dccph_x - 0 = 24 bit sequence number, 1 = 48
18 * @dccph_seq - sequence number high or low order 24 bits, depends on dccph_x
335 * @dccpms_sequence_window - Sequence Window Feature (section 7.5.2)
425 * @dccps_swl - sequence number window low
426 * @dccps_swh - sequence number window high
429 * @dccps_iss - initial sequence number sent
430 * @dccps_isr - initial sequence number received
431 * @dccps_osr - first OPEN sequence number received
432 * @dccps_gss - greatest sequence number sent
433 * @dccps_gsr - greatest valid sequence number receive
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/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/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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/5/sources/cxx-stl/gnu-libstdc++/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/6/sources/cxx-stl/gnu-libstdc++/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/7/sources/cxx-stl/gnu-libstdc++/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/8/sources/cxx-stl/gnu-libstdc++/4.4.3/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/8/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/8/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/8/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/8/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...] |
