gnustep/libs-base
0
0
Fork 0
mirror of https://github.com/gnustep/libs-base.git synced 2025-04-23 17:10:48 +00:00
Code Issues Projects Releases Packages Wiki Activity

Methods for subsets

Browse source
This commit is contained in:
Gregory John Casamento 2019-06-07 06:30:20 -04:00
parent b248ac8769
commit e3299af3f0
1 changed files with 58 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

64
Source/NSOrderedSet.m
View file

@ -1058,24 +1058,76 @@ static SEL rlSel;
}
// Set operations
- (BOOL) intersectsOrderedSet: (NSOrderedSet *)aSet
- (BOOL) intersectsOrderedSet: (NSOrderedSet *)otherSet
{
id o = nil, e = nil;
// -1. If this set is empty, this method should return NO.
if ([self count] == 0)
return NO;
// 0. Loop for all members in otherSet
e = [otherSet objectEnumerator];
while ((o = [e nextObject])) // 1. pick a member from otherSet.
{
if ([self containsObject: o]) // 2. check the member is in this set(self).
return YES;
}
return NO;
}
- (BOOL) intersectsSet: (NSSet *)aSet
- (BOOL) intersectsSet: (NSSet *)otherSet
{
id o = nil, e = nil;
// -1. If this set is empty, this method should return NO.
if ([self count] == 0)
return NO;
// 0. Loop for all members in otherSet
e = [otherSet objectEnumerator];
while ((o = [e nextObject])) // 1. pick a member from otherSet.
{
if ([self containsObject: o]) // 2. check the member is in this set(self).
return YES;
}
return NO;
}
- (BOOL) isSubsetOfOrderedSet: (NSOrderedSet *)aSet
- (BOOL) isSubsetOfOrderedSet: (NSOrderedSet *)otherSet
{
return NO;
id o = nil, e = nil;
// -1. If this set is empty, this method should return NO.
if ([self count] == 0)
return NO;
// 0. Loop for all members in otherSet
e = [otherSet objectEnumerator];
while ((o = [e nextObject])) // 1. pick a member from otherSet.
{
if ([self containsObject: o] == NO) // 2. check the member is in this set(self).
return NO;
}
return YES; // if all members are in set.
}
- (BOOL) isSubsetOfSet:(NSSet *)aSet
- (BOOL) isSubsetOfSet:(NSSet *)otherSet
{
return NO;
id o = nil, e = nil;
// -1. If this set is empty, this method should return NO.
if ([self count] == 0)
return NO;
// 0. Loop for all members in otherSet
e = [otherSet objectEnumerator];
while ((o = [e nextObject])) // 1. pick a member from otherSet.
{
if ([self containsObject: o] == NO) // 2. check the member is in this set(self).
return NO;
}
return YES; // if all members are in set.
}
// Creating a Sorted Array