| /external/pcre/dist/doc/ |
| pcre_get_substring_list.3 | 24 substrings. The arguments are:
31 The memory in which the substrings and the list are placed is obtained by
|
| pcredemo.3 | 171 * vector wasn't big enough, say so. Then output any substrings that were *
180 printf("ovector only has room for %d captured substrings\en", rc - 1);
183 /* Show substrings stored in the output vector by number. Obviously, in a real
197 * shows first how to access named substrings, and then how to code for *
201 /* See if there are any named substrings, and if so, show them by name. First
207 PCRE_INFO_NAMECOUNT, /* number of named substrings */
210 if (namecount <= 0) printf("No named substrings\en"); else
213 printf("Named substrings\en");
215 /* Before we can access the substrings, we must extract the table for
391 printf("ovector only has room for %d captured substrings\en", rc - 1)
[all...] |
| pcrecallout.3 | 161 extract substrings that have been matched so far, in the same way as for
162 extracting substrings after a match has completed. For the DFA matching
180 numbered captured substring so far. If no substrings have been captured, the
182 functions are used, because they do not support captured substrings.
186 outside the recursion, as do the values of all captured substrings. If no
187 substrings have been captured, the value of \fIcapture_last\fP is -1. This is
|
| pcrematching.3 | 70 straightforward for this algorithm to keep track of the substrings that are
134 straightforward to keep track of captured substrings for the different matching
136 do this. This means that no captured substrings are available.
138 3. Because no substrings are captured, back references within the pattern are
175 substrings, it is more complicated. The
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| UCharacterUtility.java | 113 * Skip null terminated substrings from an array of bytes.
118 * @param index to start substrings in byte count
119 * @param skipcount number of null terminated substrings to skip
120 * @return the end position of the substrings within the character array
139 * skip substrings from an array of characters, where each character is a set
144 * @param index to start substrings in byte count
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| UCharacterUtility.java | 112 * Skip null terminated substrings from an array of bytes.
117 * @param index to start substrings in byte count
118 * @param skipcount number of null terminated substrings to skip
119 * @return the end position of the substrings within the character array
138 * skip substrings from an array of characters, where each character is a set
143 * @param index to start substrings in byte count
|
| /external/pcre/dist/doc/html/ |
| pcredemo.html | 171 * vector wasn't big enough, say so. Then output any substrings that were *
180 printf("ovector only has room for %d captured substrings\n", rc - 1);
183 /* Show substrings stored in the output vector by number. Obviously, in a real
197 * shows first how to access named substrings, and then how to code for *
201 /* See if there are any named substrings, and if so, show them by name. First
207 PCRE_INFO_NAMECOUNT, /* number of named substrings */
210 if (namecount <= 0) printf("No named substrings\n"); else
213 printf("Named substrings\n");
215 /* Before we can access the substrings, we must extract the table for
391 printf("ovector only has room for %d captured substrings\n", rc - 1)
[all...] |
| pcre_get_substring_list.html | 38 substrings. The arguments are:
45 The memory in which the substrings and the list are placed is obtained by
|
| pcrecallout.html | 185 extract substrings that have been matched so far, in the same way as for
186 extracting substrings after a match has completed. For the DFA matching
208 numbered captured substring so far. If no substrings have been captured, the
210 functions are used, because they do not support captured substrings.
215 outside the recursion, as do the values of all captured substrings. If no
216 substrings have been captured, the value of <i>capture_last</i> is -1. This is
|
| /external/pcre/dist/ |
| pcredemo.c | 154 * vector wasn't big enough, say so. Then output any substrings that were *
163 printf("ovector only has room for %d captured substrings\n", rc - 1);
166 /* Show substrings stored in the output vector by number. Obviously, in a real
180 * shows first how to access named substrings, and then how to code for *
184 /* See if there are any named substrings, and if so, show them by name. First
190 PCRE_INFO_NAMECOUNT, /* number of named substrings */
193 if (namecount <= 0) printf("No named substrings\n"); else
196 printf("Named substrings\n");
198 /* Before we can access the substrings, we must extract the table for
374 printf("ovector only has room for %d captured substrings\n", rc - 1)
[all...] |
| /external/guice/core/test/com/google/inject/ |
| Asserts.java | 105 * Fails unless {@code text} includes all {@code substrings}, in order.
107 public static void assertContains(String text, String... substrings) {
116 for (String substring : substrings) {
123 String lastSubstring = substrings[substrings.length - 1];
|
| /prebuilts/go/darwin-x86/src/strings/ |
| strings.go | 307 // SplitN slices s into substrings separated by sep and returns a slice of
308 // the substrings between those separators.
310 // The count determines the number of substrings to return:
311 // n > 0: at most n substrings; the last substring will be the unsplit remainder.
312 // n == 0: the result is nil (zero substrings)
313 // n < 0: all substrings
316 // SplitAfterN slices s into substrings after each instance of sep and
317 // returns a slice of those substrings.
319 // The count determines the number of substrings to return:
320 // n > 0: at most n substrings; the last substring will be the unsplit remainder
[all...] |
| /prebuilts/go/linux-x86/src/strings/ |
| strings.go | 307 // SplitN slices s into substrings separated by sep and returns a slice of
308 // the substrings between those separators.
310 // The count determines the number of substrings to return:
311 // n > 0: at most n substrings; the last substring will be the unsplit remainder.
312 // n == 0: the result is nil (zero substrings)
313 // n < 0: all substrings
316 // SplitAfterN slices s into substrings after each instance of sep and
317 // returns a slice of those substrings.
319 // The count determines the number of substrings to return:
320 // n > 0: at most n substrings; the last substring will be the unsplit remainder
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| mnkytst.h | 9 * substrings of the default test strings to verify if the compare and
|
| /hardware/qcom/gps/msm8084/utils/ |
| loc_misc_utils.h | 50 char *raw_string: is the original string with delimiter separated substrings
52 of individual substrings
53 int max_num_substrings: is the maximum number of substrings that are expected
56 char delimiter: is the delimiter that separates the substrings. Examples: ' ', ';'
|
| /hardware/qcom/gps/msm8909/utils/ |
| loc_misc_utils.h | 50 char *raw_string: is the original string with delimiter separated substrings
52 of individual substrings
53 int max_num_substrings: is the maximum number of substrings that are expected
56 char delimiter: is the delimiter that separates the substrings. Examples: ' ', ';'
|
| /hardware/qcom/gps/msm8994/utils/ |
| loc_misc_utils.h | 50 char *raw_string: is the original string with delimiter separated substrings
52 of individual substrings
53 int max_num_substrings: is the maximum number of substrings that are expected
56 char delimiter: is the delimiter that separates the substrings. Examples: ' ', ';'
|
| /hardware/qcom/gps/msm8996/utils/ |
| loc_misc_utils.h | 50 char *raw_string: is the original string with delimiter separated substrings
52 of individual substrings
53 int max_num_substrings: is the maximum number of substrings that are expected
56 char delimiter: is the delimiter that separates the substrings. Examples: ' ', ';'
|
| /hardware/qcom/gps/utils/ |
| loc_misc_utils.h | 50 char *raw_string: is the original string with delimiter separated substrings
52 of individual substrings
53 int max_num_substrings: is the maximum number of substrings that are expected
56 char delimiter: is the delimiter that separates the substrings. Examples: ' ', ';'
|
| /external/testng/src/main/java/org/testng/reporters/ |
| XMLStringBuffer.java | 307 String[] subStrings = content.split("]]>");
308 m_buffer.append(m_currentIndent).append("<![CDATA[").append(subStrings[0]).append("]]]]>");
309 for (int i = 1; i < subStrings.length - 1; i++) {
310 m_buffer.append("<![CDATA[>").append(subStrings[i]).append("]]]]>");
312 m_buffer.append("<![CDATA[>").append(subStrings[subStrings.length - 1]).append("]]>");
|
| /external/libweave/src/ |
| string_utils.h | 14 // Treats the string as a delimited list of substrings and returns the array
|
| /external/v8/test/mjsunit/regress/ |
| regress-2058.js | 32 // the flag that determines whether we are using indices or substrings
|
| /external/c-ares/ |
| ares_parse_txt_reply.c | 137 * There may be multiple substrings in a single TXT record. Each
141 * substrings contained therein.
161 /* Step through the list of substrings, concatenating them */
|
| /external/llvm/include/llvm/ADT/ |
| StringRef.h | 456 /// Split into two substrings around the first occurrence of a separator
465 /// \returns The split substrings.
473 /// Split into two substrings around the first occurrence of a separator
482 /// \return - The split substrings.
490 /// Split into substrings around the occurrences of a separator string.
500 /// \param A - Where to put the substrings.
508 /// Split into substrings around the occurrences of a separator character.
518 /// \param A - Where to put the substrings.
525 /// Split into two substrings around the last occurrence of a separator
534 /// \return - The split substrings
[all...] |
| /external/lzma/CPP/7zip/Common/ |
| MethodProps.cpp | 275 static void SplitParams(const UString &srcString, UStringVector &subStrings)
277 subStrings.Clear();
287 subStrings.Add(s);
293 subStrings.Add(s);
|
