Examples of java.util.LinkedList.removeFirst()

java.util.LinkedList.removeFirst()
Removes and returns the first element from this list. @return the first element from this list @throws NoSuchElementException if this list is empty

    if ((elided > 0) || (maxLines < 1)) {
      final int EOL_LEN = EOL.length();
      int totalLength = 0;
      while (!lines.isEmpty()) {
        totalLength += EOL_LEN + ((String) lines.getFirst()).length();
        lines.removeFirst();
      }
      if (stack.length() > totalLength) {
        stack.setLength(totalLength);
        if (elided > 0) {
          stack.append("    (... " + elided + " lines...)");

View Full Code Here

                SimpleFeature feature = (SimpleFeature) f.next();
                SimpleFeatureType schema = feature.getFeatureType();


                // get the next fid
                LinkedList fids = (LinkedList) schema2fids.get(schema.getTypeName());
                String fid = ((FeatureId) fids.removeFirst()).getID();


                insertedFeature = WfsFactory.eINSTANCE.createInsertedFeatureType();
                insertedFeature.setHandle(insert.getHandle());
                insertedFeature.getFeatureId().add(filterFactory.featureId(fid));

View Full Code Here

      // BFS: Process level-1 and queue up level-2, process level-2 and queue up level-3, and so on
      while(!queue.isEmpty())
      {
        monitor.worked(1);
        
        TreeNode currentNode = (TreeNode)queue.removeFirst();
        
        // Change the current directory via the API as necessary as we traverse the tree
        if(mode == LINK && currentNode.path != currentPath)
        {
          XCDERegisterProvider.getProvider().changeDirectory(currentNode.path);

View Full Code Here

      IRegion r= doc.getLineInformation(l);
      String current= doc.get(r.getOffset(), r.getLength());


      if (!window.isEmpty() && window.get(0).equals(current)) {
        // repetition found, shift
        window.removeFirst();
        window.addLast(current);
        repetition= l;
      } else {
        // no repetition, add if there is room
        // otherwise return

View Full Code Here


        LinkedList frame = popFrame();
        
        System.out.println( "endPathExpr(): " + frame );
            
        push( frame.removeFirst() );
/*        
        LocationPathPattern locationPath = new LocationPathPattern();
        push( locationPath );
        while (! frame.isEmpty() )
        {

View Full Code Here

        // start at the back, its the main pattern then add everything else as 
        LinkedList list = popFrame();
        
        System.out.println( "endLocationPath: " + list );


        LocationPathPattern locationPath = (LocationPathPattern) list.removeFirst();
        push( locationPath );
        boolean doneNodeTest = false;
        while ( ! list.isEmpty() )
        {
            Object filter = list.removeFirst();

View Full Code Here

        LocationPathPattern locationPath = (LocationPathPattern) list.removeFirst();
        push( locationPath );
        boolean doneNodeTest = false;
        while ( ! list.isEmpty() )
        {
            Object filter = list.removeFirst();
            if ( filter instanceof NodeTest ) 
            {
                if ( doneNodeTest ) 
                {
                    LocationPathPattern parent = new LocationPathPattern( (NodeTest) filter );

View Full Code Here

    protected void endStep()
    {
        LinkedList list = popFrame();
        if ( ! list.isEmpty() ) 
        {
            push( list.removeFirst() );
            
            if ( ! list.isEmpty() )
            {
                System.out.println( "List should now be empty!" + list );
            }

View Full Code Here


        StringBuffer cleanedPath = new StringBuffer();


        while ( !pathElements.isEmpty() )
        {
            cleanedPath.append( pathElements.removeFirst() );
            if ( !pathElements.isEmpty() )
            {
                cleanedPath.append( '/' );
            }
        }

View Full Code Here

     */
    public static void unsetReturnPath(HttpSession session) {
        LinkedList retstack = (LinkedList) session.getAttribute(AttrConstants.RETURN_LOC_SES_ATTR);


        if ((retstack != null) && (retstack.size() >= 1)) {
            retstack.removeFirst();
        }
    }


    /**
     * Retrieve wether the "return path" should be paid attention to for new. should default to false, which means that

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.