/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
ListExtensions.cs | 206 public static IList subList( this IList list, int fromIndex, int toIndex ) 208 return new SubList( list, fromIndex, toIndex ); 212 // .Skip( fromIndex ) 213 // .Take( toIndex - fromIndex + 1 ) 217 public static IList<T> subList<T>( this IList<T> list, int fromIndex, int toIndex ) 219 return new SubList<T>( list, fromIndex, toIndex ); 222 // .Skip( fromIndex ) 223 // .Take( toIndex - fromIndex + 1 ) 227 public static IList<T> subList<T>( this List<T> list, int fromIndex, int toIndex ) 229 return new SubList<T>( list, fromIndex, toIndex ) [all...] |
/libcore/luni/src/main/java/java/util/ |
BitSet.java | 232 private void checkRange(int fromIndex, int toIndex) { 233 if ((fromIndex | toIndex) < 0 || toIndex < fromIndex) { 234 throw new IndexOutOfBoundsException("fromIndex=" + fromIndex + " toIndex=" + toIndex); 240 * range of bits {@code [fromIndex, toIndex)}, shifted down so that the bit 241 * at {@code fromIndex} is at bit 0 in the new {@code BitSet}. 244 * if {@code fromIndex} or {@code toIndex} is negative, or if 245 * {@code toIndex} is smaller than {@code fromIndex}. 247 public BitSet get(int fromIndex, int toIndex) [all...] |
DualPivotQuicksort.java | 77 * to be sorted extends from the index {@code fromIndex}, inclusive, to 78 * the index {@code toIndex}, exclusive. If {@code fromIndex == toIndex}, 82 * @param fromIndex the index of the first element, inclusive, to be sorted 84 * @throws IllegalArgumentException if {@code fromIndex > toIndex} 86 * if {@code fromIndex < 0} or {@code toIndex > a.length} 88 public static void sort(int[] a, int fromIndex, int toIndex) { 89 Arrays.checkStartAndEnd(a.length, fromIndex, toIndex); 90 doSort(a, fromIndex, toIndex - 1); 355 * to be sorted extends from the index {@code fromIndex}, inclusive, to 356 * the index {@code toIndex}, exclusive. If {@code fromIndex == toIndex} [all...] |
/sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/editors/ |
StateViewPage.java | 270 * Update GL state from GL call at fromIndex to the call at toIndex. 271 * If fromIndex < toIndex, the GL state will be updated by applying all the transformations 272 * corresponding to calls from (fromIndex + 1) to toIndex (inclusive). 273 * If fromIndex > toIndex, the GL state will be updated by reverting all the calls from 274 * fromIndex (inclusive) to (toIndex + 1). 277 private Set<IGLProperty> updateState(int fromIndex, int toIndex) { 278 assert fromIndex >= -1 && fromIndex < mGLCalls.size(); 281 if (fromIndex < toIndex) { 282 return applyTransformations(fromIndex, toIndex) [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ImmutableSortedAsList.java | 61 @Override public ImmutableList<E> subList(int fromIndex, int toIndex) { 62 Preconditions.checkPositionIndexes(fromIndex, toIndex, size()); 63 return (fromIndex == toIndex) ? ImmutableList.<E>of() 65 backingList.subList(fromIndex, toIndex), backingSet.comparator())
|
RegularImmutableList.java | 117 @Override public ImmutableList<E> subList(int fromIndex, int toIndex) { 118 Preconditions.checkPositionIndexes(fromIndex, toIndex, size); 119 return (fromIndex == toIndex) 122 array, offset + fromIndex, toIndex - fromIndex);
|
SingletonImmutableList.java | 107 @Override public ImmutableList<E> subList(int fromIndex, int toIndex) { 108 Preconditions.checkPositionIndexes(fromIndex, toIndex, 1); 109 return (fromIndex == toIndex) ? ImmutableList.<E>of() : this;
|
EmptyImmutableList.java | 118 @Override public ImmutableList<Object> subList(int fromIndex, int toIndex) { 119 checkPositionIndexes(fromIndex, toIndex, 0);
|
TransformedImmutableList.java | 93 @Override public ImmutableList<E> subList(int fromIndex, int toIndex) { 94 return new TransformedView(backingList.subList(fromIndex, toIndex));
|
/external/arduino/hardware/arduino/cores/arduino/ |
WString.cpp | 268 int String::indexOf( char ch, unsigned int fromIndex ) const 270 if ( fromIndex >= _length ) 273 const char* temp = strchr( &_buffer[fromIndex], ch ); 285 int String::indexOf( const String &s2, unsigned int fromIndex ) const 287 if ( fromIndex >= _length ) 290 const char *theFind = strstr( &_buffer[ fromIndex ], s2._buffer ); 303 int String::lastIndexOf( char ch, unsigned int fromIndex ) const 305 if ( fromIndex >= _length ) 308 char tempchar = _buffer[fromIndex + 1]; 309 _buffer[fromIndex + 1] = '\0' [all...] |
WString.h | 63 int indexOf( char ch, unsigned int fromIndex ) const; 65 int indexOf( const String &str, unsigned int fromIndex ) const; 67 int lastIndexOf( char ch, unsigned int fromIndex ) const; 69 int lastIndexOf( const String &str, unsigned int fromIndex ) const;
|
/frameworks/minikin/libs/minikin/ |
SparseBitSet.cpp | 113 uint32_t SparseBitSet::nextSetBit(uint32_t fromIndex) const { 114 if (fromIndex >= mMaxVal) { 117 uint32_t fromPage = fromIndex >> kLogValuesPerPage; 119 uint32_t offset = (fromIndex & kPageMask) >> kLogBitsPerEl; 120 element e = bitmap[offset] & (kElAllOnes >> (fromIndex & kElMask)); 122 return (fromIndex & ~kElMask) + CountLeadingZeros(e); 127 return (fromIndex & ~kPageMask) + (j << kLogBitsPerEl) + CountLeadingZeros(e);
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/suggestions/ |
MoreSuggestions.java | 56 public int layout(final SuggestedWords suggestedWords, final int fromIndex, 66 int index = fromIndex; 67 int rowStartIndex = fromIndex; 98 minWidth, calcurateMaxRowWidth(fromIndex, index)); 100 return index - fromIndex; 190 public Builder layout(final SuggestedWords suggestedWords, final int fromIndex, 197 final int count = mParams.layout(suggestedWords, fromIndex, maxWidth, minWidth, maxRow, 199 mFromIndex = fromIndex; 200 mToIndex = fromIndex + count;
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
NameLookupBuilder.java | 231 * fromIndex and toIndex 239 private void insertNameVariants(long rawContactId, long dataId, int fromIndex, int toIndex, 241 if (fromIndex == toIndex) { 250 String firstToken = mNames[fromIndex]; 251 for (int i = fromIndex; i < toIndex; i++) { 252 mNames[fromIndex] = mNames[i]; 255 insertNameVariants(rawContactId, dataId, fromIndex + 1, toIndex, 256 initiallyExact && i == fromIndex, buildCollationKey); 258 mNames[i] = mNames[fromIndex]; 259 mNames[fromIndex] = firstToken [all...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
XMLStringDefault.java | 418 * no smaller than <code>fromIndex</code>, then the index of the first 422 * (this.charAt(<i>k</i>) == ch) && (<i>k</i> >= fromIndex) 425 * position <code>fromIndex</code>, then <code>-1</code> is returned. 427 * There is no restriction on the value of <code>fromIndex</code>. If it 434 * @param fromIndex the index to start the search from. 437 * than or equal to <code>fromIndex</code>, or <code>-1</code> 440 public int indexOf(int ch, int fromIndex) 442 return m_str.indexOf(ch, fromIndex); 471 * this.charAt(k) == ch) && (k <= fromIndex) 476 * @param fromIndex the index to start the search from. There is n [all...] |
XMLString.java | 352 * no smaller than <code>fromIndex</code>, then the index of the first 356 * (this.charAt(<i>k</i>) == ch) && (<i>k</i> >= fromIndex) 359 * position <code>fromIndex</code>, then <code>-1</code> is returned. 361 * There is no restriction on the value of <code>fromIndex</code>. If it 368 * @param fromIndex the index to start the search from. 371 * than or equal to <code>fromIndex</code>, or <code>-1</code> 374 public abstract int indexOf(int ch, int fromIndex); 399 * this.charAt(k) == ch) && (k <= fromIndex) 404 * @param fromIndex the index to start the search from. There is no 405 * restriction on the value of <code>fromIndex</code>. If it i [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/ |
ObjectPropertiesSection.js | 785 * @param {number} fromIndex 789 WebInspector.ArrayGroupingTreeElement = function(object, fromIndex, toIndex, propertyCount) 791 TreeElement.call(this, String.sprintf("[%d \u2026 %d]", fromIndex, toIndex), undefined, true); 794 this._fromIndex = fromIndex; 808 * @param {number} fromIndex 811 WebInspector.ArrayGroupingTreeElement._populateArray = function(treeElement, object, fromIndex, toIndex) 813 WebInspector.ArrayGroupingTreeElement._populateRanges(treeElement, object, fromIndex, toIndex, true); 819 * @param {number} fromIndex 824 WebInspector.ArrayGroupingTreeElement._populateRanges = function(treeElement, object, fromIndex, toIndex, topLevel) 826 object.callFunctionJSON(packRanges, [{value: fromIndex}, {value: toIndex}, {value: WebInspector.ArrayGroupingTreeElement._bucketThreshold}, {value: WebIn (…) [all...] |
/libcore/luni/src/main/java/javax/security/auth/x500/ |
X500Principal.java | 228 int fromIndex = resultName.length(); 230 while (-1 != (equalIndex = resultName.lastIndexOf("=", fromIndex))) { 243 fromIndex = commaIndex; 250 int fromIndex = resultName.length(); 254 while (-1 != (equalIndex = resultName.lastIndexOf("=", fromIndex))) { 275 fromIndex = commaIndex; 304 int fromIndex = sbName.length(); 306 while (-1 != (equalIndex = sbName.lastIndexOf("=", fromIndex))) { 312 fromIndex = commaIndex;
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
InputPointers.java | 46 final int fromIndex = mTimes.getLength(); 49 if (fromIndex <= 0) { 52 final int fillLength = index - fromIndex + 1; 56 final int lastTime = mTimes.get(fromIndex - 1); 57 mTimes.fill(lastTime, fromIndex, fillLength);
|
/external/proguard/src/proguard/ |
DataEntryWriterFactory.java | 40 * @param fromIndex the start index in the class path. 45 int fromIndex, 51 for (int index = toIndex - 1; index >= fromIndex; index--)
|
/external/jdiff/src/jdiff/ |
RootDocToXML.java | 982 int fromindex = 0; local [all...] |
/external/chromium_org/chrome/browser/ui/cocoa/tabs/ |
tab_strip_model_observer_bridge.mm | 83 @selector(tabMovedWithContents:fromIndex:toIndex:)]) { 85 fromIndex:from_index
|
/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
XString.java | 658 * no smaller than <code>fromIndex</code>, then the index of the first 662 * (this.charAt(<i>k</i>) == ch) && (<i>k</i> >= fromIndex) 665 * position <code>fromIndex</code>, then <code>-1</code> is returned. 667 * There is no restriction on the value of <code>fromIndex</code>. If it 674 * @param fromIndex the index to start the search from. 677 * than or equal to <code>fromIndex</code>, or <code>-1</code> 680 public int indexOf(int ch, int fromIndex) 682 return str().indexOf(ch, fromIndex); 711 * this.charAt(k) == ch) && (k <= fromIndex) 716 * @param fromIndex the index to start the search from. There is n [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRTokenRewriteStream.m | 325 [self replaceProgNam:DEFAULT_PROGRAM_NAME FromIndex:anIndex ToIndex:anIndex Text:theText]; 330 [self replaceProgNam:DEFAULT_PROGRAM_NAME FromIndex:from ToIndex:to Text:theText]; 335 [self replaceProgNam:DEFAULT_PROGRAM_NAME FromIndex:[anIndexT getTokenIndex] ToIndex:[anIndexT getTokenIndex] Text:theText]; 340 [self replaceProgNam:DEFAULT_PROGRAM_NAME FromIndex:[from getTokenIndex] ToIndex:[to getTokenIndex] Text:theText]; 345 [self replaceProgNam:programName FromIndex:[from getTokenIndex] ToIndex:[to getTokenIndex] Text:theText]; 348 - (void) replaceProgNam:(NSString *)programName FromIndex:(NSInteger)from ToIndex:(NSInteger)to Text:(NSString *)theText 361 [self delete:DEFAULT_PROGRAM_NAME FromIndex:(NSInteger)anIndex ToIndex:(NSInteger)anIndex]; 366 [self delete:DEFAULT_PROGRAM_NAME FromIndex:from ToIndex:to]; 371 [self delete:DEFAULT_PROGRAM_NAME FromIndex:[anIndexT getTokenIndex] ToIndex:[anIndexT getTokenIndex]]; 376 [self delete:DEFAULT_PROGRAM_NAME FromIndex:[from getTokenIndex] ToIndex:[to getTokenIndex]] [all...] |
/frameworks/minikin/include/minikin/ |
SparseBitSet.h | 60 // The next set bit starting at fromIndex, inclusive, or kNotFound 62 uint32_t nextSetBit(uint32_t fromIndex) const;
|