Class: Cantor::AbstractSet

Inherits:
Object
  • Object
show all
Defined in:
lib/cantor/abstract_set.rb

Overview

AbstractSet describes the common interface implemented by its concrete subclasses. The two main implementations are RelativeSet and AbsoluteSet which are each optimized for different kinds of set operations.

Direct Known Subclasses

AbsoluteSet, RelativeComplement, RelativeSet

Set Operations collapse

Set Ordering collapse

Instance Method Summary collapse

Instance Method Details

#&(other) ⇒ AbstractSet

Computes the intersection of two sets: the set of elements common between both sets.

Returns:

See Also:



114
 
# File 'lib/cantor/abstract_set.rb', line 114

def &(other) intersection(other) end

#+(other) ⇒ AbstractSet

Computes the union of two sets: the set of elements in either or both sets

Returns:

See Also:



82
 
# File 'lib/cantor/abstract_set.rb', line 82

def +(other) union(other) end

#-(other) ⇒ AbstractSet

Computes the difference of two sets: the set of elements elements in this set and not the other.

Returns:

See Also:



90
 
# File 'lib/cantor/abstract_set.rb', line 90

def -(other) difference(other) end

#<(other) ⇒ Object

True if this set is a subset of the ‘other` set and there exists at least one element in the `other` set that doesn’t belong to this set

See Also:



165
 
# File 'lib/cantor/abstract_set.rb', line 165

def <(other) proper_subset?(other) end

#<=(other) ⇒ Object

True if every element in this set also belongs to the ‘other` set

See Also:



171
 
# File 'lib/cantor/abstract_set.rb', line 171

def <=(other) subset?(other) end

#>(other) ⇒ Object

True if this set is a superset of the ‘other` set and there exists at least one element in this set that doesn’t belong to the ‘other` set

See Also:



168
 
# File 'lib/cantor/abstract_set.rb', line 168

def >(other) proper_superset?(other) end

#>=(other) ⇒ Object

True if every element in the ‘other` set also belongs to this set

See Also:



174
 
# File 'lib/cantor/abstract_set.rb', line 174

def >=(other) superset?(other) end

#^(other) ⇒ AbstractSet

Computes the symmetric difference of two sets: the set of elements which are in either of the two sets but not in both.

Returns:

See Also:



106
 
# File 'lib/cantor/abstract_set.rb', line 106

def ^(other) symmetric_difference(other) end

#contain?(object) ⇒ Boolean

Returns:

  • (Boolean) 


18
19
20
 
# File 'lib/cantor/abstract_set.rb', line 18

def contain?(object)
  include?(object)
end

#disjoint?(other) ⇒ Boolean

True if this and the ‘other` set have no common elements

Returns:

  • (Boolean)

See Also:



155
156
157
 
# File 'lib/cantor/abstract_set.rb', line 155

def disjoint?(other)
  intersection(other).empty?
end

#exclude?(object) ⇒ Boolean

True if the set does not include the given ‘object`

Returns:

  • (Boolean) 


23
24
25
 
# File 'lib/cantor/abstract_set.rb', line 23

def exclude?(object)
  not include?(object)
end

#infinite? ⇒ Boolean

True if the set contains infinitely many elements

Returns:

  • (Boolean) 


51
52
53
 
# File 'lib/cantor/abstract_set.rb', line 51

def infinite?
  not finite?
end

#member?(object) ⇒ Boolean

True if the set includes the given ‘object` abstract :include?, :args => %w(object)

Returns:

  • (Boolean) 


14
15
16
 
# File 'lib/cantor/abstract_set.rb', line 14

def member?(object)
  include?(object)
end

#present? ⇒ Boolean

False if #size ‘== 0` abstract :empty?

Returns:

  • (Boolean) 


35
36
37
 
# File 'lib/cantor/abstract_set.rb', line 35

def present?
  not empty?
end

#proper_subset?(other) ⇒ Boolean

True if this set is a subset of the ‘other` set and there exists at least one element in the `other` set that doesn’t belong to this set

Returns:

  • (Boolean)

See Also:



133
134
135
 
# File 'lib/cantor/abstract_set.rb', line 133

def proper_subset?(other)
  other.size > size and subset?(other)
end

#proper_superset?(other) ⇒ Boolean

True if this set is a superset of the ‘other` set and there exists at least one element in this set that doesn’t belong to the ‘other` set

Returns:

  • (Boolean)

See Also:



148
149
150
 
# File 'lib/cantor/abstract_set.rb', line 148

def proper_superset?(other)
  other.size < size and superset?(other)
end

#subset?(other) ⇒ Boolean

True if every element in this set also belongs to the ‘other` set

Returns:

  • (Boolean)

See Also:



125
126
127
 
# File 'lib/cantor/abstract_set.rb', line 125

def subset?(other)
  intersection(other) == self
end

#superset?(other) ⇒ Boolean

True if every element in the ‘other` set also belongs to this set

Returns:

  • (Boolean)

See Also:



140
141
142
 
# File 'lib/cantor/abstract_set.rb', line 140

def superset?(other)
  intersection(other) == other
end

#|(other) ⇒ AbstractSet

Computes the union of two sets: the set of elements in either or both sets

Returns:

See Also:



79
 
# File 'lib/cantor/abstract_set.rb', line 79

def |(other) union(other) end

#~ ⇒ AbstractSet

Computes the complement of the set: the set of elements not in this set

Returns:

See Also:



98
 
# File 'lib/cantor/abstract_set.rb', line 98

def ~; complement end