Home
last modified time | relevance | path

Searched refs:IsSubset (Results 1 – 25 of 571) sorted by relevance

12345678910>>...23

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/telemetry/timeline/
H A Dchrome_trace_category_filter_unittest.py89 self.assertEquals(a.IsSubset(b), True)
93 self.assertEquals(a.IsSubset(b), True)
97 self.assertEquals(a.IsSubset(b), True)
101 self.assertEquals(a.IsSubset(b), None)
105 self.assertEquals(a.IsSubset(b), None)
109 self.assertEquals(a.IsSubset(b), None)
121 self.assertEquals(a.IsSubset(b), True)
144 self.assertEquals(a.IsSubset(b), True)
149 self.assertEquals(a.IsSubset(b), True)
172 self.assertEquals(a.IsSubset(b), True)
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/dawn/src/tests/unittests/
H A DMathTests.cpp279 TEST(Math, IsSubset) { in TEST() argument
281 ASSERT_TRUE(IsSubset(0b100, 0b101)); in TEST()
282 ASSERT_FALSE(IsSubset(0b010, 0b101)); in TEST()
283 ASSERT_TRUE(IsSubset(0b001, 0b101)); in TEST()
286 ASSERT_TRUE(IsSubset(0b000, 0b101)); in TEST()
289 ASSERT_TRUE(IsSubset(0b101, 0b101)); in TEST()
292 ASSERT_FALSE(IsSubset(0b111, 0b101)); in TEST()
295 ASSERT_FALSE(IsSubset(0b100, 0b000)); in TEST()
296 ASSERT_FALSE(IsSubset(0b010, 0b000)); in TEST()
297 ASSERT_FALSE(IsSubset(0b001, 0b000)); in TEST()
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/tests/
H A DTutHokkaido2.out32 --============( IsSubset )=============--
33 --> IsSubset(L: LIST, M: LIST): BOOL
37 /**/ IsSubset([1,1,2],[1,2,3,"a"]);
39 /**/ IsSubset([1,2],["a","b"]);
41 /**/ IsSubset([],[1,2]);
50 --============( end IsSubset )=============--
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/tests/
H A DTutHokkaido2.out36 --============( IsSubset )=============--
37 --> IsSubset(L: LIST, M: LIST): BOOL
41 /**/ IsSubset([1,1,2],[1,2,3,"a"]);
43 /**/ IsSubset([1,2],["a","b"]);
45 /**/ IsSubset([],[1,2]);
55 --============( end IsSubset )=============--
/dports/math/gap/gap-4.11.0/tst/testinstall/
H A Dmodfree.tst68 gap> IsSubset( v, w );
70 gap> IsSubset( w, v );
72 gap> IsSubset( v, v1 );
74 gap> IsSubset( v, v2 );
76 gap> IsSubset( v1, GF(2)^2 );
78 gap> IsSubset( GF(2)^2, v1 );
80 gap> IsSubset( w, GF(2)^2 );
82 gap> IsSubset( GF(2)^2, w );
84 gap> IsSubset( w, GF(4)^2 );
86 gap> IsSubset( GF(4)^2, w );
/dports/www/chromium-legacy/chromium-88.0.4324.182/base/sampling_heap_profiler/
H A Dlock_free_address_hash_set_unittest.cc21 static bool IsSubset(const LockFreeAddressHashSet& superset, in IsSubset() function in base::LockFreeAddressHashSetTest
38 return IsSubset(set1, set2) && IsSubset(set2, set1); in Equals()
114 EXPECT_TRUE(IsSubset(set, set2)); in TEST_F()
115 EXPECT_FALSE(IsSubset(set2, set)); in TEST_F()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/base/sampling_heap_profiler/
H A Dlock_free_address_hash_set_unittest.cc21 static bool IsSubset(const LockFreeAddressHashSet& superset, in IsSubset() function in base::LockFreeAddressHashSetTest
38 return IsSubset(set1, set2) && IsSubset(set2, set1); in Equals()
114 EXPECT_TRUE(IsSubset(set, set2)); in TEST_F()
115 EXPECT_FALSE(IsSubset(set2, set)); in TEST_F()
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System.ServiceModel/System/ServiceModel/Channels/
H A DNamedPipeTransportManager.cs75 …(IsSubset(this.allowedUsers, otherAllowedUsers) && IsSubset(otherAllowedUsers, this.allowedUsers))… in AreAllowedUsersEqual()
92 static bool IsSubset(List<SecurityIdentifier> users1, List<SecurityIdentifier> users2) in IsSubset() method in System.ServiceModel.Channels.NamedPipeTransportManager
/dports/math/gap/gap-4.11.0/pkg/homalg-2019.09.01/gap/
H A DHomalgSubobject.gi112 return IsSubset( J, K ) and IsSubset( K, J );
172 equal := IsSubset( J, FullSubobject( SuperObject( J ) ) );
200 ## the following uses IsSubset in one direction only; see above
206 InstallMethod( IsSubset,
212 ## the following uses IsSubset in one direction only; see above
/dports/math/gap/gap-4.11.0/pkg/rds-1.7/lib/
H A Dlazy.gi46 if not IsSubset([1..Size(Gdata.Glist)],Union(forbidden,diffset))
82 if not IsSubset([1..Size(Gdata.Glist)],Union(forbidden,diffset))
87 if IsSubset(Difference([2..Size(Gdata.Glist)],forbidden),Set(pres,i->i[1]))
119 if not (IsSubset(group,forbidden) and IsSubset(group,diffset))
160 if not (IsSubset(group,forbidden) and IsSubset(group,diffset))
189 elif IsSubset(Gdata.G,forbiddenSet)
198 elif IsSubset(Gdata.G,coset)
216 if not ForAll(ssets,IsListOfIntegers) and ForAll(ssets,s->IsSubset(Gdata.Glist,s))
/dports/math/gap/gap-4.11.0/pkg/resclasses-4.7.2/tst/
H A Dz_pi.tst46 gap> IsSubset(Rationals,R);
48 gap> IsSubset(U,Integers);
58 gap> IsSubset(R,U);
60 gap> IsSubset(T,R);
H A Dresclass.tst130 gap> IsSubset(cl1,U1);
132 gap> IsSubset(cl1,SparseRep(U1));
134 gap> IsSubset(SparseRep(cl1),U1);
140 gap> IsSubset(U2,ResidueClass(7,10));
152 gap> IsSubset(SparseRep(U2),SparseRep(U5));
156 gap> IsSubset(U2,U6);
158 gap> IsSubset(SparseRep(U2),SparseRep(U6));
160 gap> IsSubset(Integers,U5);
162 gap> IsSubset(U5,Integers);
277 gap> IsSubset(Q,O);
[all …]
H A Dzxz.tst48 gap> ForAny(D,v->IsSubset(NonnegativeIntegers,v));
50 gap> ForAll(D,v->IsSubset(NonnegativeIntegers,v));
80 gap> IsSubset(R,empty);
82 gap> IsSubset(empty,R);
95 gap> IsSubset(R,l);
97 gap> IsSubset(l,R);
99 gap> IsSubset(empty,l);
101 gap> IsSubset(l,empty);
/dports/math/gap/gap-4.11.0/pkg/resclasses-4.7.2/lib/
H A Dz_pi.gi160 #M IsSubset( <R>, <S> ) . . . . . . . . . . . . . . . . . . . . for Z_(pi)'s
162 InstallMethod( IsSubset,
166 function ( R, S ) return IsSubset( S!.primes, R!.primes ); end );
170 #M IsSubset( Rationals, <R> ) . . . . . . . . . . . for Rationals and Z_(pi)
172 InstallMethod( IsSubset,
178 #M IsSubset( <R>, Integers ) . . . . . . . . . . . . for Z_(pi) and Integers
180 InstallMethod( IsSubset,
/dports/devel/git-lfs/git-lfs-3.0.2/tools/
H A Dstringset.go50 if allSet.IsSubset(set) {
57 func (set StringSet) IsSubset(other StringSet) bool { func
68 return other.IsSubset(set)
/dports/math/gap/gap-4.11.0/pkg/rcwa-4.6.4/tst/
H A Dperlist.tst37 gap> IsSubset([0..2],l);
39 gap> IsSubset([0..1],l);
41 gap> IsSubset(NonnegativeIntegers,l);
43 gap> IsSubset(Integers,l);
/dports/math/gap/gap-4.11.0/pkg/XModAlg-1.17/lib/
H A Dutil.gi19 if not IsSubset( G, H ) then
39 if not IsSubset( Source( hom ), src ) then
42 if not IsSubset( Range( hom ), rng ) then
/dports/math/gap/gap-4.11.0/tst/teststandard/
H A Dvarnames.tst10 gap> Filtered(NamesSystemGVars(),name->IsSubset(LETTERS,name));;
11 gap> IsSubset(IDENTS_GVAR(), IDENTS_BOUND_GVARS() );
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/deckarep/golang-set/
H A Dset_test.go319 if !b.IsSubset(a) {
325 if b.IsSubset(a) {
334 if !a.IsSubset(b) {
343 if !a.IsSubset(b) {
359 if !b.IsSubset(a) {
365 if b.IsSubset(a) {
379 if !a.IsSubset(b) {
388 if !a.IsSubset(b) {
1062 if !empty.IsSubset(a) || !empty.IsSubset(b) {
1070 if !empty.IsSubset(empty) || !empty.IsSuperset(empty) {
/dports/math/gap/gap-4.11.0/pkg/float-0.9.1/lib/
H A Dfplll.gi12 while not ForAll(m,r->IsSubset(Integers,r)) do
19 while not ForAll(m,r->IsSubset(Integers,r)) do
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/github.com/splitio/go-toolkit/v4/datastructures/set/
H A Dimplementations.go103 func (s *ThreadUnsafeSet) IsSubset(t Set) (subset bool) { func
159 return t.IsSubset(s)
286 func (s *ThreadSafeSet) IsSubset(t Set) (subset bool) { func
354 return t.IsSubset(s)
/dports/math/gap/gap-4.11.0/pkg/congruence-1.2.3/lib/
H A Dcong.gi588 ## IsSubset
592 InstallMethod( IsSubset,
600 InstallMethod( IsSubset,
607 return ForAll( DefiningCongruenceSubgroups(G), T -> IsSubset(T,H) );
618 InstallMethod( IsSubset,
625 return ForAll( DefiningCongruenceSubgroups(G), T -> IsSubset(T,H) );
637 InstallMethod( IsSubset,
656 InstallMethod( IsSubset,
675 InstallMethod( IsSubset,
694 InstallMethod( IsSubset,
[all …]
/dports/math/gap/gap-4.11.0/lib/
H A Dmodfree.gi22 ## this happens in the method chosen for `IsSubset'.
38 return IsSubset( V, W );
43 return IsSubset( V, W ) and IsSubset( W, V );
254 ## This function is used for `IsSubset' methods for vector spaces, algebras,
256 ## Note that in `IsSubset', we want to avoid delegating to structures with
258 ## membership test for the original arguments of `IsSubset' rather than for
266 elif IsSubset( L, K ) then
268 elif IsSubset( K, L ) then
282 #M IsSubset( <V>, <U> )
287 InstallMethod( IsSubset,
[all …]
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/doc/ref/
H A Dgenlatt.tex25 `GeneralLattice( NearRingIdeals( LibraryNearRing( GTW6_2, 3 ) ), IsSubset, "ideal" )'
37 > IsSubset, "ideal" );
71 gap> l := GeneralLattice( i, IsSubset, "ideal" );
/dports/math/gap/gap-4.11.0/pkg/rcwa-4.6.4/lib/
H A Dperlist.gi106 #M IsSubset( <C>, <perlist> ) . . . . . for a collection and a periodic list
108 InstallMethod( IsSubset,
113 return IsSubset(C,PrePeriod(perlist)) and IsSubset(C,Period(perlist));
124 if not IsSubset(Rationals,perlist) then TryNextMethod(); fi;
139 if not IsSubset(Rationals,perlist) then TryNextMethod(); fi;

12345678910>>...23