Examples of java.util.Set.removeAll()

java.util.Set.removeAll()
Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets. @param c collection containing elements to be removed from this set @return true if this set changed as a result of the call @throws UnsupportedOperationException if the removeAll operationis not supported by this set @throws ClassCastException if the class of an element of this setis incompatible with the specified collection (optional) @throws NullPointerException if this set contains a null element and thespecified collection does not permit null elements (optional), or if the specified collection is null @see #remove(Object) @see #contains(Object)

            songs.remove(newSong);
            fail("expected songs.remove(newSong) to throw an IllegalStateException");
        } catch (IllegalStateException expected) {
        }
        try {
            songs.removeAll(Arrays.asList(newSong));
            fail("expected songs.removeAll(Arrays.asList(newSong)) to throw an IllegalStateException");
        } catch (IllegalStateException expected) {
        }
        Iterator iterator = songs.iterator();
        try {

View Full Code Here

                songs.remove(newSong);
                fail("expected songs.remove(newSong) to throw an IllegalStateException");
            } catch (IllegalStateException expected) {
            }
            try {
                songs.removeAll(Arrays.asList(newSong));
                fail("expected songs.removeAll(Arrays.asList(newSong)) to throw an IllegalStateException");
            } catch (IllegalStateException expected) {
            }
            Iterator iterator = songs.iterator();
            try {

View Full Code Here

                        nonDeterm.add(t2);
                    }
                }
            }
            // check if all non-deterministic situations have been resolved
            nonDeterm.removeAll(removeList);
            if (nonDeterm.size() > 0) {
                // if not, first one in each state / region (which is also
                // first in document order) wins
                Set regions = new HashSet();
                Iterator iter = nonDeterm.iterator();

View Full Code Here

            Set ext = SCXMLHelper.getStatesExited(t, currentStates);
            exitedStates.addAll(ext);
        }
        // compute residual states - these are preserved from the previous step
        Set residual = new HashSet(currentStates);
        residual.removeAll(exitedStates);
        // SeedTargetSet (residual, transitList) -> seedSet
        Set seedSet = seedTargetSet(residual, transitions, errorReporter);
        // DetermineTargetStates (initialTargetSet) -> targetSet
        Set targetSet = step.getAfterStatus().getStates();
        targetSet.addAll(seedSet); //copy to preserve seedSet

View Full Code Here

                            clear = new ArrayList(independent.size() - 1);
                        clear.add(map);
                    }
                }
                if (clear != null)
                    independent.removeAll(clear);


                _assignMaps = (ClassMapping[]) independent.toArray
                    (new ClassMapping[independent.size()]);
            }
        }

View Full Code Here

         if (localAddress == null || !currentView.contains(localAddress))
            return;
         
         // Remove all the current members from the old set; any left 
         // are the dead members
         oldMembers.removeAll(currentView);
      }
      
      if (oldMembers.size() > 0)
      {
         log.debug("Members have been removed; will launch cleanup task. Dead members: " + oldMembers);

View Full Code Here

      {
         Node node = getCache().getRoot().getChild(fqn);
         if (node != null)
         {
            keys = node.getKeys();
            keys.removeAll(INTERNAL_KEYS);
         }
      }
      catch (CacheException e)
      {
         log_.error("getAttributeKeys(): Exception getting keys for session " + realId, e);

View Full Code Here

      if (groups == null) {
    groups = new HashSet(11);
    maybeDiscard = true;
      }
      Set toAdd = new HashSet(newGrps);
      toAdd.removeAll(groups);
      // Figure out which groups to get rid of.  We start off
      // with the full set for which we are already listening,
      // and eliminate any that are in both the new set and the
      // current set.
      Collection toRemove = new HashSet(groups);

View Full Code Here

            songs.remove(newSong);
            fail("expected songs.remove(newSong) to throw an IllegalStateException");
        } catch (IllegalStateException expected) {
        }
        try {
            songs.removeAll(Arrays.asList(newSong));
            fail("expected songs.removeAll(Arrays.asList(newSong)) to throw an IllegalStateException");
        } catch (IllegalStateException expected) {
        }
        Iterator iterator = songs.iterator();
        try {

View Full Code Here

                songs.remove(newSong);
                fail("expected songs.remove(newSong) to throw an IllegalStateException");
            } catch (IllegalStateException expected) {
            }
            try {
                songs.removeAll(Arrays.asList(newSong));
                fail("expected songs.removeAll(Arrays.asList(newSong)) to throw an IllegalStateException");
            } catch (IllegalStateException expected) {
            }
            Iterator iterator = songs.iterator();
            try {

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.