Examples of java.util.Stack

java.util.Stack
The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty, and a method to search the stack for an item and discover how far it is from the top.
When a stack is first created, it contains no items.
A more complete and consistent set of LIFO stack operations is provided by the {@link Deque} interface and its implementations, whichshould be used in preference to this class. For example:
```
    {@code Deque stack = new ArrayDeque();}
```
@author Jonathan Payne @version 1.30, 11/17/05 @since JDK1.0

     * @see org.datanucleus.query.compiler.Parser#parseFrom(java.lang.String)
     */
    public Node[] parseFrom(String expression)
    {
        p = new Lexer(expression, paramPrefixes, false);
        stack = new Stack();
        return processFromExpression();
    }

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseUpdate(java.lang.String)
     */
    public Node[] parseUpdate(String expression)
    {
        p = new Lexer(expression, paramPrefixes, false);
        stack = new Stack();
        return parseTupple(expression);
    }

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseOrder(java.lang.String)
     */
    public Node[] parseOrder(String expression)
    {
        p = new Lexer(expression, paramPrefixes, false);
        stack = new Stack();
        return processOrderExpression();
    }

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseResult(java.lang.String)
     */
    public Node[] parseResult(String expression)
    {
        p = new Lexer(expression, paramPrefixes, false);
        stack = new Stack();
        List nodes = new ArrayList();
        do
        {
            processExpression();
            Node node = stack.pop();

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseTupple(java.lang.String)
     */
    public Node[] parseTupple(String expression)
    {
        p = new Lexer(expression, paramPrefixes, false);
        stack = new Stack();
        List nodes = new ArrayList();
        do
        {
            processExpression();
            Node node = stack.pop();

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parse(java.lang.String)
     */
    public Node parse(String expression)
    {
        p = new Lexer(expression, paramPrefixes, true);
        stack = new Stack();
        Node result = processExpression();


        if (p.ci.getIndex() != p.ci.getEndIndex())
        {
            // Error occurred in the JDOQL processing due to syntax error(s)

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseVariable(java.lang.String)
     */
    public Node parseVariable(String expression)
    {
        p = new Lexer(expression, paramPrefixes, true);
        stack = new Stack();
        if (!processIdentifier())
        {
            throw new QueryCompilerSyntaxException("expected identifier", p.getIndex(), p.getInput());
        }
        if (!processIdentifier())

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseFrom(java.lang.String)
     */
    public Node[] parseFrom(String expression)
    {
        p = new Lexer(expression, paramPrefixes, true);
        stack = new Stack();
        return processFromExpression();
    }

View Full Code Here

     * @see org.datanucleus.query.compiler.Parser#parseOrder(java.lang.String)
     */
    public Node[] parseOrder(String expression)
    {
        p = new Lexer(expression, paramPrefixes, true);
        stack = new Stack();
        return processOrderExpression();
    }

View Full Code Here

     * @return Node tree(s) for the RESULT expression
     */
    public Node[] parseResult(String expression)
    {
        p = new Lexer(expression, paramPrefixes, true);
        stack = new Stack();
        List nodes = new ArrayList();
        do
        {
            processExpression();
            Node expr = stack.pop();

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.Stack

base.drawable.NestingStacks

com.arjuna.ats.internal.arjuna.thread.ThreadActionData

com.atomikos.datasource.xa.XAResourceTransaction

com.atomikos.datasource.xa.XATransactionalResource

com.atomikos.icatch.imp.AbstractCompositeTransaction

com.atomikos.icatch.imp.BaseTransactionManager

com.atomikos.icatch.imp.CompositeTerminatorImp

com.atomikos.icatch.imp.CoordinatorStateHandler

com.atomikos.icatch.imp.TransactionServiceImp

com.atomikos.icatch.imp.TransactionStateHandler

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.