2018-12-30 03:20:24 -08:00
/**
* @author masq [github.cyberchef@masq.cc]
2019-12-20 15:54:39 +00:00
* @author n1073645
2018-12-30 03:20:24 -08:00
* @copyright Crown Copyright 2018
* @license Apache-2.0
*/
2019-07-09 12:23:59 +01:00
import Operation from "../Operation.mjs" ;
2019-12-20 15:54:39 +00:00
import OperationError from "../errors/OperationError.mjs" ;
2018-12-30 03:20:24 -08:00
/**
* To Case Insensitive Regex operation
*/
class ToCaseInsensitiveRegex extends Operation {
/**
* ToCaseInsensitiveRegex constructor
*/
constructor () {
super ();
this . name = "To Case Insensitive Regex" ;
this . module = "Default" ;
2019-01-10 15:01:01 +00:00
this . description = "Converts a case-sensitive regex string into a case-insensitive regex string in case the i flag is unavailable to you.<br><br>e.g. <code>Mozilla/[0-9].[0-9] .*</code> becomes <code>[mM][oO][zZ][iI][lL][lL][aA]/[0-9].[0-9] .*</code>" ;
2018-12-30 03:20:24 -08:00
this . infoURL = "https://wikipedia.org/wiki/Regular_expression" ;
this . inputType = "string" ;
this . outputType = "string" ;
this . args = [];
}
/**
* @param {string} input
* @param {Object[]} args
* @returns {string}
*/
run ( input , args ) {
2019-11-21 12:13:34 +00:00
2019-11-18 13:21:05 +00:00
/**
* Simulates look behind behaviour since javascript doesn't support it.
*
* @param {string} input
* @returns {string}
*/
function preProcess ( input ) {
let result = "" ;
for ( let i = 0 ; i < input . length ; i ++ ) {
const temp = input . charAt ( i );
if ( temp . match ( /[a-zA-Z]/g ) && ( input . charAt ( i - 1 ) !== "-" ) && ( input . charAt ( i + 1 ) !== "-" ))
result += "[" + temp . toLowerCase () + temp . toUpperCase () + "]" ;
else
result += temp ;
}
return result ;
}
2019-11-22 10:45:02 +00:00
try {
RegExp ( input );
} catch ( error ) {
2019-12-20 15:54:39 +00:00
throw new OperationError ( "Invalid Regular Expression (Please note this version of node does not support look behinds)." );
2019-11-22 10:45:02 +00:00
}
2019-11-20 09:28:34 +00:00
// Example: [test] -> [[tT][eE][sS][tT]]
2019-11-21 09:11:12 +00:00
return preProcess ( input )
2019-11-18 13:21:05 +00:00
2019-11-21 09:56:52 +00:00
// Example: [A-Z] -> [A-Za-z]
2019-11-22 10:45:02 +00:00
. replace ( /([A-Z]-[A-Z]|[a-z]-[a-z])/g , m => ` ${ m [ 0 ]. toUpperCase () } - ${ m [ 2 ]. toUpperCase () }${ m [ 0 ]. toLowerCase () } - ${ m [ 2 ]. toLowerCase () } ` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [H-d] -> [A-DH-dh-z]
. replace ( /[A-Z]-[a-z]/g , m => `A- ${ m [ 2 ]. toUpperCase () }${ m }${ m [ 0 ]. toLowerCase () } -z` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [!-D] -> [!-Da-d]
. replace ( /\\?[ -@]-[A-Z]/g , m => ` ${ m } a- ${ m [ 2 ]. toLowerCase () } ` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [%-^] -> [%-^a-z]
. replace ( /\\?[ -@]-\\?[[-`]/g , m => ` ${ m } a-z` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [K-`] -> [K-`k-z]
. replace ( /[A-Z]-\\?[[-`]/g , m => ` ${ m }${ m [ 0 ]. toLowerCase () } -z` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [[-}] -> [[-}A-Z]
. replace ( /\\?[[-`]-\\?[{-~]/g , m => ` ${ m } A-Z` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [b-}] -> [b-}B-Z]
. replace ( /[a-z]-\\?[{-~]/g , m => ` ${ m }${ m [ 0 ]. toUpperCase () } -Z` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [<-j] -> [<-z]
. replace ( /\\?[ -@]-[a-z]/g , m => ` ${ m [ 0 ] } -z` )
2019-11-18 13:31:19 +00:00
2019-11-21 09:56:52 +00:00
// Example: [^-j] -> [A-J^-j]
. replace ( /\\?[[-`]-[a-z]/g , m => `A- ${ m [ 2 ]. toUpperCase () }${ m } ` );
2019-11-20 09:28:34 +00:00
2018-12-30 03:20:24 -08:00
}
}
export default ToCaseInsensitiveRegex ;