java.util.EmptyStackException Java Examples

/**
 * Returns the top item off of this stack without removing it.
 *
 * @return the top item on the stack
 * @throws EmptyStackException  if the stack is empty
 */
public E peek() throws EmptyStackException {
    int n = size();
    if (n <= 0) {
        throw new EmptyStackException();
    } else {
        return get(n - 1);
    }
}
 

private void introduceCalleeNode() {
  CallExpression expr;
  try {
    expr = (CallExpression) stack.peek();
  } catch (EmptyStackException ex) {
    return;
  }

  AstNode child = expr.getChild(0);
  if (child == null) {
    return;
  }

  Callee callee = new Callee();
  callee.addChild(child);
  expr.replaceFirstChild(callee);
}
 

/**
 * Process notification that a namespace prefix is going out of scope.
 *
 * @param prefix Prefix that is going out of scope
 *
 * @exception SAXException if a parsing error is to be reported
 */
@Override
public void endPrefixMapping(String prefix) throws SAXException {

    if (saxLog.isDebugEnabled()) {
        saxLog.debug("endPrefixMapping(" + prefix + ")");
    }

    // Deregister this prefix mapping
    ArrayStack<String> stack = namespaces.get(prefix);
    if (stack == null) {
        return;
    }
    try {
        stack.pop();
        if (stack.empty())
            namespaces.remove(prefix);
    } catch (EmptyStackException e) {
        throw createSAXException("endPrefixMapping popped too many times");
    }

}
 

/**
 * Start capturing thread's output.
 */
public static void startCapture() {
    CaptureLog log = null;
    if (!reuse.isEmpty()) {
        try {
            log = reuse.pop();
        } catch (EmptyStackException e) {
            log = new CaptureLog();
        }
    } else {
        log = new CaptureLog();
    }
    Stack<CaptureLog> stack = logs.get();
    if (stack == null) {
        stack = new Stack<>();
        logs.set(stack);
    }
    stack.push(log);
}
 

/**
 * Sets an object at a the top of the statck
 *
 *
 * @param val object to set at the top
 * @throws  EmptyStackException  if this stack is empty.
 */
public void setTop(Object val)
{
  try {
    m_map[m_firstFree - 1] = val;
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the position the stack counting down n items.
 *
 * @param n The number of items down, indexed from zero.
 * @return     the object at n items down.
 * @throws  EmptyStackException  if this stack is empty.
 */
public int peek(int n)
{
  try {
    return m_map[m_firstFree-(1+n)];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Sets an object at a the top of the statck
 *
 *
 * @param val object to set at the top
 * @throws  EmptyStackException  if this stack is empty.
 */
public void setTop(int val)
{
  try {
    m_map[m_firstFree - 1] = val;
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the top of this stack without removing it
 * from the stack.
 *
 * @return     the object at the top of this stack.
 * @throws  EmptyStackException  if this stack is empty.
 */
public final int peek()
{
  try {
    return m_map[m_firstFree - 1];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the position the stack counting down n items.
 *
 * @param n The number of items down, indexed from zero.
 * @return     the object at n items down.
 * @throws  EmptyStackException  if this stack is empty.
 */
public Object peek(int n)
{
  try {
    return m_map[m_firstFree-(1+n)];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the position the stack counting down n items.
 *
 * @param n The number of items down, indexed from zero.
 * @return     the object at n items down.
 * @throws  EmptyStackException  if this stack is empty.
 */
public int peek(int n)
{
  try {
    return m_map[m_firstFree-(1+n)];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

public POA poa(Servant self)
{
    try {
        return (POA)orb.peekInvocationInfo().oa();
    } catch (EmptyStackException exception){
        POA returnValue = factory.lookupPOA(self);
        if (returnValue != null) {
            return returnValue;
        }

        throw wrapper.noContext( exception ) ;
    }
}
 

public byte[] object_id(Servant self)
{
    try{
        return orb.peekInvocationInfo().id();
    } catch (EmptyStackException exception){
        throw wrapper.noContext(exception) ;
    }
}
 

public boolean non_existent(Servant self)
{
    //REVISIT
    try{
        byte[] oid = orb.peekInvocationInfo().id();
        if( oid == null) return true;
        else return false;
    } catch (EmptyStackException exception){
        throw wrapper.noContext(exception) ;
    }
}
 

/**
 * Sets an object at a the top of the statck
 *
 *
 * @param val object to set at the top
 * @throws  EmptyStackException  if this stack is empty.
 */
public void setTop(Object val)
{
  try {
    m_map[m_firstFree - 1] = val;
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

public final synchronized RepositoryId popId() {

        try {
            return (RepositoryId)super.pop();
        }
        catch(EmptyStackException e) {
            increasePool(5);
            return (RepositoryId)super.pop();
        }

    }
 

/**
 * Looks at the object at the position the stack counting down n items.
 *
 * @param n The number of items down, indexed from zero.
 * @return     the object at n items down.
 * @throws  EmptyStackException  if this stack is empty.
 */
public Object peek(int n)
{
  try {
    return m_map[m_firstFree-(1+n)];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

public final synchronized RepositoryId popId() {

        try {
            return (RepositoryId)super.pop();
        }
        catch(EmptyStackException e) {
            increasePool(5);
            return (RepositoryId)super.pop();
        }

    }
 

/**
 * Looks at the object at the top of this stack without removing it
 * from the stack.
 *
 * @return     the object at the top of this stack.
 * @throws  EmptyStackException  if this stack is empty.
 */
public Object peek()
{
  try {
    return m_map[m_firstFree - 1];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

@Override
public SofaTracerSpan getCurrentSpan() throws EmptyStackException {
    if (this.isEmpty()) {
        return null;
    }
    return threadLocal.get();
}
 

/**
 * Looks at the object at the top of this stack without removing it
 * from the stack.
 *
 * @return     the object at the top of this stack.
 * @throws  EmptyStackException  if this stack is empty.
 */
public Object peek()
{
  try {
    return m_map[m_firstFree - 1];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the position the stack counting down n items.
 *
 * @param n The number of items down, indexed from zero.
 * @return     the object at n items down.
 * @throws  EmptyStackException  if this stack is empty.
 */
public Object peek(int n)
{
  try {
    return m_map[m_firstFree-(1+n)];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the top of this stack without removing it
 * from the stack.
 *
 * @return     the object at the top of this stack.
 * @throws  EmptyStackException  if this stack is empty.
 */
public final int peek()
{
  try {
    return m_map[m_firstFree - 1];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Looks at the object at the position the stack counting down n items.
 *
 * @param n The number of items down, indexed from zero.
 * @return     the object at n items down.
 * @throws  EmptyStackException  if this stack is empty.
 */
public int peek(int n)
{
  try {
    return m_map[m_firstFree-(1+n)];
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Sets an object at a the top of the statck
 *
 *
 * @param val object to set at the top
 * @throws  EmptyStackException  if this stack is empty.
 */
public void setTop(int val)
{
  try {
    m_map[m_firstFree - 1] = val;
  }
  catch (ArrayIndexOutOfBoundsException e)
  {
    throw new EmptyStackException();
  }
}
 

/**
 * Returns the top item off of this stack without removing it.
 *
 * @return the top item on the stack
 * @throws EmptyStackException  if the stack is empty
 */
public Object peek() throws EmptyStackException {
    int n = size();
    if (n <= 0) {
        throw new EmptyStackException();
    } else {
        return get(n - 1);
    }
}
 

public final synchronized RepositoryId popId() {

        try {
            return (RepositoryId)super.pop();
        }
        catch(EmptyStackException e) {
            increasePool(5);
            return (RepositoryId)super.pop();
        }

    }
 

@Override
public SofaTracerSpan pop() throws EmptyStackException {
    if (this.isEmpty()) {
        return null;
    }
    SofaTracerSpan sofaTracerSpan = threadLocal.get();
    //remove
    this.clear();
    return sofaTracerSpan;
}
 

public boolean non_existent(Servant self)
{
    //REVISIT
    try{
        byte[] oid = orb.peekInvocationInfo().id();
        if( oid == null) return true;
        else return false;
    } catch (EmptyStackException exception){
        throw wrapper.noContext(exception) ;
    }
}
 

public NameSpace pop() {
    try {
        return stack.pop();
    } catch (EmptyStackException e) {
        throw new InterpreterError("pop on empty CallStack");
    }
}
 

public byte[] object_id(Servant self)
{
    try{
        return orb.peekInvocationInfo().id();
    } catch (EmptyStackException exception){
        throw wrapper.noContext(exception) ;
    }
}