C++ (Cpp) pushAll Examples

Example #1

File: Kepler.cpp Project: UIKit0/RAMDanceToolkit

//--------------------------------------------------------------
void Kepler::draw()
{
    pushAll();
    ramBeginCamera();
    mKeplerDynamics.draw();
    ramEndCamera();
    popAll();
}

Example #2

 LinkedElements (IT elements)
   : head_(0)
   {
   try {
       pushAll(elements);
     }
   catch(...)
     {
       WARN (progress, "Failure while populating LinkedElements list. "
                       "All elements will be discarded");
       clear();
       throw;
   } }

Example #3

File: Kepler.cpp Project: UIKit0/RAMDanceToolkit

//--------------------------------------------------------------
void Kepler::drawActor(ramActor &actor)
{
    pushAll();
    
    glEnable(GL_DEPTH_TEST);
    glDisable(GL_LIGHTING);
    
    for (int i=0; i<actor.getNumNode(); i++)
	{
		ramNode &node = actor.getNode(i);
		float jointSize = (i==ramActor::JOINT_HEAD) ? 6.0 : 3.0;
		
		node.beginTransform();
		ofSetColor(ramColor::BLUE_LIGHT);
        ofNoFill();
		ofBox(jointSize);
        if (i==mNodeA || i==mNodeB) {
            ofSetColor(ramColor::RED_LIGHT);
            ofBox(jointSize*1.5f);
        }
		node.endTransform();
		
		if (node.hasParent())
		{
			ofSetColor(ramColor::RED_LIGHT);
			ofLine(node, *node.getParent());
		}
        
	}
    
    const ofVec3f lhp = actor.getNode(mNodeA).getGlobalPosition();
    const ofVec3f rhp = actor.getNode(mNodeB).getGlobalPosition();
    mPickerA.updatePosition(btVector3(lhp.x, lhp.y, lhp.z));
    mPickerB.updatePosition(btVector3(rhp.x, rhp.y, rhp.z));
    
    popAll();
}

Example #4

File: Binary Search Tree Iterator.cpp Project: sarahHe/LeetCode-solution

 /** @return the next smallest number */
 int next() {
     TreeNode *cur = myStack.top();
     myStack.pop();
     pushAll(cur->right);
     return cur->val;
 }

Example #5

File: Binary Search Tree Iterator.cpp Project: sarahHe/LeetCode-solution

 BSTIterator(TreeNode *root) {
     pushAll(root);
 }

Example #6

File: 173_BinarySearchTreeIterator.cpp Project: jinhping/leetcode

 /** @return the next smallest number */
 int next() {
     TreeNode * top = s.top();
     s.pop();
     pushAll(top -> right);
     return top -> val;
 }

Example #7

File: Binary Search Tree Iterator.cpp Project: wjk20120522/leetcode

 /** @return the next smallest number */
 int next() {
     TreeNode *tmpNode = myStack.top();
     myStack.pop();
     pushAll(tmpNode->right);
     return tmpNode->val;
 }