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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.// This module is browser compatible.import { isWildcardComparator } from "./_shared.ts";import { compare } from "./compare.ts";import { satisfies } from "./satisfies.ts";import type { Comparator, Range } from "./types.ts";
function comparatorIntersects(  c0: Comparator,  c1: Comparator,): boolean {  const op0 = c0.operator;  const op1 = c1.operator;
  if (op0 === undefined) {    // if c0 is empty comparator, then returns true    if (isWildcardComparator(c0)) return true;    return satisfies(c0, [[c1]]);  }  if (op1 === undefined) {    if (isWildcardComparator(c1)) return true;    return satisfies(c1, [[c0]]);  }
  const cmp = compare(c0, c1);
  const sameDirectionIncreasing = (op0 === ">=" || op0 === ">") &&    (op1 === ">=" || op1 === ">");  const sameDirectionDecreasing = (op0 === "<=" || op0 === "<") &&    (op1 === "<=" || op1 === "<");  const sameSemVer = cmp === 0;  const differentDirectionsInclusive = (op0 === ">=" || op0 === "<=") &&    (op1 === ">=" || op1 === "<=");  const oppositeDirectionsLessThan = cmp === -1 &&    (op0 === ">=" || op0 === ">") &&    (op1 === "<=" || op1 === "<");  const oppositeDirectionsGreaterThan = cmp === 1 &&    (op0 === "<=" || op0 === "<") &&    (op1 === ">=" || op1 === ">");
  return sameDirectionIncreasing ||    sameDirectionDecreasing ||    (sameSemVer && differentDirectionsInclusive) ||    oppositeDirectionsLessThan ||    oppositeDirectionsGreaterThan;}
function rangesSatisfiable(ranges: Range[]): boolean {  return ranges.every((r) => {    // For each OR at least one AND must be satisfiable    return r.some((comparators) => comparatorsSatisfiable(comparators));  });}
function comparatorsSatisfiable(comparators: Comparator[]): boolean {  // Comparators are satisfiable if they all intersect with each other  for (let i = 0; i < comparators.length - 1; i++) {    const c0 = comparators[i]!;    for (const c1 of comparators.slice(i + 1)) {      if (!comparatorIntersects(c0, c1)) {        return false;      }    }  }  return true;}
/** * The ranges intersect every range of AND comparators intersects with a least one range of OR ranges. * @param r0 range 0 * @param r1 range 1 * @returns returns true if any */export function rangeIntersects(  r0: Range,  r1: Range,): boolean {  return rangesSatisfiable([r0, r1]) &&    r0.some((r00) => {      return r1.some((r11) => {        return r00.every((c0) => {          return r11.every((c1) => comparatorIntersects(c0, c1));        });      });    });}