Examples of java.util.ArrayList

java.util.ArrayList
Resizable-array implementation of the List interface. Implements all optional list operations, and permits all elements, including null. In addition to implementing the List interface, this class provides methods to manipulate the size of the array that is used internally to store the list. (This class is roughly equivalent to Vector, except that it is unsynchronized.)
The size, isEmpty, get, set, iterator, and listIterator operations run in constant time. The add operation runs in amortized constant time, that is, adding n elements requires O(n) time. All of the other operations run in linear time (roughly speaking). The constant factor is low compared to that for the LinkedList implementation.
Each ArrayList instance has a capacity. The capacity is the size of the array used to store the elements in the list. It is always at least as large as the list size. As elements are added to an ArrayList, its capacity grows automatically. The details of the growth policy are not specified beyond the fact that adding an element has constant amortized time cost.
An application can increase the capacity of an ArrayList instance before adding a large number of elements using the ensureCapacity operation. This may reduce the amount of incremental reallocation.
Note that this implementation is not synchronized. If multiple threads access an ArrayList instance concurrently, and at least one of the threads modifies the list structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements, or explicitly resizes the backing array; merely setting the value of an element is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the list. If no such object exists, the list should be "wrapped" using the {@link Collections#synchronizedList Collections.synchronizedList}method. This is best done at creation time, to prevent accidental unsynchronized access to the list:
```
 List list = Collections.synchronizedList(new ArrayList(...));
```
The iterators returned by this class's iterator and listIterator methods are fail-fast: if the list is structurally modified at any time after the iterator is created, in any way except through the iterator's own remove or add methods, the iterator will throw a {@link ConcurrentModificationException}. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
This class is a member of the Java Collections Framework. @author Josh Bloch @author Neal Gafter @version 1.56, 04/21/06 @see Collection @see List @see LinkedList @see Vector @since 1.2

    @Test public void testMergeJoinOptimizationWithDistinctAlreadySorted() throws Exception {
        this.joinType = JoinType.JOIN_INNER;
        int rows = 50;
        List[] data = new List[rows];
        for(int i=0; i<rows; i++) { 
            data[i] = new ArrayList();
            Integer value = new Integer((i*17) % 47);
            data[i].add(value);
        }
        this.leftTuples = data;
        this.rightTuples = new List[] {

View Full Code Here

    @Test
    public void testMultipleSourceBulkRowInsert() throws Exception {


  
        AbstractQueryTransactionTest userTxn = new AbstractQueryTransactionTest("testMultipleSourceBulkRowInsert") {
            ArrayList list = new ArrayList();
            public void testCase() throws Exception {
                for (int i = 800; i < 807; i++) {
                    list.add("insert into pm1.g1 (e1, e2) values("+i+",'"+i+"')");
                    list.add("insert into pm2.g1 (e1, e2) values("+i+",'"+i+"')");
                }
                list.add("select pm1.g1.e1, pm1.g1.e2 into pm2.g2 from pm1.g1 where pm1.g1.e1 >= 800");
                
                // force the rollback by trying to insert an invalid row.
                list.add("insert into pm1.g2 (e1, e2) values(9999,'9999')");             


 //               execute((String[])list.toArray(new String[list.size()]));
                executeBatch((String[])list.toArray(new String[list.size()]), -1);
            }
            
            public boolean exceptionExpected() {
                return true;
            }

View Full Code Here

      
    }    
    
        
    static String[] getMultipleSourceBatch() {
        ArrayList list = new ArrayList();
        
        for (int i = 600; i < 750; i++) {
            list.add("insert into pm1.g1 (e1, e2) values("+i+",'"+i+"')");
            list.add("insert into pm1.g2 (e1, e2) values ("+i+",'"+i+"')");
            list.add("insert into pm2.g1 (e1, e2) values("+i+",'"+i+"')");
            list.add("insert into pm2.g2 (e1, e2) values ("+i+",'"+i+"')");                                
        }
        
        list.add("update pm1.g1 set e2='blah' where pm1.g1.e1 >= 600");
        list.add("update pm2.g1 set e2='blah' where pm2.g1.e1 >= 600");
        
        list.add("delete from pm1.g2 where pm1.g2.e1 >= 610");
        list.add("delete from pm1.g1 where pm1.g1.e1 >= 610");
        list.add("delete from pm2.g2 where pm2.g2.e1 >= 610");
        list.add("delete from pm2.g1 where pm2.g1.e1 >= 610");
        
        return(String[])list.toArray(new String[list.size()]);
    }

View Full Code Here

     * is not supported.
     */
    public void testSupportsFunctionInGroupBy() throws Exception {
        Function f = new Function("concat", new Expression[] { new Constant("a"), new Constant("b") }); //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$
        ExpressionSymbol expr = new ExpressionSymbol("e", f); //$NON-NLS-1$
        List cols = new ArrayList();
        cols.add(expr);
        helpTestSupportsAggregates(false, false, cols);
    }

View Full Code Here

      
      Collection copyValues = null;
      if (isAllConstants()) {
        copyValues = new LinkedHashSet(values);
      } else {
        copyValues = LanguageObject.Util.deepClone(new ArrayList(values), Expression.class);
      }
      
        SetCriteria criteriaCopy = new SetCriteria(copy, copyValues);
        criteriaCopy.setNegated(isNegated());
        criteriaCopy.allConstants = allConstants;

View Full Code Here

                    }
                } catch (XMLStreamException e) {
                    synLog.error("Source Property cannot be parsed : " + e.getStackTrace().toString());
                }
            } else if (o instanceof ArrayList) {
                ArrayList nodesList = (ArrayList) o;
                for (Object node : nodesList) {
                    if (node instanceof OMElement) {
                        if (node instanceof SOAPEnvelope) {
                            SOAPEnvelope soapEnvelope = (SOAPEnvelope) node;
                            String soapNamespace = null;

View Full Code Here




  /** Default Constructor. */
  public SearchVO()
  {
    searchCriteria = new ArrayList();
  } //end of SearchVO constructor

View Full Code Here

   */
  public Collection getSearchCriteria()
  {
    if (this.searchCriteria == null)
    {
      this.searchCriteria = new ArrayList();
    } //end of if statement (this.searchCriteria == null)
    return this.searchCriteria;
  } //end of getSearchCriteria method

View Full Code Here

   */
  public void addSearchCriteria(SearchCriteriaVO searchCriteriaVO)
  {
    if (this.searchCriteria == null)
    {
      this.searchCriteria = new ArrayList();
    } //end of if statement (this.searchCriteria == null)
    this.searchCriteria.add(searchCriteriaVO);
  } //end of addSearchCriteria method

View Full Code Here

   *
   * @return An Integer Array of unique Group IDs.
   */
  public Integer[] getGroupIDs()
  {
    Collection groupIDs = new ArrayList();
    if (this.searchCriteria != null)
    {
      Iterator it = this.searchCriteria.iterator();
      while (it.hasNext())
      {
        SearchCriteriaVO searchCriteriaVO = (SearchCriteriaVO) it.next();
        if (!groupIDs.contains(new Integer(searchCriteriaVO.getGroupID())))
        {
          groupIDs.add(new Integer(searchCriteriaVO.getGroupID()));
        } //end of if statement (!groupIDs.contains(...
      } //end of while loop (iterator.hasNext())
    } //end of if statement (this.searchCriteria != null)
    return (Integer[]) groupIDs.toArray(new Integer[groupIDs.size()]);
  } //end of getGroupIDs method

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.ArrayList

cc.mallet.extract.DocumentExtraction

cc.mallet.grmm.learning.extract.AcrfExtractorTui

cc.mallet.grmm.learning.GenericAcrfTui

cc.mallet.grmm.types.Assignment

cc.mallet.grmm.types.BidirectionalIntObjectMap

cc.mallet.grmm.types.Tree

cc.mallet.grmm.util.ModelReader

cc.sketchchair.functions.functions

cc.sketchchair.sketch.SketchPath

ch.unibe.jexample.internal.MethodLocator$Parser

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.