class Net::IMAP::SequenceSet
An IMAP sequence set is a set of message sequence numbers or unique identifier numbers (“UIDs”). It contains numbers and ranges of numbers. The numbers are all non-zero unsigned 32-bit integers and one special value ("*"
) that represents the largest value in the mailbox.
Certain types of IMAP responses will contain a SequenceSet
, for example the data for a "MODIFIED"
ResponseCode
. Some IMAP commands may receive a SequenceSet
as an argument, for example IMAP#search
, IMAP#fetch
, and IMAP#store
.
Creating sequence sets¶ ↑
SequenceSet.new
with no arguments creates an empty sequence set. Note that an empty sequence set is invalid in the IMAP grammar.
set = Net::IMAP::SequenceSet.new set.empty? #=> true set.valid? #=> false set.valid_string #!> raises DataFormatError set << 1..10 set.empty? #=> false set.valid? #=> true set.valid_string #=> "1:10"
SequenceSet.new
may receive a single optional argument: a non-zero 32 bit unsigned integer, a range, a sequence-set
formatted string, another sequence set, a Set (containing only numbers or *
), or an Array containing any of these (array inputs may be nested).
set = Net::IMAP::SequenceSet.new(1) set.valid_string #=> "1" set = Net::IMAP::SequenceSet.new(1..100) set.valid_string #=> "1:100" set = Net::IMAP::SequenceSet.new(1...100) set.valid_string #=> "1:99" set = Net::IMAP::SequenceSet.new([1, 2, 5..]) set.valid_string #=> "1:2,5:*" set = Net::IMAP::SequenceSet.new("1,2,3:7,5,6:10,2048,1024") set.valid_string #=> "1,2,3:7,5,6:10,2048,1024" set = Net::IMAP::SequenceSet.new(1, 2, 3..7, 5, 6..10, 2048, 1024) set.valid_string #=> "1:10,55,1024:2048"
Use ::[]
with one or more arguments to create a frozen SequenceSet
. An invalid (empty) set cannot be created with ::[]
.
set = Net::IMAP::SequenceSet["1,2,3:7,5,6:10,2048,1024"] set.valid_string #=> "1,2,3:7,5,6:10,2048,1024" set = Net::IMAP::SequenceSet[1, 2, [3..7, 5], 6..10, 2048, 1024] set.valid_string #=> "1:10,55,1024:2048"
Ordered and Normalized sets¶ ↑
Sometimes the order of the set’s members is significant, such as with the ESORT
, CONTEXT=SORT
, and UIDPLUS
extensions. So, when a sequence set is created by the parser or with a single string value, that string
representation is preserved.
Internally, SequenceSet
stores a normalized representation which sorts all entries, de-duplicates numbers, and coalesces adjacent or overlapping ranges. Most methods use this normalized representation to achieve O(lg n)
porformance. Use entries
or each_entry
to enumerate the set in its original order.
Most modification methods convert string
to its normalized form. To preserve string
order while modifying a set, use append
, string=
, or replace
.
Using *
¶ ↑
IMAP sequence sets may contain a special value "*"
, which represents the largest number in use. From seq-number
in RFC9051 §9:
In the case of message sequence numbers, it is the number of messages in a non-empty mailbox. In the case of unique identifiers, it is the unique identifier of the last message in the mailbox or, if the mailbox is empty, the mailbox’s current UIDNEXT value.
When creating a SequenceSet
, *
may be input as -1
, "*"
, :*
, an endless range, or a range ending in -1
. When converting to elements
, ranges
, or numbers
, it will output as either :*
or an endless range. For example:
Net::IMAP::SequenceSet["1,3,*"].to_a #=> [1, 3, :*] Net::IMAP::SequenceSet["1,234:*"].to_a #=> [1, 234..] Net::IMAP::SequenceSet[1234..-1].to_a #=> [1234..] Net::IMAP::SequenceSet[1234..].to_a #=> [1234..] Net::IMAP::SequenceSet[1234..].to_s #=> "1234:*" Net::IMAP::SequenceSet[1234..-1].to_s #=> "1234:*"
Use limit
to convert "*"
to a maximum value. When a range includes "*"
, the maximum value will always be matched:
Net::IMAP::SequenceSet["9999:*"].limit(max: 25) #=> Net::IMAP::SequenceSet["25"]
Surprising *
behavior¶ ↑
When a set includes *
, some methods may have surprising behavior.
For example, complement
treats *
as its own number. This way, the intersection
of a set and its complement
will always be empty. This is not how an IMAP server interprets the set: it will convert *
to either the number of messages in the mailbox or UIDNEXT
, as appropriate. And there will be overlap between a set and its complement after limit
is applied to each:
~Net::IMAP::SequenceSet["*"] == Net::IMAP::SequenceSet[1..(2**32-1)] ~Net::IMAP::SequenceSet[1..5] == Net::IMAP::SequenceSet["6:*"] set = Net::IMAP::SequenceSet[1..5] (set & ~set).empty? => true (set.limit(max: 4) & (~set).limit(max: 4)).to_a => [4]
When counting the number of numbers in a set, *
will be counted except when UINT32_MAX
is also in the set:
UINT32_MAX = 2**32 - 1 Net::IMAP::SequenceSet["*"].count => 1 Net::IMAP::SequenceSet[1..UINT32_MAX - 1, :*].count => UINT32_MAX Net::IMAP::SequenceSet["1:*"].count => UINT32_MAX Net::IMAP::SequenceSet[UINT32_MAX, :*].count => 1 Net::IMAP::SequenceSet[UINT32_MAX..].count => 1
What’s here?¶ ↑
SequenceSet
provides methods for:
Methods for Creating a SequenceSet¶ ↑
-
::[]
: Creates a validated frozen sequence set from one or more inputs. -
::new
: Creates a new mutable sequence set, which may be empty (invalid). -
::try_convert
: Callsto_sequence_set
on an object and verifies that the result is aSequenceSet
. -
::empty
: Returns a frozen empty (invalid)SequenceSet
. -
::full
: Returns a frozenSequenceSet
containing every possible number.
Methods for Comparing¶ ↑
Comparison to another SequenceSet:
-
==
: Returns whether a given set contains the same numbers asself
. -
eql?
: Returns whether a given set uses the samestring
asself
.
Comparison to objects which are convertible to SequenceSet:
-
===
: Returns whether a given object is fully contained withinself
, ornil
if the object cannot be converted to a compatible type. -
cover?
: Returns whether a given object is fully contained withinself
. -
intersect?
(aliased asoverlap?
): Returns whetherself
and a given object have any common elements. -
disjoint?
: Returns whetherself
and a given object have no common elements.
Methods for Querying¶ ↑
These methods do not modify self
.
Set membership:
-
include?
(aliased asmember?
): Returns whether a given object (nz-number, range, or*
) is contained by the set. -
include_star?
: Returns whether the set contains*
.
Minimum and maximum value elements:
-
min
: Returns the minimum number in the set. -
max
: Returns the maximum number in the set. -
minmax
: Returns the minimum and maximum numbers in the set.
Accessing value by offset in sorted set:
-
[]
(aliased asslice
): Returns the number or consecutive subset at a given offset or range of offsets in the sorted set. -
at
: Returns the number at a given offset in the sorted set. -
find_index
: Returns the given number’s offset in the sorted set.
Accessing value by offset in ordered entries
-
ordered_at
: Returns the number at a given offset in the ordered entries. -
find_ordered_index
: Returns the index of the given number’s first occurrence in entries.
Set cardinality:
-
count
(aliased assize
): Returns the count of numbers in the set. Duplicated numbers are not counted. -
empty?
: Returns whether the set has no members. IMAP syntax does not allow empty sequence sets. -
valid?
: Returns whether the set has any members. -
full?
: Returns whether the set contains every possible value, including*
.
Denormalized properties:
-
has_duplicates?
: Returns whether the ordered entries repeat any numbers. -
count_duplicates
: Returns the count of repeated numbers in the ordered entries. -
count_with_duplicates
: Returns the count of numbers in the ordered entries, including any repeated numbers.
Methods for Iterating¶ ↑
Normalized (sorted and coalesced):
-
each_element
: Yields each number and range in the set, sorted and coalesced, and returnsself
. -
elements
(aliased asto_a
): Returns an Array of every number and range in the set, sorted and coalesced. -
each_range
: Yields each element in the set as a Range and returnsself
. -
ranges
: Returns an Array of every element in the set, converting numbers into ranges of a single value. -
each_number
: Yields each number in the set and returnsself
. -
numbers
: Returns an Array with every number in the set, expanding ranges into all of their contained numbers. -
to_set
: Returns a Set containing all of thenumbers
in the set.
Order preserving:
-
each_entry
: Yields each number and range in the set, unsorted and without deduplicating numbers or coalescing ranges, and returnsself
. -
entries
: Returns an Array of every number and range in the set, unsorted and without deduplicating numbers or coalescing ranges. -
each_ordered_number
: Yields each number in the ordered entries and returnsself
.
Methods for Set Operations¶ ↑
These methods do not modify self
.
-
|
(aliased asunion
and+
): Returns a new set combining all members fromself
with all members from the other object. -
&
(aliased asintersection
): Returns a new set containing all members common toself
and the other object. -
-
(aliased asdifference
): Returns a copy ofself
with all members in the other object removed. -
^
(aliased asxor
): Returns a new set containing all members fromself
and the other object except those common to both. -
~
(aliased ascomplement
): Returns a new set containing all members that are not inself
-
limit
: Returns a copy ofself
which has replaced*
with a given maximum value and removed all members over that maximum.
Methods for Assigning¶ ↑
These methods add or replace elements in self
.
Normalized (sorted and coalesced):
These methods always update string
to be fully sorted and coalesced.
-
add
(aliased as<<
): Adds a given object to the set; returnsself
. -
add?
: If the given object is not an element in the set, adds it and returnsself
; otherwise, returnsnil
. -
merge
: Merges multiple elements into the set; returnsself
. -
complement!
: Replaces the contents of the set with its owncomplement
.
Order preserving:
These methods may cause string
to not be sorted or coalesced.
-
append
: Adds a given object to the set, appending it to the existing string, and returnsself
. -
string=
: Assigns a newstring
value and replaceselements
to match. -
replace
: Replaces the contents of the set with the contents of a given object.
Methods for Deleting¶ ↑
These methods remove elements from self
, and update string
to be fully sorted and coalesced.
-
clear
: Removes all elements in the set; returnsself
. -
delete
: Removes a given object from the set; returnsself
. -
delete?
: If the given object is an element in the set, removes it and returns it; otherwise, returnsnil
. -
delete_at
: Removes the number at a given offset. -
slice!
: Removes the number or consecutive numbers at a given offset or range of offsets. -
subtract
: Removes each given object from the set; returnsself
. -
limit!
: Replaces*
with a given maximum value and removes all members over that maximum; returnsself
.
Methods for IMAP String Formatting¶ ↑
-
to_s
: Returns thesequence-set
string, or an empty string when the set is empty. -
string
: Returns thesequence-set
string, or nil when empty. -
valid_string
: Returns thesequence-set
string, or raisesDataFormatError
when the set is empty. -
normalized_string
: Returns asequence-set
string with its elements sorted and coalesced, or nil when the set is empty. -
normalize
: Returns a new set with this set’s normalizedsequence-set
representation. -
normalize!
: Updatesstring
to its normalizedsequence-set
representation and returnsself
.
Constants
- UINT32_MAX
-
The largest possible non-zero unsigned 32-bit integer
Public Class Methods
Source
# File lib/net/imap/sequence_set.rb, line 328 def [](first, *rest) if rest.empty? if first.is_a?(SequenceSet) && first.frozen? && first.valid? first else new(first).validate.freeze end else new(first).merge(*rest).validate.freeze end end
Returns a frozen SequenceSet
, constructed from values
.
An empty SequenceSet
is invalid and will raise a DataFormatError
.
Use ::new
to create a mutable or empty SequenceSet
.
Source
# File lib/net/imap/sequence_set.rb, line 359 def empty; EMPTY end
Returns a frozen empty set singleton. Note that valid IMAP sequence sets cannot be empty, so this set is invalid.
Source
# File lib/net/imap/sequence_set.rb, line 362 def full; FULL end
Returns a frozen full set singleton: "1:*"
Source
# File lib/net/imap/sequence_set.rb, line 371 def initialize(input = nil) input ? replace(input) : clear end
Create a new SequenceSet
object from input
, which may be another SequenceSet
, an IMAP
formatted sequence-set
string, a number, a range, :*
, or an enumerable of these.
Use ::[]
to create a frozen (non-empty) SequenceSet
.
Source
# File lib/net/imap/sequence_set.rb, line 349 def try_convert(obj) return obj if obj.is_a?(SequenceSet) return nil unless obj.respond_to?(:to_sequence_set) obj = obj.to_sequence_set return obj if obj.is_a?(SequenceSet) raise DataFormatError, "invalid object returned from to_sequence_set" end
If obj
is a SequenceSet
, returns obj
. If obj
responds_to to_sequence_set
, calls obj.to_sequence_set
and returns the result. Otherwise returns nil
.
If obj.to_sequence_set
doesn’t return a SequenceSet
, an exception is raised.
Public Instance Methods
Source
# File lib/net/imap/sequence_set.rb, line 650 def &(other) remain_frozen dup.subtract SequenceSet.new(other).complement! end
Returns a new sequence set containing only the numbers common to this set and other
.
other
may be any object that would be accepted by ::new
: a non-zero 32 bit unsigned integer, range, sequence-set
formatted string, another sequence set, or an enumerable containing any of these.
Net::IMAP::SequenceSet[1..5] & [2, 4, 6] #=> Net::IMAP::SequenceSet["2,4"]
(seqset & other)
is equivalent to (seqset - ~other)
.
Source
# File lib/net/imap/sequence_set.rb, line 632 def -(other) remain_frozen dup.subtract other end
Returns a new sequence set built by duplicating this set and removing every number that appears in other
.
other
may be any object that would be accepted by ::new
: a non-zero 32 bit unsigned integer, range, sequence-set
formatted string, another sequence set, or an enumerable containing any of these.
Net::IMAP::SequenceSet[1..5] - 2 - 4 - 6 #=> Net::IMAP::SequenceSet["1,3,5"]
Related: subtract
Source
# File lib/net/imap/sequence_set.rb, line 468 def ==(other) self.class == other.class && (to_s == other.to_s || tuples == other.tuples) end
Returns true when the other SequenceSet
represents the same message identifiers. Encoding difference—such as order, overlaps, or duplicates—are ignored.
Net::IMAP::SequenceSet["1:3"] == Net::IMAP::SequenceSet["1:3"] #=> true Net::IMAP::SequenceSet["1,2,3"] == Net::IMAP::SequenceSet["1:3"] #=> true Net::IMAP::SequenceSet["1,3"] == Net::IMAP::SequenceSet["3,1"] #=> true Net::IMAP::SequenceSet["9,1:*"] == Net::IMAP::SequenceSet["1:*"] #=> true
Source
# File lib/net/imap/sequence_set.rb, line 498 def ===(other) cover?(other) rescue nil end
Returns whether other
is contained within the set. Returns nil
if a StandardError is raised while converting other
to a comparable type.
Related: cover?
, include?
, include_star?
Source
# File lib/net/imap/sequence_set.rb, line 1220 def [](index, length = nil) if length then slice_length(index, length) elsif index.is_a?(Range) then slice_range(index) else at(index) end end
Returns a number or a subset from the sorted set, without modifying the set.
When an Integer argument index
is given, the number at offset index
in the sorted set is returned:
set = Net::IMAP::SequenceSet["10:15,20:23,26"] set[0] #=> 10 set[5] #=> 15 set[10] #=> 26
If index
is negative, it counts relative to the end of the sorted set:
set = Net::IMAP::SequenceSet["10:15,20:23,26"] set[-1] #=> 26 set[-3] #=> 22 set[-6] #=> 15
If index
is out of range, nil
is returned.
set = Net::IMAP::SequenceSet["10:15,20:23,26"] set[11] #=> nil set[-12] #=> nil
The result is based on the sorted and de-duplicated set, not on the ordered entries
in string
.
set = Net::IMAP::SequenceSet["12,20:23,11:16,21"] set[0] #=> 11 set[-1] #=> 23
Related: at
Source
# File lib/net/imap/sequence_set.rb, line 671 def ^(other) remain_frozen (self | other).subtract(self & other) end
Returns a new sequence set containing numbers that are exclusive between this set and other
.
other
may be any object that would be accepted by ::new
: a non-zero 32 bit unsigned integer, range, sequence-set
formatted string, another sequence set, or an enumerable containing any of these.
Net::IMAP::SequenceSet[1..5] ^ [2, 4, 6] #=> Net::IMAP::SequenceSet["1,3,5:6"]
(seqset ^ other)
is equivalent to ((seqset | other) - (seqset & other))
.
Source
# File lib/net/imap/sequence_set.rb, line 613 def |(other) remain_frozen dup.merge other end
Returns a new sequence set that has every number in the other
object added.
other
may be any object that would be accepted by ::new
: a non-zero 32 bit unsigned integer, range, sequence-set
formatted string, another sequence set, or an enumerable containing any of these.
Net::IMAP::SequenceSet["1:5"] | 2 | [4..6, 99] #=> Net::IMAP::SequenceSet["1:6,99"]
Source
# File lib/net/imap/sequence_set.rb, line 689 def ~; remain_frozen dup.complement! end
Returns the complement of self, a SequenceSet
which contains all numbers except for those in this set.
~Net::IMAP::SequenceSet.full #=> Net::IMAP::SequenceSet.empty ~Net::IMAP::SequenceSet.empty #=> Net::IMAP::SequenceSet.full ~Net::IMAP::SequenceSet["1:5,100:222"] #=> Net::IMAP::SequenceSet["6:99,223:*"] ~Net::IMAP::SequenceSet["6:99,223:*"] #=> Net::IMAP::SequenceSet["1:5,100:222"]
Related: complement!
Source
# File lib/net/imap/sequence_set.rb, line 701 def add(object) tuple_add input_to_tuple object normalize! end
Adds a range or number to the set and returns self
.
string
will be regenerated. Use merge
to add many elements at once.
Source
Source
# File lib/net/imap/sequence_set.rb, line 711 def append(object) modifying! tuple = input_to_tuple object entry = tuple_to_str tuple string unless empty? # write @string before tuple_add tuple_add tuple @string = -(@string ? "#{@string},#{entry}" : entry) self end
Adds a range or number to the set and returns self
.
Unlike add
, merge
, or union
, the new value is appended to string
. This may result in a string
which has duplicates or is out-of-order.
Source
# File lib/net/imap/sequence_set.rb, line 1150 def at(index) lookup_number_by_tuple_index(tuples, index) end
Returns the number at the given index
in the sorted set, without modifying the set.
index
is interpreted the same as in []
, except that at
only allows a single integer argument.
Related: []
, slice
, ordered_at
Source
# File lib/net/imap/sequence_set.rb, line 374 def clear; @tuples, @string = [], nil; self end
Removes all elements and returns self.
Source
# File lib/net/imap/sequence_set.rb, line 1300 def complement! return replace(self.class.full) if empty? return clear if full? flat = @tuples.flat_map { [_1 - 1, _2 + 1] } if flat.first < 1 then flat.shift else flat.unshift 1 end if STAR_INT < flat.last then flat.pop else flat.push STAR_INT end @tuples = flat.each_slice(2).to_a normalize! end
Converts the SequenceSet
to its own complement
. It will contain all possible values except for those currently in the set.
Related: complement
Source
# File lib/net/imap/sequence_set.rb, line 1045 def count @tuples.sum(@tuples.count) { _2 - _1 } + (include_star? && include?(UINT32_MAX) ? -1 : 0) end
Returns the count of numbers
in the set.
*
will be counted as 2**32 - 1
(the maximum 32-bit unsigned integer value).
Related: count_with_duplicates
Source
# File lib/net/imap/sequence_set.rb, line 1074 def count_duplicates return 0 unless @string count_with_duplicates - count end
Returns the count of repeated numbers in the ordered entries
, the difference between count_with_duplicates
and count
.
When string
is normalized, this is zero.
Related: entries
, count_with_duplicates
, has_duplicates?
Source
# File lib/net/imap/sequence_set.rb, line 1061 def count_with_duplicates return count unless @string each_entry_tuple.sum {|min, max| max - min + ((max == STAR_INT && min != STAR_INT) ? 0 : 1) } end
Returns the count of numbers in the ordered entries
, including any repeated numbers.
*
will be counted as 2**32 - 1
(the maximum 32-bit unsigned integer value).
When string
is normalized, this behaves the same as count
.
Related: entries
, count_duplicates
, has_duplicates?
Source
# File lib/net/imap/sequence_set.rb, line 510 def cover?(other) input_to_tuples(other).none? { !include_tuple?(_1) } end
Returns whether other
is contained within the set. other
may be any object that would be accepted by ::new
.
Related: ===
, include?
, include_star?
Source
# File lib/net/imap/sequence_set.rb, line 417 def deconstruct; valid? ? [normalized_string] : [] end
Returns an array with normalized_string
when valid and an empty array otherwise.
Source
# File lib/net/imap/sequence_set.rb, line 741 def delete(object) tuple_subtract input_to_tuple object normalize! end
Deletes the given range or number from the set and returns self
.
string
will be regenerated after deletion. Use subtract
to remove many elements at once.
Related: delete?
, delete_at
, subtract
, difference
Source
# File lib/net/imap/sequence_set.rb, line 778 def delete?(object) tuple = input_to_tuple object if tuple.first == tuple.last return unless include_tuple? tuple tuple_subtract tuple normalize! from_tuple_int tuple.first else copy = dup tuple_subtract tuple normalize! copy if copy.subtract(self).valid? end end
Removes a specified value from the set, and returns the removed value. Returns nil
if nothing was removed.
Returns an integer when the specified number
argument was removed:
set = Net::IMAP::SequenceSet.new [5..10, 20] set.delete?(7) #=> 7 set #=> #<Net::IMAP::SequenceSet "5:6,8:10,20"> set.delete?("20") #=> 20 set #=> #<Net::IMAP::SequenceSet "5:6,8:10"> set.delete?(30) #=> nil
Returns :*
when *
or -1
is specified and removed:
set = Net::IMAP::SequenceSet.new "5:9,20,35,*" set.delete?(-1) #=> :* set #=> #<Net::IMAP::SequenceSet "5:9,20,35">
And returns a new SequenceSet
when a range is specified:
set = Net::IMAP::SequenceSet.new [5..10, 20] set.delete?(9..) #=> #<Net::IMAP::SequenceSet "9:10,20"> set #=> #<Net::IMAP::SequenceSet "5:8"> set.delete?(21..) #=> nil
string
will be regenerated after deletion.
Related: delete
, delete_at
, subtract
, difference
, disjoint?
Source
# File lib/net/imap/sequence_set.rb, line 801 def delete_at(index) slice! Integer(index.to_int) end
Deletes a number the set, indicated by the given index
. Returns the number that was removed, or nil
if nothing was removed.
string
will be regenerated after deletion.
Related: delete
, delete?
, slice!
, subtract
, difference
Source
# File lib/net/imap/sequence_set.rb, line 562 def disjoint?(other) empty? || input_to_tuples(other).none? { intersect_tuple? _1 } end
Returns true
if the set and a given object have no common elements, false
otherwise.
Net::IMAP::SequenceSet["5:10"].disjoint? "7,9,11" #=> false Net::IMAP::SequenceSet["5:10"].disjoint? "11:33" #=> true
Related: intersection
, intersect?
Source
# File lib/net/imap/sequence_set.rb, line 951 def each_element # :yields: integer or range or :* return to_enum(__method__) unless block_given? @tuples.each do yield tuple_to_entry _1 end self end
Yields each number or range (or :*
) in elements
to the block and returns self. Returns an enumerator when called without a block.
The returned numbers are sorted and de-duplicated, even when the input string
is not. See normalize
.
Related: elements
, each_entry
Source
# File lib/net/imap/sequence_set.rb, line 939 def each_entry(&block) # :yields: integer or range or :* return to_enum(__method__) unless block_given? each_entry_tuple do yield tuple_to_entry _1 end end
Yields each number or range in string
to the block and returns self
. Returns an enumerator when called without a block.
The entries are yielded in the same order they appear in string
, with no sorting, deduplication, or coalescing. When string
is in its normalized form, this will yield the same values as each_element
.
Related: entries
, each_element
Source
# File lib/net/imap/sequence_set.rb, line 1001 def each_number(&block) # :yields: integer return to_enum(__method__) unless block_given? raise RangeError, '%s contains "*"' % [self.class] if include_star? @tuples.each do each_number_in_tuple _1, _2, &block end self end
Yields each number in numbers
to the block and returns self. If the set contains a *
, RangeError will be raised.
Returns an enumerator when called without a block (even if the set contains *
).
Related: numbers
, each_ordered_number
Source
# File lib/net/imap/sequence_set.rb, line 1015 def each_ordered_number(&block) return to_enum(__method__) unless block_given? raise RangeError, '%s contains "*"' % [self.class] if include_star? each_entry_tuple do each_number_in_tuple _1, _2, &block end end
Yields each number in entries
to the block and returns self. If the set contains a *
, RangeError will be raised.
Returns an enumerator when called without a block (even if the set contains *
).
Related: entries
, each_number
Source
# File lib/net/imap/sequence_set.rb, line 983 def each_range # :yields: range return to_enum(__method__) unless block_given? @tuples.each do |min, max| if min == STAR_INT then yield :*.. elsif max == STAR_INT then yield min.. else yield min..max end end self end
Yields each range in ranges
to the block and returns self. Returns an enumerator when called without a block.
Related: ranges
Source
# File lib/net/imap/sequence_set.rb, line 880 def elements; each_element.to_a end
Returns an array of ranges and integers and :*
.
The returned elements are sorted and coalesced, even when the input string
is not. *
will sort last. See normalize
.
By itself, *
translates to :*
. A range containing *
translates to an endless range. Use limit
to translate both cases to a maximum value.
The returned elements will be sorted and coalesced, even when the input string
is not. *
will sort last. See normalize
.
Net::IMAP::SequenceSet["2,5:9,6,*,12:11"].elements #=> [2, 5..9, 11..12, :*]
Related: each_element
, ranges
, numbers
Source
# File lib/net/imap/sequence_set.rb, line 592 def empty?; @tuples.empty? end
Returns true if the set contains no elements
Source
# File lib/net/imap/sequence_set.rb, line 862 def entries; each_entry.to_a end
Returns an array of ranges and integers and :*
.
The entries are in the same order they appear in string
, with no sorting, deduplication, or coalescing. When string
is in its normalized form, this will return the same result as elements
. This is useful when the given order is significant, for example in a ESEARCH response to IMAP#sort
.
Related: each_entry
, elements
Source
# File lib/net/imap/sequence_set.rb, line 487 def eql?(other) self.class == other.class && string == other.string end
Hash equality requires the same encoded string
representation.
Net::IMAP::SequenceSet["1:3"] .eql? Net::IMAP::SequenceSet["1:3"] #=> true Net::IMAP::SequenceSet["1,2,3"].eql? Net::IMAP::SequenceSet["1:3"] #=> false Net::IMAP::SequenceSet["1,3"] .eql? Net::IMAP::SequenceSet["3,1"] #=> false Net::IMAP::SequenceSet["9,1:*"].eql? Net::IMAP::SequenceSet["1:*"] #=> false
Source
# File lib/net/imap/sequence_set.rb, line 1095 def find_index(number) number = to_tuple_int number each_tuple_with_index(@tuples) do |min, max, idx_min| number < min and return nil number <= max and return from_tuple_int(idx_min + (number - min)) end nil end
Returns the (sorted and deduplicated) index of number
in the set, or nil
if number
isn’t in the set.
Related: []
, at
, find_ordered_index
Source
# File lib/net/imap/sequence_set.rb, line 1108 def find_ordered_index(number) number = to_tuple_int number each_tuple_with_index(each_entry_tuple) do |min, max, idx_min| if min <= number && number <= max return from_tuple_int(idx_min + (number - min)) end end nil end
Returns the first index of number
in the ordered entries
, or nil
if number
isn’t in the set.
Related: find_index
Source
# File lib/net/imap/sequence_set.rb, line 445 def freeze return self if frozen? string @tuples.each(&:freeze).freeze super end
Freezes and returns the set. A frozen SequenceSet
is Ractor-safe.
Source
# File lib/net/imap/sequence_set.rb, line 595 def full?; @tuples == [[1, STAR_INT]] end
Returns true if the set contains every possible element.
Source
# File lib/net/imap/sequence_set.rb, line 1086 def has_duplicates? return false unless @string count_with_duplicates != count end
Returns whether or not the ordered entries
repeat any numbers.
Always returns false
when string
is normalized.
Related: entries
, count_with_duplicates
, count_duplicates?
Source
# File lib/net/imap/sequence_set.rb, line 490 def hash; [self.class, string].hash end
See eql?
Source
# File lib/net/imap/sequence_set.rb, line 536 def include?(element) include_tuple? input_to_tuple element end
Returns true
when a given number or range is in self
, and false
otherwise. Returns false
unless number
is an Integer, Range, or *
.
set = Net::IMAP::SequenceSet["5:10,100,111:115"] set.include? 1 #=> false set.include? 5..10 #=> true set.include? 11..20 #=> false set.include? 100 #=> true set.include? 6 #=> true, covered by "5:10" set.include? 4..9 #=> true, covered by "5:10" set.include? "4:9" #=> true, strings are parsed set.include? 4..9 #=> false, intersection is not sufficient set.include? "*" #=> false, use #limit to re-interpret "*" set.include? -1 #=> false, -1 is interpreted as "*" set = Net::IMAP::SequenceSet["5:10,100,111:*"] set.include? :* #=> true set.include? "*" #=> true set.include? -1 #=> true set.include? 200.. #=> true set.include? 100.. #=> false
Related: include_star?
, cover?
, ===
Source
# File lib/net/imap/sequence_set.rb, line 541 def include_star?; @tuples.last&.last == STAR_INT end
Returns true
when the set contains *
.
Source
# File lib/net/imap/sequence_set.rb, line 1346 def inspect if empty? (frozen? ? "%s.empty" : "#<%s empty>") % [self.class] elsif frozen? "%s[%p]" % [self.class, to_s] else "#<%s %p>" % [self.class, to_s] end end
Source
# File lib/net/imap/sequence_set.rb, line 550 def intersect?(other) valid? && input_to_tuples(other).any? { intersect_tuple? _1 } end
Returns true
if the set and a given object have any common elements, false
otherwise.
Net::IMAP::SequenceSet["5:10"].intersect? "7,9,11" #=> true Net::IMAP::SequenceSet["5:10"].intersect? "11:33" #=> false
Related: intersection
, disjoint?
Source
# File lib/net/imap/sequence_set.rb, line 1273 def limit(max:) max = to_tuple_int(max) if empty? then self.class.empty elsif !include_star? && max < min then self.class.empty elsif max(star: STAR_INT) <= max then frozen? ? self : dup.freeze else dup.limit!(max: max).freeze end end
Returns a frozen SequenceSet
with *
converted to max
, numbers and ranges over max
removed, and ranges containing max
converted to end at max
.
Net::IMAP::SequenceSet["5,10:22,50"].limit(max: 20).to_s #=> "5,10:20"
*
is always interpreted as the maximum value. When the set contains *
, it will be set equal to the limit.
Net::IMAP::SequenceSet["*"].limit(max: 37) #=> Net::IMAP::SequenceSet["37"] Net::IMAP::SequenceSet["5:*"].limit(max: 37) #=> Net::IMAP::SequenceSet["5:37"] Net::IMAP::SequenceSet["500:*"].limit(max: 37) #=> Net::IMAP::SequenceSet["37"]
Source
# File lib/net/imap/sequence_set.rb, line 1286 def limit!(max:) star = include_star? max = to_tuple_int(max) tuple_subtract [max + 1, STAR_INT] tuple_add [max, max ] if star normalize! end
Removes all members over max
and returns self. If *
is a member, it will be converted to max
.
Related: limit
Source
# File lib/net/imap/sequence_set.rb, line 570 def max(star: :*) (val = @tuples.last&.last) && val == STAR_INT ? star : val end
Returns the maximum value in self
, star
when the set includes *
, or nil
when the set is empty.
Source
# File lib/net/imap/sequence_set.rb, line 834 def merge(*inputs) tuples_add input_to_tuples inputs normalize! end
Merges all of the elements that appear in any of the inputs
into the set, and returns self
.
The inputs
may be any objects that would be accepted by ::new
: non-zero 32 bit unsigned integers, ranges, sequence-set
formatted strings, other sequence sets, or enumerables containing any of these.
string
will be regenerated after all inputs have been merged.
Source
# File lib/net/imap/sequence_set.rb, line 578 def min(star: :*) (val = @tuples.first&.first) && val == STAR_INT ? star : val end
Returns the minimum value in self
, star
when the only value in the set is *
, or nil
when the set is empty.
Source
# File lib/net/imap/sequence_set.rb, line 586 def minmax(star: :*); [min(star: star), max(star: star)] unless empty? end
Returns a 2-element array containing the minimum and maximum numbers in self
, or nil
when the set is empty.
Source
# File lib/net/imap/sequence_set.rb, line 1319 def normalize str = normalized_string return self if frozen? && str == string remain_frozen dup.instance_exec { @string = str&.-@; self } end
Returns a new SequenceSet
with a normalized string representation.
The returned set’s string
is sorted and deduplicated. Adjacent or overlapping elements will be merged into a single larger range.
Net::IMAP::SequenceSet["1:5,3:7,10:9,10:11"].normalize #=> Net::IMAP::SequenceSet["1:7,9:11"]
Related: normalize!
, normalized_string
Source
# File lib/net/imap/sequence_set.rb, line 1329 def normalize! @string = nil self end
Resets string
to be sorted, deduplicated, and coalesced. Returns self
.
Related: normalize
, normalized_string
Source
# File lib/net/imap/sequence_set.rb, line 1342 def normalized_string @tuples.empty? ? nil : -@tuples.map { tuple_to_str _1 }.join(",") end
Returns a normalized sequence-set
string representation, sorted and deduplicated. Adjacent or overlapping elements will be merged into a single larger range. Returns nil
when the set is empty.
Net::IMAP::SequenceSet["1:5,3:7,10:9,10:11"].normalized_string #=> "1:7,9:11"
Related: normalize!
, normalize
Source
# File lib/net/imap/sequence_set.rb, line 929 def numbers; each_number.to_a end
Returns a sorted array of all of the number values in the sequence set.
The returned numbers are sorted and de-duplicated, even when the input string
is not. See normalize
.
Net::IMAP::SequenceSet["2,5:9,6,12:11"].numbers #=> [2, 5, 6, 7, 8, 9, 11, 12]
If the set contains a *
, RangeError is raised. See limit
.
Net::IMAP::SequenceSet["10000:*"].numbers #!> RangeError
WARNING: Even excluding sets with *
, an enormous result can easily be created. An array with over 4 billion integers could be returned, requiring up to 32GiB of memory on a 64-bit architecture.
Net::IMAP::SequenceSet[10000..2**32-1].numbers # ...probably freezes the process for a while... #!> NoMemoryError (probably)
For safety, consider using limit
or intersection
to set an upper bound. Alternatively, use each_element
, each_range
, or even each_number
to avoid allocation of a result array.
Source
# File lib/net/imap/sequence_set.rb, line 1163 def ordered_at(index) lookup_number_by_tuple_index(each_entry_tuple, index) end
Returns the number at the given index
in the ordered entries
, without modifying the set.
index
is interpreted the same as in at
(and []
), except that ordered_at
applies to the ordered entries
, not the sorted set.
Related: []
, slice
, ordered_at
Source
# File lib/net/imap/sequence_set.rb, line 901 def ranges; each_range.to_a end
Returns an array of ranges
The returned elements are sorted and coalesced, even when the input string
is not. *
will sort last. See normalize
.
*
translates to an endless range. By itself, *
translates to :*..
. Use limit
to set *
to a maximum value.
The returned ranges will be sorted and coalesced, even when the input string
is not. *
will sort last. See normalize
.
Net::IMAP::SequenceSet["2,5:9,6,*,12:11"].ranges #=> [2..2, 5..9, 11..12, :*..] Net::IMAP::SequenceSet["123,999:*,456:789"].ranges #=> [123..123, 456..789, 999..]
Related: each_range
, elements
, numbers
, to_set
Source
# File lib/net/imap/sequence_set.rb, line 381 def replace(other) case other when SequenceSet then initialize_dup(other) when String then self.string = other else clear; merge other end self end
Replace the contents of the set with the contents of other
and returns self
.
other
may be another SequenceSet
, or it may be an IMAP
sequence-set
string, a number, a range, *
, or an enumerable of these.
Source
# File lib/net/imap/sequence_set.rb, line 818 def slice!(index, length = nil) deleted = slice(index, length) and subtract deleted deleted end
Deletes a number or consecutive numbers from the set, indicated by the given index
, start
and length
, or range
of offsets. Returns the number or sequence set that was removed, or nil
if nothing was removed. Arguments are interpreted the same as for slice
or []
.
string
will be regenerated after deletion.
Related: slice
, delete_at
, delete
, delete?
, subtract
, difference
Source
# File lib/net/imap/sequence_set.rb, line 413 def string; @string ||= normalized_string if valid? end
Returns the IMAP sequence-set
string representation, or nil
when the set is empty. Note that an empty set is invalid in the IMAP syntax.
Use valid_string
to raise an exception when the set is empty, or to_s
to return an empty string.
If the set was created from a single string, it is not normalized. If the set is updated the string will be normalized.
Related: valid_string
, normalized_string
, to_s
Source
# File lib/net/imap/sequence_set.rb, line 426 def string=(str) if str.nil? clear else str = String.try_convert(str) or raise ArgumentError, "not a string" tuples = str_to_tuples str @tuples, @string = [], -str tuples_add tuples end end
Assigns a new string to string
and resets elements
to match. It cannot be set to an empty string—assign nil
or use clear
instead. The string is validated but not normalized.
Source
# File lib/net/imap/sequence_set.rb, line 848 def subtract(*objects) tuples_subtract input_to_tuples objects normalize! end
Removes all of the elements that appear in any of the given objects
from the set, and returns self
.
The objects
may be any objects that would be accepted by ::new
: non-zero 32 bit unsigned integers, ranges, sequence-set
formatted strings, other sequence sets, or enumerables containing any of these.
Related: difference
Source
# File lib/net/imap/sequence_set.rb, line 442 def to_s; string || "" end
Returns the IMAP sequence-set
string representation, or an empty string when the set is empty. Note that an empty set is invalid in the IMAP syntax.
Related: valid_string
, normalized_string
, to_s
Source
Source
# File lib/net/imap/sequence_set.rb, line 589 def valid?; !empty? end
Returns false when the set is empty.
Source
# File lib/net/imap/sequence_set.rb, line 397 def valid_string raise DataFormatError, "empty sequence-set" if empty? string end
Returns the IMAP sequence-set
string representation, or raises a DataFormatError
when the set is empty.
Use string
to return nil
or to_s
to return an empty string without error.
Related: string
, normalized_string
, to_s