push
void push(const value_type& __x) {
void push(const value_type& __x) { c.push_back(__x); }
void push(const value_type& __x) { _M_c.push_back(__x); }
inline void push(contents* c)
fUndoHistory.push(edit);
fRedoHistory.push(edit);
fUndoHistory.push(edit);
fUndoHistory.push(edit);
fRedoHistory.push(edit);
fCoordinatorQueue.push(item);
fUndoHistory.push(command);
fRedoHistory.push(command);
fUndoHistory.push(command);
fUndoHistory.push(command);
fRedoHistory.push(command);
fRedoHistory.push(command);
fUndoHistory.push(command);
fRedoHistory.push(command);
fUndoHistory.push(command);
fUndoHistory.push(command);
fSavedCursors.push(fCursor);
PriorityQueue.push (WordAndRatio);
fStack.push(fData->Position());
fChunkCache.push(chunk);
fPtStack.push(*point);
fOpStack.push(OP_LINETO | lineCount);
fPtStack.push(linePts[i]);
fOpStack.push(OP_BEZIERTO | bezierCount);
fPtStack.push(bezierPts[i]);
fOpStack.push(op | 3);
fPtStack.push(BPoint(rx, ry));
fPtStack.push(BPoint(angle, 0));
fPtStack.push(point);
fOpStack.push(OP_CLOSE);
fOpStack.push(OP_MOVETO);
nodes[i].push(&nodes[k]);
nodes[k].push(&nodes[i]);
inDegreeZeroNodes.push(&nodes[i]);
inDegreeZeroNodes.push(n->pointers[k]);
.set push; \
push(a, n, i);
push(a, n, i+1);
push(ak, *cp, i+1);
push(a, n, i);
push(ak, c, i+1);
fQueue.push(value);
error = child->push(query);
status_t error = ListNode::push(query);
status_t error = predicateNode.push(query);
CPPUNIT_ASSERT( predicateNode.push(query) == pushResult );
CPPUNIT_ASSERT( predicateNode.push(query) == pushResult );
virtual status_t push(Query &query) const = 0;
CPPUNIT_ASSERT( predicate1.push(query) == B_OK );
CPPUNIT_ASSERT( predicate1.push(query) == B_OK );
CPPUNIT_ASSERT( predicate1.push(query) == B_OK );
nodes[i].push(&nodes[k]);
nodes[k].push(&nodes[i]);
inDegreeZeroNodes.push(&nodes[i]);
inDegreeZeroNodes.push(n->pointers[k]);
nodes[i].push(&nodes[k]);
nodes[k].push(&nodes[i]);
inDegreeZeroNodes.push(&nodes[i]);
inDegreeZeroNodes.push(n->pointers[k]);
skippedTokens->push(fTokens.front());