Examples of java.util.Hashtable.values()

java.util.Hashtable.values()
Returns a {@link Collection} view of the values contained in this map.The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Collection.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations. @since 1.2

    
    Hashtable oldJobs = null;
    oldJobs = this.runningJobs;
    this.runningJobs = new Hashtable();
    
    Iterator jobs = oldJobs.values().iterator();
    while (jobs.hasNext()) {
      Job nextJob = (Job)jobs.next();
      int state = nextJob.checkState();
      /*
      if (state != Job.RUNNING) {

View Full Code Here

  synchronized private void checkWaitingJobs() {
    Hashtable oldJobs = null;
    oldJobs = this.waitingJobs;
    this.waitingJobs = new Hashtable();
    
    Iterator jobs = oldJobs.values().iterator();
    while (jobs.hasNext()) {
      Job nextJob = (Job)jobs.next();
      int state = nextJob.checkState();
      /*
      if (state != Job.WAITING) {

View Full Code Here

  synchronized private void startReadyJobs() {
    Hashtable oldJobs = null;
    oldJobs = this.readyJobs;
    this.readyJobs = new Hashtable();
    
    Iterator jobs = oldJobs.values().iterator();
    while (jobs.hasNext()) {
      Job nextJob = (Job)jobs.next();
      //System.out.println("Job to submit to Hadoop: " + nextJob.getJobName());
      nextJob.submit();
      //System.out.println("Hadoop ID: " + nextJob.getMapredJobID());

View Full Code Here

        catch (NamingException ex)
        {
            throw new DataBackendException(
                    "The LDAP server specified is unavailable", ex);
        }
        return new PermissionSet(permissions.values());
    }


    /**
     * Stores Group's attributes. The Groups is required to exist in the system.
     *

View Full Code Here

            if (foreignKeys != null)
            {
                foreignKeys.close();
            }
        }
        return fks.values();
    }
}

View Full Code Here

            xaConns.put(str, xc);
        }


        // Now check that connections from each of these
        // pooled connections have different string values
        Iterator it = xaConns.values().iterator();
        clearConnections();
        while ( it.hasNext() )
        {
            XAConnection xc = (XAConnection)it.next();
            Connection conn = xc.getConnection();

View Full Code Here

            assertToString(conn);
        }
        clearConnections();


        // Now clear out the pooled connections
        it = xaConns.values().iterator();
        while ( it.hasNext() )
        {
            XAConnection xc = (XAConnection)it.next();
            xc.close();
        }

View Full Code Here

            pooledConns.put(str, pc);
        }


        // Now check that connections from each of these
        // pooled connections have different string values
        Iterator it = pooledConns.values().iterator();
        clearConnections();
        while ( it.hasNext() )
        {
            PooledConnection pc = (PooledConnection)it.next();
            Connection conn = pc.getConnection();

View Full Code Here

            assertToString(conn);
        }
        clearConnections();


        // Now clear out the pooled connections
        it = pooledConns.values().iterator();
        while ( it.hasNext() )
        {
            PooledConnection pc = (PooledConnection)it.next();
            pc.close();
        }

View Full Code Here

    while(nodesIterator.hasNext()){
      RegistryPageContributor page = (RegistryPageContributor) nodesIterator.next();
      mapping.put(page.getPageId(),new CategorizedPageNode(page));
    }
    
    Iterator values = mapping.values().iterator();
    List returnValue = new ArrayList();
    while(values.hasNext()){
      CategorizedPageNode next = (CategorizedPageNode) values.next();
      returnValue.add(next);
      if(next.contributor.getCategory() == null) {

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.