semver.js
function isSatisfiable (comparators, options) {
  var result = true
  var remainingComparators = comparators.slice()
  var testComparator = remainingComparators.pop()

  while (result && remainingComparators.length) {
    result = remainingComparators.every(function (otherComparator) {
      return testComparator.intersects(otherComparator, options)
    })

    testComparator = remainingComparators.pop()
  }

  return result
}
function isSatisfiable (comparators, options) {
  var result = true
  var remainingComparators = comparators.slice()
  var testComparator = remainingComparators.pop()

  while (result && remainingComparators.length) {
    result = remainingComparators.every(function (otherComparator) {
      return testComparator.intersects(otherComparator, options)
    })

    testComparator = remainingComparators.pop()
  }

  return result
}
function isSatisfiable ( comparators , options ) { var result = true var remainingComparators = comparators . slice ( ) var testComparator = remainingComparators . pop ( ) while ( result && remainingComparators . length ) { result = remainingComparators . every ( function ( otherComparator ) { return testComparator . intersects ( otherComparator , options ) } ) testComparator = remainingComparators . pop ( ) } return result }
take a set of comparators and determine whether there exists a version which can satisfy it
take a set of comparators and determine whether there exists a version which can satisfy it