/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
example-bind.cpp | 132 // Element access 136 typedef typename tuple_element<I-1, tuple<Values...> >::type Element; 137 typedef typename add_reference<Element>::type RJ; 138 typedef typename add_const_reference<Element>::type PJ;
|
example-tuple.cpp | 175 // Element access 179 typedef typename tuple_element<I-1, tuple<Values...> >::type Element; 180 typedef typename add_reference<Element>::type RJ; 181 typedef typename add_const_reference<Element>::type PJ;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
partition.h | 40 struct Element { 41 Element() : value(0), next(0), prev(0) {} 42 Element(T v) : value(v), next(0), prev(0) {} 45 Element* next; 46 Element* prev; 63 // Initialize just creates num_states of elements. All element 64 // operations are then done by simply disconnecting the element from 77 elements_[i] = new Element(i); 101 // use the Move() method move an element from once class to another. 103 Element* element = elements_[element_id] local 120 Element* element = elements_[element_id]; local [all...] |
factor-weight.h | 153 struct Element { 154 Element() {} 156 Element(StateId s, Weight w) : state(s), weight(w) {} 182 StateId start = FindState(Element(fst_->Start(), Weight::One())); 190 const Element &e = elements_[s]; 229 // Find state corresponding to an element. Create new state 230 // if element not found. 231 StateId FindState(const Element &e) { 247 element_map_.insert(pair<const Element, StateId>(e, s)); 256 Element e = elements_[s] [all...] |
rmepsilon.h | 78 struct Element { 83 Element() {} 85 Element(Label i, Label o, StateId s) 91 size_t operator()(const Element& e) const { 105 bool operator()(const Element &e1, const Element &e2) const { 112 typedef hash_map<Element, pair<StateId, ssize_t>, 120 // Maps an element 'e' to a pair 'p' corresponding to a position 163 Element element(arc.ilabel, arc.olabel, arc.nextstate) [all...] |
synchronize.h | 58 struct Element { 59 Element() {} 61 Element(StateId s, const String *i, const String *o) 100 StateId start = FindState(Element(fst_->Start(), empty, empty)); 108 const Element &e = elements_[s]; 191 // Finds state corresponding to an element. Creates new state 192 // if element not found. 193 StateId FindState(const Element &e) { 200 element_map_.insert(pair<const Element, StateId>(e, s)); 209 Element e = elements_[s] [all...] |
determinize.h | 213 struct Element { 214 Element() {} 216 Element(StateId s, Weight w) : state_id(s), weight(w) {} 221 typedef slist<Element> Subset; 245 Element element(s, Weight::One()); 247 subset->push_front(element); 257 Element &element = *siter; local 258 final = Plus(final, Times(element.weight 433 const Element &element = *iter; local [all...] |
/frameworks/base/graphics/java/android/renderscript/ |
ProgramFragmentFixedFunction.java | 265 Element.Builder b = new Element.Builder(mRS); 266 b.add(Element.F32_4(mRS), "Color");
|
Element.java | 23 * <p>The most basic data type. An element represents one cell of a memory allocation. 24 * Element is the basic data type of Renderscript. An element can be of two forms: Basic elements or Complex forms. 28 * <li>4 element float vector</li> 41 * bind point for a data structure generates a Renderscript element to represent the 44 public class Element extends BaseObj { 46 Element[] mElements; 58 * @return element size in bytes 64 * DataType represents the basic type information for a basic element. The 142 * Return if a element is too complex for use as a data source for a Mesh o [all...] |
/libcore/dalvik/src/main/java/dalvik/system/ |
DexPathList.java | 52 private final Element[] dexElements; 142 * this returns a zero-element list. 191 * Makes an array of dex/resource path elements, one per element of 194 private static Element[] makeDexElements(ArrayList<File> files, 196 ArrayList<Element> elements = new ArrayList<Element>(); 244 elements.add(new Element(file, zip, dex)); 248 return elements.toArray(new Element[elements.size()]); 303 * path element. If the class is found but has not yet been 311 for (Element element : dexElements) [all...] |
/libcore/xml/src/main/java/org/kxml2/kdom/ |
Element.java | 29 * In order to create an element, please use the createElement method 33 public class Element extends Node { 41 public Element() { 67 public Element createElement( 77 * Returns the number of attributes of this element. */ 113 * all parents un of the root element. */ 117 Element current = this; 120 if (!(current.parent instanceof Element)) return current.parent; 121 current = (Element) current.parent; 128 * returns the (local) name of the element */ [all...] |
/external/chromium/testing/gmock/include/gmock/ |
gmock-generated-matchers.h | 319 Element; 322 // in a one-element local array is not destructed when the array 327 const Matcher<const Element&> matcher = 328 MatcherCast<const Element&>(e1_); 347 Element; 349 const Matcher<const Element&> matchers[] = { 350 MatcherCast<const Element&>(e1_), 351 MatcherCast<const Element&>(e2_), 374 Element; 376 const Matcher<const Element&> matchers[] = [all...] |
gmock-matchers.h | [all...] |
/external/clang/lib/AST/ |
CXXInheritance.cpp | 206 CXXBasePathElement Element; 207 Element.Base = &*BaseSpec; 208 Element.Class = Record; 210 Element.SubobjectNumber = 0; 212 Element.SubobjectNumber = Subobjects.second; 213 ScratchPath.push_back(Element);
|
VTableBuilder.cpp | 221 const CXXBasePathElement &Element = Path[I]; 223 if (Element.Base->isVirtual()) { 227 QualType VBaseType = Element.Base->getType(); 235 const CXXBasePathElement &Element = Path[I]; 238 const ASTRecordLayout &Layout = Context.getASTRecordLayout(Element.Class); 240 const RecordType *BaseType = Element.Base->getType()->getAs<RecordType>(); [all...] |
/external/emma/ant/ant14/com/vladium/emma/report/ |
ReportCfg.java | 32 * ReportCfg is a container for report type {@link ReportCfg.Element}s that are 37 * conceptual property being set via an attribute and a nested element are resolved 53 public static abstract class Element implements IReportEnums, IReportProperties 98 // generic property element [don't doc this publicly]: 113 Element (final Task task, final IProperties settings) 160 public static class Element_HTML extends Element 179 public static class Element_TXT extends Element 198 public static class Element_LCOV extends Element 216 public static class Element_XML extends Element 285 final Element cfg = (Element) i.next () [all...] |
/external/webkit/Source/WebCore/dom/ |
Element.h | 50 class Element : public ContainerNode { 52 static PassRefPtr<Element> create(const QualifiedName&, Document*); 53 virtual ~Element(); 157 Element* offsetParent(); 204 PassRefPtr<Element> cloneElementWithChildren(); 205 PassRefPtr<Element> cloneElementWithoutChildren(); 225 virtual void copyNonAttributeProperties(const Element* /*source*/) { } 286 Element* firstElementChild() const; 287 Element* lastElementChild() const; 288 Element* previousElementSibling() const [all...] |
Element.cpp | 27 #include "Element.h" 76 StyleSelectorParentPusher(Element* parent) 104 Element* m_parent; 108 PassRefPtr<Element> Element::create(const QualifiedName& tagName, Document* document) 110 return adoptRef(new Element(tagName, document, CreateElement)); 113 Element::~Element() 120 inline ElementRareData* Element::rareData() const 126 inline ElementRareData* Element::ensureRareData( 164 HTMLElement* element = toHTMLElement(node.get()); local 1926 const Element* element = this; local [all...] |
/external/clang/lib/CodeGen/ |
CGExprConstant.cpp | 273 // Append the last element. 519 // No need to divide by element size, since addr of label is always void*, 537 // Build a struct with the union sub-element as the first member, 745 // Complex type with element initializers 761 // We have a scalar in braces. Just use the first element. [all...] |
/external/llvm/include/llvm/TableGen/ |
Record.h | 607 /// VarListElementInit::resolveReferences. If the list element is resolvable 733 /// VarListElementInit::resolveReferences. If the list element is resolvable 737 assert(0 && "Illegal element reference off int"); 777 /// VarListElementInit::resolveReferences. If the list element is resolvable 781 assert(0 && "Illegal element reference off string"); 829 assert(i < Values.size() && "List element index out of range!"); [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
DwarfCompileUnit.cpp | 268 // If first address element is OpPlus then emit 279 uint64_t Element = DV->getAddrElement(i); 280 if (Element == DIBuilder::OpPlus) { 283 } else if (Element == DIBuilder::OpDeref) { 377 DIDescriptor Element = Fields.getElement(i); 378 DIDerivedType DT = DIDerivedType(Element); 381 forwardingField = Element; 383 varField = Element; 551 DIDescriptor Element = TParams.getElement(i); 552 if (Element.isTemplateTypeParameter() [all...] |
DwarfDebug.cpp | 109 DIDescriptor Element = Elements.getElement(i); 110 DIDerivedType DT = DIDerivedType(Element); [all...] |
/external/dbus/bus/ |
config-parser.c | 77 } Element; 88 DBusList *stack; /**< stack of Element */ 124 static Element* 128 Element *e; 132 e = dbus_new0 (Element, 1); 148 element_free (Element *e) 159 Element *e; 166 static Element* 169 Element *e; 179 Element *e [all...] |
/external/tinyxml/ |
tinyxml.h | 138 A Document can contain: Element (container or leaf) 143 An Element can contain: Element (container or leaf) 405 the text needs to define an element or junk will result. This is 408 A TiXmlDocument will read nodes until it reads a root element, and 409 all the children of that root element. 427 ELEMENT, 441 Element: name of the element 462 Element: name of the elemen [all...] |
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
ArraysTest.java | [all...] |