HomeSort by relevance Sort by last modified time
    Searched refs:NewChild (Results 1 - 6 of 6) sorted by null

  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_isinstance.py 176 class NewChild(NewSuper):
242 self.assertEqual(True, issubclass(NewChild, (NewChild,)))
243 self.assertEqual(True, issubclass(NewChild, (NewSuper,)))
244 self.assertEqual(False, issubclass(NewSuper, (NewChild,)))
245 self.assertEqual(True, issubclass(NewSuper, (NewChild, NewSuper)))
246 self.assertEqual(False, issubclass(NewChild, ()))
247 self.assertEqual(True, issubclass(NewSuper, (NewChild, (NewSuper,))))
251 self.assertEqual(True, issubclass(str, (unicode, (Child, NewChild, basestring))))
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_isinstance.py 176 class NewChild(NewSuper):
242 self.assertEqual(True, issubclass(NewChild, (NewChild,)))
243 self.assertEqual(True, issubclass(NewChild, (NewSuper,)))
244 self.assertEqual(False, issubclass(NewSuper, (NewChild,)))
245 self.assertEqual(True, issubclass(NewSuper, (NewChild, NewSuper)))
246 self.assertEqual(False, issubclass(NewChild, ()))
247 self.assertEqual(True, issubclass(NewSuper, (NewChild, (NewSuper,))))
251 self.assertEqual(True, issubclass(str, (unicode, (Child, NewChild, basestring))))
  /external/llvm/include/llvm/Analysis/
LoopInfo.h 243 /// the OldChild entry in our children list with NewChild, and updates the
244 /// parent pointer of OldChild to be null and the NewChild to be this loop.
246 void replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild);
251 void addChildLoop(LoopT *NewChild) {
252 assert(NewChild->ParentLoop == 0 && "NewChild already has a parent!");
253 NewChild->ParentLoop = static_cast<LoopT *>(this);
254 SubLoops.push_back(NewChild);
LoopInfoImpl.h 219 /// the OldChild entry in our children list with NewChild, and updates the
220 /// parent pointer of OldChild to be null and the NewChild to be this loop.
224 replaceChildLoopWith(LoopT *OldChild, LoopT *NewChild) {
226 assert(NewChild->ParentLoop == 0 && "NewChild already has a parent!");
230 *I = NewChild;
232 NewChild->ParentLoop = static_cast<LoopT *>(this);
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
Antlr.Runtime.Tree.Tests.pas 411 T, NewChild: ICommonTree;
417 NewChild := TCommonTree.Create(TCommonToken.Create(99, 'x'));
418 T.ReplaceChildren(0, 2, NewChild);
443 T, NewChild: ICommonTree;
449 NewChild := TCommonTree.Create(TCommonToken.Create(99, 'x'));
450 T.ReplaceChildren(0, 0, NewChild);
457 T, NewChild: ICommonTree;
463 NewChild := TCommonTree.Create(TCommonToken.Create(99, 'x'));
464 T.ReplaceChildren(2, 2, NewChild);
471 T, NewChild: ICommonTree
    [all...]
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp     [all...]

Completed in 204 milliseconds