Examples of containsAll()

Examples of java.util.List.containsAll()

517
518
519
520
521
522
523
524
        // -> the first privilege must not be removed.
        Privilege privilege2 = (Privilege) twoPrivs.get(1);
        acl.addAccessControlEntry(testPrincipal, new Privilege[] {privilege2});

        List currentPrivileges = currentPrivileges(acl, testPrincipal);
        assertTrue("'AccessControlList.addAccessControlEntry' must not remove privileges added before", currentPrivileges.containsAll(twoPrivs));
    }
}
View Full Code Here

Examples of java.util.Set.containsAll()

326
327
328
329
330
331
332
333
334
335
336
      {
         lock.readLock().lock();
         try
         {
            Set state = getCurrentState(false);
            return state.containsAll(c);
         }
         finally
         {
            lock.readLock().unlock();
         }
View Full Code Here

Examples of java.util.Set.containsAll()

866
867
868
869
870
871
872
873
874
875
876
        while (st.hasMoreTokens()) {
          set.add(st.nextToken().trim());
        }
      }
      if (op == ApamFilter.SUBSET) {
        return set.containsAll(collection);
      } else {
        return collection.containsAll(set);
      }
    }
    for (Iterator iterator = collection.iterator(); iterator.hasNext();) {
View Full Code Here

Examples of java.util.Set.containsAll()

698
699
700
701
702
703
704
705
706
707
708
    /**
     * getCriticalExtensionOIDs() method testing.
     */
    public void testGetCriticalExtensionOIDs() {
        Set certCEOids = certificate.getCriticalExtensionOIDs();
        if (!(certCEOids.containsAll(allCritical)
                    && allCritical.containsAll(certCEOids))) {
            fail("Incorrect value of Critical Extension OIDs");
        }
    }
   
View Full Code Here

Examples of java.util.Set.containsAll()

709
710
711
712
713
714
715
716
717
718
719
    /**
     * getNonCriticalExtensionOIDs() method testing.
     */
    public void testGetNonCriticalExtensionOIDs() {
        Set certNCEOids = certificate.getNonCriticalExtensionOIDs();
        if (!(certNCEOids.containsAll(allNonCritical)
                    && allNonCritical.containsAll(certNCEOids))) {
            fail("Incorrect value of Non Critical Extension OIDs");
        }
    }
   
View Full Code Here

Examples of java.util.TreeSet.containsAll()

183
184
185
186
187
188
189
190
191
192
193
                    break;
                case CollectionUtilities.NOT_A_SUBSET_B:
                    checkContainment(a.size() != 0 && b.size() == 0, a, relation, b);
                    break;
                case CollectionUtilities.A_PROPER_SUBSET_OF_B:
                    checkContainment(b.containsAll(a) && !a.equals(b), a, relation, b);
                    break;
                case CollectionUtilities.NOT_A_EQUALS_B:
                    checkContainment(!CollectionUtilities.containsSome(a, b) && a.size() != 0 && b.size() != 0, a, relation, b);
                    break;
                case CollectionUtilities.A_PROPER_SUPERSET_B:
View Full Code Here

Examples of java.util.Vector.containsAll()

1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
    {
      return true;
    }

    // PB: Changed to containsAll() since equals() fails when using JRE 1.4
    if (v.containsAll(messageParts.keySet())
      && (v.size() == messageParts.size()))
    {
      // Check for xsi:type mismatch
      Iterator parts = messageParts.keySet().iterator();
      QName partName, xsiType;
View Full Code Here

Examples of java.util.concurrent.BlockingQueue.containsAll()

601
602
603
604
605
606
607
608
609
610
611
    @Test
    public void testContainsAll() {
        BlockingQueue q = populatedQueue(SIZE);
        LocalConcurrentBlockingObjectQueue p = new LocalConcurrentBlockingObjectQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertTrue(q.containsAll(p));
            assertFalse(p.containsAll(q));
            p.add(new Integer(i));
        }
        assertTrue(p.containsAll(q));
    }
View Full Code Here

Examples of kodkod.instance.TupleSet.containsAll()

518
519
520
521
522
523
524
525
526
527
528
    /** Shrink the bounds for the given relation; throws an exception if the new bounds is not sameAs/subsetOf the old bounds. */
    void shrink(Relation relation, TupleSet lowerBound, TupleSet upperBound) throws Err {
       if (solved) throw new ErrorFatal("Cannot shrink a Kodkod relation since solve() has completed.");
       TupleSet oldL = bounds.lowerBound(relation);
       TupleSet oldU = bounds.upperBound(relation);
       if (oldU.containsAll(upperBound) && upperBound.containsAll(lowerBound) && lowerBound.containsAll(oldL)) {
          bounds.bound(relation, lowerBound, upperBound);
       } else {
          throw new ErrorAPI("Inconsistent bounds shrinking on relation: "+relation);
       }
    }
View Full Code Here

Examples of kodkod.util.ints.IntSet.containsAll()

389
390
391
392
393
394
395
396
397
398
399
        int next = atoms.next();
        ordering.add(prev*usize + next);
        prev = next;
      }
     
      if (ordering.containsAll(bounds.lowerBound(relation).indexView()) &&
        bounds.upperBound(relation).indexView().containsAll(ordering)) {
       
        // remove the ordered partition from the set of symmetric partitions
        removePartition(domain.min());
       
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.