| /external/chromium/base/ |
| template_util_unittest.cc | 16 class Child : public Parent {};
44 // EXPECT_TRUE( (is_convertible < Child), (Parent > ::value));
47 EXPECT_TRUE( (is_convertible<Child, Parent>::value) );
48 EXPECT_FALSE( (is_convertible<Parent, Child>::value) );
|
| bind_unittest.cc | 68 class Child : public Parent {
274 Child child; local
275 child.value = 0;
276 Closure virtual_set_cb = Bind(&Parent::VirtualSet, &child);
278 EXPECT_EQ(kChildValue, child.value);
280 child.value = 0;
281 Closure non_virtual_set_cb = Bind(&Parent::NonVirtualSet, &child);
283 EXPECT_EQ(kParentValue, child.value);
577 // const Child* const_child_ptr
[all...] |
| /external/chromium_org/base/ |
| template_util_unittest.cc | 18 class Child : public Parent {};
44 // (is_convertible < Child), (Parent > ::value)
47 COMPILE_ASSERT( (is_convertible<Child, Parent>::value), IsConvertible);
48 COMPILE_ASSERT(!(is_convertible<Parent, Child>::value), IsConvertible);
61 COMPILE_ASSERT(!(is_same<Child, Parent>::value), IsSame);
62 COMPILE_ASSERT(!(is_same<Parent, Child>::value), IsSame);
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-2073.js | 50 var Child,
51 child;
52 Child = function() {};
53 Child.prototype = this;
54 child = new Child();
55 child.id = nextid();
56 child.parent = this;
57 child.left = this.last;
58 child.right = null
[all...] |
| /external/compiler-rt/lib/asan/lit_tests/TestCases/Linux/ |
| clone_test.cc | 16 int Child(void *arg) {
18 printf("Child: %p\n", x);
27 pid_t clone_pid = clone(Child, sp, CLONE_FILES | CLONE_VM, NULL, 0, 0, 0);
35 // Make sure the child stack was indeed unpoisoned.
|
| swapcontext_test.cc | 34 void Child(int mode) {
36 printf("Child: %p\n", x);
50 printf("Child stack: %p\n", child_stack);
51 // Setup child context.
58 makecontext(&child_context, (void (*)())Child, 1, mode);
|
| /external/clang/test/Analysis/inlining/ |
| dyn-dispatch-bifurcate.cpp | 28 class Child : public Parent {
34 Child *b = reinterpret_cast<Child *>(a);
|
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 25 Child[] children = new Child[16];
28 * Looks up a child by name and creates a new one if necessary.
34 Child current = children[index];
37 current = new Child(parent, uri, localName, parent.depth + 1, hash);
42 Child previous;
47 // We already have a child with that name.
55 // Add a new child to the bucket.
56 current = new Child(parent, uri, localName, parent.depth + 1, hash);
63 * Looks up a child by name
[all...] |
| /external/clang/test/CodeGenCXX/ |
| microsoft-abi-methods.cpp | 68 class Child: public Base { };
71 Child c;
72 // Make sure that the Base constructor call in the Child constructor uses
74 // CHECK: define linkonce_odr x86_thiscallcc %class.Child* @"\01??0Child@@QAE@XZ"
78 // Make sure that the Base destructor call in the Child denstructor uses
80 // CHECK: define linkonce_odr x86_thiscallcc void @"\01??1Child@@QAE@XZ"
|
| /external/clang/test/Analysis/ |
| reinterpret-cast.cpp | 10 struct Child : public IntWrapper {
15 Child *wrapper = reinterpret_cast<Child*>(data);
17 // We don't actually know if 'data' is a Child.
|
| inline.cpp | 67 class Child : public Parent {
76 Child x;
99 class Child : public Parent {
107 Child() : m_child(0) {}
113 Child x;
121 class Grandchild : public Child {};
147 class Child : virtual public Parent {
155 Child() : m_child(0) {}
161 Child x;
169 class Grandchild : virtual public Child {};
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_mutants.py | 165 class Child:
182 self.a = Child(self)
|
| test_isinstance.py | 169 class Child(Super):
193 self.assertEqual(False, isinstance(Super(), Child))
197 self.assertEqual(True, isinstance(Child(), Super))
198 self.assertEqual(False, isinstance(Child(), AbstractSuper))
205 self.assertEqual(False, isinstance(AbstractSuper(), Child))
210 self.assertEqual(False, isinstance(AbstractChild(), Child))
216 self.assertEqual(False, issubclass(Super, Child))
218 self.assertEqual(True, issubclass(Child, Child))
219 self.assertEqual(True, issubclass(Child, Super)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_mutants.py | 165 class Child:
182 self.a = Child(self)
|
| test_isinstance.py | 169 class Child(Super):
193 self.assertEqual(False, isinstance(Super(), Child))
197 self.assertEqual(True, isinstance(Child(), Super))
198 self.assertEqual(False, isinstance(Child(), AbstractSuper))
205 self.assertEqual(False, isinstance(AbstractSuper(), Child))
210 self.assertEqual(False, isinstance(AbstractChild(), Child))
216 self.assertEqual(False, issubclass(Super, Child))
218 self.assertEqual(True, issubclass(Child, Child))
219 self.assertEqual(True, issubclass(Child, Super)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| Twine.h | 65 /// - If a Twine has another Twine as a child, that child should always be
133 union Child
152 Child LHS;
155 Child RHS;
179 explicit Twine(Child _LHS, NodeKind _LHSKind,
180 Child _RHS, NodeKind _RHSKind)
225 // A twine child should always be binary.
242 /// printOneChild - Print one child from a twine.
243 void printOneChild(raw_ostream &OS, Child Ptr, NodeKind Kind) const
[all...] |
| /external/llvm/include/llvm/Object/ |
| Archive.h | 49 class Child {
61 Child(const Archive *Parent, const char *Start);
63 bool operator ==(const Child &other) const {
68 bool operator <(const Child &other) const {
72 Child getNext() const;
98 Child child; member in class:llvm::object::Archive::child_iterator
100 child_iterator() : child(Child(0, 0)) {}
101 child_iterator(const Child &c) : child(c) {
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugInfoEntry.cpp | 51 const DWARFDebugInfoEntryMinimal *child = getFirstChild(); local
52 if (recurseDepth > 0 && child) {
53 while (child) {
54 child->dump(OS, cu, recurseDepth-1, indent+2);
55 child = child->getSibling();
296 const DWARFDebugInfoEntryMinimal *child = getFirstChild(); local
297 while (child) {
298 child->buildAddressRangeTable(CU, DebugAranges);
299 child = child->getSibling()
[all...] |
| /external/llvm/lib/Object/ |
| Archive.cpp | 82 Archive::Child::Child(const Archive *Parent, const char *Start)
103 Archive::Child Archive::Child::getNext() const {
113 return Child(Parent, NULL);
115 return Child(Parent, NextLoc);
118 error_code Archive::Child::getName(StringRef &Result) const {
171 error_code Archive::Child::getMemoryBuffer(OwningPtr<MemoryBuffer> &Result,
185 error_code Archive::Child::getAsBinary(OwningPtr<Binary> &Result) const {
320 Child c(this, Loc)
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherEmitter.cpp | 162 // We need to encode the child and the offset of the failure code before
165 // children depends on the VBR size of the child, so for large children we
180 assert(ChildSize != 0 && "Should not have a zero-sized child!");
287 const Matcher *Child;
290 Child = SOM->getCaseMatcher(i);
293 Child = cast<SwitchTypeMatcher>(N)->getCaseMatcher(i);
300 // children depends on the VBR size of the child, so for large children we
311 ChildSize = EmitMatcherList(Child, Indent+1, CurrentIdx+VBRSize+IdxSize,
315 assert(ChildSize != 0 && "Should not have a zero-sized child!");
|
| /external/chromium_org/cc/resources/ |
| resource_provider.cc | 156 ResourceProvider::Child::Child() {}
158 ResourceProvider::Child::~Child() {}
764 Child child_info;
765 int child = next_child_++; local
766 children_[child] = child_info;
767 return child;
774 Child& child = it->second local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 245 /// This updates the loop depth of the new child.
248 /// addChildLoop - Add the specified loop to be a child of this loop. This
249 /// updates the loop depth of the new child.
257 /// removeChildLoop - This removes the specified child from being a subloop of
262 LoopT *Child = *I;
263 assert(Child->ParentLoop == this && "Child is not a child of this loop!");
265 Child->ParentLoop = 0;
266 return Child;
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineCSE.cpp | 635 MachineDomTreeNode *Child = Children[i];
636 WorkList.push_back(Child);
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 248 // If this is really a nested loop, rip it out into a child loop. Don't do
353 DomTreeNode *Child = Children.front();
354 DT->changeImmediateDominator(Child, Node->getIDom());
592 // Change the parent loop to use the outer loop as its child now.
|
| /external/tinyxml/ |
| tinyxml.cpp | 785 // 2) An element with only a text child is printed as <foo> text </foo>
884 const TiXmlNode* child = this->FirstChild(); local
885 if ( child ) {
886 const TiXmlText* childText = child->ToText();
1621 TiXmlNode* child = node->FirstChild(); local
1622 if ( child )
1623 return TiXmlHandle( child );
1633 TiXmlNode* child = node->FirstChild( value ); local
1634 if ( child )
1635 return TiXmlHandle( child );
1645 TiXmlElement* child = node->FirstChildElement(); local
1657 TiXmlElement* child = node->FirstChildElement( value ); local
1670 TiXmlNode* child = node->FirstChild(); local
1689 TiXmlNode* child = node->FirstChild( value ); local
1708 TiXmlElement* child = node->FirstChildElement(); local
1727 TiXmlElement* child = node->FirstChildElement( value ); local
[all...] |
