Examples of java.util.LinkedList.indexOf()

java.util.LinkedList.indexOf()
Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the lowest index i such that (o==null ? get(i)==null : o.equals(get(i))), or -1 if there is no such index. @param o element to search for @return the index of the first occurrence of the specified element inthis list, or -1 if this list does not contain the element

            }
            return;
        }


        LinkedList panes = getPanes();
        int row = panes.indexOf(lp);


        boolean boundary = false;
        int bls_row = -1;
        if (backgroundLayerSeparator != null) {
            bls_row = panes.indexOf(backgroundLayerSeparator);

View Full Code Here

        int row = panes.indexOf(lp);


        boolean boundary = false;
        int bls_row = -1;
        if (backgroundLayerSeparator != null) {
            bls_row = panes.indexOf(backgroundLayerSeparator);
            boundary = bufferedBoundary;
        }


        if (command.equals(LayerTopCmd)) {
            // Move layer selected layer to top

View Full Code Here


        // Walk backwards and remove duplicates.
        LinkedList newLogicSheetList = new LinkedList();
        for(int i = logicSheetList.size()-1; i>=0; i--) {
            Logicsheet logicsheet = (Logicsheet) logicSheetList.get(i);
            if(newLogicSheetList.indexOf(logicsheet) == -1)
                newLogicSheetList.addFirst(logicsheet);
        }


        // Add the list of logicsheets now.
        Iterator iterator = newLogicSheetList.iterator();

View Full Code Here


        // Walk backwards and remove duplicates.
        LinkedList newLogicSheetList = new LinkedList();
        for(int i = logicSheetList.size()-1; i>=0; i--) {
            Logicsheet logicsheet = (Logicsheet) logicSheetList.get(i);
            if(newLogicSheetList.indexOf(logicsheet) == -1)
                newLogicSheetList.addFirst(logicsheet);
        }


        // Add the list of logicsheets now.
        Iterator iterator = newLogicSheetList.iterator();

View Full Code Here

            for (int i = 0; i < nodeNames.length; i++)
                extractNamedTask(newLeaves, tasksToInsert, nodeNames[i]);
            if (tasksToInsert.isEmpty())
                return null;
            
            int insertionPos = newLeaves.indexOf(insertionMarker);
            newLeaves.remove(insertionPos);
            newLeaves.addAll(insertionPos, tasksToInsert);
            
            evLeaves = new ArrayList(newLeaves);
            enumerateOrdinals();

View Full Code Here


        // Walk backwards and remove duplicates.
        LinkedList newLogicSheetList = new LinkedList();
        for(int i = logicSheetList.size()-1; i>=0; i--) {
            Logicsheet logicsheet = (Logicsheet) logicSheetList.get(i);
            if(newLogicSheetList.indexOf(logicsheet) == -1)
                newLogicSheetList.addFirst(logicsheet);
        }


        // Add the list of logicsheets now.
        Iterator iterator = newLogicSheetList.iterator();

View Full Code Here


        // Walk backwards and remove duplicates.
        LinkedList newLogicSheetList = new LinkedList();
        for(int i = logicSheetList.size()-1; i>=0; i--) {
            Logicsheet logicsheet = (Logicsheet) logicSheetList.get(i);
            if(newLogicSheetList.indexOf(logicsheet) == -1)
                newLogicSheetList.addFirst(logicsheet);
        }


        // Add the list of logicsheets now.
        Iterator iterator = newLogicSheetList.iterator();

View Full Code Here

                    // Iterate all input ports of the sink or composite actor
                    // to find the largest depth.
                    int maximumPortDepth = -1;
                    while (inputsIterator.hasNext()) {
                        IOPort input = (IOPort) inputsIterator.next();
                        int inputPortDepth = ports.indexOf(input);
                        if (maximumPortDepth < inputPortDepth) {
                            maximumPortDepth = inputPortDepth;
                        }
                    }

View Full Code Here

                // Iterate all input ports the current output depends on to
                // find their maximum depth.
                int maximumPortDepth = -1;
                while (inputsIterator.hasNext()) {
                    IOPort input = (IOPort) inputsIterator.next();
                    int inputPortDepth = ports.indexOf(input);
                    if (maximumPortDepth < inputPortDepth) {
                        maximumPortDepth = inputPortDepth;
                    }
                }

View Full Code Here


            t1.setT(new Test1());


            long handle1 = t1.$GET$CHECKPOINT().createCheckpoint();
            objects.add(t1.getT());
            System.out.print(objects.indexOf(t1.getT()) + " ");


            t1.setT(new Test1());


            long handle2 = t1.$GET$CHECKPOINT().createCheckpoint();
            objects.add(t1.getT());

View Full Code Here

0 1 2 3

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.