Searched refs:limit (Results 76 - 100 of 4587) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/base/
H A DSplitter.java102 private final int limit; field in class:Splitter
109 CharMatcher trimmer, int limit) {
113 this.limit = limit;
302 return new Splitter(strategy, true, trimmer, limit);
307 * stops splitting after it reaches the limit.
308 * The limit defines the maximum number of items returned by the iterator.
311 * {@code Splitter.on(',').limit(3).split("a,b,c,d")} returns an iterable
314 * {@code Splitter.on(',').limit(3).omitEmptyStrings().split("a,,,b,,,c,d")}
317 * {@code Splitter.on(',').limit(
108 Splitter(Strategy strategy, boolean omitEmptyStrings, CharMatcher trimmer, int limit) argument
325 limit(int limit) argument
486 int limit; field in class:Splitter.SplittingIterator
[all...]
/external/guava/guava-gwt/src-super/com/google/common/base/super/com/google/common/base/
H A DSplitter.java99 private final int limit; field in class:Splitter
106 CharMatcher trimmer, int limit) {
110 this.limit = limit;
244 return new Splitter(strategy, true, trimmer, limit);
249 * stops splitting after it reaches the limit.
250 * The limit defines the maximum number of items returned by the iterator.
253 * {@code Splitter.on(',').limit(3).split("a,b,c,d")} returns an iterable
256 * {@code Splitter.on(',').limit(3).omitEmptyStrings().split("a,,,b,,,c,d")}
259 * {@code Splitter.on(',').limit(
105 Splitter(Strategy strategy, boolean omitEmptyStrings, CharMatcher trimmer, int limit) argument
267 limit(int limit) argument
428 int limit; field in class:Splitter.SplittingIterator
[all...]
/external/icu/icu4c/source/i18n/
H A Dnultrans.cpp31 offsets.start = offsets.limit;
H A Dcasetrn.cpp54 // automatically adjust start and limit if the Replaceable disagrees
67 // detect, and store in csc->b1, if we hit the limit
68 if(csc->index<csc->limit) {
71 csc->limit=csc->index;
139 if (offsets.start >= offsets.limit) {
147 csc.limit = offsets.contextLimit;
154 for(textPos=offsets.start; textPos<offsets.limit;) {
162 // fMap() tried to look beyond the context limit
183 csc.limit=offsets.contextLimit+=delta;
184 offsets.limit
[all...]
H A Danytrans.cpp60 * | | - first run (start, limit)
61 * | | - second run (start, limit)
89 int32_t limit; member in class:ScriptRunIterator
93 * (inclusive) to limit (exclusive).
95 ScriptRunIterator(const Replaceable& text, int32_t start, int32_t limit);
100 * examine scriptCode, start, and limit.
105 * Adjusts internal indices for a change in the limit index of the
106 * given delta. A positive delta means the limit has increased.
121 limit = myStart;
130 start = limit;
259 int32_t limit = pos.limit; local
[all...]
H A Dfphdlimp.cpp47 FieldPositionOnlyHandler::addAttribute(int32_t id, int32_t start, int32_t limit) { argument
50 pos.setEndIndex(limit);
88 FieldPositionIteratorHandler::addAttribute(int32_t id, int32_t start, int32_t limit) { argument
89 if (iter && U_SUCCESS(status) && start < limit) {
93 vec->addElement(limit, status);
/external/iptables/include/linux/netfilter/
H A Dxt_connlimit.h21 unsigned int limit; member in struct:xt_connlimit_info
/external/kernel-headers/original/uapi/linux/netfilter/
H A Dxt_connlimit.h24 unsigned int limit; member in struct:xt_connlimit_info
/external/pdfium/core/include/thirdparties/freetype/freetype/
H A Dftautoh.h318 * prop.limit = 14;
345 FT_UInt limit; member in struct:FT_Prop_IncreaseXHeight_
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/
H A Dftautoh.h318 * prop.limit = 14;
345 FT_UInt limit; member in struct:FT_Prop_IncreaseXHeight_
/external/chromium_org/third_party/icu/source/i18n/
H A Dcasetrn.cpp54 // automatically adjust start and limit if the Replaceable disagrees
67 // detect, and store in csc->b1, if we hit the limit
68 if(csc->index<csc->limit) {
71 csc->limit=csc->index;
139 if (offsets.start >= offsets.limit) {
147 csc.limit = offsets.contextLimit;
154 for(textPos=offsets.start; textPos<offsets.limit;) {
162 // fMap() tried to look beyond the context limit
183 csc.limit=offsets.contextLimit+=delta;
184 offsets.limit
[all...]
H A Dfphdlimp.cpp47 FieldPositionOnlyHandler::addAttribute(int32_t id, int32_t start, int32_t limit) { argument
50 pos.setEndIndex(limit);
88 FieldPositionIteratorHandler::addAttribute(int32_t id, int32_t start, int32_t limit) { argument
89 if (iter && U_SUCCESS(status) && start < limit) {
93 vec->addElement(limit, status);
/external/okhttp/okio/src/main/java/okio/
H A DDeflaterSink.java53 int toDeflate = (int) Math.min(byteCount, head.limit - head.pos);
62 if (head.pos == head.limit) {
81 ? deflater.deflate(s.data, s.limit, Segment.SIZE - s.limit, Deflater.SYNC_FLUSH)
82 : deflater.deflate(s.data, s.limit, Segment.SIZE - s.limit);
85 s.limit += deflated;
/external/chromium_org/third_party/WebKit/Source/platform/text/
H A DSuffixTree.h59 int limit = std::min(m_depth, query.length()); local
60 for (int i = 0; i < limit; ++i) {
100 unsigned limit = std::min(base + m_depth, text.length()); local
101 for (unsigned offset = 0; base + offset < limit; ++offset) {
105 child = base + offset + 1 == limit ? &m_leaf : new Node();
/external/chromium_org/chrome/browser/download/
H A Ddownload_path_reservation_tracker.cc31 // shorter than this limit, we give up automatic truncation and prompt the user.
104 // Truncates path->BaseName() to make path->BaseName().value().size() <= limit.
109 bool TruncateFileName(base::FilePath* path, size_t limit) { argument
112 if (basename.value().size() <= limit)
119 // Impossible to satisfy the limit.
120 if (limit < kTruncatedNameLengthLowerbound + ext.size())
122 limit -= ext.size();
128 base::TruncateUTF8ToByteSize(name, limit, &truncated);
131 DCHECK(name.size() > limit);
132 truncated = name.substr(0, CBU16_IS_TRAIL(name[limit])
202 int limit = max_length - kIntermediateNameSuffixLength; local
225 int limit = local
[all...]
/external/chromium_org/net/disk_cache/blockfile/
H A Dbitmap.cc212 bool Bitmap::FindNextBit(int* index, int limit, bool value) const { argument
214 DCHECK_LE(limit, num_bits_);
215 DCHECK_LE(*index, limit);
217 DCHECK_GE(limit, 0);
220 if (bit_index >= limit || limit <= 0)
223 // From now on limit != 0, since if it was we would have returned false.
245 // Loop through all but the last word. Note that 'limit' is one
248 // valid, so we want to avoid reading words[1] when limit == 32.
249 const int last_word_index = (limit
275 FindBits(int* index, int limit, bool value) const argument
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Duarrsort.c64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, argument
70 while((limit-start)>=MIN_QSORT) {
71 int32_t i=(start+limit)/2;
88 limit=i;
95 while(start<limit) {
168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, argument
173 /* start and left are inclusive, limit and right are exclusive */
175 if((start+MIN_QSORT)>=limit) {
176 doInsertionSort(array+start*itemSize, limit-start, itemSize, cmp, context, px);
181 right=limit;
[all...]
H A Ducmndata.c121 int32_t limit=count; local
123 * Remember the shared prefix between s, start and limit,
125 * The shared prefix should get longer as we narrow the [start, limit[ range.
134 * both the start and limit indexes have moved.
135 * At the same time, we find if s is one of the start and (limit-1) names,
142 --limit;
143 if(0==strcmpAfterPrefix(s, names+toc[limit].nameOffset, &limitPrefixLength)) {
144 return limit;
146 while(start<limit) {
147 int32_t i=(start+limit)/
166 int32_t limit=count; local
[all...]
/external/icu/icu4c/source/common/
H A Duarrsort.c64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, argument
70 while((limit-start)>=MIN_QSORT) {
71 int32_t i=(start+limit)/2;
88 limit=i;
95 while(start<limit) {
168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, argument
173 /* start and left are inclusive, limit and right are exclusive */
175 if((start+MIN_QSORT)>=limit) {
176 doInsertionSort(array+start*itemSize, limit-start, itemSize, cmp, context, px);
181 right=limit;
[all...]
H A Ducmndata.c121 int32_t limit=count; local
123 * Remember the shared prefix between s, start and limit,
125 * The shared prefix should get longer as we narrow the [start, limit[ range.
134 * both the start and limit indexes have moved.
135 * At the same time, we find if s is one of the start and (limit-1) names,
142 --limit;
143 if(0==strcmpAfterPrefix(s, names+toc[limit].nameOffset, &limitPrefixLength)) {
144 return limit;
146 while(start<limit) {
147 int32_t i=(start+limit)/
166 int32_t limit=count; local
[all...]
/external/elfutils/0.153/libdw/
H A Ddwarf_next_cfi.c85 const uint8_t *limit = data->d_buf + data->d_size; local
96 if (unlikely (limit - bytes < 8))
104 if (unlikely ((uint64_t) (limit - bytes) < length)
114 limit = bytes + length;
153 bytes = memchr (bytes, '\0', limit - bytes);
163 if (unlikely (limit - bytes < 5))
209 if ((Dwarf_Word) (limit - bytes) < entry->cie.augmentation_data_size)
247 entry->cie.initial_instructions_end = limit;
252 entry->fde.end = limit;
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cid/
H A Dcidparse.c58 FT_Byte *cur, *limit; local
113 limit = p + read_len - 10;
115 for ( p = buffer; p < limit; p++ )
150 parser->root.limit = parser->root.cursor + ps_len;
165 limit = parser->root.limit;
168 while ( cur < limit )
181 limit = parser->root.limit;
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dreptest.cpp90 void extractBetween(int32_t start, int32_t limit, UnicodeString& result) const { argument
91 chars.extractBetween(start, limit, result);
121 void fixStyles(int32_t start, int32_t limit, int32_t newLen) { argument
123 if (start != limit && styles.charAt(start) != NO_STYLE) {
127 } else if (limit < styles.length()) {
128 newStyle = styles.charAt(limit);
142 styles.replaceBetween(start, limit, s);
145 virtual void handleReplaceBetween(int32_t start, int32_t limit, const UnicodeString& text) { argument
147 this->extractBetween(start, limit, s);
149 this->chars.replaceBetween(start, limit, tex
154 copy(int32_t start, int32_t limit, int32_t dest) argument
[all...]
/external/chromium_org/third_party/icu/source/tools/toolutil/
H A Duparse.c79 char *start, *limit; local
124 limit=uprv_strchr(start, '#');
125 if(limit!=NULL) {
127 while(limit>start && U_IS_INV_WHITESPACE(*(limit-1))) {
128 --limit;
132 *limit=0;
142 /* set the limit pointer of this field */
143 limit=start;
144 while(*limit!
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dreptest.cpp90 void extractBetween(int32_t start, int32_t limit, UnicodeString& result) const { argument
91 chars.extractBetween(start, limit, result);
121 void fixStyles(int32_t start, int32_t limit, int32_t newLen) { argument
123 if (start != limit && styles.charAt(start) != NO_STYLE) {
127 } else if (limit < styles.length()) {
128 newStyle = styles.charAt(limit);
142 styles.replaceBetween(start, limit, s);
145 virtual void handleReplaceBetween(int32_t start, int32_t limit, const UnicodeString& text) { argument
147 this->extractBetween(start, limit, s);
149 this->chars.replaceBetween(start, limit, tex
154 copy(int32_t start, int32_t limit, int32_t dest) argument
[all...]

Completed in 580 milliseconds

1234567891011>>