/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRRewriteRuleTokenStream.h | 37 /** Create a stream with one element */ 40 element:(id) oneElement; 51 element:(id)element; 64 - (id<ANTLRTree>) toTree:(id<ANTLRToken>)element;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRRewriteRuleTokenStream.h | 37 /** Create a stream with one element */ 40 element:(id) oneElement; 51 element:(id)element; 64 - (id<ANTLRTree>) toTree:(id<ANTLRToken>)element;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRRewriteRuleTokenStream.h | 37 /** Create a stream with one element */ 40 element:(id) oneElement; 51 element:(id)element; 64 - (id<ANTLRTree>) toTree:(id<ANTLRToken>)element;
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRRewriteRuleNodeStream.h | 37 + (ANTLRRewriteRuleNodeStream *) newANTLRRewriteRuleNodeStream:(id<ANTLRTreeAdaptor>)aTreeAdaptor description:(NSString *)anElementDescription element:(id)anElement; 41 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)aTreeAdaptor description:(NSString *)anElementDescription element:(id)anElement; 45 - (id) toTree:(id<ANTLRBaseTree>)element; 46 - (id) dup:(id)element;
|
H A D | ANTLRRewriteRuleTokenStream.h | 37 /** Create a stream with one element */ 40 element:(id) oneElement; 51 element:(id)element; 64 - (id<ANTLRBaseTree>) toTree:(id<ANTLRToken>)element;
|
/external/droiddriver/src/io/appium/droiddriver/validators/ |
H A D | ExemptScrollActionValidator.java | 29 public boolean isApplicable(UiElement element, Action action) { argument 34 public String validate(UiElement element, Action action) { argument
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | DescendingImmutableSortedSet.java | 81 public E lower(E element) { argument 82 return forward.higher(element); 86 public E floor(E element) { argument 87 return forward.ceiling(element); 91 public E ceiling(E element) { argument 92 return forward.floor(element); 96 public E higher(E element) { argument 97 return forward.lower(element);
|
H A D | AbstractMultiset.java | 59 @Override public boolean contains(@Nullable Object element) { argument 60 return count(element) > 0; 68 public int count(@Nullable Object element) { argument 70 if (Objects.equal(entry.getElement(), element)) { 79 @Override public boolean add(@Nullable E element) { argument 80 add(element, 1); 85 public int add(@Nullable E element, int occurrences) { argument 89 @Override public boolean remove(@Nullable Object element) { argument 90 return remove(element, 1) > 0; 94 public int remove(@Nullable Object element, in argument 99 setCount(@ullable E element, int count) argument 104 setCount(@ullable E element, int oldCount, int newCount) argument [all...] |
/external/icu/icu4c/source/common/ |
H A D | unifiedcache.cpp | 151 const UHashElement *element = uhash_nextElement(fHashtable, &pos); local 154 for (; element != NULL; element = uhash_nextElement(fHashtable, &pos)) { 156 (const SharedObject *) element->value.pointer; 158 (const CacheKeyBase *) element->key.pointer; 197 const UHashElement *element = uhash_nextElement(fHashtable, &pos); local 198 for (; element != NULL; element = uhash_nextElement(fHashtable, &pos)) { 200 (const SharedObject *) element->value.pointer; 202 uhash_removeElement(fHashtable, element); 248 const UHashElement *element = uhash_find(fHashtable, &key); local 278 const UHashElement *element = uhash_find(fHashtable, &key); local 333 _put( const UHashElement *element, const SharedObject *value, const UErrorCode status) argument 358 _fetch( const UHashElement *element, const SharedObject *&value, UErrorCode &status) argument 370 _inProgress(const UHashElement *element) argument [all...] |
/external/v8/test/webkit/ |
H A D | stack-unwinding.js | 37 function arrayOperatorFunction(element) { 38 return element + 5;
|
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
H A D | ZLinkedList.java | 34 public boolean moveToTop(Type element) {
argument 35 return organizer.moveToTop(element);
68 public void addToBottom(Type element) {
argument 69 organizer.addToBottom(element);
72 public void addToTop(Type element) {
argument 73 organizer.addToTop(element);
|
H A D | ListOrganizer.java | 22 * Utility class providing additional element organization operations.
33 public boolean moveToTop(ElementType element) {
argument 34 if(list.remove(element)) {
35 list.add(list.size(), element);
52 //widgetOrder.remove(element);
113 public void addToBottom(ElementType element) {
argument 114 list.add(0, element);
117 public void addToTop(ElementType element) {
argument 118 list.add(list.size(), element);
|
/external/guava/guava-gwt/test-super/com/google/common/collect/testing/super/com/google/common/collect/testing/testers/ |
H A D | SetHashCodeTester.java | 36 for (E element : getSampleElements()) { 37 expectedHashCode += ((element == null) ? 0 : element.hashCode()); 49 for (E element : elements) { 50 expectedHashCode += ((element == null) ? 0 : element.hashCode()); 57 + "a null element counting as having a hash of zero).",
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | SetHashCodeTester.java | 39 for (E element : getSampleElements()) { 40 expectedHashCode += ((element == null) ? 0 : element.hashCode()); 52 for (E element : elements) { 53 expectedHashCode += ((element == null) ? 0 : element.hashCode()); 60 + "a null element counting as having a hash of zero).",
|
/external/jarjar/src/main/com/tonicsystems/jarjar/ |
H A D | RulesFileParser.java | 54 PatternElement element = null; 60 element = rule; 62 element = new Zap(); 64 element = new Keep(); 68 element.setPattern(parts[1]); 69 patterns.add(element);
|
/external/mesa3d/src/mapi/glapi/gen/ |
H A D | glX_proto_common.py | 35 def create_item(self, name, element, context): 37 return glx_proto_type(element, context) 39 return glX_XML.glx_item_factory.create_item(self, name, element, context) 43 def __init__(self, element, context): 44 gl_XML.gl_type.__init__(self, element, context) 46 self.glx_name = element.nsProp( "glx_name", None )
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_vs_variant.c | 296 fetch.element[i].type = TRANSLATE_ELEMENT_NORMAL; 297 fetch.element[i].input_format = key->element[i].in.format; 298 fetch.element[i].input_buffer = key->element[i].in.buffer; 299 fetch.element[i].input_offset = key->element[i].in.offset; 300 fetch.element[i].instance_divisor = 0; 301 fetch.element[i].output_format = PIPE_FORMAT_R32G32B32A32_FLOAT; 302 fetch.element[ [all...] |
/external/droiddriver/src/io/appium/droiddriver/finders/ |
H A D | ByXPath.java | 142 Element element = getDocument().createElement(XPaths.tag(className)); 143 TO_DOM_MAP.put(uiElement, element); 144 FROM_DOM_MAP.put(element, uiElement); 146 setAttribute(element, Attribute.CLASS, className); 147 setAttribute(element, Attribute.RESOURCE_ID, uiElement.getResourceId()); 148 setAttribute(element, Attribute.PACKAGE, uiElement.getPackageName()); 149 setAttribute(element, Attribute.CONTENT_DESC, uiElement.getContentDescription()); 150 setAttribute(element, Attribute.TEXT, uiElement.getText()); 151 setAttribute(element, Attribute.CHECKABLE, uiElement.isCheckable()); 152 setAttribute(element, Attribut 185 setAttribute(Element element, Attribute attr, String value) argument 192 setAttribute(Element element, Attribute attr, boolean value) argument [all...] |
/external/droiddriver/src/io/appium/droiddriver/actions/ |
H A D | ClickAction.java | 43 public boolean perform(InputInjector injector, UiElement element) { argument 44 SINGLE.perform(element); 45 SINGLE.perform(element); 56 public boolean perform(InputInjector injector, UiElement element) { argument 57 Rect elementRect = element.getVisibleBounds(); 72 public boolean perform(InputInjector injector, UiElement element) { argument 73 Rect elementRect = element.getVisibleBounds();
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | MultisetSetCountConditionallyTester.java | 38 @Override void setCountCheckReturnValue(E element, int count) { argument 41 setCount(element, count)); 44 @Override void setCountNoCheckReturnValue(E element, int count) { argument 45 setCount(element, count); 48 private boolean setCount(E element, int count) { argument 49 return getMultiset().setCount(element, getMultiset().count(element), count);
|
/external/apache-harmony/sql/src/test/java/org/apache/harmony/sql/tests/java/sql/ |
H A D | TimestampTest.java | 175 for (int[] element : valid) { 176 Timestamp theTimestamp = new Timestamp(element[0], element[1], 177 element[2], element[3], element[4], element[5], element[6]); 183 for (int[] element : invalid) { 185 new Timestamp(element[ [all...] |
/external/nanopb-c/generator/google/protobuf/internal/ |
H A D | encoder.py | 133 for element in value: 134 result += compute_value_size(element) 140 for element in value: 141 result += compute_value_size(element) 162 for element in value: 163 result += compute_value_size(modify_value(element)) 169 for element in value: 170 result += compute_value_size(modify_value(element)) 237 for element in value: 238 l = local_len(element [all...] |
/external/protobuf/python/google/protobuf/internal/ |
H A D | encoder.py | 139 for element in value: 140 result += compute_value_size(element) 146 for element in value: 147 result += compute_value_size(element) 168 for element in value: 169 result += compute_value_size(modify_value(element)) 175 for element in value: 176 result += compute_value_size(modify_value(element)) 243 for element in value: 244 l = local_len(element [all...] |
/external/vixl/src/vixl/ |
H A D | invalset.h | 46 // - Adding an element already present in the set is illegal. In debug mode, 52 // element. 61 // searching for an element we ensure the elements are sorted (this is generally 62 // the case) and perform a binary search. When deleting an element we do not 63 // free the associated memory immediately. Instead, an element to be deleted is 95 // It is illegal to insert an element already present in the set. 96 void insert(const ElementType& element); 98 // Looks for the specified element in the set and - if found - deletes it. 99 void erase(const ElementType& element); 113 // This returns the key of the minimum element i 280 insert(const ElementType& element) argument 312 erase(const ElementType& element) argument 323 Search( const ElementType& element) argument 387 IsValid(const ElementType& element) argument 393 EraseInternal(ElementType* element) argument 426 BinarySearch( const ElementType& element, ElementType* start, ElementType* end) const argument 747 IsValid(const ElementType& element) argument 753 Key(const ElementType& element) argument [all...] |
/external/ceres-solver/include/ceres/internal/ |
H A D | fixed_array.h | 109 // Returns a pointer to the underlying element array. 110 inline const T* get() const { return &array_[0].element; } 111 inline T* get() { return &array_[0].element; } 114 // Returns a reference to the "i"th element. 117 return array_[i].element; 121 // Returns a reference to the "i"th element. 124 return array_[i].element; 127 inline iterator begin() { return &array_[0].element; } 128 inline iterator end() { return &array_[size_].element; } 130 inline const_iterator begin() const { return &array_[0].element; } 139 T element; member in struct:ceres::internal::FixedArray::InnerContainer [all...] |