2020-08-15 12:45:36 +00:00
module . exports =
/******/ ( function ( modules , runtime ) { // webpackBootstrap
/******/ "use strict" ;
/******/ // The module cache
/******/ var installedModules = { } ;
/******/
/******/ // The require function
/******/ function _ _webpack _require _ _ ( moduleId ) {
/******/
/******/ // Check if module is in cache
/******/ if ( installedModules [ moduleId ] ) {
/******/ return installedModules [ moduleId ] . exports ;
/******/ }
/******/ // Create a new module (and put it into the cache)
/******/ var module = installedModules [ moduleId ] = {
/******/ i : moduleId ,
/******/ l : false ,
/******/ exports : { }
/******/ } ;
/******/
/******/ // Execute the module function
/******/ var threw = true ;
/******/ try {
/******/ modules [ moduleId ] . call ( module . exports , module , module . exports , _ _webpack _require _ _ ) ;
/******/ threw = false ;
/******/ } finally {
/******/ if ( threw ) delete installedModules [ moduleId ] ;
/******/ }
/******/
/******/ // Flag the module as loaded
/******/ module . l = true ;
/******/
/******/ // Return the exports of the module
/******/ return module . exports ;
/******/ }
/******/
/******/
/******/ _ _webpack _require _ _ . ab = _ _dirname + "/" ;
/******/
/******/ // the startup function
/******/ function startup ( ) {
/******/ // Load entry module and return exports
2020-08-21 11:33:37 +00:00
/******/ return _ _webpack _require _ _ ( 109 ) ;
2020-08-15 12:45:36 +00:00
/******/ } ;
/******/
/******/ // run startup
/******/ return startup ( ) ;
/******/ } )
/************************************************************************/
/******/ ( {
2021-05-24 22:44:03 +00:00
/***/ 4 :
/***/ ( function ( module ) {
module . exports = require ( "child_process" ) ;
/***/ } ) ,
2020-08-21 12:45:16 +00:00
/***/ 8 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const Range = _ _webpack _require _ _ ( 828 )
const intersects = ( r1 , r2 , options ) => {
r1 = new Range ( r1 , options )
r2 = new Range ( r2 , options )
return r1 . intersects ( r2 )
}
module . exports = intersects
/***/ } ) ,
/***/ 16 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const parse = _ _webpack _require _ _ ( 925 )
const prerelease = ( version , options ) => {
const parsed = parse ( version , options )
return ( parsed && parsed . prerelease . length ) ? parsed . prerelease : null
}
module . exports = prerelease
/***/ } ) ,
/***/ 17 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const neq = ( a , b , loose ) => compare ( a , b , loose ) !== 0
module . exports = neq
/***/ } ) ,
/***/ 55 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const Range = _ _webpack _require _ _ ( 828 )
const satisfies = ( version , range , options ) => {
try {
range = new Range ( range , options )
} catch ( er ) {
return false
}
return range . test ( version )
}
module . exports = satisfies
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 87 :
/***/ ( function ( module ) {
module . exports = require ( "os" ) ;
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 88 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const debug = _ _webpack _require _ _ ( 427 )
const { MAX _LENGTH , MAX _SAFE _INTEGER } = _ _webpack _require _ _ ( 293 )
const { re , t } = _ _webpack _require _ _ ( 523 )
2021-05-24 22:44:03 +00:00
const parseOptions = _ _webpack _require _ _ ( 785 )
2020-08-21 12:45:16 +00:00
const { compareIdentifiers } = _ _webpack _require _ _ ( 463 )
class SemVer {
constructor ( version , options ) {
2021-05-24 22:44:03 +00:00
options = parseOptions ( options )
2020-08-21 12:45:16 +00:00
if ( version instanceof SemVer ) {
if ( version . loose === ! ! options . loose &&
version . includePrerelease === ! ! options . includePrerelease ) {
return version
} else {
version = version . version
}
} else if ( typeof version !== 'string' ) {
throw new TypeError ( ` Invalid Version: ${ version } ` )
}
if ( version . length > MAX _LENGTH ) {
throw new TypeError (
` version is longer than ${ MAX _LENGTH } characters `
)
}
debug ( 'SemVer' , version , options )
this . options = options
this . loose = ! ! options . loose
// this isn't actually relevant for versions, but keep it so that we
// don't run into trouble passing this.options around.
this . includePrerelease = ! ! options . includePrerelease
const m = version . trim ( ) . match ( options . loose ? re [ t . LOOSE ] : re [ t . FULL ] )
if ( ! m ) {
throw new TypeError ( ` Invalid Version: ${ version } ` )
}
this . raw = version
// these are actually numbers
this . major = + m [ 1 ]
this . minor = + m [ 2 ]
this . patch = + m [ 3 ]
if ( this . major > MAX _SAFE _INTEGER || this . major < 0 ) {
throw new TypeError ( 'Invalid major version' )
}
if ( this . minor > MAX _SAFE _INTEGER || this . minor < 0 ) {
throw new TypeError ( 'Invalid minor version' )
}
if ( this . patch > MAX _SAFE _INTEGER || this . patch < 0 ) {
throw new TypeError ( 'Invalid patch version' )
}
// numberify any prerelease numeric ids
if ( ! m [ 4 ] ) {
this . prerelease = [ ]
} else {
this . prerelease = m [ 4 ] . split ( '.' ) . map ( ( id ) => {
if ( /^[0-9]+$/ . test ( id ) ) {
const num = + id
if ( num >= 0 && num < MAX _SAFE _INTEGER ) {
return num
}
}
return id
} )
}
this . build = m [ 5 ] ? m [ 5 ] . split ( '.' ) : [ ]
this . format ( )
}
format ( ) {
this . version = ` ${ this . major } . ${ this . minor } . ${ this . patch } `
if ( this . prerelease . length ) {
this . version += ` - ${ this . prerelease . join ( '.' ) } `
}
return this . version
}
toString ( ) {
return this . version
}
compare ( other ) {
debug ( 'SemVer.compare' , this . version , this . options , other )
if ( ! ( other instanceof SemVer ) ) {
if ( typeof other === 'string' && other === this . version ) {
return 0
}
other = new SemVer ( other , this . options )
}
if ( other . version === this . version ) {
return 0
}
return this . compareMain ( other ) || this . comparePre ( other )
}
compareMain ( other ) {
if ( ! ( other instanceof SemVer ) ) {
other = new SemVer ( other , this . options )
}
return (
compareIdentifiers ( this . major , other . major ) ||
compareIdentifiers ( this . minor , other . minor ) ||
compareIdentifiers ( this . patch , other . patch )
)
}
comparePre ( other ) {
if ( ! ( other instanceof SemVer ) ) {
other = new SemVer ( other , this . options )
}
// NOT having a prerelease is > having one
if ( this . prerelease . length && ! other . prerelease . length ) {
return - 1
} else if ( ! this . prerelease . length && other . prerelease . length ) {
return 1
} else if ( ! this . prerelease . length && ! other . prerelease . length ) {
return 0
}
let i = 0
do {
const a = this . prerelease [ i ]
const b = other . prerelease [ i ]
debug ( 'prerelease compare' , i , a , b )
if ( a === undefined && b === undefined ) {
return 0
} else if ( b === undefined ) {
return 1
} else if ( a === undefined ) {
return - 1
} else if ( a === b ) {
continue
} else {
return compareIdentifiers ( a , b )
}
} while ( ++ i )
}
compareBuild ( other ) {
if ( ! ( other instanceof SemVer ) ) {
other = new SemVer ( other , this . options )
}
let i = 0
do {
const a = this . build [ i ]
const b = other . build [ i ]
debug ( 'prerelease compare' , i , a , b )
if ( a === undefined && b === undefined ) {
return 0
} else if ( b === undefined ) {
return 1
} else if ( a === undefined ) {
return - 1
} else if ( a === b ) {
continue
} else {
return compareIdentifiers ( a , b )
}
} while ( ++ i )
}
// preminor will bump the version up to the next minor release, and immediately
// down to pre-release. premajor and prepatch work the same way.
inc ( release , identifier ) {
switch ( release ) {
case 'premajor' :
this . prerelease . length = 0
this . patch = 0
this . minor = 0
this . major ++
this . inc ( 'pre' , identifier )
break
case 'preminor' :
this . prerelease . length = 0
this . patch = 0
this . minor ++
this . inc ( 'pre' , identifier )
break
case 'prepatch' :
// If this is already a prerelease, it will bump to the next version
// drop any prereleases that might already exist, since they are not
// relevant at this point.
this . prerelease . length = 0
this . inc ( 'patch' , identifier )
this . inc ( 'pre' , identifier )
break
// If the input is a non-prerelease version, this acts the same as
// prepatch.
case 'prerelease' :
if ( this . prerelease . length === 0 ) {
this . inc ( 'patch' , identifier )
}
this . inc ( 'pre' , identifier )
break
case 'major' :
// If this is a pre-major version, bump up to the same major version.
// Otherwise increment major.
// 1.0.0-5 bumps to 1.0.0
// 1.1.0 bumps to 2.0.0
if (
this . minor !== 0 ||
this . patch !== 0 ||
this . prerelease . length === 0
) {
this . major ++
}
this . minor = 0
this . patch = 0
this . prerelease = [ ]
break
case 'minor' :
// If this is a pre-minor version, bump up to the same minor version.
// Otherwise increment minor.
// 1.2.0-5 bumps to 1.2.0
// 1.2.1 bumps to 1.3.0
if ( this . patch !== 0 || this . prerelease . length === 0 ) {
this . minor ++
}
this . patch = 0
this . prerelease = [ ]
break
case 'patch' :
// If this is not a pre-release version, it will increment the patch.
// If it is a pre-release it will bump up to the same patch version.
// 1.2.0-5 patches to 1.2.0
// 1.2.0 patches to 1.2.1
if ( this . prerelease . length === 0 ) {
this . patch ++
}
this . prerelease = [ ]
break
// This probably shouldn't be used publicly.
// 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
case 'pre' :
if ( this . prerelease . length === 0 ) {
this . prerelease = [ 0 ]
} else {
let i = this . prerelease . length
while ( -- i >= 0 ) {
if ( typeof this . prerelease [ i ] === 'number' ) {
this . prerelease [ i ] ++
i = - 2
}
}
if ( i === - 1 ) {
// didn't increment anything
this . prerelease . push ( 0 )
}
}
if ( identifier ) {
// 1.2.0-beta.1 bumps to 1.2.0-beta.2,
// 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0
if ( this . prerelease [ 0 ] === identifier ) {
if ( isNaN ( this . prerelease [ 1 ] ) ) {
this . prerelease = [ identifier , 0 ]
}
} else {
this . prerelease = [ identifier , 0 ]
}
}
break
default :
throw new Error ( ` invalid increment argument: ${ release } ` )
}
this . format ( )
this . raw = this . version
return this
}
}
module . exports = SemVer
2021-05-24 22:44:03 +00:00
/***/ } ) ,
/***/ 91 :
/***/ ( function ( module ) {
"use strict" ;
module . exports = function ( Yallist ) {
Yallist . prototype [ Symbol . iterator ] = function * ( ) {
for ( let walker = this . head ; walker ; walker = walker . next ) {
yield walker . value
}
}
}
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 98 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const eq = _ _webpack _require _ _ ( 898 )
const neq = _ _webpack _require _ _ ( 17 )
const gt = _ _webpack _require _ _ ( 123 )
const gte = _ _webpack _require _ _ ( 522 )
const lt = _ _webpack _require _ _ ( 194 )
const lte = _ _webpack _require _ _ ( 520 )
const cmp = ( a , op , b , loose ) => {
switch ( op ) {
case '===' :
if ( typeof a === 'object' )
a = a . version
if ( typeof b === 'object' )
b = b . version
return a === b
case '!==' :
if ( typeof a === 'object' )
a = a . version
if ( typeof b === 'object' )
b = b . version
return a !== b
case '' :
case '=' :
case '==' :
return eq ( a , b , loose )
case '!=' :
return neq ( a , b , loose )
case '>' :
return gt ( a , b , loose )
case '>=' :
return gte ( a , b , loose )
case '<' :
return lt ( a , b , loose )
case '<=' :
return lte ( a , b , loose )
default :
throw new TypeError ( ` Invalid operator: ${ op } ` )
}
}
module . exports = cmp
2020-08-21 11:33:37 +00:00
/***/ } ) ,
/***/ 109 :
2020-08-15 12:45:36 +00:00
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2020-08-21 11:33:37 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-15 12:45:36 +00:00
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2020-10-16 16:24:41 +00:00
exports . run = void 0 ;
2020-08-21 11:33:37 +00:00
const core = _ _importStar ( _ _webpack _require _ _ ( 186 ) ) ;
2021-04-27 22:34:26 +00:00
const context = _ _importStar ( _ _webpack _require _ _ ( 842 ) ) ;
2020-08-21 11:33:37 +00:00
const docker = _ _importStar ( _ _webpack _require _ _ ( 758 ) ) ;
const stateHelper = _ _importStar ( _ _webpack _require _ _ ( 647 ) ) ;
function run ( ) {
2020-08-15 12:45:36 +00:00
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-08-21 11:33:37 +00:00
try {
2021-04-27 22:34:26 +00:00
const { registry , username , password , l ogout } = context . getInputs ( ) ;
2020-10-16 16:24:41 +00:00
stateHelper . setRegistry ( registry ) ;
stateHelper . setLogout ( logout ) ;
yield docker . login ( registry , username , password ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
catch ( error ) {
core . setFailed ( error . message ) ;
2020-08-15 12:45:36 +00:00
}
} ) ;
}
2020-10-16 16:24:41 +00:00
exports . run = run ;
2020-08-21 11:33:37 +00:00
function logout ( ) {
2020-08-15 12:45:36 +00:00
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-08-21 11:33:37 +00:00
if ( ! stateHelper . logout ) {
return ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
yield docker . logout ( stateHelper . registry ) ;
2020-08-15 12:45:36 +00:00
} ) ;
}
2020-08-21 11:33:37 +00:00
if ( ! stateHelper . IsPost ) {
run ( ) ;
}
else {
logout ( ) ;
}
//# sourceMappingURL=main.js.map
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 123 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const gt = ( a , b , loose ) => compare ( a , b , loose ) > 0
module . exports = gt
2020-08-21 11:33:37 +00:00
/***/ } ) ,
/***/ 129 :
2021-05-24 22:44:03 +00:00
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
"use strict" ;
// A linked list to keep track of recently-used-ness
const Yallist = _ _webpack _require _ _ ( 665 )
const MAX = Symbol ( 'max' )
const LENGTH = Symbol ( 'length' )
const LENGTH _CALCULATOR = Symbol ( 'lengthCalculator' )
const ALLOW _STALE = Symbol ( 'allowStale' )
const MAX _AGE = Symbol ( 'maxAge' )
const DISPOSE = Symbol ( 'dispose' )
const NO _DISPOSE _ON _SET = Symbol ( 'noDisposeOnSet' )
const LRU _LIST = Symbol ( 'lruList' )
const CACHE = Symbol ( 'cache' )
const UPDATE _AGE _ON _GET = Symbol ( 'updateAgeOnGet' )
const naiveLength = ( ) => 1
// lruList is a yallist where the head is the youngest
// item, and the tail is the oldest. the list contains the Hit
// objects as the entries.
// Each Hit object has a reference to its Yallist.Node. This
// never changes.
//
// cache is a Map (or PseudoMap) that matches the keys to
// the Yallist.Node object.
class LRUCache {
constructor ( options ) {
if ( typeof options === 'number' )
options = { max : options }
if ( ! options )
options = { }
if ( options . max && ( typeof options . max !== 'number' || options . max < 0 ) )
throw new TypeError ( 'max must be a non-negative number' )
// Kind of weird to have a default max of Infinity, but oh well.
const max = this [ MAX ] = options . max || Infinity
const lc = options . length || naiveLength
this [ LENGTH _CALCULATOR ] = ( typeof lc !== 'function' ) ? naiveLength : lc
this [ ALLOW _STALE ] = options . stale || false
if ( options . maxAge && typeof options . maxAge !== 'number' )
throw new TypeError ( 'maxAge must be a number' )
this [ MAX _AGE ] = options . maxAge || 0
this [ DISPOSE ] = options . dispose
this [ NO _DISPOSE _ON _SET ] = options . noDisposeOnSet || false
this [ UPDATE _AGE _ON _GET ] = options . updateAgeOnGet || false
this . reset ( )
}
// resize the cache when the max changes.
set max ( mL ) {
if ( typeof mL !== 'number' || mL < 0 )
throw new TypeError ( 'max must be a non-negative number' )
this [ MAX ] = mL || Infinity
trim ( this )
}
get max ( ) {
return this [ MAX ]
}
set allowStale ( allowStale ) {
this [ ALLOW _STALE ] = ! ! allowStale
}
get allowStale ( ) {
return this [ ALLOW _STALE ]
}
set maxAge ( mA ) {
if ( typeof mA !== 'number' )
throw new TypeError ( 'maxAge must be a non-negative number' )
this [ MAX _AGE ] = mA
trim ( this )
}
get maxAge ( ) {
return this [ MAX _AGE ]
}
// resize the cache when the lengthCalculator changes.
set lengthCalculator ( lC ) {
if ( typeof lC !== 'function' )
lC = naiveLength
if ( lC !== this [ LENGTH _CALCULATOR ] ) {
this [ LENGTH _CALCULATOR ] = lC
this [ LENGTH ] = 0
this [ LRU _LIST ] . forEach ( hit => {
hit . length = this [ LENGTH _CALCULATOR ] ( hit . value , hit . key )
this [ LENGTH ] += hit . length
} )
}
trim ( this )
}
get lengthCalculator ( ) { return this [ LENGTH _CALCULATOR ] }
get length ( ) { return this [ LENGTH ] }
get itemCount ( ) { return this [ LRU _LIST ] . length }
rforEach ( fn , thisp ) {
thisp = thisp || this
for ( let walker = this [ LRU _LIST ] . tail ; walker !== null ; ) {
const prev = walker . prev
forEachStep ( this , fn , walker , thisp )
walker = prev
}
}
forEach ( fn , thisp ) {
thisp = thisp || this
for ( let walker = this [ LRU _LIST ] . head ; walker !== null ; ) {
const next = walker . next
forEachStep ( this , fn , walker , thisp )
walker = next
}
}
keys ( ) {
return this [ LRU _LIST ] . toArray ( ) . map ( k => k . key )
}
values ( ) {
return this [ LRU _LIST ] . toArray ( ) . map ( k => k . value )
}
reset ( ) {
if ( this [ DISPOSE ] &&
this [ LRU _LIST ] &&
this [ LRU _LIST ] . length ) {
this [ LRU _LIST ] . forEach ( hit => this [ DISPOSE ] ( hit . key , hit . value ) )
}
this [ CACHE ] = new Map ( ) // hash of items by key
this [ LRU _LIST ] = new Yallist ( ) // list of items in order of use recency
this [ LENGTH ] = 0 // length of items in the list
}
dump ( ) {
return this [ LRU _LIST ] . map ( hit =>
isStale ( this , hit ) ? false : {
k : hit . key ,
v : hit . value ,
e : hit . now + ( hit . maxAge || 0 )
} ) . toArray ( ) . filter ( h => h )
}
dumpLru ( ) {
return this [ LRU _LIST ]
}
set ( key , value , maxAge ) {
maxAge = maxAge || this [ MAX _AGE ]
if ( maxAge && typeof maxAge !== 'number' )
throw new TypeError ( 'maxAge must be a number' )
const now = maxAge ? Date . now ( ) : 0
const len = this [ LENGTH _CALCULATOR ] ( value , key )
if ( this [ CACHE ] . has ( key ) ) {
if ( len > this [ MAX ] ) {
del ( this , this [ CACHE ] . get ( key ) )
return false
}
const node = this [ CACHE ] . get ( key )
const item = node . value
// dispose of the old one before overwriting
// split out into 2 ifs for better coverage tracking
if ( this [ DISPOSE ] ) {
if ( ! this [ NO _DISPOSE _ON _SET ] )
this [ DISPOSE ] ( key , item . value )
}
item . now = now
item . maxAge = maxAge
item . value = value
this [ LENGTH ] += len - item . length
item . length = len
this . get ( key )
trim ( this )
return true
}
const hit = new Entry ( key , value , len , now , maxAge )
// oversized objects fall out of cache automatically.
if ( hit . length > this [ MAX ] ) {
if ( this [ DISPOSE ] )
this [ DISPOSE ] ( key , value )
return false
}
this [ LENGTH ] += hit . length
this [ LRU _LIST ] . unshift ( hit )
this [ CACHE ] . set ( key , this [ LRU _LIST ] . head )
trim ( this )
return true
}
has ( key ) {
if ( ! this [ CACHE ] . has ( key ) ) return false
const hit = this [ CACHE ] . get ( key ) . value
return ! isStale ( this , hit )
}
get ( key ) {
return get ( this , key , true )
}
peek ( key ) {
return get ( this , key , false )
}
pop ( ) {
const node = this [ LRU _LIST ] . tail
if ( ! node )
return null
del ( this , node )
return node . value
}
del ( key ) {
del ( this , this [ CACHE ] . get ( key ) )
}
load ( arr ) {
// reset the cache
this . reset ( )
const now = Date . now ( )
// A previous serialized cache has the most recent items first
for ( let l = arr . length - 1 ; l >= 0 ; l -- ) {
const hit = arr [ l ]
const expiresAt = hit . e || 0
if ( expiresAt === 0 )
// the item was created without expiration in a non aged cache
this . set ( hit . k , hit . v )
else {
const maxAge = expiresAt - now
// dont add already expired items
if ( maxAge > 0 ) {
this . set ( hit . k , hit . v , maxAge )
}
}
}
}
prune ( ) {
this [ CACHE ] . forEach ( ( value , key ) => get ( this , key , false ) )
}
}
const get = ( self , key , doUse ) => {
const node = self [ CACHE ] . get ( key )
if ( node ) {
const hit = node . value
if ( isStale ( self , hit ) ) {
del ( self , node )
if ( ! self [ ALLOW _STALE ] )
return undefined
} else {
if ( doUse ) {
if ( self [ UPDATE _AGE _ON _GET ] )
node . value . now = Date . now ( )
self [ LRU _LIST ] . unshiftNode ( node )
}
}
return hit . value
}
}
const isStale = ( self , hit ) => {
if ( ! hit || ( ! hit . maxAge && ! self [ MAX _AGE ] ) )
return false
const diff = Date . now ( ) - hit . now
return hit . maxAge ? diff > hit . maxAge
: self [ MAX _AGE ] && ( diff > self [ MAX _AGE ] )
}
const trim = self => {
if ( self [ LENGTH ] > self [ MAX ] ) {
for ( let walker = self [ LRU _LIST ] . tail ;
self [ LENGTH ] > self [ MAX ] && walker !== null ; ) {
// We know that we're about to delete this one, and also
// what the next least recently used key will be, so just
// go ahead and set it now.
const prev = walker . prev
del ( self , walker )
walker = prev
}
}
}
const del = ( self , node ) => {
if ( node ) {
const hit = node . value
if ( self [ DISPOSE ] )
self [ DISPOSE ] ( hit . key , hit . value )
self [ LENGTH ] -= hit . length
self [ CACHE ] . delete ( hit . key )
self [ LRU _LIST ] . removeNode ( node )
}
}
class Entry {
constructor ( key , value , length , now , maxAge ) {
this . key = key
this . value = value
this . length = length
this . now = now
this . maxAge = maxAge || 0
}
}
const forEachStep = ( self , fn , node , thisp ) => {
let hit = node . value
if ( isStale ( self , hit ) ) {
del ( self , node )
if ( ! self [ ALLOW _STALE ] )
hit = undefined
}
if ( hit )
fn . call ( thisp , hit . value , hit . key , self )
}
module . exports = LRUCache
2020-08-21 11:33:37 +00:00
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 156 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const compareBuild = ( a , b , loose ) => {
const versionA = new SemVer ( a , loose )
const versionB = new SemVer ( b , loose )
return versionA . compare ( versionB ) || versionA . compareBuild ( versionB )
}
module . exports = compareBuild
2020-08-21 11:33:37 +00:00
/***/ } ) ,
/***/ 159 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2021-06-22 08:00:24 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-21 11:33:37 +00:00
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-06-22 08:00:24 +00:00
exports . argStringToArray = exports . ToolRunner = void 0 ;
2020-08-21 11:33:37 +00:00
const os = _ _importStar ( _ _webpack _require _ _ ( 87 ) ) ;
const events = _ _importStar ( _ _webpack _require _ _ ( 614 ) ) ;
2021-05-24 22:44:03 +00:00
const child = _ _importStar ( _ _webpack _require _ _ ( 4 ) ) ;
2020-08-21 11:33:37 +00:00
const path = _ _importStar ( _ _webpack _require _ _ ( 622 ) ) ;
const io = _ _importStar ( _ _webpack _require _ _ ( 436 ) ) ;
const ioUtil = _ _importStar ( _ _webpack _require _ _ ( 962 ) ) ;
2021-06-22 08:00:24 +00:00
const timers _1 = _ _webpack _require _ _ ( 213 ) ;
2020-08-21 11:33:37 +00:00
/* eslint-disable @typescript-eslint/unbound-method */
const IS _WINDOWS = process . platform === 'win32' ;
/ *
* Class for running command line tools . Handles quoting and arg parsing in a platform agnostic way .
2020-08-15 12:45:36 +00:00
* /
2020-08-21 11:33:37 +00:00
class ToolRunner extends events . EventEmitter {
constructor ( toolPath , args , options ) {
super ( ) ;
if ( ! toolPath ) {
throw new Error ( "Parameter 'toolPath' cannot be null or empty." ) ;
}
this . toolPath = toolPath ;
this . args = args || [ ] ;
this . options = options || { } ;
}
_debug ( message ) {
if ( this . options . listeners && this . options . listeners . debug ) {
this . options . listeners . debug ( message ) ;
}
}
_getCommandString ( options , noPrefix ) {
const toolPath = this . _getSpawnFileName ( ) ;
const args = this . _getSpawnArgs ( options ) ;
let cmd = noPrefix ? '' : '[command]' ; // omit prefix when piped to a second tool
if ( IS _WINDOWS ) {
// Windows + cmd file
if ( this . _isCmdFile ( ) ) {
cmd += toolPath ;
for ( const a of args ) {
cmd += ` ${ a } ` ;
2020-08-15 12:45:36 +00:00
}
}
2020-08-21 11:33:37 +00:00
// Windows + verbatim
else if ( options . windowsVerbatimArguments ) {
cmd += ` " ${ toolPath } " ` ;
for ( const a of args ) {
cmd += ` ${ a } ` ;
}
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
// Windows (regular)
else {
cmd += this . _windowsQuoteCmdArg ( toolPath ) ;
for ( const a of args ) {
cmd += ` ${ this . _windowsQuoteCmdArg ( a ) } ` ;
}
2020-08-15 12:45:36 +00:00
}
}
else {
2020-08-21 11:33:37 +00:00
// OSX/Linux - this can likely be improved with some form of quoting.
// creating processes on Unix is fundamentally different than Windows.
// on Unix, execvp() takes an arg array.
cmd += toolPath ;
for ( const a of args ) {
cmd += ` ${ a } ` ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
}
return cmd ;
}
_processLineBuffer ( data , strBuffer , onLine ) {
try {
let s = strBuffer + data . toString ( ) ;
let n = s . indexOf ( os . EOL ) ;
while ( n > - 1 ) {
const line = s . substring ( 0 , n ) ;
onLine ( line ) ;
// the rest of the string ...
s = s . substring ( n + os . EOL . length ) ;
n = s . indexOf ( os . EOL ) ;
2020-08-15 12:45:36 +00:00
}
2021-06-22 08:00:24 +00:00
return s ;
2020-08-15 12:45:36 +00:00
}
catch ( err ) {
// streaming lines to console is best effort. Don't fail a build.
this . _debug ( ` error processing line. Failed with error ${ err } ` ) ;
2021-06-22 08:00:24 +00:00
return '' ;
2020-08-15 12:45:36 +00:00
}
}
_getSpawnFileName ( ) {
if ( IS _WINDOWS ) {
if ( this . _isCmdFile ( ) ) {
return process . env [ 'COMSPEC' ] || 'cmd.exe' ;
}
}
return this . toolPath ;
}
_getSpawnArgs ( options ) {
if ( IS _WINDOWS ) {
if ( this . _isCmdFile ( ) ) {
let argline = ` /D /S /C " ${ this . _windowsQuoteCmdArg ( this . toolPath ) } ` ;
for ( const a of this . args ) {
argline += ' ' ;
argline += options . windowsVerbatimArguments
? a
: this . _windowsQuoteCmdArg ( a ) ;
}
argline += '"' ;
return [ argline ] ;
}
}
return this . args ;
}
_endsWith ( str , end ) {
return str . endsWith ( end ) ;
}
_isCmdFile ( ) {
const upperToolPath = this . toolPath . toUpperCase ( ) ;
return ( this . _endsWith ( upperToolPath , '.CMD' ) ||
this . _endsWith ( upperToolPath , '.BAT' ) ) ;
}
_windowsQuoteCmdArg ( arg ) {
// for .exe, apply the normal quoting rules that libuv applies
if ( ! this . _isCmdFile ( ) ) {
return this . _uvQuoteCmdArg ( arg ) ;
}
// otherwise apply quoting rules specific to the cmd.exe command line parser.
// the libuv rules are generic and are not designed specifically for cmd.exe
// command line parser.
//
// for a detailed description of the cmd.exe command line parser, refer to
// http://stackoverflow.com/questions/4094699/how-does-the-windows-command-interpreter-cmd-exe-parse-scripts/7970912#7970912
// need quotes for empty arg
if ( ! arg ) {
return '""' ;
}
// determine whether the arg needs to be quoted
const cmdSpecialChars = [
' ' ,
'\t' ,
'&' ,
'(' ,
')' ,
'[' ,
']' ,
'{' ,
'}' ,
'^' ,
'=' ,
';' ,
'!' ,
"'" ,
'+' ,
',' ,
'`' ,
'~' ,
'|' ,
'<' ,
'>' ,
'"'
] ;
let needsQuotes = false ;
for ( const char of arg ) {
if ( cmdSpecialChars . some ( x => x === char ) ) {
needsQuotes = true ;
break ;
}
}
// short-circuit if quotes not needed
if ( ! needsQuotes ) {
return arg ;
}
// the following quoting rules are very similar to the rules that by libuv applies.
//
// 1) wrap the string in quotes
//
// 2) double-up quotes - i.e. " => ""
//
// this is different from the libuv quoting rules. libuv replaces " with \", which unfortunately
// doesn't work well with a cmd.exe command line.
//
// note, replacing " with "" also works well if the arg is passed to a downstream .NET console app.
// for example, the command line:
// foo.exe "myarg:""my val"""
// is parsed by a .NET console app into an arg array:
// [ "myarg:\"my val\"" ]
// which is the same end result when applying libuv quoting rules. although the actual
// command line from libuv quoting rules would look like:
// foo.exe "myarg:\"my val\""
//
// 3) double-up slashes that precede a quote,
// e.g. hello \world => "hello \world"
// hello\"world => "hello\\""world"
// hello\\"world => "hello\\\\""world"
// hello world\ => "hello world\\"
//
// technically this is not required for a cmd.exe command line, or the batch argument parser.
// the reasons for including this as a .cmd quoting rule are:
//
// a) this is optimized for the scenario where the argument is passed from the .cmd file to an
// external program. many programs (e.g. .NET console apps) rely on the slash-doubling rule.
//
// b) it's what we've been doing previously (by deferring to node default behavior) and we
// haven't heard any complaints about that aspect.
//
// note, a weakness of the quoting rules chosen here, is that % is not escaped. in fact, % cannot be
// escaped when used on the command line directly - even though within a .cmd file % can be escaped
// by using %%.
//
// the saving grace is, on the command line, %var% is left as-is if var is not defined. this contrasts
// the line parsing rules within a .cmd file, where if var is not defined it is replaced with nothing.
//
// one option that was explored was replacing % with ^% - i.e. %var% => ^%var^%. this hack would
// often work, since it is unlikely that var^ would exist, and the ^ character is removed when the
// variable is used. the problem, however, is that ^ is not removed when %* is used to pass the args
// to an external program.
//
// an unexplored potential solution for the % escaping problem, is to create a wrapper .cmd file.
// % can be escaped within a .cmd file.
let reverse = '"' ;
let quoteHit = true ;
for ( let i = arg . length ; i > 0 ; i -- ) {
// walk the string in reverse
reverse += arg [ i - 1 ] ;
if ( quoteHit && arg [ i - 1 ] === '\\' ) {
reverse += '\\' ; // double the slash
}
else if ( arg [ i - 1 ] === '"' ) {
quoteHit = true ;
reverse += '"' ; // double the quote
}
else {
quoteHit = false ;
}
}
reverse += '"' ;
return reverse
. split ( '' )
. reverse ( )
. join ( '' ) ;
}
_uvQuoteCmdArg ( arg ) {
// Tool runner wraps child_process.spawn() and needs to apply the same quoting as
// Node in certain cases where the undocumented spawn option windowsVerbatimArguments
// is used.
//
// Since this function is a port of quote_cmd_arg from Node 4.x (technically, lib UV,
// see https://github.com/nodejs/node/blob/v4.x/deps/uv/src/win/process.c for details),
// pasting copyright notice from Node within this function:
//
// Copyright Joyent, Inc. and other Node contributors. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
if ( ! arg ) {
// Need double quotation for empty argument
return '""' ;
}
if ( ! arg . includes ( ' ' ) && ! arg . includes ( '\t' ) && ! arg . includes ( '"' ) ) {
// No quotation needed
return arg ;
}
if ( ! arg . includes ( '"' ) && ! arg . includes ( '\\' ) ) {
// No embedded double quotes or backslashes, so I can just wrap
// quote marks around the whole thing.
return ` " ${ arg } " ` ;
}
// Expected input/output:
// input : hello"world
// output: "hello\"world"
// input : hello""world
// output: "hello\"\"world"
// input : hello\world
// output: hello\world
// input : hello\\world
// output: hello\\world
// input : hello\"world
// output: "hello\\\"world"
// input : hello\\"world
// output: "hello\\\\\"world"
// input : hello world\
// output: "hello world\\" - note the comment in libuv actually reads "hello world\"
// but it appears the comment is wrong, it should be "hello world\\"
let reverse = '"' ;
let quoteHit = true ;
for ( let i = arg . length ; i > 0 ; i -- ) {
// walk the string in reverse
reverse += arg [ i - 1 ] ;
if ( quoteHit && arg [ i - 1 ] === '\\' ) {
reverse += '\\' ;
}
else if ( arg [ i - 1 ] === '"' ) {
quoteHit = true ;
reverse += '\\' ;
}
else {
quoteHit = false ;
}
}
reverse += '"' ;
return reverse
. split ( '' )
. reverse ( )
. join ( '' ) ;
}
_cloneExecOptions ( options ) {
options = options || { } ;
const result = {
cwd : options . cwd || process . cwd ( ) ,
env : options . env || process . env ,
silent : options . silent || false ,
windowsVerbatimArguments : options . windowsVerbatimArguments || false ,
failOnStdErr : options . failOnStdErr || false ,
ignoreReturnCode : options . ignoreReturnCode || false ,
delay : options . delay || 10000
} ;
result . outStream = options . outStream || process . stdout ;
result . errStream = options . errStream || process . stderr ;
return result ;
}
_getSpawnOptions ( options , toolPath ) {
options = options || { } ;
const result = { } ;
result . cwd = options . cwd ;
result . env = options . env ;
result [ 'windowsVerbatimArguments' ] =
options . windowsVerbatimArguments || this . _isCmdFile ( ) ;
if ( options . windowsVerbatimArguments ) {
result . argv0 = ` " ${ toolPath } " ` ;
}
return result ;
}
/ * *
* Exec a tool .
* Output will be streamed to the live console .
* Returns promise with return code
*
* @ param tool path to tool to exec
* @ param options optional exec options . See ExecOptions
* @ returns number
* /
exec ( ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
// root the tool path if it is unrooted and contains relative pathing
if ( ! ioUtil . isRooted ( this . toolPath ) &&
( this . toolPath . includes ( '/' ) ||
( IS _WINDOWS && this . toolPath . includes ( '\\' ) ) ) ) {
// prefer options.cwd if it is specified, however options.cwd may also need to be rooted
this . toolPath = path . resolve ( process . cwd ( ) , this . options . cwd || process . cwd ( ) , this . toolPath ) ;
}
// if the tool is only a file name, then resolve it from the PATH
// otherwise verify it exists (add extension on Windows if necessary)
this . toolPath = yield io . which ( this . toolPath , true ) ;
2021-06-22 08:00:24 +00:00
return new Promise ( ( resolve , reject ) => _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-08-15 12:45:36 +00:00
this . _debug ( ` exec tool: ${ this . toolPath } ` ) ;
this . _debug ( 'arguments:' ) ;
for ( const arg of this . args ) {
this . _debug ( ` ${ arg } ` ) ;
}
const optionsNonNull = this . _cloneExecOptions ( this . options ) ;
if ( ! optionsNonNull . silent && optionsNonNull . outStream ) {
optionsNonNull . outStream . write ( this . _getCommandString ( optionsNonNull ) + os . EOL ) ;
}
const state = new ExecState ( optionsNonNull , this . toolPath ) ;
state . on ( 'debug' , ( message ) => {
this . _debug ( message ) ;
} ) ;
2021-06-22 08:00:24 +00:00
if ( this . options . cwd && ! ( yield ioUtil . exists ( this . options . cwd ) ) ) {
return reject ( new Error ( ` The cwd: ${ this . options . cwd } does not exist! ` ) ) ;
}
2020-08-15 12:45:36 +00:00
const fileName = this . _getSpawnFileName ( ) ;
const cp = child . spawn ( fileName , this . _getSpawnArgs ( optionsNonNull ) , this . _getSpawnOptions ( this . options , fileName ) ) ;
2021-06-22 08:00:24 +00:00
let stdbuffer = '' ;
2020-08-15 12:45:36 +00:00
if ( cp . stdout ) {
cp . stdout . on ( 'data' , ( data ) => {
if ( this . options . listeners && this . options . listeners . stdout ) {
this . options . listeners . stdout ( data ) ;
}
if ( ! optionsNonNull . silent && optionsNonNull . outStream ) {
optionsNonNull . outStream . write ( data ) ;
}
2021-06-22 08:00:24 +00:00
stdbuffer = this . _processLineBuffer ( data , stdbuffer , ( line ) => {
2020-08-15 12:45:36 +00:00
if ( this . options . listeners && this . options . listeners . stdline ) {
this . options . listeners . stdline ( line ) ;
}
} ) ;
} ) ;
}
2021-06-22 08:00:24 +00:00
let errbuffer = '' ;
2020-08-15 12:45:36 +00:00
if ( cp . stderr ) {
cp . stderr . on ( 'data' , ( data ) => {
state . processStderr = true ;
if ( this . options . listeners && this . options . listeners . stderr ) {
this . options . listeners . stderr ( data ) ;
}
if ( ! optionsNonNull . silent &&
optionsNonNull . errStream &&
optionsNonNull . outStream ) {
const s = optionsNonNull . failOnStdErr
? optionsNonNull . errStream
: optionsNonNull . outStream ;
s . write ( data ) ;
}
2021-06-22 08:00:24 +00:00
errbuffer = this . _processLineBuffer ( data , errbuffer , ( line ) => {
2020-08-15 12:45:36 +00:00
if ( this . options . listeners && this . options . listeners . errline ) {
this . options . listeners . errline ( line ) ;
}
} ) ;
} ) ;
}
cp . on ( 'error' , ( err ) => {
state . processError = err . message ;
state . processExited = true ;
state . processClosed = true ;
state . CheckComplete ( ) ;
} ) ;
cp . on ( 'exit' , ( code ) => {
state . processExitCode = code ;
state . processExited = true ;
this . _debug ( ` Exit code ${ code } received from tool ' ${ this . toolPath } ' ` ) ;
state . CheckComplete ( ) ;
} ) ;
cp . on ( 'close' , ( code ) => {
state . processExitCode = code ;
state . processExited = true ;
state . processClosed = true ;
this . _debug ( ` STDIO streams have closed for tool ' ${ this . toolPath } ' ` ) ;
state . CheckComplete ( ) ;
} ) ;
state . on ( 'done' , ( error , exitCode ) => {
if ( stdbuffer . length > 0 ) {
this . emit ( 'stdline' , stdbuffer ) ;
}
if ( errbuffer . length > 0 ) {
this . emit ( 'errline' , errbuffer ) ;
}
cp . removeAllListeners ( ) ;
if ( error ) {
reject ( error ) ;
}
else {
resolve ( exitCode ) ;
}
} ) ;
if ( this . options . input ) {
if ( ! cp . stdin ) {
throw new Error ( 'child process missing stdin' ) ;
}
cp . stdin . end ( this . options . input ) ;
}
2021-06-22 08:00:24 +00:00
} ) ) ;
2020-08-15 12:45:36 +00:00
} ) ;
}
}
exports . ToolRunner = ToolRunner ;
/ * *
* Convert an arg string to an array of args . Handles escaping
*
* @ param argString string of arguments
* @ returns string [ ] array of arguments
* /
function argStringToArray ( argString ) {
const args = [ ] ;
let inQuotes = false ;
let escaped = false ;
let arg = '' ;
function append ( c ) {
// we only escape double quotes.
if ( escaped && c !== '"' ) {
arg += '\\' ;
}
arg += c ;
escaped = false ;
}
for ( let i = 0 ; i < argString . length ; i ++ ) {
const c = argString . charAt ( i ) ;
if ( c === '"' ) {
if ( ! escaped ) {
inQuotes = ! inQuotes ;
}
else {
append ( c ) ;
}
continue ;
}
if ( c === '\\' && escaped ) {
append ( c ) ;
continue ;
}
if ( c === '\\' && inQuotes ) {
escaped = true ;
continue ;
}
if ( c === ' ' && ! inQuotes ) {
if ( arg . length > 0 ) {
args . push ( arg ) ;
arg = '' ;
}
continue ;
}
append ( c ) ;
}
if ( arg . length > 0 ) {
args . push ( arg . trim ( ) ) ;
}
return args ;
}
exports . argStringToArray = argStringToArray ;
class ExecState extends events . EventEmitter {
constructor ( options , toolPath ) {
super ( ) ;
this . processClosed = false ; // tracks whether the process has exited and stdio is closed
this . processError = '' ;
this . processExitCode = 0 ;
this . processExited = false ; // tracks whether the process has exited
this . processStderr = false ; // tracks whether stderr was written to
this . delay = 10000 ; // 10 seconds
this . done = false ;
this . timeout = null ;
if ( ! toolPath ) {
throw new Error ( 'toolPath must not be empty' ) ;
}
this . options = options ;
this . toolPath = toolPath ;
if ( options . delay ) {
this . delay = options . delay ;
}
}
CheckComplete ( ) {
if ( this . done ) {
return ;
}
if ( this . processClosed ) {
this . _setResult ( ) ;
}
else if ( this . processExited ) {
2021-06-22 08:00:24 +00:00
this . timeout = timers _1 . setTimeout ( ExecState . HandleTimeout , this . delay , this ) ;
2020-08-15 12:45:36 +00:00
}
}
_debug ( message ) {
this . emit ( 'debug' , message ) ;
}
_setResult ( ) {
// determine whether there is an error
let error ;
if ( this . processExited ) {
if ( this . processError ) {
error = new Error ( ` There was an error when attempting to execute the process ' ${ this . toolPath } '. This may indicate the process failed to start. Error: ${ this . processError } ` ) ;
}
else if ( this . processExitCode !== 0 && ! this . options . ignoreReturnCode ) {
error = new Error ( ` The process ' ${ this . toolPath } ' failed with exit code ${ this . processExitCode } ` ) ;
}
else if ( this . processStderr && this . options . failOnStdErr ) {
error = new Error ( ` The process ' ${ this . toolPath } ' failed because one or more lines were written to the STDERR stream ` ) ;
}
}
// clear the timeout
if ( this . timeout ) {
clearTimeout ( this . timeout ) ;
this . timeout = null ;
}
this . done = true ;
this . emit ( 'done' , error , this . processExitCode ) ;
}
static HandleTimeout ( state ) {
if ( state . done ) {
return ;
}
if ( ! state . processClosed && state . processExited ) {
const message = ` The STDIO streams did not close within ${ state . delay /
1000 } seconds of the exit event from process '${state.toolPath}' . This may indicate a child process inherited the STDIO streams and has not yet exited . ` ;
state . _debug ( message ) ;
}
state . _setResult ( ) ;
}
}
//# sourceMappingURL=toolrunner.js.map
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 179 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const Range = _ _webpack _require _ _ ( 828 )
const gt = _ _webpack _require _ _ ( 123 )
const minVersion = ( range , loose ) => {
range = new Range ( range , loose )
let minver = new SemVer ( '0.0.0' )
if ( range . test ( minver ) ) {
return minver
}
minver = new SemVer ( '0.0.0-0' )
if ( range . test ( minver ) ) {
return minver
}
minver = null
for ( let i = 0 ; i < range . set . length ; ++ i ) {
const comparators = range . set [ i ]
2021-05-24 22:44:03 +00:00
let setMin = null
2020-08-21 12:45:16 +00:00
comparators . forEach ( ( comparator ) => {
// Clone to avoid manipulating the comparator's semver object.
const compver = new SemVer ( comparator . semver . version )
switch ( comparator . operator ) {
case '>' :
if ( compver . prerelease . length === 0 ) {
compver . patch ++
} else {
compver . prerelease . push ( 0 )
}
compver . raw = compver . format ( )
/* fallthrough */
case '' :
case '>=' :
2021-05-24 22:44:03 +00:00
if ( ! setMin || gt ( compver , setMin ) ) {
setMin = compver
2020-08-21 12:45:16 +00:00
}
break
case '<' :
case '<=' :
/* Ignore maximum versions */
break
/* istanbul ignore next */
default :
throw new Error ( ` Unexpected operation: ${ comparator . operator } ` )
}
} )
2021-05-24 22:44:03 +00:00
if ( setMin && ( ! minver || gt ( minver , setMin ) ) )
minver = setMin
2020-08-21 12:45:16 +00:00
}
if ( minver && range . test ( minver ) ) {
return minver
}
return null
}
module . exports = minVersion
2020-08-15 12:45:36 +00:00
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 186 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
2020-08-20 13:59:36 +00:00
"use strict" ;
2021-05-24 23:08:08 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-20 13:59:36 +00:00
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-06-22 07:47:22 +00:00
exports . getState = exports . saveState = exports . group = exports . endGroup = exports . startGroup = exports . info = exports . warning = exports . error = exports . debug = exports . isDebug = exports . setFailed = exports . setCommandEcho = exports . setOutput = exports . getBooleanInput = exports . getMultilineInput = exports . getInput = exports . addPath = exports . setSecret = exports . exportVariable = exports . ExitCode = void 0 ;
2020-08-21 11:33:37 +00:00
const command _1 = _ _webpack _require _ _ ( 351 ) ;
2020-10-01 17:31:10 +00:00
const file _command _1 = _ _webpack _require _ _ ( 717 ) ;
const utils _1 = _ _webpack _require _ _ ( 278 ) ;
2020-08-21 11:33:37 +00:00
const os = _ _importStar ( _ _webpack _require _ _ ( 87 ) ) ;
const path = _ _importStar ( _ _webpack _require _ _ ( 622 ) ) ;
/ * *
* The code to exit an action
* /
var ExitCode ;
( function ( ExitCode ) {
/ * *
* A code indicating that the action was successful
* /
ExitCode [ ExitCode [ "Success" ] = 0 ] = "Success" ;
/ * *
* A code indicating that the action was a failure
* /
ExitCode [ ExitCode [ "Failure" ] = 1 ] = "Failure" ;
} ) ( ExitCode = exports . ExitCode || ( exports . ExitCode = { } ) ) ;
//-----------------------------------------------------------------------
// Variables
//-----------------------------------------------------------------------
/ * *
* Sets env variable for this action and future actions in the job
* @ param name the name of the variable to set
* @ param val the value of the variable . Non - string values will be converted to a string via JSON . stringify
* /
// eslint-disable-next-line @typescript-eslint/no-explicit-any
function exportVariable ( name , val ) {
2020-10-01 17:31:10 +00:00
const convertedVal = utils _1 . toCommandValue ( val ) ;
2020-08-21 11:33:37 +00:00
process . env [ name ] = convertedVal ;
2020-10-01 17:31:10 +00:00
const filePath = process . env [ 'GITHUB_ENV' ] || '' ;
if ( filePath ) {
const delimiter = '_GitHubActionsFileCommandDelimeter_' ;
const commandValue = ` ${ name } << ${ delimiter } ${ os . EOL } ${ convertedVal } ${ os . EOL } ${ delimiter } ` ;
file _command _1 . issueCommand ( 'ENV' , commandValue ) ;
}
else {
command _1 . issueCommand ( 'set-env' , { name } , convertedVal ) ;
}
2020-08-21 11:33:37 +00:00
}
exports . exportVariable = exportVariable ;
/ * *
* Registers a secret which will get masked from logs
* @ param secret value of the secret
* /
function setSecret ( secret ) {
command _1 . issueCommand ( 'add-mask' , { } , secret ) ;
}
exports . setSecret = setSecret ;
/ * *
* Prepends inputPath to the PATH ( for this action and future actions )
* @ param inputPath
* /
function addPath ( inputPath ) {
2020-10-01 17:31:10 +00:00
const filePath = process . env [ 'GITHUB_PATH' ] || '' ;
if ( filePath ) {
file _command _1 . issueCommand ( 'PATH' , inputPath ) ;
}
else {
command _1 . issueCommand ( 'add-path' , { } , inputPath ) ;
}
2020-08-21 11:33:37 +00:00
process . env [ 'PATH' ] = ` ${ inputPath } ${ path . delimiter } ${ process . env [ 'PATH' ] } ` ;
}
exports . addPath = addPath ;
/ * *
2021-05-24 23:08:08 +00:00
* Gets the value of an input .
* Unless trimWhitespace is set to false in InputOptions , the value is also trimmed .
* Returns an empty string if the value is not defined .
2020-08-21 11:33:37 +00:00
*
* @ param name name of the input to get
* @ param options optional . See InputOptions .
* @ returns string
* /
function getInput ( name , options ) {
const val = process . env [ ` INPUT_ ${ name . replace ( / /g , '_' ) . toUpperCase ( ) } ` ] || '' ;
if ( options && options . required && ! val ) {
throw new Error ( ` Input required and not supplied: ${ name } ` ) ;
}
2021-05-24 23:08:08 +00:00
if ( options && options . trimWhitespace === false ) {
return val ;
}
2020-08-21 11:33:37 +00:00
return val . trim ( ) ;
}
exports . getInput = getInput ;
2021-06-22 07:47:22 +00:00
/ * *
* Gets the values of an multiline input . Each value is also trimmed .
*
* @ param name name of the input to get
* @ param options optional . See InputOptions .
* @ returns string [ ]
*
* /
function getMultilineInput ( name , options ) {
const inputs = getInput ( name , options )
. split ( '\n' )
. filter ( x => x !== '' ) ;
return inputs ;
}
exports . getMultilineInput = getMultilineInput ;
2021-05-24 23:08:08 +00:00
/ * *
* Gets the input value of the boolean type in the YAML 1.2 "core schema" specification .
* Support boolean input list : ` true | True | TRUE | false | False | FALSE ` .
* The return value is also in boolean type .
* ref : https : //yaml.org/spec/1.2/spec.html#id2804923
*
* @ param name name of the input to get
* @ param options optional . See InputOptions .
* @ returns boolean
* /
function getBooleanInput ( name , options ) {
const trueValue = [ 'true' , 'True' , 'TRUE' ] ;
const falseValue = [ 'false' , 'False' , 'FALSE' ] ;
const val = getInput ( name , options ) ;
if ( trueValue . includes ( val ) )
return true ;
if ( falseValue . includes ( val ) )
return false ;
throw new TypeError ( ` Input does not meet YAML 1.2 "Core Schema" specification: ${ name } \n ` +
` Support boolean input list: \` true | True | TRUE | false | False | FALSE \` ` ) ;
}
exports . getBooleanInput = getBooleanInput ;
2020-08-21 11:33:37 +00:00
/ * *
* Sets the value of an output .
*
* @ param name name of the output to set
* @ param value value to store . Non - string values will be converted to a string via JSON . stringify
* /
// eslint-disable-next-line @typescript-eslint/no-explicit-any
function setOutput ( name , value ) {
2021-05-24 23:08:08 +00:00
process . stdout . write ( os . EOL ) ;
2020-08-21 11:33:37 +00:00
command _1 . issueCommand ( 'set-output' , { name } , value ) ;
}
exports . setOutput = setOutput ;
/ * *
* Enables or disables the echoing of commands into stdout for the rest of the step .
* Echoing is disabled by default if ACTIONS _STEP _DEBUG is not set .
*
* /
function setCommandEcho ( enabled ) {
command _1 . issue ( 'echo' , enabled ? 'on' : 'off' ) ;
}
exports . setCommandEcho = setCommandEcho ;
//-----------------------------------------------------------------------
// Results
//-----------------------------------------------------------------------
/ * *
* Sets the action status to failed .
* When the action exits it will be with an exit code of 1
* @ param message add error issue message
* /
function setFailed ( message ) {
process . exitCode = ExitCode . Failure ;
error ( message ) ;
}
exports . setFailed = setFailed ;
//-----------------------------------------------------------------------
// Logging Commands
//-----------------------------------------------------------------------
/ * *
* Gets whether Actions Step Debug is on or not
* /
function isDebug ( ) {
return process . env [ 'RUNNER_DEBUG' ] === '1' ;
}
exports . isDebug = isDebug ;
/ * *
* Writes debug message to user log
* @ param message debug message
* /
function debug ( message ) {
command _1 . issueCommand ( 'debug' , { } , message ) ;
}
exports . debug = debug ;
/ * *
* Adds an error issue
* @ param message error issue message . Errors will be converted to string via toString ( )
* /
function error ( message ) {
command _1 . issue ( 'error' , message instanceof Error ? message . toString ( ) : message ) ;
}
exports . error = error ;
/ * *
* Adds an warning issue
* @ param message warning issue message . Errors will be converted to string via toString ( )
* /
function warning ( message ) {
command _1 . issue ( 'warning' , message instanceof Error ? message . toString ( ) : message ) ;
}
exports . warning = warning ;
/ * *
* Writes info to log with console . log .
* @ param message info message
* /
function info ( message ) {
process . stdout . write ( message + os . EOL ) ;
}
exports . info = info ;
/ * *
* Begin an output group .
*
* Output until the next ` groupEnd ` will be foldable in this group
*
* @ param name The name of the output group
* /
function startGroup ( name ) {
command _1 . issue ( 'group' , name ) ;
}
exports . startGroup = startGroup ;
/ * *
* End an output group .
* /
function endGroup ( ) {
command _1 . issue ( 'endgroup' ) ;
}
exports . endGroup = endGroup ;
/ * *
* Wrap an asynchronous function call in a group .
*
* Returns the same type as the function itself .
*
* @ param name The name of the group
* @ param fn The function to wrap in the group
* /
function group ( name , fn ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
startGroup ( name ) ;
let result ;
try {
result = yield fn ( ) ;
}
finally {
endGroup ( ) ;
}
return result ;
} ) ;
}
exports . group = group ;
//-----------------------------------------------------------------------
// Wrapper action state
//-----------------------------------------------------------------------
/ * *
* Saves state for current action , the state can only be retrieved by this action ' s post job execution .
*
* @ param name name of the state to store
* @ param value value to store . Non - string values will be converted to a string via JSON . stringify
* /
// eslint-disable-next-line @typescript-eslint/no-explicit-any
function saveState ( name , value ) {
command _1 . issueCommand ( 'save-state' , { name } , value ) ;
}
exports . saveState = saveState ;
/ * *
* Gets the value of an state set by this action ' s main execution .
*
* @ param name name of the state to get
* @ returns string
* /
function getState ( name ) {
return process . env [ ` STATE_ ${ name } ` ] || '' ;
}
exports . getState = getState ;
//# sourceMappingURL=core.js.map
2020-08-15 12:45:36 +00:00
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 194 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const lt = ( a , b , loose ) => compare ( a , b , loose ) < 0
module . exports = lt
2021-06-22 08:00:24 +00:00
/***/ } ) ,
/***/ 213 :
/***/ ( function ( module ) {
module . exports = require ( "timers" ) ;
2020-10-01 17:31:10 +00:00
/***/ } ) ,
/***/ 278 :
/***/ ( function ( _ _unusedmodule , exports ) {
"use strict" ;
// We use any as a valid input type
/* eslint-disable @typescript-eslint/no-explicit-any */
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-05-24 23:08:08 +00:00
exports . toCommandValue = void 0 ;
2020-10-01 17:31:10 +00:00
/ * *
* Sanitizes an input into a string so it can be passed into issueCommand safely
* @ param input input to sanitize into a string
* /
function toCommandValue ( input ) {
if ( input === null || input === undefined ) {
return '' ;
}
else if ( typeof input === 'string' || input instanceof String ) {
return input ;
}
return JSON . stringify ( input ) ;
}
exports . toCommandValue = toCommandValue ;
//# sourceMappingURL=utils.js.map
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 293 :
/***/ ( function ( module ) {
// Note: this is the semver.org version of the spec that it implements
// Not necessarily the package version of this code.
const SEMVER _SPEC _VERSION = '2.0.0'
const MAX _LENGTH = 256
const MAX _SAFE _INTEGER = Number . MAX _SAFE _INTEGER ||
/* istanbul ignore next */ 9007199254740991
// Max safe segment length for coercion.
const MAX _SAFE _COMPONENT _LENGTH = 16
module . exports = {
SEMVER _SPEC _VERSION ,
MAX _LENGTH ,
MAX _SAFE _INTEGER ,
MAX _SAFE _COMPONENT _LENGTH
}
/***/ } ) ,
/***/ 297 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const parse = _ _webpack _require _ _ ( 925 )
const eq = _ _webpack _require _ _ ( 898 )
const diff = ( version1 , version2 ) => {
if ( eq ( version1 , version2 ) ) {
return null
} else {
const v1 = parse ( version1 )
const v2 = parse ( version2 )
const hasPre = v1 . prerelease . length || v2 . prerelease . length
const prefix = hasPre ? 'pre' : ''
const defaultResult = hasPre ? 'prerelease' : ''
for ( const key in v1 ) {
if ( key === 'major' || key === 'minor' || key === 'patch' ) {
if ( v1 [ key ] !== v2 [ key ] ) {
return prefix + key
}
}
}
return defaultResult // may be undefined
}
}
module . exports = diff
2021-06-22 08:00:24 +00:00
/***/ } ) ,
/***/ 304 :
/***/ ( function ( module ) {
module . exports = require ( "string_decoder" ) ;
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 309 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const compare = ( a , b , loose ) =>
new SemVer ( a , loose ) . compare ( new SemVer ( b , loose ) )
module . exports = compare
/***/ } ) ,
/***/ 323 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const outside = _ _webpack _require _ _ ( 420 )
// Determine if version is less than all the versions possible in the range
const ltr = ( version , range , options ) => outside ( version , range , '<' , options )
module . exports = ltr
2020-08-15 12:45:36 +00:00
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 351 :
2020-08-15 12:45:36 +00:00
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2021-05-24 23:08:08 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
2020-08-15 12:45:36 +00:00
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
2021-05-24 23:08:08 +00:00
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
2020-08-15 12:45:36 +00:00
return result ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-05-24 23:08:08 +00:00
exports . issue = exports . issueCommand = void 0 ;
2020-08-21 11:33:37 +00:00
const os = _ _importStar ( _ _webpack _require _ _ ( 87 ) ) ;
2020-10-01 17:31:10 +00:00
const utils _1 = _ _webpack _require _ _ ( 278 ) ;
2020-08-21 11:33:37 +00:00
/ * *
* Commands
*
* Command Format :
* : : name key = value , key = value : : message
*
* Examples :
* : : warning : : This is the message
* : : set - env name = MY _VAR : : some value
* /
function issueCommand ( command , properties , message ) {
const cmd = new Command ( command , properties , message ) ;
process . stdout . write ( cmd . toString ( ) + os . EOL ) ;
}
exports . issueCommand = issueCommand ;
function issue ( name , message = '' ) {
issueCommand ( name , { } , message ) ;
}
exports . issue = issue ;
const CMD _STRING = '::' ;
class Command {
constructor ( command , properties , message ) {
if ( ! command ) {
command = 'missing.command' ;
}
this . command = command ;
this . properties = properties ;
this . message = message ;
}
toString ( ) {
let cmdStr = CMD _STRING + this . command ;
if ( this . properties && Object . keys ( this . properties ) . length > 0 ) {
cmdStr += ' ' ;
let first = true ;
for ( const key in this . properties ) {
if ( this . properties . hasOwnProperty ( key ) ) {
const val = this . properties [ key ] ;
if ( val ) {
if ( first ) {
first = false ;
}
else {
cmdStr += ',' ;
}
cmdStr += ` ${ key } = ${ escapeProperty ( val ) } ` ;
}
}
}
}
cmdStr += ` ${ CMD _STRING } ${ escapeData ( this . message ) } ` ;
return cmdStr ;
}
}
function escapeData ( s ) {
2020-10-01 17:31:10 +00:00
return utils _1 . toCommandValue ( s )
2020-08-21 11:33:37 +00:00
. replace ( /%/g , '%25' )
. replace ( /\r/g , '%0D' )
. replace ( /\n/g , '%0A' ) ;
}
function escapeProperty ( s ) {
2020-10-01 17:31:10 +00:00
return utils _1 . toCommandValue ( s )
2020-08-21 11:33:37 +00:00
. replace ( /%/g , '%25' )
. replace ( /\r/g , '%0D' )
. replace ( /\n/g , '%0A' )
. replace ( /:/g , '%3A' )
. replace ( /,/g , '%2C' ) ;
}
//# sourceMappingURL=command.js.map
/***/ } ) ,
/***/ 357 :
/***/ ( function ( module ) {
module . exports = require ( "assert" ) ;
/***/ } ) ,
2020-08-21 12:45:16 +00:00
/***/ 380 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
2020-08-21 11:33:37 +00:00
2020-08-21 12:45:16 +00:00
// Determine if version is greater than all the versions possible in the range.
const outside = _ _webpack _require _ _ ( 420 )
const gtr = ( version , range , options ) => outside ( version , range , '>' , options )
module . exports = gtr
/***/ } ) ,
/***/ 383 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
// just pre-load all the stuff that index.js lazily exports
const internalRe = _ _webpack _require _ _ ( 523 )
module . exports = {
re : internalRe . re ,
src : internalRe . src ,
tokens : internalRe . t ,
SEMVER _SPEC _VERSION : _ _webpack _require _ _ ( 293 ) . SEMVER _SPEC _VERSION ,
SemVer : _ _webpack _require _ _ ( 88 ) ,
compareIdentifiers : _ _webpack _require _ _ ( 463 ) . compareIdentifiers ,
rcompareIdentifiers : _ _webpack _require _ _ ( 463 ) . rcompareIdentifiers ,
parse : _ _webpack _require _ _ ( 925 ) ,
valid : _ _webpack _require _ _ ( 601 ) ,
clean : _ _webpack _require _ _ ( 848 ) ,
inc : _ _webpack _require _ _ ( 900 ) ,
diff : _ _webpack _require _ _ ( 297 ) ,
major : _ _webpack _require _ _ ( 688 ) ,
minor : _ _webpack _require _ _ ( 447 ) ,
patch : _ _webpack _require _ _ ( 866 ) ,
prerelease : _ _webpack _require _ _ ( 16 ) ,
compare : _ _webpack _require _ _ ( 309 ) ,
rcompare : _ _webpack _require _ _ ( 417 ) ,
compareLoose : _ _webpack _require _ _ ( 804 ) ,
compareBuild : _ _webpack _require _ _ ( 156 ) ,
sort : _ _webpack _require _ _ ( 426 ) ,
rsort : _ _webpack _require _ _ ( 701 ) ,
gt : _ _webpack _require _ _ ( 123 ) ,
lt : _ _webpack _require _ _ ( 194 ) ,
eq : _ _webpack _require _ _ ( 898 ) ,
neq : _ _webpack _require _ _ ( 17 ) ,
gte : _ _webpack _require _ _ ( 522 ) ,
lte : _ _webpack _require _ _ ( 520 ) ,
cmp : _ _webpack _require _ _ ( 98 ) ,
coerce : _ _webpack _require _ _ ( 466 ) ,
Comparator : _ _webpack _require _ _ ( 532 ) ,
Range : _ _webpack _require _ _ ( 828 ) ,
satisfies : _ _webpack _require _ _ ( 55 ) ,
toComparators : _ _webpack _require _ _ ( 706 ) ,
maxSatisfying : _ _webpack _require _ _ ( 579 ) ,
minSatisfying : _ _webpack _require _ _ ( 832 ) ,
minVersion : _ _webpack _require _ _ ( 179 ) ,
validRange : _ _webpack _require _ _ ( 741 ) ,
outside : _ _webpack _require _ _ ( 420 ) ,
gtr : _ _webpack _require _ _ ( 380 ) ,
ltr : _ _webpack _require _ _ ( 323 ) ,
intersects : _ _webpack _require _ _ ( 8 ) ,
simplifyRange : _ _webpack _require _ _ ( 561 ) ,
subset : _ _webpack _require _ _ ( 863 ) ,
}
/***/ } ) ,
/***/ 417 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const rcompare = ( a , b , loose ) => compare ( b , a , loose )
module . exports = rcompare
/***/ } ) ,
/***/ 420 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const Comparator = _ _webpack _require _ _ ( 532 )
const { ANY } = Comparator
const Range = _ _webpack _require _ _ ( 828 )
const satisfies = _ _webpack _require _ _ ( 55 )
const gt = _ _webpack _require _ _ ( 123 )
const lt = _ _webpack _require _ _ ( 194 )
const lte = _ _webpack _require _ _ ( 520 )
const gte = _ _webpack _require _ _ ( 522 )
const outside = ( version , range , hilo , options ) => {
version = new SemVer ( version , options )
range = new Range ( range , options )
let gtfn , ltefn , ltfn , comp , ecomp
switch ( hilo ) {
case '>' :
gtfn = gt
ltefn = lte
ltfn = lt
comp = '>'
ecomp = '>='
break
case '<' :
gtfn = lt
ltefn = gte
ltfn = gt
comp = '<'
ecomp = '<='
break
default :
throw new TypeError ( 'Must provide a hilo val of "<" or ">"' )
}
2021-05-24 22:44:03 +00:00
// If it satisfies the range it is not outside
2020-08-21 12:45:16 +00:00
if ( satisfies ( version , range , options ) ) {
return false
}
// From now on, variable terms are as if we're in "gtr" mode.
// but note that everything is flipped for the "ltr" function.
for ( let i = 0 ; i < range . set . length ; ++ i ) {
const comparators = range . set [ i ]
let high = null
let low = null
comparators . forEach ( ( comparator ) => {
if ( comparator . semver === ANY ) {
comparator = new Comparator ( '>=0.0.0' )
}
high = high || comparator
low = low || comparator
if ( gtfn ( comparator . semver , high . semver , options ) ) {
high = comparator
} else if ( ltfn ( comparator . semver , low . semver , options ) ) {
low = comparator
}
} )
// If the edge version comparator has a operator then our version
// isn't outside it
if ( high . operator === comp || high . operator === ecomp ) {
return false
}
// If the lowest version comparator has an operator and our version
// is less than it then it isn't higher than the range
if ( ( ! low . operator || low . operator === comp ) &&
ltefn ( version , low . semver ) ) {
return false
} else if ( low . operator === ecomp && ltfn ( version , low . semver ) ) {
return false
}
}
return true
}
module . exports = outside
/***/ } ) ,
/***/ 426 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compareBuild = _ _webpack _require _ _ ( 156 )
const sort = ( list , loose ) => list . sort ( ( a , b ) => compareBuild ( a , b , loose ) )
module . exports = sort
/***/ } ) ,
/***/ 427 :
/***/ ( function ( module ) {
const debug = (
typeof process === 'object' &&
process . env &&
process . env . NODE _DEBUG &&
/\bsemver\b/i . test ( process . env . NODE _DEBUG )
) ? ( ... args ) => console . error ( 'SEMVER' , ... args )
: ( ) => { }
module . exports = debug
2020-08-21 11:33:37 +00:00
/***/ } ) ,
/***/ 436 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2021-06-22 07:52:03 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-21 11:33:37 +00:00
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-06-22 07:52:03 +00:00
exports . findInPath = exports . which = exports . mkdirP = exports . rmRF = exports . mv = exports . cp = void 0 ;
const assert _1 = _ _webpack _require _ _ ( 357 ) ;
2021-05-24 22:48:47 +00:00
const childProcess = _ _importStar ( _ _webpack _require _ _ ( 4 ) ) ;
const path = _ _importStar ( _ _webpack _require _ _ ( 622 ) ) ;
2020-08-21 11:33:37 +00:00
const util _1 = _ _webpack _require _ _ ( 669 ) ;
2021-05-24 22:48:47 +00:00
const ioUtil = _ _importStar ( _ _webpack _require _ _ ( 962 ) ) ;
2020-08-21 11:33:37 +00:00
const exec = util _1 . promisify ( childProcess . exec ) ;
2021-06-22 07:52:03 +00:00
const execFile = util _1 . promisify ( childProcess . execFile ) ;
2020-08-21 11:33:37 +00:00
/ * *
* Copies a file or folder .
* Based off of shelljs - https : //github.com/shelljs/shelljs/blob/9237f66c52e5daa40458f94f9565e18e8132f5a6/src/cp.js
*
* @ param source source path
* @ param dest destination path
* @ param options optional . See CopyOptions .
* /
function cp ( source , dest , options = { } ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2021-06-22 07:52:03 +00:00
const { force , recursive , copySourceDirectory } = readCopyOptions ( options ) ;
2020-08-21 11:33:37 +00:00
const destStat = ( yield ioUtil . exists ( dest ) ) ? yield ioUtil . stat ( dest ) : null ;
// Dest is an existing file, but not forcing
if ( destStat && destStat . isFile ( ) && ! force ) {
return ;
}
// If dest is an existing directory, should copy inside.
2021-06-22 07:52:03 +00:00
const newDest = destStat && destStat . isDirectory ( ) && copySourceDirectory
2020-08-21 11:33:37 +00:00
? path . join ( dest , path . basename ( source ) )
: dest ;
if ( ! ( yield ioUtil . exists ( source ) ) ) {
throw new Error ( ` no such file or directory: ${ source } ` ) ;
}
const sourceStat = yield ioUtil . stat ( source ) ;
if ( sourceStat . isDirectory ( ) ) {
if ( ! recursive ) {
throw new Error ( ` Failed to copy. ${ source } is a directory, but tried to copy without recursive flag. ` ) ;
}
else {
yield cpDirRecursive ( source , newDest , 0 , force ) ;
}
}
else {
if ( path . relative ( source , newDest ) === '' ) {
// a file cannot be copied to itself
throw new Error ( ` ' ${ newDest } ' and ' ${ source } ' are the same file ` ) ;
}
yield copyFile ( source , newDest , force ) ;
}
} ) ;
}
exports . cp = cp ;
/ * *
* Moves a path .
*
* @ param source source path
* @ param dest destination path
* @ param options optional . See MoveOptions .
* /
function mv ( source , dest , options = { } ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
if ( yield ioUtil . exists ( dest ) ) {
let destExists = true ;
if ( yield ioUtil . isDirectory ( dest ) ) {
// If dest is directory copy src into dest
dest = path . join ( dest , path . basename ( source ) ) ;
destExists = yield ioUtil . exists ( dest ) ;
}
if ( destExists ) {
if ( options . force == null || options . force ) {
yield rmRF ( dest ) ;
}
else {
throw new Error ( 'Destination already exists' ) ;
}
}
}
yield mkdirP ( path . dirname ( dest ) ) ;
yield ioUtil . rename ( source , dest ) ;
} ) ;
}
exports . mv = mv ;
/ * *
* Remove a path recursively with force
*
* @ param inputPath path to remove
* /
function rmRF ( inputPath ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
if ( ioUtil . IS _WINDOWS ) {
// Node doesn't provide a delete operation, only an unlink function. This means that if the file is being used by another
// program (e.g. antivirus), it won't be deleted. To address this, we shell out the work to rd/del.
2021-06-22 07:52:03 +00:00
// Check for invalid characters
// https://docs.microsoft.com/en-us/windows/win32/fileio/naming-a-file
if ( /[*"<>|]/ . test ( inputPath ) ) {
throw new Error ( 'File path must not contain `*`, `"`, `<`, `>` or `|` on Windows' ) ;
}
2020-08-21 11:33:37 +00:00
try {
2021-06-22 07:52:03 +00:00
const cmdPath = ioUtil . getCmdPath ( ) ;
2020-08-21 11:33:37 +00:00
if ( yield ioUtil . isDirectory ( inputPath , true ) ) {
2021-06-22 07:52:03 +00:00
yield exec ( ` ${ cmdPath } /s /c "rd /s /q "%inputPath%"" ` , {
env : { inputPath }
} ) ;
2020-08-21 11:33:37 +00:00
}
else {
2021-06-22 07:52:03 +00:00
yield exec ( ` ${ cmdPath } /s /c "del /f /a "%inputPath%"" ` , {
env : { inputPath }
} ) ;
2020-08-21 11:33:37 +00:00
}
}
catch ( err ) {
// if you try to delete a file that doesn't exist, desired result is achieved
// other errors are valid
if ( err . code !== 'ENOENT' )
throw err ;
}
// Shelling out fails to remove a symlink folder with missing source, this unlink catches that
try {
yield ioUtil . unlink ( inputPath ) ;
}
catch ( err ) {
// if you try to delete a file that doesn't exist, desired result is achieved
// other errors are valid
if ( err . code !== 'ENOENT' )
throw err ;
}
}
else {
let isDir = false ;
try {
isDir = yield ioUtil . isDirectory ( inputPath ) ;
}
catch ( err ) {
// if you try to delete a file that doesn't exist, desired result is achieved
// other errors are valid
if ( err . code !== 'ENOENT' )
throw err ;
return ;
}
if ( isDir ) {
2021-06-22 07:52:03 +00:00
yield execFile ( ` rm ` , [ ` -rf ` , ` ${ inputPath } ` ] ) ;
2020-08-21 11:33:37 +00:00
}
else {
yield ioUtil . unlink ( inputPath ) ;
}
}
} ) ;
}
exports . rmRF = rmRF ;
/ * *
* Make a directory . Creates the full path with folders in between
* Will throw if it fails
*
* @ param fsPath path to create
* @ returns Promise < void >
* /
function mkdirP ( fsPath ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2021-06-22 07:52:03 +00:00
assert _1 . ok ( fsPath , 'a path argument must be provided' ) ;
yield ioUtil . mkdir ( fsPath , { recursive : true } ) ;
2020-08-21 11:33:37 +00:00
} ) ;
}
exports . mkdirP = mkdirP ;
/ * *
* Returns path of a tool had the tool actually been invoked . Resolves via paths .
* If you check and the tool does not exist , it will throw .
*
* @ param tool name of the tool
* @ param check whether to check if tool exists
* @ returns Promise < string > path to tool
* /
function which ( tool , check ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
if ( ! tool ) {
throw new Error ( "parameter 'tool' is required" ) ;
}
// recursive when check=true
if ( check ) {
const result = yield which ( tool , false ) ;
if ( ! result ) {
if ( ioUtil . IS _WINDOWS ) {
throw new Error ( ` Unable to locate executable file: ${ tool } . Please verify either the file path exists or the file can be found within a directory specified by the PATH environment variable. Also verify the file has a valid extension for an executable file. ` ) ;
}
else {
throw new Error ( ` Unable to locate executable file: ${ tool } . Please verify either the file path exists or the file can be found within a directory specified by the PATH environment variable. Also check the file mode to verify the file is executable. ` ) ;
}
}
2021-05-24 22:48:47 +00:00
return result ;
2020-08-21 11:33:37 +00:00
}
2021-05-24 22:48:47 +00:00
const matches = yield findInPath ( tool ) ;
if ( matches && matches . length > 0 ) {
return matches [ 0 ] ;
}
return '' ;
} ) ;
}
exports . which = which ;
/ * *
* Returns a list of all occurrences of the given tool on the system path .
*
* @ returns Promise < string [ ] > the paths of the tool
* /
function findInPath ( tool ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
if ( ! tool ) {
throw new Error ( "parameter 'tool' is required" ) ;
}
// build the list of extensions to try
const extensions = [ ] ;
if ( ioUtil . IS _WINDOWS && process . env [ 'PATHEXT' ] ) {
for ( const extension of process . env [ 'PATHEXT' ] . split ( path . delimiter ) ) {
if ( extension ) {
extensions . push ( extension ) ;
2020-08-21 11:33:37 +00:00
}
}
2021-05-24 22:48:47 +00:00
}
// if it's rooted, return it if exists. otherwise return empty.
if ( ioUtil . isRooted ( tool ) ) {
const filePath = yield ioUtil . tryGetExecutablePath ( tool , extensions ) ;
if ( filePath ) {
return [ filePath ] ;
2020-08-21 11:33:37 +00:00
}
2021-05-24 22:48:47 +00:00
return [ ] ;
}
// if any path separators, return empty
if ( tool . includes ( path . sep ) ) {
return [ ] ;
}
// build the list of directories
//
// Note, technically "where" checks the current directory on Windows. From a toolkit perspective,
// it feels like we should not do this. Checking the current directory seems like more of a use
// case of a shell, and the which() function exposed by the toolkit should strive for consistency
// across platforms.
const directories = [ ] ;
if ( process . env . PATH ) {
for ( const p of process . env . PATH . split ( path . delimiter ) ) {
if ( p ) {
directories . push ( p ) ;
2020-08-21 11:33:37 +00:00
}
}
}
2021-05-24 22:48:47 +00:00
// find all matches
const matches = [ ] ;
for ( const directory of directories ) {
const filePath = yield ioUtil . tryGetExecutablePath ( path . join ( directory , tool ) , extensions ) ;
if ( filePath ) {
matches . push ( filePath ) ;
}
2020-08-21 11:33:37 +00:00
}
2021-05-24 22:48:47 +00:00
return matches ;
2020-08-21 11:33:37 +00:00
} ) ;
}
2021-05-24 22:48:47 +00:00
exports . findInPath = findInPath ;
2020-08-21 11:33:37 +00:00
function readCopyOptions ( options ) {
const force = options . force == null ? true : options . force ;
const recursive = Boolean ( options . recursive ) ;
2021-06-22 07:52:03 +00:00
const copySourceDirectory = options . copySourceDirectory == null
? true
: Boolean ( options . copySourceDirectory ) ;
return { force , recursive , copySourceDirectory } ;
2020-08-21 11:33:37 +00:00
}
function cpDirRecursive ( sourceDir , destDir , currentDepth , force ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
// Ensure there is not a run away recursive copy
if ( currentDepth >= 255 )
return ;
currentDepth ++ ;
yield mkdirP ( destDir ) ;
const files = yield ioUtil . readdir ( sourceDir ) ;
for ( const fileName of files ) {
const srcFile = ` ${ sourceDir } / ${ fileName } ` ;
const destFile = ` ${ destDir } / ${ fileName } ` ;
const srcFileStat = yield ioUtil . lstat ( srcFile ) ;
if ( srcFileStat . isDirectory ( ) ) {
// Recurse
yield cpDirRecursive ( srcFile , destFile , currentDepth , force ) ;
}
else {
yield copyFile ( srcFile , destFile , force ) ;
}
}
// Change the mode for the newly created directory
yield ioUtil . chmod ( destDir , ( yield ioUtil . stat ( sourceDir ) ) . mode ) ;
} ) ;
}
// Buffered file copy
function copyFile ( srcFile , destFile , force ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
if ( ( yield ioUtil . lstat ( srcFile ) ) . isSymbolicLink ( ) ) {
// unlink/re-link it
try {
yield ioUtil . lstat ( destFile ) ;
yield ioUtil . unlink ( destFile ) ;
}
catch ( e ) {
// Try to override file permission
if ( e . code === 'EPERM' ) {
yield ioUtil . chmod ( destFile , '0666' ) ;
yield ioUtil . unlink ( destFile ) ;
}
// other errors = it doesn't exist, no work to do
}
// Copy over symlink
const symlinkFull = yield ioUtil . readlink ( srcFile ) ;
yield ioUtil . symlink ( symlinkFull , destFile , ioUtil . IS _WINDOWS ? 'junction' : null ) ;
}
else if ( ! ( yield ioUtil . exists ( destFile ) ) || force ) {
yield ioUtil . copyFile ( srcFile , destFile ) ;
}
} ) ;
}
//# sourceMappingURL=io.js.map
2020-08-15 12:45:36 +00:00
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 447 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const minor = ( a , loose ) => new SemVer ( a , loose ) . minor
module . exports = minor
/***/ } ) ,
/***/ 463 :
/***/ ( function ( module ) {
const numeric = /^[0-9]+$/
const compareIdentifiers = ( a , b ) => {
const anum = numeric . test ( a )
const bnum = numeric . test ( b )
if ( anum && bnum ) {
a = + a
b = + b
}
return a === b ? 0
: ( anum && ! bnum ) ? - 1
: ( bnum && ! anum ) ? 1
: a < b ? - 1
: 1
}
const rcompareIdentifiers = ( a , b ) => compareIdentifiers ( b , a )
module . exports = {
compareIdentifiers ,
rcompareIdentifiers
}
/***/ } ) ,
/***/ 466 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const parse = _ _webpack _require _ _ ( 925 )
const { re , t } = _ _webpack _require _ _ ( 523 )
const coerce = ( version , options ) => {
if ( version instanceof SemVer ) {
return version
}
if ( typeof version === 'number' ) {
version = String ( version )
}
if ( typeof version !== 'string' ) {
return null
}
options = options || { }
let match = null
if ( ! options . rtl ) {
match = version . match ( re [ t . COERCE ] )
} else {
// Find the right-most coercible string that does not share
// a terminus with a more left-ward coercible string.
// Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'
//
// Walk through the string checking with a /g regexp
// Manually set the index so as to pick up overlapping matches.
// Stop when we get a match that ends at the string end, since no
// coercible string can be more right-ward without the same terminus.
let next
while ( ( next = re [ t . COERCERTL ] . exec ( version ) ) &&
( ! match || match . index + match [ 0 ] . length !== version . length )
) {
if ( ! match ||
next . index + next [ 0 ] . length !== match . index + match [ 0 ] . length ) {
match = next
}
re [ t . COERCERTL ] . lastIndex = next . index + next [ 1 ] . length + next [ 2 ] . length
}
// leave it in a clean state
re [ t . COERCERTL ] . lastIndex = - 1
}
if ( match === null )
return null
return parse ( ` ${ match [ 2 ] } . ${ match [ 3 ] || '0' } . ${ match [ 4 ] || '0' } ` , options )
}
module . exports = coerce
2020-08-15 12:45:36 +00:00
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 514 :
2020-08-15 12:45:36 +00:00
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2021-06-22 08:00:24 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-15 12:45:36 +00:00
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-06-22 08:00:24 +00:00
exports . getExecOutput = exports . exec = void 0 ;
const string _decoder _1 = _ _webpack _require _ _ ( 304 ) ;
2020-08-21 11:33:37 +00:00
const tr = _ _importStar ( _ _webpack _require _ _ ( 159 ) ) ;
/ * *
* Exec a command .
* Output will be streamed to the live console .
* Returns promise with return code
*
* @ param commandLine command to execute ( can include additional args ) . Must be correctly escaped .
* @ param args optional arguments for tool . Escaping is handled by the lib .
* @ param options optional exec options . See ExecOptions
* @ returns Promise < number > exit code
* /
function exec ( commandLine , args , options ) {
2020-08-15 12:45:36 +00:00
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-08-21 11:33:37 +00:00
const commandArgs = tr . argStringToArray ( commandLine ) ;
if ( commandArgs . length === 0 ) {
throw new Error ( ` Parameter 'commandLine' cannot be null or empty. ` ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
// Path to tool to execute should be first arg
const toolPath = commandArgs [ 0 ] ;
args = commandArgs . slice ( 1 ) . concat ( args || [ ] ) ;
const runner = new tr . ToolRunner ( toolPath , args , options ) ;
return runner . exec ( ) ;
2020-08-15 12:45:36 +00:00
} ) ;
}
2020-08-21 11:33:37 +00:00
exports . exec = exec ;
2021-06-22 08:00:24 +00:00
/ * *
* Exec a command and get the output .
* Output will be streamed to the live console .
* Returns promise with the exit code and collected stdout and stderr
*
* @ param commandLine command to execute ( can include additional args ) . Must be correctly escaped .
* @ param args optional arguments for tool . Escaping is handled by the lib .
* @ param options optional exec options . See ExecOptions
* @ returns Promise < ExecOutput > exit code , stdout , and stderr
* /
function getExecOutput ( commandLine , args , options ) {
var _a , _b ;
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
let stdout = '' ;
let stderr = '' ;
//Using string decoder covers the case where a mult-byte character is split
const stdoutDecoder = new string _decoder _1 . StringDecoder ( 'utf8' ) ;
const stderrDecoder = new string _decoder _1 . StringDecoder ( 'utf8' ) ;
const originalStdoutListener = ( _a = options === null || options === void 0 ? void 0 : options . listeners ) === null || _a === void 0 ? void 0 : _a . stdout ;
const originalStdErrListener = ( _b = options === null || options === void 0 ? void 0 : options . listeners ) === null || _b === void 0 ? void 0 : _b . stderr ;
const stdErrListener = ( data ) => {
stderr += stderrDecoder . write ( data ) ;
if ( originalStdErrListener ) {
originalStdErrListener ( data ) ;
}
} ;
const stdOutListener = ( data ) => {
stdout += stdoutDecoder . write ( data ) ;
if ( originalStdoutListener ) {
originalStdoutListener ( data ) ;
}
} ;
const listeners = Object . assign ( Object . assign ( { } , options === null || options === void 0 ? void 0 : options . listeners ) , { stdout : stdOutListener , stderr : stdErrListener } ) ;
const exitCode = yield exec ( commandLine , args , Object . assign ( Object . assign ( { } , options ) , { listeners } ) ) ;
//flush any remaining characters
stdout += stdoutDecoder . end ( ) ;
stderr += stderrDecoder . end ( ) ;
return {
exitCode ,
stdout ,
stderr
} ;
} ) ;
}
exports . getExecOutput = getExecOutput ;
2020-08-21 11:33:37 +00:00
//# sourceMappingURL=exec.js.map
/***/ } ) ,
2020-08-21 12:45:16 +00:00
/***/ 520 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const lte = ( a , b , loose ) => compare ( a , b , loose ) <= 0
module . exports = lte
2020-08-21 11:33:37 +00:00
/***/ } ) ,
2020-08-21 12:45:16 +00:00
/***/ 522 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const gte = ( a , b , loose ) => compare ( a , b , loose ) >= 0
module . exports = gte
2020-08-21 11:33:37 +00:00
2020-08-15 12:45:36 +00:00
/***/ } ) ,
2020-08-21 12:45:16 +00:00
/***/ 523 :
/***/ ( function ( module , exports , _ _webpack _require _ _ ) {
2020-08-20 14:40:33 +00:00
2020-08-21 12:45:16 +00:00
const { MAX _SAFE _COMPONENT _LENGTH } = _ _webpack _require _ _ ( 293 )
const debug = _ _webpack _require _ _ ( 427 )
exports = module . exports = { }
// The actual regexps go on exports.re
const re = exports . re = [ ]
const src = exports . src = [ ]
const t = exports . t = { }
let R = 0
const createToken = ( name , value , isGlobal ) => {
const index = R ++
debug ( index , value )
t [ name ] = index
src [ index ] = value
re [ index ] = new RegExp ( value , isGlobal ? 'g' : undefined )
}
// The following Regular Expressions can be used for tokenizing,
// validating, and parsing SemVer version strings.
// ## Numeric Identifier
// A single `0`, or a non-zero digit followed by zero or more digits.
createToken ( 'NUMERICIDENTIFIER' , '0|[1-9]\\d*' )
createToken ( 'NUMERICIDENTIFIERLOOSE' , '[0-9]+' )
// ## Non-numeric Identifier
// Zero or more digits, followed by a letter or hyphen, and then zero or
// more letters, digits, or hyphens.
createToken ( 'NONNUMERICIDENTIFIER' , '\\d*[a-zA-Z-][a-zA-Z0-9-]*' )
// ## Main Version
// Three dot-separated numeric identifiers.
createToken ( 'MAINVERSION' , ` ( ${ src [ t . NUMERICIDENTIFIER ] } ) \\ . ` +
` ( ${ src [ t . NUMERICIDENTIFIER ] } ) \\ . ` +
` ( ${ src [ t . NUMERICIDENTIFIER ] } ) ` )
createToken ( 'MAINVERSIONLOOSE' , ` ( ${ src [ t . NUMERICIDENTIFIERLOOSE ] } ) \\ . ` +
` ( ${ src [ t . NUMERICIDENTIFIERLOOSE ] } ) \\ . ` +
` ( ${ src [ t . NUMERICIDENTIFIERLOOSE ] } ) ` )
// ## Pre-release Version Identifier
// A numeric identifier, or a non-numeric identifier.
createToken ( 'PRERELEASEIDENTIFIER' , ` (?: ${ src [ t . NUMERICIDENTIFIER ]
} | $ { src [ t . NONNUMERICIDENTIFIER ] } ) ` )
createToken ( 'PRERELEASEIDENTIFIERLOOSE' , ` (?: ${ src [ t . NUMERICIDENTIFIERLOOSE ]
} | $ { src [ t . NONNUMERICIDENTIFIER ] } ) ` )
// ## Pre-release Version
// Hyphen, followed by one or more dot-separated pre-release version
// identifiers.
createToken ( 'PRERELEASE' , ` (?:-( ${ src [ t . PRERELEASEIDENTIFIER ]
} ( ? : \ \ . $ { src [ t . PRERELEASEIDENTIFIER ] } ) * ) ) ` )
createToken ( 'PRERELEASELOOSE' , ` (?:-?( ${ src [ t . PRERELEASEIDENTIFIERLOOSE ]
} ( ? : \ \ . $ { src [ t . PRERELEASEIDENTIFIERLOOSE ] } ) * ) ) ` )
// ## Build Metadata Identifier
// Any combination of digits, letters, or hyphens.
createToken ( 'BUILDIDENTIFIER' , '[0-9A-Za-z-]+' )
// ## Build Metadata
// Plus sign, followed by one or more period-separated build metadata
// identifiers.
createToken ( 'BUILD' , ` (?: \\ +( ${ src [ t . BUILDIDENTIFIER ]
} ( ? : \ \ . $ { src [ t . BUILDIDENTIFIER ] } ) * ) ) ` )
// ## Full Version String
// A main version, followed optionally by a pre-release version and
// build metadata.
// Note that the only major, minor, patch, and pre-release sections of
// the version string are capturing groups. The build metadata is not a
// capturing group, because it should not ever be used in version
// comparison.
createToken ( 'FULLPLAIN' , ` v? ${ src [ t . MAINVERSION ]
} $ { src [ t . PRERELEASE ] } ? $ {
src [ t . BUILD ] } ? ` )
createToken ( 'FULL' , ` ^ ${ src [ t . FULLPLAIN ] } $ ` )
// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.
// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty
// common in the npm registry.
createToken ( 'LOOSEPLAIN' , ` [v= \\ s]* ${ src [ t . MAINVERSIONLOOSE ]
} $ { src [ t . PRERELEASELOOSE ] } ? $ {
src [ t . BUILD ] } ? ` )
createToken ( 'LOOSE' , ` ^ ${ src [ t . LOOSEPLAIN ] } $ ` )
createToken ( 'GTLT' , '((?:<|>)?=?)' )
// Something like "2.*" or "1.2.x".
// Note that "x.x" is a valid xRange identifer, meaning "any version"
// Only the first item is strictly required.
createToken ( 'XRANGEIDENTIFIERLOOSE' , ` ${ src [ t . NUMERICIDENTIFIERLOOSE ] } |x|X| \\ * ` )
createToken ( 'XRANGEIDENTIFIER' , ` ${ src [ t . NUMERICIDENTIFIER ] } |x|X| \\ * ` )
createToken ( 'XRANGEPLAIN' , ` [v= \\ s]*( ${ src [ t . XRANGEIDENTIFIER ] } ) ` +
` (?: \\ .( ${ src [ t . XRANGEIDENTIFIER ] } ) ` +
` (?: \\ .( ${ src [ t . XRANGEIDENTIFIER ] } ) ` +
` (?: ${ src [ t . PRERELEASE ] } )? ${
src [ t . BUILD ] } ? ` +
` )?)? ` )
createToken ( 'XRANGEPLAINLOOSE' , ` [v= \\ s]*( ${ src [ t . XRANGEIDENTIFIERLOOSE ] } ) ` +
` (?: \\ .( ${ src [ t . XRANGEIDENTIFIERLOOSE ] } ) ` +
` (?: \\ .( ${ src [ t . XRANGEIDENTIFIERLOOSE ] } ) ` +
` (?: ${ src [ t . PRERELEASELOOSE ] } )? ${
src [ t . BUILD ] } ? ` +
` )?)? ` )
createToken ( 'XRANGE' , ` ^ ${ src [ t . GTLT ] } \\ s* ${ src [ t . XRANGEPLAIN ] } $ ` )
createToken ( 'XRANGELOOSE' , ` ^ ${ src [ t . GTLT ] } \\ s* ${ src [ t . XRANGEPLAINLOOSE ] } $ ` )
// Coercion.
// Extract anything that could conceivably be a part of a valid semver
createToken ( 'COERCE' , ` ${ '(^|[^\\d])' +
'(\\d{1,' } $ { MAX _SAFE _COMPONENT _LENGTH } } ) ` +
` (?: \\ .( \\ d{1, ${ MAX _SAFE _COMPONENT _LENGTH } }))? ` +
` (?: \\ .( \\ d{1, ${ MAX _SAFE _COMPONENT _LENGTH } }))? ` +
` (?: $ |[^ \\ d]) ` )
createToken ( 'COERCERTL' , src [ t . COERCE ] , true )
// Tilde ranges.
// Meaning is "reasonably at or greater than"
createToken ( 'LONETILDE' , '(?:~>?)' )
createToken ( 'TILDETRIM' , ` ( \\ s*) ${ src [ t . LONETILDE ] } \\ s+ ` , true )
exports . tildeTrimReplace = '$1~'
createToken ( 'TILDE' , ` ^ ${ src [ t . LONETILDE ] } ${ src [ t . XRANGEPLAIN ] } $ ` )
createToken ( 'TILDELOOSE' , ` ^ ${ src [ t . LONETILDE ] } ${ src [ t . XRANGEPLAINLOOSE ] } $ ` )
// Caret ranges.
// Meaning is "at least and backwards compatible with"
createToken ( 'LONECARET' , '(?:\\^)' )
createToken ( 'CARETTRIM' , ` ( \\ s*) ${ src [ t . LONECARET ] } \\ s+ ` , true )
exports . caretTrimReplace = '$1^'
createToken ( 'CARET' , ` ^ ${ src [ t . LONECARET ] } ${ src [ t . XRANGEPLAIN ] } $ ` )
createToken ( 'CARETLOOSE' , ` ^ ${ src [ t . LONECARET ] } ${ src [ t . XRANGEPLAINLOOSE ] } $ ` )
// A simple gt/lt/eq thing, or just "" to indicate "any version"
createToken ( 'COMPARATORLOOSE' , ` ^ ${ src [ t . GTLT ] } \\ s*( ${ src [ t . LOOSEPLAIN ] } ) $ |^ $ ` )
createToken ( 'COMPARATOR' , ` ^ ${ src [ t . GTLT ] } \\ s*( ${ src [ t . FULLPLAIN ] } ) $ |^ $ ` )
// An expression to strip any whitespace between the gtlt and the thing
// it modifies, so that `> 1.2.3` ==> `>1.2.3`
createToken ( 'COMPARATORTRIM' , ` ( \\ s*) ${ src [ t . GTLT ]
} \ \ s * ( $ { src [ t . LOOSEPLAIN ] } | $ { src [ t . XRANGEPLAIN ] } ) ` , true)
exports . comparatorTrimReplace = '$1$2$3'
// Something like `1.2.3 - 1.2.4`
// Note that these all use the loose form, because they'll be
// checked against either the strict or loose comparator form
// later.
createToken ( 'HYPHENRANGE' , ` ^ \\ s*( ${ src [ t . XRANGEPLAIN ] } ) ` +
` \\ s+- \\ s+ ` +
` ( ${ src [ t . XRANGEPLAIN ] } ) ` +
` \\ s* $ ` )
createToken ( 'HYPHENRANGELOOSE' , ` ^ \\ s*( ${ src [ t . XRANGEPLAINLOOSE ] } ) ` +
` \\ s+- \\ s+ ` +
` ( ${ src [ t . XRANGEPLAINLOOSE ] } ) ` +
` \\ s* $ ` )
// Star ranges basically just allow anything at all.
createToken ( 'STAR' , '(<|>)?=?\\s*\\*' )
// >=0.0.0 is like a star
createToken ( 'GTE0' , '^\\s*>=\\s*0\.0\.0\\s*$' )
createToken ( 'GTE0PRE' , '^\\s*>=\\s*0\.0\.0-0\\s*$' )
/***/ } ) ,
/***/ 532 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const ANY = Symbol ( 'SemVer ANY' )
// hoisted class for cyclic dependency
class Comparator {
static get ANY ( ) {
return ANY
}
constructor ( comp , options ) {
2021-05-24 22:44:03 +00:00
options = parseOptions ( options )
2020-08-21 12:45:16 +00:00
if ( comp instanceof Comparator ) {
if ( comp . loose === ! ! options . loose ) {
return comp
} else {
comp = comp . value
}
}
debug ( 'comparator' , comp , options )
this . options = options
this . loose = ! ! options . loose
this . parse ( comp )
if ( this . semver === ANY ) {
this . value = ''
} else {
this . value = this . operator + this . semver . version
}
debug ( 'comp' , this )
}
parse ( comp ) {
const r = this . options . loose ? re [ t . COMPARATORLOOSE ] : re [ t . COMPARATOR ]
const m = comp . match ( r )
if ( ! m ) {
throw new TypeError ( ` Invalid comparator: ${ comp } ` )
}
this . operator = m [ 1 ] !== undefined ? m [ 1 ] : ''
if ( this . operator === '=' ) {
this . operator = ''
}
// if it literally is just '>' or '' then allow anything.
if ( ! m [ 2 ] ) {
this . semver = ANY
} else {
this . semver = new SemVer ( m [ 2 ] , this . options . loose )
}
}
toString ( ) {
return this . value
}
test ( version ) {
debug ( 'Comparator.test' , version , this . options . loose )
if ( this . semver === ANY || version === ANY ) {
return true
}
if ( typeof version === 'string' ) {
try {
version = new SemVer ( version , this . options )
} catch ( er ) {
return false
}
}
return cmp ( version , this . operator , this . semver , this . options )
}
intersects ( comp , options ) {
if ( ! ( comp instanceof Comparator ) ) {
throw new TypeError ( 'a Comparator is required' )
}
if ( ! options || typeof options !== 'object' ) {
options = {
loose : ! ! options ,
includePrerelease : false
}
}
if ( this . operator === '' ) {
if ( this . value === '' ) {
return true
}
return new Range ( comp . value , options ) . test ( this . value )
} else if ( comp . operator === '' ) {
if ( comp . value === '' ) {
return true
}
return new Range ( this . value , options ) . test ( comp . semver )
}
const sameDirectionIncreasing =
( this . operator === '>=' || this . operator === '>' ) &&
( comp . operator === '>=' || comp . operator === '>' )
const sameDirectionDecreasing =
( this . operator === '<=' || this . operator === '<' ) &&
( comp . operator === '<=' || comp . operator === '<' )
const sameSemVer = this . semver . version === comp . semver . version
const differentDirectionsInclusive =
( this . operator === '>=' || this . operator === '<=' ) &&
( comp . operator === '>=' || comp . operator === '<=' )
const oppositeDirectionsLessThan =
cmp ( this . semver , '<' , comp . semver , options ) &&
( this . operator === '>=' || this . operator === '>' ) &&
( comp . operator === '<=' || comp . operator === '<' )
const oppositeDirectionsGreaterThan =
cmp ( this . semver , '>' , comp . semver , options ) &&
( this . operator === '<=' || this . operator === '<' ) &&
( comp . operator === '>=' || comp . operator === '>' )
return (
sameDirectionIncreasing ||
sameDirectionDecreasing ||
( sameSemVer && differentDirectionsInclusive ) ||
oppositeDirectionsLessThan ||
oppositeDirectionsGreaterThan
)
}
}
module . exports = Comparator
2021-05-24 22:44:03 +00:00
const parseOptions = _ _webpack _require _ _ ( 785 )
2020-08-21 12:45:16 +00:00
const { re , t } = _ _webpack _require _ _ ( 523 )
const cmp = _ _webpack _require _ _ ( 98 )
const debug = _ _webpack _require _ _ ( 427 )
const SemVer = _ _webpack _require _ _ ( 88 )
const Range = _ _webpack _require _ _ ( 828 )
/***/ } ) ,
/***/ 561 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
// given a set of versions and a range, create a "simplified" range
// that includes the same versions that the original range does
// If the original range is shorter than the simplified one, return that.
const satisfies = _ _webpack _require _ _ ( 55 )
const compare = _ _webpack _require _ _ ( 309 )
module . exports = ( versions , range , options ) => {
const set = [ ]
let min = null
let prev = null
const v = versions . sort ( ( a , b ) => compare ( a , b , options ) )
for ( const version of v ) {
const included = satisfies ( version , range , options )
if ( included ) {
prev = version
if ( ! min )
min = version
} else {
if ( prev ) {
set . push ( [ min , prev ] )
}
prev = null
min = null
}
}
if ( min )
set . push ( [ min , null ] )
const ranges = [ ]
for ( const [ min , max ] of set ) {
if ( min === max )
ranges . push ( min )
else if ( ! max && min === v [ 0 ] )
ranges . push ( '*' )
else if ( ! max )
ranges . push ( ` >= ${ min } ` )
else if ( min === v [ 0 ] )
ranges . push ( ` <= ${ max } ` )
else
ranges . push ( ` ${ min } - ${ max } ` )
}
const simplified = ranges . join ( ' || ' )
const original = typeof range . raw === 'string' ? range . raw : String ( range )
return simplified . length < original . length ? simplified : range
}
/***/ } ) ,
/***/ 579 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const Range = _ _webpack _require _ _ ( 828 )
const maxSatisfying = ( versions , range , options ) => {
let max = null
let maxSV = null
let rangeObj = null
try {
rangeObj = new Range ( range , options )
} catch ( er ) {
return null
}
versions . forEach ( ( v ) => {
if ( rangeObj . test ( v ) ) {
// satisfies(v, range, options)
if ( ! max || maxSV . compare ( v ) === - 1 ) {
// compare(max, v, true)
max = v
maxSV = new SemVer ( max , options )
}
}
} )
return max
}
module . exports = maxSatisfying
/***/ } ) ,
/***/ 601 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const parse = _ _webpack _require _ _ ( 925 )
const valid = ( version , options ) => {
const v = parse ( version , options )
return v ? v . version : null
}
module . exports = valid
/***/ } ) ,
/***/ 614 :
/***/ ( function ( module ) {
module . exports = require ( "events" ) ;
/***/ } ) ,
/***/ 622 :
/***/ ( function ( module ) {
module . exports = require ( "path" ) ;
/***/ } ) ,
/***/ 647 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2020-08-20 14:40:33 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-15 12:45:36 +00:00
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2020-08-21 11:33:37 +00:00
exports . setLogout = exports . setRegistry = exports . logout = exports . registry = exports . IsPost = void 0 ;
const core = _ _importStar ( _ _webpack _require _ _ ( 186 ) ) ;
exports . IsPost = ! ! process . env [ 'STATE_isPost' ] ;
exports . registry = process . env [ 'STATE_registry' ] || '' ;
exports . logout = /true/i . test ( process . env [ 'STATE_logout' ] || '' ) ;
function setRegistry ( registry ) {
core . saveState ( 'registry' , registry ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
exports . setRegistry = setRegistry ;
function setLogout ( logout ) {
core . saveState ( 'logout' , logout ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
exports . setLogout = setLogout ;
if ( ! exports . IsPost ) {
core . saveState ( 'isPost' , 'true' ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
//# sourceMappingURL=state-helper.js.map
2021-05-24 22:44:03 +00:00
/***/ } ) ,
/***/ 665 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
"use strict" ;
module . exports = Yallist
Yallist . Node = Node
Yallist . create = Yallist
function Yallist ( list ) {
var self = this
if ( ! ( self instanceof Yallist ) ) {
self = new Yallist ( )
}
self . tail = null
self . head = null
self . length = 0
if ( list && typeof list . forEach === 'function' ) {
list . forEach ( function ( item ) {
self . push ( item )
} )
} else if ( arguments . length > 0 ) {
for ( var i = 0 , l = arguments . length ; i < l ; i ++ ) {
self . push ( arguments [ i ] )
}
}
return self
}
Yallist . prototype . removeNode = function ( node ) {
if ( node . list !== this ) {
throw new Error ( 'removing node which does not belong to this list' )
}
var next = node . next
var prev = node . prev
if ( next ) {
next . prev = prev
}
if ( prev ) {
prev . next = next
}
if ( node === this . head ) {
this . head = next
}
if ( node === this . tail ) {
this . tail = prev
}
node . list . length --
node . next = null
node . prev = null
node . list = null
return next
}
Yallist . prototype . unshiftNode = function ( node ) {
if ( node === this . head ) {
return
}
if ( node . list ) {
node . list . removeNode ( node )
}
var head = this . head
node . list = this
node . next = head
if ( head ) {
head . prev = node
}
this . head = node
if ( ! this . tail ) {
this . tail = node
}
this . length ++
}
Yallist . prototype . pushNode = function ( node ) {
if ( node === this . tail ) {
return
}
if ( node . list ) {
node . list . removeNode ( node )
}
var tail = this . tail
node . list = this
node . prev = tail
if ( tail ) {
tail . next = node
}
this . tail = node
if ( ! this . head ) {
this . head = node
}
this . length ++
}
Yallist . prototype . push = function ( ) {
for ( var i = 0 , l = arguments . length ; i < l ; i ++ ) {
push ( this , arguments [ i ] )
}
return this . length
}
Yallist . prototype . unshift = function ( ) {
for ( var i = 0 , l = arguments . length ; i < l ; i ++ ) {
unshift ( this , arguments [ i ] )
}
return this . length
}
Yallist . prototype . pop = function ( ) {
if ( ! this . tail ) {
return undefined
}
var res = this . tail . value
this . tail = this . tail . prev
if ( this . tail ) {
this . tail . next = null
} else {
this . head = null
}
this . length --
return res
}
Yallist . prototype . shift = function ( ) {
if ( ! this . head ) {
return undefined
}
var res = this . head . value
this . head = this . head . next
if ( this . head ) {
this . head . prev = null
} else {
this . tail = null
}
this . length --
return res
}
Yallist . prototype . forEach = function ( fn , thisp ) {
thisp = thisp || this
for ( var walker = this . head , i = 0 ; walker !== null ; i ++ ) {
fn . call ( thisp , walker . value , i , this )
walker = walker . next
}
}
Yallist . prototype . forEachReverse = function ( fn , thisp ) {
thisp = thisp || this
for ( var walker = this . tail , i = this . length - 1 ; walker !== null ; i -- ) {
fn . call ( thisp , walker . value , i , this )
walker = walker . prev
}
}
Yallist . prototype . get = function ( n ) {
for ( var i = 0 , walker = this . head ; walker !== null && i < n ; i ++ ) {
// abort out of the list early if we hit a cycle
walker = walker . next
}
if ( i === n && walker !== null ) {
return walker . value
}
}
Yallist . prototype . getReverse = function ( n ) {
for ( var i = 0 , walker = this . tail ; walker !== null && i < n ; i ++ ) {
// abort out of the list early if we hit a cycle
walker = walker . prev
}
if ( i === n && walker !== null ) {
return walker . value
}
}
Yallist . prototype . map = function ( fn , thisp ) {
thisp = thisp || this
var res = new Yallist ( )
for ( var walker = this . head ; walker !== null ; ) {
res . push ( fn . call ( thisp , walker . value , this ) )
walker = walker . next
}
return res
}
Yallist . prototype . mapReverse = function ( fn , thisp ) {
thisp = thisp || this
var res = new Yallist ( )
for ( var walker = this . tail ; walker !== null ; ) {
res . push ( fn . call ( thisp , walker . value , this ) )
walker = walker . prev
}
return res
}
Yallist . prototype . reduce = function ( fn , initial ) {
var acc
var walker = this . head
if ( arguments . length > 1 ) {
acc = initial
} else if ( this . head ) {
walker = this . head . next
acc = this . head . value
} else {
throw new TypeError ( 'Reduce of empty list with no initial value' )
}
for ( var i = 0 ; walker !== null ; i ++ ) {
acc = fn ( acc , walker . value , i )
walker = walker . next
}
return acc
}
Yallist . prototype . reduceReverse = function ( fn , initial ) {
var acc
var walker = this . tail
if ( arguments . length > 1 ) {
acc = initial
} else if ( this . tail ) {
walker = this . tail . prev
acc = this . tail . value
} else {
throw new TypeError ( 'Reduce of empty list with no initial value' )
}
for ( var i = this . length - 1 ; walker !== null ; i -- ) {
acc = fn ( acc , walker . value , i )
walker = walker . prev
}
return acc
}
Yallist . prototype . toArray = function ( ) {
var arr = new Array ( this . length )
for ( var i = 0 , walker = this . head ; walker !== null ; i ++ ) {
arr [ i ] = walker . value
walker = walker . next
}
return arr
}
Yallist . prototype . toArrayReverse = function ( ) {
var arr = new Array ( this . length )
for ( var i = 0 , walker = this . tail ; walker !== null ; i ++ ) {
arr [ i ] = walker . value
walker = walker . prev
}
return arr
}
Yallist . prototype . slice = function ( from , to ) {
to = to || this . length
if ( to < 0 ) {
to += this . length
}
from = from || 0
if ( from < 0 ) {
from += this . length
}
var ret = new Yallist ( )
if ( to < from || to < 0 ) {
return ret
}
if ( from < 0 ) {
from = 0
}
if ( to > this . length ) {
to = this . length
}
for ( var i = 0 , walker = this . head ; walker !== null && i < from ; i ++ ) {
walker = walker . next
}
for ( ; walker !== null && i < to ; i ++ , walker = walker . next ) {
ret . push ( walker . value )
}
return ret
}
Yallist . prototype . sliceReverse = function ( from , to ) {
to = to || this . length
if ( to < 0 ) {
to += this . length
}
from = from || 0
if ( from < 0 ) {
from += this . length
}
var ret = new Yallist ( )
if ( to < from || to < 0 ) {
return ret
}
if ( from < 0 ) {
from = 0
}
if ( to > this . length ) {
to = this . length
}
for ( var i = this . length , walker = this . tail ; walker !== null && i > to ; i -- ) {
walker = walker . prev
}
for ( ; walker !== null && i > from ; i -- , walker = walker . prev ) {
ret . push ( walker . value )
}
return ret
}
Yallist . prototype . splice = function ( start , deleteCount , ... nodes ) {
if ( start > this . length ) {
start = this . length - 1
}
if ( start < 0 ) {
start = this . length + start ;
}
for ( var i = 0 , walker = this . head ; walker !== null && i < start ; i ++ ) {
walker = walker . next
}
var ret = [ ]
for ( var i = 0 ; walker && i < deleteCount ; i ++ ) {
ret . push ( walker . value )
walker = this . removeNode ( walker )
}
if ( walker === null ) {
walker = this . tail
}
if ( walker !== this . head && walker !== this . tail ) {
walker = walker . prev
}
for ( var i = 0 ; i < nodes . length ; i ++ ) {
walker = insert ( this , walker , nodes [ i ] )
}
return ret ;
}
Yallist . prototype . reverse = function ( ) {
var head = this . head
var tail = this . tail
for ( var walker = head ; walker !== null ; walker = walker . prev ) {
var p = walker . prev
walker . prev = walker . next
walker . next = p
}
this . head = tail
this . tail = head
return this
}
function insert ( self , node , value ) {
var inserted = node === self . head ?
new Node ( value , null , node , self ) :
new Node ( value , node , node . next , self )
if ( inserted . next === null ) {
self . tail = inserted
}
if ( inserted . prev === null ) {
self . head = inserted
}
self . length ++
return inserted
}
function push ( self , item ) {
self . tail = new Node ( item , self . tail , null , self )
if ( ! self . head ) {
self . head = self . tail
}
self . length ++
}
function unshift ( self , item ) {
self . head = new Node ( item , null , self . head , self )
if ( ! self . tail ) {
self . tail = self . head
}
self . length ++
}
function Node ( value , prev , next , list ) {
if ( ! ( this instanceof Node ) ) {
return new Node ( value , prev , next , list )
}
this . list = list
this . value = value
if ( prev ) {
prev . next = this
this . prev = prev
} else {
this . prev = null
}
if ( next ) {
next . prev = this
this . next = next
} else {
this . next = null
}
}
try {
// add if support for Symbol.iterator is present
_ _webpack _require _ _ ( 91 ) ( Yallist )
} catch ( er ) { }
2020-08-21 11:33:37 +00:00
/***/ } ) ,
/***/ 669 :
/***/ ( function ( module ) {
module . exports = require ( "util" ) ;
2020-08-15 12:45:36 +00:00
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 688 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const major = ( a , loose ) => new SemVer ( a , loose ) . major
module . exports = major
/***/ } ) ,
/***/ 701 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compareBuild = _ _webpack _require _ _ ( 156 )
const rsort = ( list , loose ) => list . sort ( ( a , b ) => compareBuild ( b , a , loose ) )
module . exports = rsort
/***/ } ) ,
/***/ 706 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const Range = _ _webpack _require _ _ ( 828 )
// Mostly just for testing and legacy API reasons
const toComparators = ( range , options ) =>
new Range ( range , options ) . set
. map ( comp => comp . map ( c => c . value ) . join ( ' ' ) . trim ( ) . split ( ' ' ) )
module . exports = toComparators
2020-10-01 17:31:10 +00:00
/***/ } ) ,
/***/ 717 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
// For internal use, subject to change.
2021-05-24 23:08:08 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
2020-10-01 17:31:10 +00:00
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
2021-05-24 23:08:08 +00:00
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
2020-10-01 17:31:10 +00:00
return result ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-05-24 23:08:08 +00:00
exports . issueCommand = void 0 ;
2020-10-01 17:31:10 +00:00
// We use any as a valid input type
/* eslint-disable @typescript-eslint/no-explicit-any */
const fs = _ _importStar ( _ _webpack _require _ _ ( 747 ) ) ;
const os = _ _importStar ( _ _webpack _require _ _ ( 87 ) ) ;
const utils _1 = _ _webpack _require _ _ ( 278 ) ;
function issueCommand ( command , message ) {
const filePath = process . env [ ` GITHUB_ ${ command } ` ] ;
if ( ! filePath ) {
throw new Error ( ` Unable to find environment variable for file command ${ command } ` ) ;
}
if ( ! fs . existsSync ( filePath ) ) {
throw new Error ( ` Missing file at path: ${ filePath } ` ) ;
}
fs . appendFileSync ( filePath , ` ${ utils _1 . toCommandValue ( message ) } ${ os . EOL } ` , {
encoding : 'utf8'
} ) ;
}
exports . issueCommand = issueCommand ;
//# sourceMappingURL=file-command.js.map
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 741 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const Range = _ _webpack _require _ _ ( 828 )
const validRange = ( range , options ) => {
try {
// Return '*' instead of '' so that truthiness works.
// This will throw if it's invalid anyway
return new Range ( range , options ) . range || '*'
} catch ( er ) {
return null
}
}
module . exports = validRange
2020-08-15 12:45:36 +00:00
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 747 :
/***/ ( function ( module ) {
module . exports = require ( "fs" ) ;
/***/ } ) ,
/***/ 758 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
2020-08-15 12:45:36 +00:00
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
2020-08-21 11:33:37 +00:00
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
exports . loginECR = exports . loginStandard = exports . logout = exports . login = void 0 ;
2020-08-21 12:45:16 +00:00
const aws = _ _importStar ( _ _webpack _require _ _ ( 981 ) ) ;
2021-06-22 09:09:26 +00:00
const core = _ _importStar ( _ _webpack _require _ _ ( 186 ) ) ;
const exec = _ _importStar ( _ _webpack _require _ _ ( 514 ) ) ;
2020-08-21 11:33:37 +00:00
function login ( registry , username , password ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-08-21 12:45:16 +00:00
if ( yield aws . isECR ( registry ) ) {
2020-08-21 11:33:37 +00:00
yield loginECR ( registry , username , password ) ;
}
else {
yield loginStandard ( registry , username , password ) ;
}
} ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
exports . login = login ;
function logout ( registry ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2021-06-22 09:09:26 +00:00
yield exec
. getExecOutput ( 'docker' , [ 'logout' , registry ] , {
ignoreReturnCode : true
} )
. then ( res => {
if ( res . stderr . length > 0 && res . exitCode != 0 ) {
core . warning ( res . stderr . trim ( ) ) ;
2020-08-21 11:33:37 +00:00
}
} ) ;
} ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
exports . logout = logout ;
function loginStandard ( registry , username , password ) {
2020-08-15 12:45:36 +00:00
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-10-20 12:41:56 +00:00
if ( ! username || ! password ) {
throw new Error ( 'Username and password required' ) ;
2020-08-15 12:45:36 +00:00
}
2020-10-20 12:41:56 +00:00
let loginArgs = [ 'login' , '--password-stdin' ] ;
loginArgs . push ( '--username' , username ) ;
2020-08-21 11:33:37 +00:00
loginArgs . push ( registry ) ;
if ( registry ) {
2021-04-27 22:34:26 +00:00
core . info ( ` Logging into ${ registry } ... ` ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
else {
2021-04-27 22:34:26 +00:00
core . info ( ` Logging into Docker Hub... ` ) ;
2020-08-21 11:33:37 +00:00
}
2021-06-22 09:09:26 +00:00
yield exec
. getExecOutput ( 'docker' , loginArgs , {
ignoreReturnCode : true ,
silent : true ,
input : Buffer . from ( password )
} )
. then ( res => {
if ( res . stderr . length > 0 && res . exitCode != 0 ) {
throw new Error ( res . stderr . trim ( ) ) ;
2020-08-21 11:33:37 +00:00
}
2021-04-27 22:34:26 +00:00
core . info ( ` Login Succeeded! ` ) ;
2020-08-21 11:33:37 +00:00
} ) ;
2020-08-15 12:45:36 +00:00
} ) ;
}
2020-08-21 11:33:37 +00:00
exports . loginStandard = loginStandard ;
function loginECR ( registry , username , password ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
2020-08-21 12:45:16 +00:00
const cliPath = yield aws . getCLI ( ) ;
const cliVersion = yield aws . getCLIVersion ( ) ;
2020-08-21 13:27:22 +00:00
const region = yield aws . getRegion ( registry ) ;
2020-12-17 19:21:48 +00:00
const accountIDs = yield aws . getAccountIDs ( registry ) ;
2020-12-11 06:15:35 +00:00
if ( yield aws . isPubECR ( registry ) ) {
2021-04-27 22:34:26 +00:00
core . info ( ` AWS Public ECR detected with ${ region } region ` ) ;
2020-12-11 06:15:35 +00:00
}
else {
2021-04-27 22:34:26 +00:00
core . info ( ` AWS ECR detected with ${ region } region ` ) ;
2020-12-11 06:15:35 +00:00
}
2020-10-20 12:41:56 +00:00
process . env . AWS _ACCESS _KEY _ID = username || process . env . AWS _ACCESS _KEY _ID ;
process . env . AWS _SECRET _ACCESS _KEY = password || process . env . AWS _SECRET _ACCESS _KEY ;
2021-04-27 22:34:26 +00:00
core . info ( ` Retrieving docker login command through AWS CLI ${ cliVersion } ( ${ cliPath } )... ` ) ;
2020-12-17 19:21:48 +00:00
const loginCmds = yield aws . getDockerLoginCmds ( cliVersion , registry , region , accountIDs ) ;
2021-04-27 22:34:26 +00:00
core . info ( ` Logging into ${ registry } ... ` ) ;
2020-12-16 20:53:24 +00:00
loginCmds . forEach ( ( loginCmd , index ) => {
2021-06-22 09:09:26 +00:00
exec
. getExecOutput ( loginCmd , [ ] , {
ignoreReturnCode : true ,
silent : true
} )
. then ( res => {
if ( res . stderr . length > 0 && res . exitCode != 0 ) {
throw new Error ( res . stderr . trim ( ) ) ;
2020-12-16 20:53:24 +00:00
}
if ( loginCmds . length > 1 ) {
2021-04-27 22:34:26 +00:00
core . info ( ` Login Succeeded! ( ${ index } / ${ loginCmds . length } ) ` ) ;
2020-12-16 20:53:24 +00:00
}
else {
2021-04-27 22:34:26 +00:00
core . info ( 'Login Succeeded!' ) ;
2020-12-16 20:53:24 +00:00
}
} ) ;
2020-08-21 11:33:37 +00:00
} ) ;
} ) ;
2020-08-15 12:45:36 +00:00
}
2020-08-21 11:33:37 +00:00
exports . loginECR = loginECR ;
//# sourceMappingURL=docker.js.map
2020-08-15 12:45:36 +00:00
2021-05-24 22:44:03 +00:00
/***/ } ) ,
/***/ 785 :
/***/ ( function ( module ) {
// parse out just the options we care about so we always get a consistent
// obj with keys in a consistent order.
const opts = [ 'includePrerelease' , 'loose' , 'rtl' ]
const parseOptions = options =>
! options ? { }
: typeof options !== 'object' ? { loose : true }
: opts . filter ( k => options [ k ] ) . reduce ( ( options , k ) => {
options [ k ] = true
return options
} , { } )
module . exports = parseOptions
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 804 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const compareLoose = ( a , b ) => compare ( a , b , true )
module . exports = compareLoose
/***/ } ) ,
/***/ 828 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
// hoisted class for cyclic dependency
class Range {
constructor ( range , options ) {
2021-05-24 22:44:03 +00:00
options = parseOptions ( options )
2020-08-21 12:45:16 +00:00
if ( range instanceof Range ) {
if (
range . loose === ! ! options . loose &&
range . includePrerelease === ! ! options . includePrerelease
) {
return range
} else {
return new Range ( range . raw , options )
}
}
if ( range instanceof Comparator ) {
// just put it in the set and return
this . raw = range . value
this . set = [ [ range ] ]
this . format ( )
return this
}
this . options = options
this . loose = ! ! options . loose
this . includePrerelease = ! ! options . includePrerelease
// First, split based on boolean or ||
this . raw = range
this . set = range
. split ( /\s*\|\|\s*/ )
// map the range to a 2d array of comparators
. map ( range => this . parseRange ( range . trim ( ) ) )
// throw out any comparator lists that are empty
// this generally means that it was not a valid range, which is allowed
// in loose mode, but will still throw if the WHOLE range is invalid.
. filter ( c => c . length )
if ( ! this . set . length ) {
throw new TypeError ( ` Invalid SemVer Range: ${ range } ` )
}
2021-05-24 22:44:03 +00:00
// if we have any that are not the null set, throw out null sets.
if ( this . set . length > 1 ) {
// keep the first one, in case they're all null sets
const first = this . set [ 0 ]
this . set = this . set . filter ( c => ! isNullSet ( c [ 0 ] ) )
if ( this . set . length === 0 )
this . set = [ first ]
else if ( this . set . length > 1 ) {
// if we have any that are *, then the range is just *
for ( const c of this . set ) {
if ( c . length === 1 && isAny ( c [ 0 ] ) ) {
this . set = [ c ]
break
}
}
}
}
2020-08-21 12:45:16 +00:00
this . format ( )
}
format ( ) {
this . range = this . set
. map ( ( comps ) => {
return comps . join ( ' ' ) . trim ( )
} )
. join ( '||' )
. trim ( )
return this . range
}
toString ( ) {
return this . range
}
parseRange ( range ) {
range = range . trim ( )
2021-05-24 22:44:03 +00:00
// memoize range parsing for performance.
// this is a very hot path, and fully deterministic.
const memoOpts = Object . keys ( this . options ) . join ( ',' )
const memoKey = ` parseRange: ${ memoOpts } : ${ range } `
const cached = cache . get ( memoKey )
if ( cached )
return cached
const loose = this . options . loose
2020-08-21 12:45:16 +00:00
// `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`
const hr = loose ? re [ t . HYPHENRANGELOOSE ] : re [ t . HYPHENRANGE ]
range = range . replace ( hr , hyphenReplace ( this . options . includePrerelease ) )
debug ( 'hyphen replace' , range )
// `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
range = range . replace ( re [ t . COMPARATORTRIM ] , comparatorTrimReplace )
debug ( 'comparator trim' , range , re [ t . COMPARATORTRIM ] )
// `~ 1.2.3` => `~1.2.3`
range = range . replace ( re [ t . TILDETRIM ] , tildeTrimReplace )
// `^ 1.2.3` => `^1.2.3`
range = range . replace ( re [ t . CARETTRIM ] , caretTrimReplace )
// normalize spaces
range = range . split ( /\s+/ ) . join ( ' ' )
// At this point, the range is completely trimmed and
// ready to be split into comparators.
const compRe = loose ? re [ t . COMPARATORLOOSE ] : re [ t . COMPARATOR ]
2021-05-24 22:44:03 +00:00
const rangeList = range
2020-08-21 12:45:16 +00:00
. split ( ' ' )
. map ( comp => parseComparator ( comp , this . options ) )
. join ( ' ' )
. split ( /\s+/ )
2021-05-24 22:44:03 +00:00
// >=0.0.0 is equivalent to *
2020-08-21 12:45:16 +00:00
. map ( comp => replaceGTE0 ( comp , this . options ) )
// in loose mode, throw out any that are not valid comparators
. filter ( this . options . loose ? comp => ! ! comp . match ( compRe ) : ( ) => true )
. map ( comp => new Comparator ( comp , this . options ) )
2021-05-24 22:44:03 +00:00
// if any comparators are the null set, then replace with JUST null set
// if more than one comparator, remove any * comparators
// also, don't include the same comparator more than once
const l = rangeList . length
const rangeMap = new Map ( )
for ( const comp of rangeList ) {
if ( isNullSet ( comp ) )
return [ comp ]
rangeMap . set ( comp . value , comp )
}
if ( rangeMap . size > 1 && rangeMap . has ( '' ) )
rangeMap . delete ( '' )
const result = [ ... rangeMap . values ( ) ]
cache . set ( memoKey , result )
return result
2020-08-21 12:45:16 +00:00
}
intersects ( range , options ) {
if ( ! ( range instanceof Range ) ) {
throw new TypeError ( 'a Range is required' )
}
return this . set . some ( ( thisComparators ) => {
return (
isSatisfiable ( thisComparators , options ) &&
range . set . some ( ( rangeComparators ) => {
return (
isSatisfiable ( rangeComparators , options ) &&
thisComparators . every ( ( thisComparator ) => {
return rangeComparators . every ( ( rangeComparator ) => {
return thisComparator . intersects ( rangeComparator , options )
} )
} )
)
} )
)
} )
}
// if ANY of the sets match ALL of its comparators, then pass
test ( version ) {
if ( ! version ) {
return false
}
if ( typeof version === 'string' ) {
try {
version = new SemVer ( version , this . options )
} catch ( er ) {
return false
}
}
for ( let i = 0 ; i < this . set . length ; i ++ ) {
if ( testSet ( this . set [ i ] , version , this . options ) ) {
return true
}
}
return false
}
}
module . exports = Range
2021-05-24 22:44:03 +00:00
const LRU = _ _webpack _require _ _ ( 129 )
const cache = new LRU ( { max : 1000 } )
const parseOptions = _ _webpack _require _ _ ( 785 )
2020-08-21 12:45:16 +00:00
const Comparator = _ _webpack _require _ _ ( 532 )
const debug = _ _webpack _require _ _ ( 427 )
const SemVer = _ _webpack _require _ _ ( 88 )
const {
re ,
t ,
comparatorTrimReplace ,
tildeTrimReplace ,
caretTrimReplace
} = _ _webpack _require _ _ ( 523 )
2021-05-24 22:44:03 +00:00
const isNullSet = c => c . value === '<0.0.0-0'
const isAny = c => c . value === ''
2020-08-21 12:45:16 +00:00
// take a set of comparators and determine whether there
// exists a version which can satisfy it
const isSatisfiable = ( comparators , options ) => {
let result = true
const remainingComparators = comparators . slice ( )
let testComparator = remainingComparators . pop ( )
while ( result && remainingComparators . length ) {
result = remainingComparators . every ( ( otherComparator ) => {
return testComparator . intersects ( otherComparator , options )
} )
testComparator = remainingComparators . pop ( )
}
return result
}
// comprised of xranges, tildes, stars, and gtlt's at this point.
// already replaced the hyphen ranges
// turn into a set of JUST comparators.
const parseComparator = ( comp , options ) => {
debug ( 'comp' , comp , options )
comp = replaceCarets ( comp , options )
debug ( 'caret' , comp )
comp = replaceTildes ( comp , options )
debug ( 'tildes' , comp )
comp = replaceXRanges ( comp , options )
debug ( 'xrange' , comp )
comp = replaceStars ( comp , options )
debug ( 'stars' , comp )
return comp
}
const isX = id => ! id || id . toLowerCase ( ) === 'x' || id === '*'
// ~, ~> --> * (any, kinda silly)
// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0
// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0
// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0
// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0
// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0
const replaceTildes = ( comp , options ) =>
comp . trim ( ) . split ( /\s+/ ) . map ( ( comp ) => {
return replaceTilde ( comp , options )
} ) . join ( ' ' )
const replaceTilde = ( comp , options ) => {
const r = options . loose ? re [ t . TILDELOOSE ] : re [ t . TILDE ]
return comp . replace ( r , ( _ , M , m , p , pr ) => {
debug ( 'tilde' , comp , _ , M , m , p , pr )
let ret
if ( isX ( M ) ) {
ret = ''
} else if ( isX ( m ) ) {
ret = ` >= ${ M } .0.0 < ${ + M + 1 } .0.0-0 `
} else if ( isX ( p ) ) {
// ~1.2 == >=1.2.0 <1.3.0-0
ret = ` >= ${ M } . ${ m } .0 < ${ M } . ${ + m + 1 } .0-0 `
} else if ( pr ) {
debug ( 'replaceTilde pr' , pr )
ret = ` >= ${ M } . ${ m } . ${ p } - ${ pr
} < $ { M } . $ { + m + 1 } . 0 - 0 `
} else {
// ~1.2.3 == >=1.2.3 <1.3.0-0
ret = ` >= ${ M } . ${ m } . ${ p
} < $ { M } . $ { + m + 1 } . 0 - 0 `
}
debug ( 'tilde return' , ret )
return ret
} )
}
// ^ --> * (any, kinda silly)
// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0
// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0
// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0
// ^1.2.3 --> >=1.2.3 <2.0.0-0
// ^1.2.0 --> >=1.2.0 <2.0.0-0
const replaceCarets = ( comp , options ) =>
comp . trim ( ) . split ( /\s+/ ) . map ( ( comp ) => {
return replaceCaret ( comp , options )
} ) . join ( ' ' )
const replaceCaret = ( comp , options ) => {
debug ( 'caret' , comp , options )
const r = options . loose ? re [ t . CARETLOOSE ] : re [ t . CARET ]
const z = options . includePrerelease ? '-0' : ''
return comp . replace ( r , ( _ , M , m , p , pr ) => {
debug ( 'caret' , comp , _ , M , m , p , pr )
let ret
if ( isX ( M ) ) {
ret = ''
} else if ( isX ( m ) ) {
ret = ` >= ${ M } .0.0 ${ z } < ${ + M + 1 } .0.0-0 `
} else if ( isX ( p ) ) {
if ( M === '0' ) {
ret = ` >= ${ M } . ${ m } .0 ${ z } < ${ M } . ${ + m + 1 } .0-0 `
} else {
ret = ` >= ${ M } . ${ m } .0 ${ z } < ${ + M + 1 } .0.0-0 `
}
} else if ( pr ) {
debug ( 'replaceCaret pr' , pr )
if ( M === '0' ) {
if ( m === '0' ) {
ret = ` >= ${ M } . ${ m } . ${ p } - ${ pr
} < $ { M } . $ { m } . $ { + p + 1 } - 0 `
} else {
ret = ` >= ${ M } . ${ m } . ${ p } - ${ pr
} < $ { M } . $ { + m + 1 } . 0 - 0 `
}
} else {
ret = ` >= ${ M } . ${ m } . ${ p } - ${ pr
} < $ { + M + 1 } . 0.0 - 0 `
}
} else {
debug ( 'no pr' )
if ( M === '0' ) {
if ( m === '0' ) {
ret = ` >= ${ M } . ${ m } . ${ p
} $ { z } < $ { M } . $ { m } . $ { + p + 1 } - 0 `
} else {
ret = ` >= ${ M } . ${ m } . ${ p
} $ { z } < $ { M } . $ { + m + 1 } . 0 - 0 `
}
} else {
ret = ` >= ${ M } . ${ m } . ${ p
} < $ { + M + 1 } . 0.0 - 0 `
}
}
debug ( 'caret return' , ret )
return ret
} )
}
const replaceXRanges = ( comp , options ) => {
debug ( 'replaceXRanges' , comp , options )
return comp . split ( /\s+/ ) . map ( ( comp ) => {
return replaceXRange ( comp , options )
} ) . join ( ' ' )
}
const replaceXRange = ( comp , options ) => {
comp = comp . trim ( )
const r = options . loose ? re [ t . XRANGELOOSE ] : re [ t . XRANGE ]
return comp . replace ( r , ( ret , gtlt , M , m , p , pr ) => {
debug ( 'xRange' , comp , ret , gtlt , M , m , p , pr )
const xM = isX ( M )
const xm = xM || isX ( m )
const xp = xm || isX ( p )
const anyX = xp
if ( gtlt === '=' && anyX ) {
gtlt = ''
}
// if we're including prereleases in the match, then we need
// to fix this to -0, the lowest possible prerelease value
pr = options . includePrerelease ? '-0' : ''
if ( xM ) {
if ( gtlt === '>' || gtlt === '<' ) {
// nothing is allowed
ret = '<0.0.0-0'
} else {
// nothing is forbidden
ret = '*'
}
} else if ( gtlt && anyX ) {
// we know patch is an x, because we have any x at all.
// replace X with 0
if ( xm ) {
m = 0
}
p = 0
if ( gtlt === '>' ) {
// >1 => >=2.0.0
// >1.2 => >=1.3.0
gtlt = '>='
if ( xm ) {
M = + M + 1
m = 0
p = 0
} else {
m = + m + 1
p = 0
}
} else if ( gtlt === '<=' ) {
// <=0.7.x is actually <0.8.0, since any 0.7.x should
// pass. Similarly, <=7.x is actually <8.0.0, etc.
gtlt = '<'
if ( xm ) {
M = + M + 1
} else {
m = + m + 1
}
}
if ( gtlt === '<' )
pr = '-0'
ret = ` ${ gtlt + M } . ${ m } . ${ p } ${ pr } `
} else if ( xm ) {
ret = ` >= ${ M } .0.0 ${ pr } < ${ + M + 1 } .0.0-0 `
} else if ( xp ) {
ret = ` >= ${ M } . ${ m } .0 ${ pr
} < $ { M } . $ { + m + 1 } . 0 - 0 `
}
debug ( 'xRange return' , ret )
return ret
} )
}
// Because * is AND-ed with everything else in the comparator,
// and '' means "any version", just remove the *s entirely.
const replaceStars = ( comp , options ) => {
debug ( 'replaceStars' , comp , options )
// Looseness is ignored here. star is always as loose as it gets!
return comp . trim ( ) . replace ( re [ t . STAR ] , '' )
}
const replaceGTE0 = ( comp , options ) => {
debug ( 'replaceGTE0' , comp , options )
return comp . trim ( )
. replace ( re [ options . includePrerelease ? t . GTE0PRE : t . GTE0 ] , '' )
}
// This function is passed to string.replace(re[t.HYPHENRANGE])
// M, m, patch, prerelease, build
// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5
// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do
// 1.2 - 3.4 => >=1.2.0 <3.5.0-0
const hyphenReplace = incPr => ( $0 ,
from , fM , fm , fp , fpr , fb ,
to , tM , tm , tp , tpr , tb ) => {
if ( isX ( fM ) ) {
from = ''
} else if ( isX ( fm ) ) {
from = ` >= ${ fM } .0.0 ${ incPr ? '-0' : '' } `
} else if ( isX ( fp ) ) {
from = ` >= ${ fM } . ${ fm } .0 ${ incPr ? '-0' : '' } `
} else if ( fpr ) {
from = ` >= ${ from } `
} else {
from = ` >= ${ from } ${ incPr ? '-0' : '' } `
}
if ( isX ( tM ) ) {
to = ''
} else if ( isX ( tm ) ) {
to = ` < ${ + tM + 1 } .0.0-0 `
} else if ( isX ( tp ) ) {
to = ` < ${ tM } . ${ + tm + 1 } .0-0 `
} else if ( tpr ) {
to = ` <= ${ tM } . ${ tm } . ${ tp } - ${ tpr } `
} else if ( incPr ) {
to = ` < ${ tM } . ${ tm } . ${ + tp + 1 } -0 `
} else {
to = ` <= ${ to } `
}
return ( ` ${ from } ${ to } ` ) . trim ( )
}
const testSet = ( set , version , options ) => {
for ( let i = 0 ; i < set . length ; i ++ ) {
if ( ! set [ i ] . test ( version ) ) {
return false
}
}
if ( version . prerelease . length && ! options . includePrerelease ) {
// Find the set of versions that are allowed to have prereleases
// For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0
// That should allow `1.2.3-pr.2` to pass.
// However, `1.2.4-alpha.notready` should NOT be allowed,
// even though it's within the range set by the comparators.
for ( let i = 0 ; i < set . length ; i ++ ) {
debug ( set [ i ] . semver )
if ( set [ i ] . semver === Comparator . ANY ) {
continue
}
if ( set [ i ] . semver . prerelease . length > 0 ) {
const allowed = set [ i ] . semver
if ( allowed . major === version . major &&
allowed . minor === version . minor &&
allowed . patch === version . patch ) {
return true
}
}
}
// Version has a -pre, but it's not one of the ones we like.
return false
}
return true
}
/***/ } ) ,
/***/ 832 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const Range = _ _webpack _require _ _ ( 828 )
const minSatisfying = ( versions , range , options ) => {
let min = null
let minSV = null
let rangeObj = null
try {
rangeObj = new Range ( range , options )
} catch ( er ) {
return null
}
versions . forEach ( ( v ) => {
if ( rangeObj . test ( v ) ) {
// satisfies(v, range, options)
if ( ! min || minSV . compare ( v ) === 1 ) {
// compare(min, v, true)
min = v
minSV = new SemVer ( min , options )
}
}
} )
return min
}
module . exports = minSatisfying
2020-08-15 12:45:36 +00:00
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 842 :
2020-08-20 14:40:33 +00:00
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
exports . getInputs = void 0 ;
2020-08-21 11:33:37 +00:00
const core = _ _importStar ( _ _webpack _require _ _ ( 186 ) ) ;
2020-08-20 14:40:33 +00:00
function getInputs ( ) {
2020-10-16 16:24:41 +00:00
return {
registry : core . getInput ( 'registry' ) ,
2020-10-20 12:41:56 +00:00
username : core . getInput ( 'username' ) ,
password : core . getInput ( 'password' ) ,
2021-06-22 08:39:55 +00:00
logout : core . getBooleanInput ( 'logout' )
2020-10-16 16:24:41 +00:00
} ;
2020-08-20 14:40:33 +00:00
}
exports . getInputs = getInputs ;
//# sourceMappingURL=context.js.map
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 848 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const parse = _ _webpack _require _ _ ( 925 )
const clean = ( version , options ) => {
const s = parse ( version . trim ( ) . replace ( /^[=v]+/ , '' ) , options )
return s ? s . version : null
}
module . exports = clean
/***/ } ) ,
/***/ 863 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const Range = _ _webpack _require _ _ ( 828 )
2021-05-24 22:44:03 +00:00
const Comparator = _ _webpack _require _ _ ( 532 )
const { ANY } = Comparator
2020-08-21 12:45:16 +00:00
const satisfies = _ _webpack _require _ _ ( 55 )
const compare = _ _webpack _require _ _ ( 309 )
// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:
2021-05-24 22:44:03 +00:00
// - Every simple range `r1, r2, ...` is a null set, OR
// - Every simple range `r1, r2, ...` which is not a null set is a subset of
// some `R1, R2, ...`
2020-08-21 12:45:16 +00:00
//
// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:
// - If c is only the ANY comparator
// - If C is only the ANY comparator, return true
2021-05-24 22:44:03 +00:00
// - Else if in prerelease mode, return false
// - else replace c with `[>=0.0.0]`
// - If C is only the ANY comparator
// - if in prerelease mode, return true
// - else replace C with `[>=0.0.0]`
2020-08-21 12:45:16 +00:00
// - Let EQ be the set of = comparators in c
// - If EQ is more than one, return true (null set)
// - Let GT be the highest > or >= comparator in c
// - Let LT be the lowest < or <= comparator in c
// - If GT and LT, and GT.semver > LT.semver, return true (null set)
2021-05-24 22:44:03 +00:00
// - If any C is a = range, and GT or LT are set, return false
2020-08-21 12:45:16 +00:00
// - If EQ
// - If GT, and EQ does not satisfy GT, return true (null set)
// - If LT, and EQ does not satisfy LT, return true (null set)
// - If EQ satisfies every C, return true
// - Else return false
// - If GT
2021-05-24 22:44:03 +00:00
// - If GT.semver is lower than any > or >= comp in C, return false
2020-08-21 12:45:16 +00:00
// - If GT is >=, and GT.semver does not satisfy every C, return false
2021-05-24 22:44:03 +00:00
// - If GT.semver has a prerelease, and not in prerelease mode
// - If no C has a prerelease and the GT.semver tuple, return false
2020-08-21 12:45:16 +00:00
// - If LT
2021-05-24 22:44:03 +00:00
// - If LT.semver is greater than any < or <= comp in C, return false
2020-08-21 12:45:16 +00:00
// - If LT is <=, and LT.semver does not satisfy every C, return false
2021-05-24 22:44:03 +00:00
// - If GT.semver has a prerelease, and not in prerelease mode
// - If no C has a prerelease and the LT.semver tuple, return false
2020-08-21 12:45:16 +00:00
// - Else return true
2021-05-24 22:44:03 +00:00
const subset = ( sub , dom , options = { } ) => {
if ( sub === dom )
return true
2020-08-21 12:45:16 +00:00
sub = new Range ( sub , options )
dom = new Range ( dom , options )
let sawNonNull = false
OUTER : for ( const simpleSub of sub . set ) {
for ( const simpleDom of dom . set ) {
const isSub = simpleSubset ( simpleSub , simpleDom , options )
sawNonNull = sawNonNull || isSub !== null
if ( isSub )
continue OUTER
}
// the null set is a subset of everything, but null simple ranges in
// a complex range should be ignored. so if we saw a non-null range,
// then we know this isn't a subset, but if EVERY simple range was null,
// then it is a subset.
if ( sawNonNull )
return false
}
return true
}
const simpleSubset = ( sub , dom , options ) => {
2021-05-24 22:44:03 +00:00
if ( sub === dom )
return true
if ( sub . length === 1 && sub [ 0 ] . semver === ANY ) {
if ( dom . length === 1 && dom [ 0 ] . semver === ANY )
return true
else if ( options . includePrerelease )
sub = [ new Comparator ( '>=0.0.0-0' ) ]
else
sub = [ new Comparator ( '>=0.0.0' ) ]
}
if ( dom . length === 1 && dom [ 0 ] . semver === ANY ) {
if ( options . includePrerelease )
return true
else
dom = [ new Comparator ( '>=0.0.0' ) ]
}
2020-08-21 12:45:16 +00:00
const eqSet = new Set ( )
let gt , lt
for ( const c of sub ) {
if ( c . operator === '>' || c . operator === '>=' )
gt = higherGT ( gt , c , options )
else if ( c . operator === '<' || c . operator === '<=' )
lt = lowerLT ( lt , c , options )
else
eqSet . add ( c . semver )
}
if ( eqSet . size > 1 )
return null
let gtltComp
if ( gt && lt ) {
gtltComp = compare ( gt . semver , lt . semver , options )
if ( gtltComp > 0 )
return null
else if ( gtltComp === 0 && ( gt . operator !== '>=' || lt . operator !== '<=' ) )
return null
}
// will iterate one or zero times
for ( const eq of eqSet ) {
if ( gt && ! satisfies ( eq , String ( gt ) , options ) )
return null
if ( lt && ! satisfies ( eq , String ( lt ) , options ) )
return null
for ( const c of dom ) {
if ( ! satisfies ( eq , String ( c ) , options ) )
return false
}
2021-05-24 22:44:03 +00:00
2020-08-21 12:45:16 +00:00
return true
}
let higher , lower
let hasDomLT , hasDomGT
2021-05-24 22:44:03 +00:00
// if the subset has a prerelease, we need a comparator in the superset
// with the same tuple and a prerelease, or it's not a subset
let needDomLTPre = lt &&
! options . includePrerelease &&
lt . semver . prerelease . length ? lt . semver : false
let needDomGTPre = gt &&
! options . includePrerelease &&
gt . semver . prerelease . length ? gt . semver : false
// exception: <1.2.3-0 is the same as <1.2.3
if ( needDomLTPre && needDomLTPre . prerelease . length === 1 &&
lt . operator === '<' && needDomLTPre . prerelease [ 0 ] === 0 ) {
needDomLTPre = false
}
2020-08-21 12:45:16 +00:00
for ( const c of dom ) {
hasDomGT = hasDomGT || c . operator === '>' || c . operator === '>='
hasDomLT = hasDomLT || c . operator === '<' || c . operator === '<='
if ( gt ) {
2021-05-24 22:44:03 +00:00
if ( needDomGTPre ) {
if ( c . semver . prerelease && c . semver . prerelease . length &&
c . semver . major === needDomGTPre . major &&
c . semver . minor === needDomGTPre . minor &&
c . semver . patch === needDomGTPre . patch ) {
needDomGTPre = false
}
}
2020-08-21 12:45:16 +00:00
if ( c . operator === '>' || c . operator === '>=' ) {
higher = higherGT ( gt , c , options )
2021-05-24 22:44:03 +00:00
if ( higher === c && higher !== gt )
2020-08-21 12:45:16 +00:00
return false
} else if ( gt . operator === '>=' && ! satisfies ( gt . semver , String ( c ) , options ) )
return false
}
if ( lt ) {
2021-05-24 22:44:03 +00:00
if ( needDomLTPre ) {
if ( c . semver . prerelease && c . semver . prerelease . length &&
c . semver . major === needDomLTPre . major &&
c . semver . minor === needDomLTPre . minor &&
c . semver . patch === needDomLTPre . patch ) {
needDomLTPre = false
}
}
2020-08-21 12:45:16 +00:00
if ( c . operator === '<' || c . operator === '<=' ) {
lower = lowerLT ( lt , c , options )
2021-05-24 22:44:03 +00:00
if ( lower === c && lower !== lt )
2020-08-21 12:45:16 +00:00
return false
} else if ( lt . operator === '<=' && ! satisfies ( lt . semver , String ( c ) , options ) )
return false
}
if ( ! c . operator && ( lt || gt ) && gtltComp !== 0 )
return false
}
// if there was a < or >, and nothing in the dom, then must be false
// UNLESS it was limited by another range in the other direction.
// Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
if ( gt && hasDomLT && ! lt && gtltComp !== 0 )
return false
if ( lt && hasDomGT && ! gt && gtltComp !== 0 )
return false
2021-05-24 22:44:03 +00:00
// we needed a prerelease range in a specific tuple, but didn't get one
// then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,
// because it includes prereleases in the 1.2.3 tuple
if ( needDomGTPre || needDomLTPre )
return false
2020-08-21 12:45:16 +00:00
return true
}
// >=1.2.3 is lower than >1.2.3
const higherGT = ( a , b , options ) => {
if ( ! a )
return b
const comp = compare ( a . semver , b . semver , options )
return comp > 0 ? a
: comp < 0 ? b
: b . operator === '>' && a . operator === '>=' ? b
: a
}
// <=1.2.3 is higher than <1.2.3
const lowerLT = ( a , b , options ) => {
if ( ! a )
return b
const comp = compare ( a . semver , b . semver , options )
return comp < 0 ? a
: comp > 0 ? b
: b . operator === '<' && a . operator === '<=' ? b
: a
}
module . exports = subset
/***/ } ) ,
/***/ 866 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const patch = ( a , loose ) => new SemVer ( a , loose ) . patch
module . exports = patch
/***/ } ) ,
/***/ 898 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const compare = _ _webpack _require _ _ ( 309 )
const eq = ( a , b , loose ) => compare ( a , b , loose ) === 0
module . exports = eq
/***/ } ) ,
/***/ 900 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const SemVer = _ _webpack _require _ _ ( 88 )
const inc = ( version , release , options , identifier ) => {
if ( typeof ( options ) === 'string' ) {
identifier = options
options = undefined
}
try {
return new SemVer ( version , options ) . inc ( release , identifier ) . version
} catch ( er ) {
return null
}
}
module . exports = inc
/***/ } ) ,
/***/ 925 :
/***/ ( function ( module , _ _unusedexports , _ _webpack _require _ _ ) {
const { MAX _LENGTH } = _ _webpack _require _ _ ( 293 )
const { re , t } = _ _webpack _require _ _ ( 523 )
const SemVer = _ _webpack _require _ _ ( 88 )
2021-05-24 22:44:03 +00:00
const parseOptions = _ _webpack _require _ _ ( 785 )
2020-08-21 12:45:16 +00:00
const parse = ( version , options ) => {
2021-05-24 22:44:03 +00:00
options = parseOptions ( options )
2020-08-21 12:45:16 +00:00
if ( version instanceof SemVer ) {
return version
}
if ( typeof version !== 'string' ) {
return null
}
if ( version . length > MAX _LENGTH ) {
return null
}
const r = options . loose ? re [ t . LOOSE ] : re [ t . FULL ]
if ( ! r . test ( version ) ) {
return null
}
try {
return new SemVer ( version , options )
} catch ( er ) {
return null
}
}
module . exports = parse
2020-08-20 14:40:33 +00:00
/***/ } ) ,
2020-08-21 11:33:37 +00:00
/***/ 962 :
2020-08-15 12:45:36 +00:00
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
2021-06-22 07:52:03 +00:00
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
2020-08-15 12:45:36 +00:00
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
var _a ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2021-06-22 07:52:03 +00:00
exports . getCmdPath = exports . tryGetExecutablePath = exports . isRooted = exports . isDirectory = exports . exists = exports . IS _WINDOWS = exports . unlink = exports . symlink = exports . stat = exports . rmdir = exports . rename = exports . readlink = exports . readdir = exports . mkdir = exports . lstat = exports . copyFile = exports . chmod = void 0 ;
2021-05-24 22:48:47 +00:00
const fs = _ _importStar ( _ _webpack _require _ _ ( 747 ) ) ;
const path = _ _importStar ( _ _webpack _require _ _ ( 622 ) ) ;
2020-08-15 12:45:36 +00:00
_a = fs . promises , exports . chmod = _a . chmod , exports . copyFile = _a . copyFile , exports . lstat = _a . lstat , exports . mkdir = _a . mkdir , exports . readdir = _a . readdir , exports . readlink = _a . readlink , exports . rename = _a . rename , exports . rmdir = _a . rmdir , exports . stat = _a . stat , exports . symlink = _a . symlink , exports . unlink = _a . unlink ;
exports . IS _WINDOWS = process . platform === 'win32' ;
function exists ( fsPath ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
try {
yield exports . stat ( fsPath ) ;
}
catch ( err ) {
if ( err . code === 'ENOENT' ) {
return false ;
}
throw err ;
}
return true ;
} ) ;
}
exports . exists = exists ;
function isDirectory ( fsPath , useStat = false ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
const stats = useStat ? yield exports . stat ( fsPath ) : yield exports . lstat ( fsPath ) ;
return stats . isDirectory ( ) ;
} ) ;
}
exports . isDirectory = isDirectory ;
/ * *
* On OSX / Linux , true if path starts with '/' . On Windows , true for paths like :
* \ , \ hello , \ \ hello \ share , C : , and C : \ hello ( and corresponding alternate separator cases ) .
* /
function isRooted ( p ) {
p = normalizeSeparators ( p ) ;
if ( ! p ) {
throw new Error ( 'isRooted() parameter "p" cannot be empty' ) ;
}
if ( exports . IS _WINDOWS ) {
return ( p . startsWith ( '\\' ) || /^[A-Z]:/i . test ( p ) // e.g. \ or \hello or \\hello
) ; // e.g. C: or C:\hello
}
return p . startsWith ( '/' ) ;
}
exports . isRooted = isRooted ;
/ * *
* Best effort attempt to determine whether a file exists and is executable .
* @ param filePath file path to check
* @ param extensions additional file extensions to try
* @ return if file exists and is executable , returns the file path . otherwise empty string .
* /
function tryGetExecutablePath ( filePath , extensions ) {
return _ _awaiter ( this , void 0 , void 0 , function * ( ) {
let stats = undefined ;
try {
// test file exists
stats = yield exports . stat ( filePath ) ;
}
catch ( err ) {
if ( err . code !== 'ENOENT' ) {
// eslint-disable-next-line no-console
console . log ( ` Unexpected error attempting to determine if executable file exists ' ${ filePath } ': ${ err } ` ) ;
}
}
if ( stats && stats . isFile ( ) ) {
if ( exports . IS _WINDOWS ) {
// on Windows, test for valid extension
const upperExt = path . extname ( filePath ) . toUpperCase ( ) ;
if ( extensions . some ( validExt => validExt . toUpperCase ( ) === upperExt ) ) {
return filePath ;
}
}
else {
if ( isUnixExecutable ( stats ) ) {
return filePath ;
}
}
}
// try each extension
const originalFilePath = filePath ;
for ( const extension of extensions ) {
filePath = originalFilePath + extension ;
stats = undefined ;
try {
stats = yield exports . stat ( filePath ) ;
}
catch ( err ) {
if ( err . code !== 'ENOENT' ) {
// eslint-disable-next-line no-console
console . log ( ` Unexpected error attempting to determine if executable file exists ' ${ filePath } ': ${ err } ` ) ;
}
}
if ( stats && stats . isFile ( ) ) {
if ( exports . IS _WINDOWS ) {
// preserve the case of the actual file (since an extension was appended)
try {
const directory = path . dirname ( filePath ) ;
const upperName = path . basename ( filePath ) . toUpperCase ( ) ;
for ( const actualName of yield exports . readdir ( directory ) ) {
if ( upperName === actualName . toUpperCase ( ) ) {
filePath = path . join ( directory , actualName ) ;
break ;
}
}
}
catch ( err ) {
// eslint-disable-next-line no-console
console . log ( ` Unexpected error attempting to determine the actual case of the file ' ${ filePath } ': ${ err } ` ) ;
}
return filePath ;
}
else {
if ( isUnixExecutable ( stats ) ) {
return filePath ;
}
}
}
}
return '' ;
} ) ;
}
exports . tryGetExecutablePath = tryGetExecutablePath ;
function normalizeSeparators ( p ) {
p = p || '' ;
if ( exports . IS _WINDOWS ) {
// convert slashes on Windows
p = p . replace ( /\//g , '\\' ) ;
// remove redundant slashes
return p . replace ( /\\\\+/g , '\\' ) ;
}
// remove redundant slashes
return p . replace ( /\/\/+/g , '/' ) ;
}
// on Mac/Linux, test the execute bit
// R W X R W X R W X
// 256 128 64 32 16 8 4 2 1
function isUnixExecutable ( stats ) {
return ( ( stats . mode & 1 ) > 0 ||
( ( stats . mode & 8 ) > 0 && stats . gid === process . getgid ( ) ) ||
( ( stats . mode & 64 ) > 0 && stats . uid === process . getuid ( ) ) ) ;
}
2021-06-22 07:52:03 +00:00
// Get the path of cmd.exe in windows
function getCmdPath ( ) {
var _a ;
return ( _a = process . env [ 'COMSPEC' ] ) !== null && _a !== void 0 ? _a : ` cmd.exe ` ;
}
exports . getCmdPath = getCmdPath ;
2020-08-15 12:45:36 +00:00
//# sourceMappingURL=io-util.js.map
2020-08-21 12:45:16 +00:00
/***/ } ) ,
/***/ 981 :
/***/ ( function ( _ _unusedmodule , exports , _ _webpack _require _ _ ) {
"use strict" ;
var _ _createBinding = ( this && this . _ _createBinding ) || ( Object . create ? ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
Object . defineProperty ( o , k2 , { enumerable : true , get : function ( ) { return m [ k ] ; } } ) ;
} ) : ( function ( o , m , k , k2 ) {
if ( k2 === undefined ) k2 = k ;
o [ k2 ] = m [ k ] ;
} ) ) ;
var _ _setModuleDefault = ( this && this . _ _setModuleDefault ) || ( Object . create ? ( function ( o , v ) {
Object . defineProperty ( o , "default" , { enumerable : true , value : v } ) ;
} ) : function ( o , v ) {
o [ "default" ] = v ;
} ) ;
var _ _importStar = ( this && this . _ _importStar ) || function ( mod ) {
if ( mod && mod . _ _esModule ) return mod ;
var result = { } ;
if ( mod != null ) for ( var k in mod ) if ( k !== "default" && Object . hasOwnProperty . call ( mod , k ) ) _ _createBinding ( result , mod , k ) ;
_ _setModuleDefault ( result , mod ) ;
return result ;
} ;
var _ _awaiter = ( this && this . _ _awaiter ) || function ( thisArg , _arguments , P , generator ) {
function adopt ( value ) { return value instanceof P ? value : new P ( function ( resolve ) { resolve ( value ) ; } ) ; }
return new ( P || ( P = Promise ) ) ( function ( resolve , reject ) {
function fulfilled ( value ) { try { step ( generator . next ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function rejected ( value ) { try { step ( generator [ "throw" ] ( value ) ) ; } catch ( e ) { reject ( e ) ; } }
function step ( result ) { result . done ? resolve ( result . value ) : adopt ( result . value ) . then ( fulfilled , rejected ) ; }
step ( ( generator = generator . apply ( thisArg , _arguments || [ ] ) ) . next ( ) ) ;
} ) ;
} ;
Object . defineProperty ( exports , "__esModule" , { value : true } ) ;
2020-12-17 19:21:48 +00:00
exports . getDockerLoginCmds = exports . parseCLIVersion = exports . getCLIVersion = exports . execCLI = exports . getCLI = exports . getAccountIDs = exports . getRegion = exports . isPubECR = exports . isECR = void 0 ;
2020-08-21 12:45:16 +00:00
const semver = _ _importStar ( _ _webpack _require _ _ ( 383 ) ) ;
2021-06-22 09:09:26 +00:00
const exec = _ _importStar ( _ _webpack _require _ _ ( 514 ) ) ;
2020-08-21 12:45:16 +00:00
const io = _ _importStar ( _ _webpack _require _ _ ( 436 ) ) ;
2020-12-17 19:21:48 +00:00
const ecrRegistryRegex = /^(([0-9]{12})\.dkr\.ecr\.(.+)\.amazonaws\.com(.cn)?)(\/([^:]+)(:.+)?)?$/ ;
exports . isECR = ( registry ) => {
return ecrRegistryRegex . test ( registry ) || exports . isPubECR ( registry ) ;
} ;
exports . isPubECR = ( registry ) => {
2020-12-11 06:15:35 +00:00
return registry === 'public.ecr.aws' ;
2020-12-17 19:21:48 +00:00
} ;
exports . getRegion = ( registry ) => {
if ( exports . isPubECR ( registry ) ) {
2020-12-11 06:15:35 +00:00
return process . env . AWS _REGION || process . env . AWS _DEFAULT _REGION || 'us-east-1' ;
}
2020-12-17 19:21:48 +00:00
const matches = registry . match ( ecrRegistryRegex ) ;
if ( ! matches ) {
return '' ;
}
return matches [ 3 ] ;
} ;
exports . getAccountIDs = ( registry ) => {
if ( exports . isPubECR ( registry ) ) {
return [ ] ;
}
const matches = registry . match ( ecrRegistryRegex ) ;
if ( ! matches ) {
return [ ] ;
}
let accountIDs = [ matches [ 2 ] ] ;
if ( process . env . AWS _ACCOUNT _IDS ) {
accountIDs . push ( ... process . env . AWS _ACCOUNT _IDS . split ( ',' ) ) ;
}
return accountIDs . filter ( ( item , index ) => accountIDs . indexOf ( item ) === index ) ;
} ;
2020-08-21 12:45:16 +00:00
exports . getCLI = ( ) => _ _awaiter ( void 0 , void 0 , void 0 , function * ( ) {
return io . which ( 'aws' , true ) ;
} ) ;
2020-08-21 14:29:54 +00:00
exports . execCLI = ( args ) => _ _awaiter ( void 0 , void 0 , void 0 , function * ( ) {
2021-06-22 09:09:26 +00:00
return exec
. getExecOutput ( yield exports . getCLI ( ) , args , {
ignoreReturnCode : true ,
silent : true
} )
. then ( res => {
if ( res . stderr . length > 0 && res . exitCode != 0 ) {
throw new Error ( res . stderr . trim ( ) ) ;
2020-08-21 12:45:16 +00:00
}
2021-06-22 09:09:26 +00:00
else if ( res . stderr . length > 0 ) {
2020-08-21 13:07:43 +00:00
return res . stderr . trim ( ) ;
}
else {
return res . stdout . trim ( ) ;
}
2020-08-21 12:45:16 +00:00
} ) ;
} ) ;
2020-08-21 12:56:11 +00:00
exports . getCLIVersion = ( ) => _ _awaiter ( void 0 , void 0 , void 0 , function * ( ) {
2020-08-21 14:29:54 +00:00
return exports . parseCLIVersion ( yield exports . execCLI ( [ '--version' ] ) ) ;
2020-08-21 12:56:11 +00:00
} ) ;
2020-08-21 12:45:16 +00:00
exports . parseCLIVersion = ( stdout ) => _ _awaiter ( void 0 , void 0 , void 0 , function * ( ) {
const matches = /aws-cli\/([0-9.]+)/ . exec ( stdout ) ;
2020-08-21 13:27:22 +00:00
if ( ! matches ) {
throw new Error ( ` Cannot parse AWS CLI version ` ) ;
}
return semver . clean ( matches [ 1 ] ) ;
} ) ;
2020-12-17 19:21:48 +00:00
exports . getDockerLoginCmds = ( cliVersion , registry , region , accountIDs ) => _ _awaiter ( void 0 , void 0 , void 0 , function * ( ) {
2020-12-11 06:15:35 +00:00
let ecrCmd = ( yield exports . isPubECR ( registry ) ) ? 'ecr-public' : 'ecr' ;
2020-12-17 06:49:50 +00:00
if ( semver . satisfies ( cliVersion , '>=2.0.0' ) || ( yield exports . isPubECR ( registry ) ) ) {
2020-12-11 06:15:35 +00:00
return exports . execCLI ( [ ecrCmd , 'get-login-password' , '--region' , region ] ) . then ( pwd => {
2020-12-16 20:53:24 +00:00
return [ ` docker login --username AWS --password ${ pwd } ${ registry } ` ] ;
2020-08-21 13:27:22 +00:00
} ) ;
}
else {
2020-12-17 19:21:48 +00:00
return exports . execCLI ( [
ecrCmd ,
'get-login' ,
'--region' ,
region ,
'--registry-ids' ,
accountIDs . join ( ' ' ) ,
'--no-include-email'
] ) . then ( dockerLoginCmds => {
2020-12-16 20:53:24 +00:00
return dockerLoginCmds . trim ( ) . split ( ` \n ` ) ;
2020-08-21 13:27:22 +00:00
} ) ;
2020-08-21 12:45:16 +00:00
}
} ) ;
//# sourceMappingURL=aws.js.map
2020-08-15 12:45:36 +00:00
/***/ } )
/******/ } ) ;