/external/chromium_org/ppapi/cpp/ |
H A D | network_list.h | 32 /// specified <code>index</code>. 33 std::string GetName(uint32_t index) const; 36 /// specified <code>index</code>. 37 PP_NetworkList_Type GetType(uint32_t index) const; 40 /// the specified <code>index</code>. 41 PP_NetworkList_State GetState(uint32_t index) const; 44 /// specified <code>index</code> and stores them in 46 int32_t GetIpAddresses(uint32_t index, 50 /// the specified <code>index</code>. 51 std::string GetDisplayName(uint32_t index) cons [all...] |
/external/chromium_org/ppapi/thunk/ |
H A D | ppb_network_list_api.h | 22 virtual PP_Var GetName(uint32_t index) = 0; 23 virtual PP_NetworkList_Type GetType(uint32_t index) = 0; 24 virtual PP_NetworkList_State GetState(uint32_t index) = 0; 25 virtual int32_t GetIpAddresses(uint32_t index, 27 virtual PP_Var GetDisplayName(uint32_t index) = 0; 28 virtual uint32_t GetMTU(uint32_t index) = 0;
|
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | CompositionUnderlineRangeFilter.cpp | 16 size_t CompositionUnderlineRangeFilter::seekValidIndex(size_t index) argument 18 if (index == kNotFound) 22 while (index < numUnderlines) { 23 const CompositionUnderline& underline = m_underlines[index]; 27 ++index; 30 return index;
|
/external/chromium_org/third_party/WebKit/Source/platform/ |
H A D | MIMETypeFromURL.cpp | 39 size_t index = url.find(';'); local 40 if (index == kNotFound) 41 index = url.find(','); 42 if (index != kNotFound) { 43 if (index > 5) 44 return url.substring(5, index - 5).lower();
|
/external/chromium_org/ui/base/models/ |
H A D | list_model.h | 26 // Adds |item| at the |index| into |items_|. Takes ownership of |item|. 27 void AddAt(size_t index, ItemType* item) { argument 28 DCHECK_LE(index, item_count()); 29 items_.insert(items_.begin() + index, item); 30 NotifyItemsAdded(index, 1); 38 // Removes the item at |index| from |items_| without deleting it. 40 scoped_ptr<ItemType> RemoveAt(size_t index) { argument 41 DCHECK_LT(index, item_count()); 42 ItemType* item = items_[index]; 43 items_.weak_erase(items_.begin() + index); 56 DeleteAt(size_t index) argument 69 Move(size_t index, size_t target_index) argument 102 NotifyItemMoved(size_t index, size_t target_index) argument 120 GetItemAt(size_t index) argument [all...] |
H A D | list_selection_model.cc | 17 static void IncrementFromImpl(int index, int* value) { argument 18 if (*value >= index) 22 static bool DecrementFromImpl(int index, int* value) { argument 23 if (*value == index) { 27 if (*value > index) 40 void ListSelectionModel::IncrementFrom(int index) { argument 44 IncrementFromImpl(index, &(*i)); 46 IncrementFromImpl(index, &anchor_); 47 IncrementFromImpl(index, &active_); 50 void ListSelectionModel::DecrementFrom(int index) { argument 62 SetSelectedIndex(int index) argument 74 AddIndexToSelection(int index) argument 81 RemoveIndexFromSelection(int index) argument 88 SetSelectionFromAnchorTo(int index) argument 101 AddSelectionFromAnchorTo(int index) argument [all...] |
/external/chromium_org/v8/test/webkit/ |
H A D | function-constructor-newline-after-brace.js | 33 var index = tempString.indexOf("{") + 2; 34 tempString = tempString.substr(index, tempString.length - index - 2); 47 var index = tempString.indexOf("{") + 2; 48 tempString = tempString.substr(index, tempString.length - index - 2);
|
/external/libcxx/test/utilities/type.index/type.index.overview/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/type.index/type.index.overview/Android.mk 19 test_name := utilities/type.index/type.index.overview/copy_ctor 23 test_name := utilities/type.index/type.index.overview/copy_assign
|
/external/proguard/src/proguard/classfile/instruction/visitor/ |
H A D | MultiInstructionVisitor.java | 86 for (int index = 0; index < instructionVisitorCount; index++) 88 instructionVisitors[index].visitSimpleInstruction(clazz, method, codeAttribute, offset, simpleInstruction); 94 for (int index = 0; index < instructionVisitorCount; index++) 96 instructionVisitors[index].visitVariableInstruction(clazz, method, codeAttribute, offset, variableInstruction); 102 for (int index = 0; index < instructionVisitorCoun [all...] |
/external/valgrind/main/none/tests/mips64/ |
H A D | load_store_unaligned.c | 26 int i, index; local 41 index = (i / SOLL) % N; 43 i, index, memSrc[index], index, memDst[index], outLoad);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicReduceOrderTest.cpp | 24 int index, minX, maxX, minY, maxY; 26 for (index = 1; index < 4; ++index) { 27 if (cubic[minX].fX > cubic[index].fX) { 28 minX = index; 30 if (cubic[minY].fY > cubic[index].fY) { 31 minY = index; 33 if (cubic[maxX].fX < cubic[index].fX) { 34 maxX = index; 62 size_t index; local [all...] |
H A D | PathOpsDTriangleTest.cpp | 32 for (size_t index = 0; index < tests_count; ++index) { 33 const SkDTriangle& triangle = tests[index]; 35 bool result = triangle.contains(inPoint[index]); 37 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index); 40 result = triangle.contains(outPoint[index]); 42 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index); 59 for (size_t index = 0; index < oneOff_coun [all...] |
/external/skia/tests/ |
H A D | PathOpsCubicReduceOrderTest.cpp | 24 int index, minX, maxX, minY, maxY; 26 for (index = 1; index < 4; ++index) { 27 if (cubic[minX].fX > cubic[index].fX) { 28 minX = index; 30 if (cubic[minY].fY > cubic[index].fY) { 31 minY = index; 33 if (cubic[maxX].fX < cubic[index].fX) { 34 maxX = index; 62 size_t index; local [all...] |
H A D | PathOpsDTriangleTest.cpp | 32 for (size_t index = 0; index < tests_count; ++index) { 33 const SkDTriangle& triangle = tests[index]; 35 bool result = triangle.contains(inPoint[index]); 37 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index); 40 result = triangle.contains(outPoint[index]); 42 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index); 59 for (size_t index = 0; index < oneOff_coun [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicReduceOrder_Test.cpp | 14 size_t index; local 47 for (index = firstPointDegeneratesTest; index < pointDegenerates_count; ++index) { 48 const Cubic& cubic = pointDegenerates[index]; 52 SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order); 55 for (index = firstNotPointDegeneratesTest; index < notPointDegenerates_count; ++index) { 56 const Cubic& cubic = notPointDegenerates[index]; [all...] |
/external/skia/experimental/Intersection/ |
H A D | CubicReduceOrder_Test.cpp | 14 size_t index; local 47 for (index = firstPointDegeneratesTest; index < pointDegenerates_count; ++index) { 48 const Cubic& cubic = pointDegenerates[index]; 52 SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order); 55 for (index = firstNotPointDegeneratesTest; index < notPointDegenerates_count; ++index) { 56 const Cubic& cubic = notPointDegenerates[index]; [all...] |
/external/proguard/src/proguard/classfile/attribute/preverification/ |
H A D | MoreZeroFrame.java | 80 for (int index = 0; index < additionalVariablesCount; index++) 82 additionalVariables[index].accept(clazz, method, codeAttribute, offset, verificationTypeVisitor); 118 for (int index = 0; index < additionalVariablesCount; index++) 120 VerificationType thisType = this.additionalVariables[index]; 121 VerificationType otherType = other.additionalVariables[index]; 137 for (int index [all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/dexbacked/util/ |
H A D | VariableSizeListIterator.java | 46 private int index; field in class:VariableSizeListIterator 58 * @param index The index of the item being read. This is guaranteed to be less than {@code size} 61 protected abstract T readNextItem(@Nonnull DexReader reader, int index); argument 69 return index < size; 74 if (index >= size) { 77 return readNextItem(reader, index++); 82 return index > 0; 87 int targetIndex = index-1; 89 index [all...] |
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | AttributesImplSerializer.java | 32 * faster lookup of an index by qName, which is commonly done in the stream 42 * Hash table of qName/index values to quickly lookup the index 46 * The keys to the hashtable to find the index are either 66 * This method gets the index of an attribute given its qName. 68 * @return the integer index of the attribute. 73 int index; 79 index = super.getIndex(qname); 80 return index; 86 index [all...] |
/external/chromium_org/chrome/browser/ui/views/tabs/ |
H A D | stacked_tab_strip_layout.h | 51 // Sets the index of the active tab. 52 void SetActiveIndex(int index); 61 // Adds a new tab at the specified index. |add_types| is a bitmask of 63 void AddTab(int index, int add_types, int start_x); 65 // Removes the tab at the specified index. |start_x| is the new x-coordinate 68 void RemoveTab(int index, int start_x, int old_x); 70 // Moves the tab from |from| to |to|. |new_active_index| is the index of the 78 // Returns the active index as used by this class. The active index dictates 80 // StackedTabStripLayout forces the active index t [all...] |
/external/proguard/src/proguard/util/ |
H A D | ClassNameParser.java | 62 int index; 66 for (index = 0; index < regularExpression.length(); index++) 69 if (regularExpression.regionMatches(index, "L///;", 0, 5)) 76 new OrMatcher(parse(regularExpression.substring(index + 5)), 85 if (regularExpression.regionMatches(index, "L***;", 0, 5)) 90 createAnyTypeMatcher(parse(regularExpression.substring(index + 5))); 95 if (regularExpression.regionMatches(index, "**", 0, 2)) 104 parse(regularExpression.substring(index [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | collationrootelements.cpp | 26 int32_t index = findP(p); local 27 uint32_t q = elements[index]; 30 // p == elements[index] is a root primary. Find the CE before it. 33 secTer = elements[index - 1]; 40 index -= 2; 42 p = elements[index]; 47 --index; 51 // p > elements[index] which is the previous primary. 56 q = elements[++index]; 71 int32_t index local 88 int32_t index = findPrimary(p); local 118 int32_t index; local 143 int32_t index; local 171 getPrimaryAfter(uint32_t p, int32_t index, UBool isCompressible) const argument 193 getSecondaryAfter(int32_t index, uint32_t s) const argument 216 getTertiaryAfter(int32_t index, uint32_t s, uint32_t t) const argument 249 int32_t index = findP(p); local [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | IntStream.java | 44 * current input position, index(), or some other marker so that 47 * track line/col info as well as input index so its markers are 52 /** Return the current input symbol index 0..n where n indicates the 53 * last symbol has been read. The index is the symbol about to be 56 int index(); method in interface:IntStream 58 /** Reset the stream so that next call to index would return marker. 59 * The marker will usually be index() but it doesn't have to be. It's 89 /** Set the input cursor to the position indicated by index. This is 95 * requirement and in that its argument is strictly an input cursor (index). 105 * The index i 109 seek(int index) argument [all...] |
/external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/framework/jdwp/ |
H A D | Location.java | 37 public long index; field in class:Location 46 index = 0; 52 public Location(byte tag, long classID, long methodID, long index) { argument 56 this.index = index; 63 return "Location: tag="+tag+", classID="+classID+", methodID="+methodID+", index="+index; 74 && index == loc.index;
|
/external/apache-xml/src/main/java/org/apache/xml/utils/res/ |
H A D | CharArrayWrapper.java | 35 public char getChar(int index){ argument 36 return m_char[index];
|