File: interval_parser.rb

package info (click to toggle)
ruby-semver-dialects 3.4.0-2
  • links: PTS, VCS
  • area: main
  • in suites: sid, trixie
  • size: 156 kB
  • sloc: ruby: 1,537; makefile: 4
file content (60 lines) | stat: -rw-r--r-- 2,692 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
# frozen_string_literal: true

# IntervalParser parses a simple constraint expressed in the npm syntax
# (or equivalent) and returns a Interval that has an upper boundary
# or a lower boundary.
#
# The constraint is a string that can either be:
# - an operator (>, <, >=, <=, =) followed by a version
# - a version; the interval starts and ends with that version
# - "=*"; the interval has no boundaries and includes any version
#
# Technically IntervalParser returns a Interval such as
# start_cut is BelowAll or end_cut is AboveAll.
# The type of the Interval matches the operator
# that's been detected.
#
module SemverDialects
  module IntervalParser
    # A constraint is made of an operator followed by a version string.
    # Use the regular expression of the SemanticVersion because this is the most generic one.
    CONSTRAINT_REGEXP = Regexp.new("(?<op>[><=]+) *(?<version>#{SemanticVersion::VERSION_PATTERN})").freeze

    def self.parse(typ, versionstring)
      if versionstring == '=*'
        # special case = All Versions
        return Interval.new(IntervalType::LEFT_OPEN | IntervalType::RIGHT_OPEN, BelowAll.new, AboveAll.new)
      end

      version_items = versionstring.split(' ')
      interval = Interval.new(IntervalType::LEFT_OPEN | IntervalType::RIGHT_OPEN, BelowAll.new, AboveAll.new)
      version_items.each do |version_item|
        matches = version_item.match CONSTRAINT_REGEXP
        raise InvalidConstraintError, versionstring if matches.nil?

        version = SemverDialects.parse_version(typ, matches[:version])
        boundary = Boundary.new(version)
        case matches[:op]
        when '>='
          new_interval = Interval.new(IntervalType::LEFT_CLOSED | IntervalType::RIGHT_OPEN, boundary, AboveAll.new)
          interval = interval.intersect(new_interval)
        when '<='
          new_interval = Interval.new(IntervalType::LEFT_OPEN | IntervalType::RIGHT_CLOSED, BelowAll.new, boundary)
          interval = interval.intersect(new_interval)
        when '<'
          new_interval = Interval.new(IntervalType::LEFT_OPEN | IntervalType::RIGHT_OPEN, BelowAll.new, boundary)
          interval = interval.intersect(new_interval)
        when '>'
          new_interval = Interval.new(IntervalType::LEFT_OPEN | IntervalType::RIGHT_OPEN, boundary, AboveAll.new)
          interval = interval.intersect(new_interval)
        when '=', '=='
          new_interval = Interval.new(IntervalType::LEFT_CLOSED | IntervalType::RIGHT_CLOSED, boundary, boundary)
          interval = interval.intersect(new_interval)
        end
      end
      interval
    rescue InvalidVersionError
      raise InvalidConstraintError, versionstring
    end
  end
end