Examples of java.util.Vector.insertElementAt()

java.util.Vector.insertElementAt()
Inserts the specified object as a component in this vector at the specified {@code index}. Each component in this vector with an index greater or equal to the specified {@code index} isshifted upward to have an index one greater than the value it had previously.
The index must be a value greater than or equal to {@code 0}and less than or equal to the current size of the vector. (If the index is equal to the current size of the vector, the new element is appended to the Vector.)
This method is identical in functionality to the {@link #add(int,Object) add(int, E)}method (which is part of the {@link List} interface). Note that the{@code add} method reverses the order of the parameters, to more closelymatch array usage. @param obj the component to insert @param index where to insert the new component @throws ArrayIndexOutOfBoundsException if the index is out of range( {@code index < 0 || index> size()})

      hierarchy.clear();


      // Get the elements hierarchy
      tmpClass = element.getClass();
      while(tmpClass != null) {
        hierarchy.insertElementAt(tmpClass, 0);
        tmpClass = tmpClass.getSuperclass();
      }


      // Take each element of commonHierarchy
      // and see if hierarchy contains it

View Full Code Here

            if (aNodeFirstFlag) {
                // append next father at the end of the Vector
                tAllIds.addElement(tCurrentFather);
            } else {
                // insert next father at the beginning of the Vector
                tAllIds.insertElementAt(tCurrentFather, 0);
            }


            // May throw KFM_NoSuchNodeException
            tCurrentFather = getFatherNode(tCurrentFather);
        }

View Full Code Here

            if (aNodeFirstFlag) {
                // append next father at the end of the Vector
                tAllIds.addElement(tCurrentFather);
            } else {
                // insert next father at the beginning of the Vector
                tAllIds.insertElementAt(tCurrentFather, 0);
            }


            // May throw KFM_NoSuchNodeException
            tCurrentFather = getFatherNode(tCurrentFather);
        }

View Full Code Here

            // nextContractChar() from having to search the entire list for the longest
            // sequence.
            if (groupChars.length() > pair.entryName.length()) {
                entryTable.addElement(new EntryPair(groupChars, anOrder, fwd));
            } else {
                entryTable.insertElementAt(new EntryPair(groupChars, anOrder,
                        fwd), entryTable.size() - 1);
            }
        }


        // If this was a forward mapping for a contracting string, also add a

View Full Code Here

      Integer group = new Integer(headerInfo.getHeader(i,columnIndex));
      Integer current = (Integer) counts.elementAt(group.intValue());
      Integer insertElement = new Integer(1);
      if (current != null)
        insertElement = new Integer(current.intValue() + 1);
      counts.insertElementAt(insertElement, group.intValue());
    }
    int [] cv = new int [counts.size()];
    for (int i =0; i < cv.length; i++) {
      cv[i] = ((Integer)counts.elementAt(i)).intValue();
    }

View Full Code Here

                                }
                                if (le.getTime() < startTime) {
                                    break;
                                }
                                if (rflag) {
                                    lv.insertElementAt(le, 0);
                                } else {
                                    lv.addElement(le);
                                }
                            }
                        }

View Full Code Here

            objects.push(array);
        } else if (VECTOR.equals(elementType)) {
            Vector v = new Vector();
            int length = Integer.parseInt((String) attributes.get(LENGTH));
            for (int i = 0; i < length; ++i) {
                v.insertElementAt(objects.pop(), 0);
            }
            objects.push(v);
        } else if (FACTORY_CONFIGURATION.equals(elementType)) {
            Object o = attributes.get(FACTORY_PID);
            if (o != null) {

View Full Code Here

    int argright = ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-2)).right;
    Expression arg = (Expression)((java_cup.runtime.Symbol) CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-2)).value;
    int arglleft = ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).left;
    int arglright = ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).right;
    Vector argl = (Vector)((java_cup.runtime.Symbol) CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).value;
     argl.insertElementAt(arg, 0); RESULT = argl; 
              CUP$XPathParser$result = new java_cup.runtime.Symbol(36/*NonemptyArgumentList*/, ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-2)).left, ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).right, RESULT);
            }
          return CUP$XPathParser$result;


          /*. . . . . . . . . . . . . . . . . . . .*/

View Full Code Here

    int pright = ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-1)).right;
    Expression p = (Expression)((java_cup.runtime.Symbol) CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-1)).value;
    int ppleft = ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).left;
    int ppright = ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).right;
    Vector pp = (Vector)((java_cup.runtime.Symbol) CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).value;
     pp.insertElementAt(p, 0); RESULT = pp; 
              CUP$XPathParser$result = new java_cup.runtime.Symbol(35/*Predicates*/, ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-1)).left, ((java_cup.runtime.Symbol)CUP$XPathParser$stack.elementAt(CUP$XPathParser$top-0)).right, RESULT);
            }
          return CUP$XPathParser$result;


          /*. . . . . . . . . . . . . . . . . . . .*/

View Full Code Here

    final LocationPathPattern lppToCompare =
        (LocationPathPattern)patterns.elementAt(i);


    if (pattern.noSmallerThan(lppToCompare)) {
        inserted = true;
        patterns.insertElementAt(pattern, i);
        break;
    }
      }
      if (inserted == false) {
    patterns.addElement(pattern);

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.