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


                    if (order instanceof Schema[]) {
                        Schema[] sOrder = (Schema[]) order;


                        for (int i = 0; i < sOrder.length; i++) {
                            int nsIndex = targNS.indexOf(sOrder[i]
                                    .getTargetNamespace());


                            if (nsIndex >= 0) { // found
                                so.add(sOrder[i]);
                                targNS.remove(nsIndex);

View Full Code Here

                        }
                    } else {
                        String[] stringOrder = (String[]) order;


                        for (int i = 0; i < stringOrder.length; i++) {
                            int nsIndex = targNS.indexOf(stringOrder[i]);


                            try {
                                if (nsIndex >= 0) { // found


                                    URI uri = new URI(stringOrder[i]);

View Full Code Here

                    if (!targNS.contains(schema.getTargetNamespace())) {
                        so.add(schema);
                    }


                    for (int i = 0; i < schema.getImports().length; i++) {
                        int nsIndex = targNS.indexOf(schema.getImports()[i]
                                .getTargetNamespace());


                        if (nsIndex >= 0) { // found
                            so.add(schema.getImports()[i]);
                            targNS.remove(nsIndex);

View Full Code Here

                if( ! result.contains(currentNode) )
                    currentNode = null;
                
                if( chooseSingle && currentNode != null )
                { // cycle through full polygons
                    int idx = result.indexOf(currentNode);
                    Assert.assertTrue( idx >= 0 );
                    for( int i=0; i < result.size(); ++i )
                    {
                        IntersectionTreeNode node = (IntersectionTreeNode)result.get((idx + i + 1 ) % result.size());
                        if( node.nRight == 1 )

View Full Code Here


                if (delta < 0) {
                    int step = (int) Math.floor(-delta);
                    updateList(ll,
                               step,
                               ll.indexOf(edge.getAnother(element)));
                }
            }
        }
    }

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

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.