HomeSort by relevance Sort by last modified time
    Searched refs:element (Results 601 - 625 of 1844) sorted by null

<<21222324252627282930>>

  /external/python/cpython3/Lib/xml/etree/
ElementTree.py 8 2. Element represents a single node in this tree.
11 usually done on the ElementTree level. Interactions with a single XML element
12 and its sub-elements are done on the Element level.
14 Element is a flexible container object designed to store hierarchical data
16 dictionary. Each Element has a number of properties associated with it:
18 'tag' - a string containing the element's name.
20 'attributes' - a Python dictionary storing the element's attributes.
22 'text' - a string containing the element's text content.
24 'tail' - an optional string containing text after the element's end tag.
28 To create an element instance, use the Element constructor
    [all...]
  /external/libcups/cups/
ipp.h     [all...]
  /external/tinyxml/
xmltest.cpp 156 // an element from the document.
159 // Get the "ToDo" element.
175 // "none" to "here". It's the next sibling element.
244 TiXmlElement* element; local
257 XmlTest( "Root element exists.", true, ( node != 0 && node->ToElement() ) );
258 XmlTest ( "Root element value is 'ToDo'.", "ToDo", node->Value());
263 XmlTest( "Sibling element exists & is an element.", true, ( node != 0 && node->ToElement() ) );
306 for( element = todoElement->FirstChildElement();
307 element;
508 TiXmlElement* element = docH.FirstChildElement( "document" ).FirstChildElement( "Russian" ).Element(); local
669 const TiXmlElement* element = doc.RootElement(); local
    [all...]
  /art/libartbase/base/
array_slice.h 47 // Create an array slice of the first 'length' elements of the array, with each element being
76 // Element access. NOTE: Not providing at() and data().
132 bool Contains(const T* element) const {
133 return &AtUnchecked(0) <= element && element < &AtUnchecked(size_);
  /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
TestPaths.java 26 import org.unicode.cldr.util.DtdData.Element;
252 for (Element element : dtdData.getElements()) {
253 if (element.isDeprecated() || element == dtdData.ANY || element == dtdData.PCDATA) {
256 M3<String, String, Boolean> infoAV = infoEAV.get(element.name);
260 + ":" + element.name);
264 for (Attribute attribute : element.getAttributes().keySet()) {
272 + ":" + element.nam
456 String element = parts.getElement(i); local
    [all...]
  /external/cldr/tools/java/org/unicode/cldr/tool/
PluralMinimalPairs.java 47 String element = parts.getElement(-1); local
48 PluralType type = "pluralMinimalPairs".equals(element) ? PluralType.CARDINAL
49 : "ordinalMinimalPairs".equals(element) ? PluralType.ORDINAL
  /external/dagger2/compiler/src/main/java/dagger/internal/codegen/
FrameworkField.java 26 import javax.lang.model.element.ElementVisitor;
27 import javax.lang.model.element.ExecutableElement;
28 import javax.lang.model.element.TypeElement;
ModuleDescriptor.java 14 import javax.lang.model.element.AnnotationMirror;
15 import javax.lang.model.element.ExecutableElement;
16 import javax.lang.model.element.TypeElement;
  /external/dagger2/compiler/src/test/java/dagger/internal/codegen/
DependencyRequestMapperTest.java 30 import javax.lang.model.element.ExecutableElement;
31 import javax.lang.model.element.TypeElement;
32 import javax.lang.model.element.VariableElement;
  /external/doclava/src/com/google/doclava/
AnnotationInstanceInfo.java 73 if (value.element() != null) {
74 str.append(value.element().name());
136 // Serialize data about the annotation element values
140 data.setValue(elemBase + ".name", value.element().name());
  /external/fonttools/Lib/fontTools/ttLib/tables/
S__i_l_l.py 74 for element in content:
75 if not isinstance(element, tuple): continue
76 tag, a, subcontent = element
_a_v_a_r.py 92 for element in content:
93 if isinstance(element, tuple):
94 elementName, elementAttrs, _ = element
_s_b_i_x.py 105 for element in content:
106 if isinstance(element, tuple):
107 name, attrs, content = element
112 raise ttLib.TTLibError("can't handle '%s' element" % name)
  /external/google-breakpad/src/processor/
synth_minidump.h 285 template<typename Element>
292 // Add ELEMENT to this list.
293 void Add(Element *element) {
294 element->Finish(file_offset_ + Size());
295 Append(*element);
  /external/guava/guava/src/com/google/common/collect/
Lists.java 296 * Returns an unmodifiable list containing the specified first element and
307 * @param first the first element
338 * element, and backed by the specified array of additional elements. Changes
348 * @param first the first element
349 * @param second the second element
389 * Returns every possible list that can be formed by choosing one element
423 * Cartesian product has one element, an empty list (counter-intuitive, but
442 * or any element of a provided list is null
449 * Returns every possible list that can be formed by choosing one element
483 * Cartesian product has one element, an empty list (counter-intuitive, bu
    [all...]
MinMaxPriorityQueue.java 44 * its least element and its greatest element, as determined by the queue's
49 * head element -- the implicit target of the methods {@link #peek()}, {@link
50 * #poll()} and {@link #remove()} -- is defined as the <i>least</i> element in
53 * {@link #removeLast} are also provided, to act on the <i>greatest</i> element
58 * removes its greatest element according to its comparator (which might be the
59 * element that was just added). This is different from conventional bounded
74 * #peekLast}, {@link #element}, and {@link #size} are constant-time
133 * removes its greatest element (according to its comparator), which might be
134 * the element that was just added
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
Lists.java 262 * Returns an unmodifiable list containing the specified first element and
273 * @param first the first element
304 * element, and backed by the specified array of additional elements. Changes
314 * @param first the first element
315 * @param second the second element
355 * Returns every possible list that can be formed by choosing one element
389 * Cartesian product has one element, an empty list (counter-intuitive, but
408 * or any element of a provided list is null
415 * Returns every possible list that can be formed by choosing one element
449 * Cartesian product has one element, an empty list (counter-intuitive, bu
    [all...]
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
AbstractContainerTester.java 122 * of each given element has increased by one since the test collection was
162 for (E element : elements) {
163 assertFalse("Should not contain " + element,
164 actualContents().contains(element));
191 * @return an array of the proper size with a duplicate element.
231 * @return a suitable location for a null element, to use when initializing
232 * containers for tests that involve a null element being present.
  /external/guava/guava-tests/test/com/google/common/util/concurrent/
AbstractFutureTest.java 167 StackTraceElement element = elements[i]; local
168 if (element.getClassName().equals(clazz)
169 && element.getMethodName().equals(method)) {
174 new AssertionFailedError("Expected element " + clazz + "." + method
  /external/guice/core/test/com/google/inject/spi/
ElementSourceTest.java 42 null /* No original element source */,
50 List<Element> elements = Elements.getElements(new A());
51 for (Element element : elements) {
52 if (element instanceof Binding) {
53 Binding<?> binding = (Binding<?>) element;
  /external/libchrome/base/android/jni_generator/java/src/org/chromium/example/jni_generator/
SampleForTests.java 212 // Called by the native side to append another element.
220 InnerStructA element = it.next(); local
221 // Now, do something with element.
255 InnerStructB element = it.next(); local
256 // Now, do something with element.
257 nativeAddStructB(mNativeCPPObject, element);
  /external/mesa3d/src/gallium/drivers/nouveau/nv30/
nv30_vbo.c 220 PUSH_DATA (push, (vb->stride << 8) | vertex->element[i].state);
265 so = MALLOC(sizeof(*so) + sizeof(*so->element) * num_elements);
280 so->element[i].state = nv30_vtxfmt(pipe->screen, fmt)->hw;
281 if (!so->element[i].state) {
292 so->element[i].state = nv30_vtxfmt(pipe->screen, fmt)->hw;
299 transkey.element[j].type = TRANSLATE_ELEMENT_NORMAL;
300 transkey.element[j].input_format = ve->src_format;
301 transkey.element[j].input_buffer = vbi;
302 transkey.element[j].input_offset = ve->src_offset;
303 transkey.element[j].instance_divisor = ve->instance_divisor
    [all...]
  /external/smali/smalidea/src/main/java/org/jf/smalidea/psi/impl/
SmaliMethodReference.java 167 @Override public boolean isReferenceTo(PsiElement element) {
168 return resolve() == element;
188 @Override public PsiElement bindToElement(@NotNull PsiElement element) throws IncorrectOperationException {
  /external/tensorflow/tensorflow/core/kernels/
barrier_ops.cc 330 PersistentTuple& element = *element_ptr; local
332 if (element.empty()) { // Never seen before key
333 // Added a new element, for keeping track of the insertion index
337 element.reserve(1 + num_components());
339 // The first entry in element is the priority: the
350 element.push_back(index_persistent_tensor);
352 // The rest of the element stores uninitialized Tensors with
356 element.push_back(PersistentTensor(uninitialized));
359 const PersistentTensor& component = element[1 + component_index];
372 element[1 + component_index] = next_element
    [all...]
random_shuffle_queue_op.cc 70 // Helper for dequeuing a single random element from queues_.
209 PersistentTensor element;
211 tuple, index, i, attempt->context, &element));
213 queues_[i].push_back(element);
304 // what is going to happen to the element read out of the
312 Tensor element; local
314 &element);
320 tuple.emplace_back(element);
349 PersistentTensor element;
351 attempt->tuple, i, j, attempt->context, &element);
    [all...]

Completed in 1424 milliseconds

<<21222324252627282930>>