pubgrub/term

Types

pub type Relation {
  Satisfied
  Contradicted
  Inconclusive
}

</>

pub type Term(v) {
  Positive(version_ranges.Ranges(v))
  Negative(version_ranges.Ranges(v))
}

</>

pub fn any(compare: fn(v, v) -> order.Order) -> Term(v)

</>

pub fn compare(term: Term(v)) -> fn(v, v) -> order.Order

</>

pub fn contains(term: Term(v), version: v) -> Bool

</>

pub fn empty(compare: fn(v, v) -> order.Order) -> Term(v)

</>

pub fn equal(left: Term(v), right: Term(v)) -> Bool

</>

pub fn exact(
  compare: fn(v, v) -> order.Order,
  version: v,
) -> Term(v)

</>

pub fn intersection(left: Term(v), right: Term(v)) -> Term(v)

</>

pub fn is_any(term: Term(v)) -> Bool

</>

pub fn is_disjoint(left: Term(v), right: Term(v)) -> Bool

</>

pub fn is_positive(term: Term(v)) -> Bool

</>

pub fn negate(term: Term(v)) -> Term(v)

</>

pub fn relation_with(
  term: Term(v),
  other_terms_intersection: Term(v),
) -> Relation

</>

pub fn subset_of(left: Term(v), right: Term(v)) -> Bool

</>

pub fn to_string(
  term: Term(v),
  range_to_string: fn(version_ranges.Ranges(v)) -> String,
) -> String

</>

pub fn union(left: Term(v), right: Term(v)) -> Term(v)

</>

pub fn unwrap_negative(term: Term(v)) -> version_ranges.Ranges(v)

</>

pub fn unwrap_positive(term: Term(v)) -> version_ranges.Ranges(v)