Cool_Tools/CyberChef
1
0
Fork 0
mirror of synced 2024-11-16 03:03:22 +01:00
Code Releases Activity

Added 'More Info' links to the descriptions of many operations for #265

Browse Source
This commit is contained in:
George J 2018-05-05 00:43:42 +01:00
parent 403296cc59
commit c7f13ff67f
3 changed files with 108 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/core/Operation.js
View File

@ -18,6 +18,7 @@ const Operation = function(operationName) {
this.name = operationName;
this.module = "";
this.description = "";
this.infoURL = null;
this.inputType = -1;
this.outputType = -1;
this.run = null;
@ -42,6 +43,7 @@ const Operation = function(operationName) {
Operation.prototype._parseConfig = function(operationConfig) {
this.module = operationConfig.module;
this.description = operationConfig.description;
this.infoURL = operationConfig.infoURL;
this.inputType = Dish.typeEnum(operationConfig.inputType);
this.outputType = Dish.typeEnum(operationConfig.outputType);
this.highlight = operationConfig.highlight;

99
src/core/config/OperationConfig.js
View File

@ -226,6 +226,7 @@ const OperationConfig = {
"From Base64": {
module: "Default",
description: "Base64 is a notation for encoding arbitrary byte data using a restricted set of symbols that can be conveniently used by humans and processed by computers.<br><br>This operation decodes data from an ASCII Base64 string back into its raw format.<br><br>e.g. <code>aGVsbG8=</code> becomes <code>hello</code>",
infoURL: "https://wikipedia.org/wiki/Base64",
highlight: "func",
highlightReverse: "func",
inputType: "string",
@ -246,6 +247,7 @@ const OperationConfig = {
"To Base64": {
module: "Default",
description: "Base64 is a notation for encoding arbitrary byte data using a restricted set of symbols that can be conveniently used by humans and processed by computers.<br><br>This operation encodes data in an ASCII Base64 string.<br><br>e.g. <code>hello</code> becomes <code>aGVsbG8=</code>",
infoURL: "https://wikipedia.org/wiki/Base64",
highlight: "func",
highlightReverse: "func",
inputType: "ArrayBuffer",
@ -261,6 +263,7 @@ const OperationConfig = {
"From Base58": {
module: "Default",
description: "Base58 (similar to Base64) is a notation for encoding arbitrary byte data. It differs from Base64 by removing easily misread characters (i.e. l, I, 0 and O) to improve human readability.<br><br>This operation decodes data from an ASCII string (with an alphabet of your choosing, presets included) back into its raw form.<br><br>e.g. <code>StV1DL6CwTryKyV</code> becomes <code>hello world</code><br><br>Base58 is commonly used in cryptocurrencies (Bitcoin, Ripple, etc).",
infoURL: "https://wikipedia.org/wiki/Base58",
inputType: "string",
outputType: "byteArray",
args: [
@ -279,6 +282,7 @@ const OperationConfig = {
"To Base58": {
module: "Default",
description: "Base58 (similar to Base64) is a notation for encoding arbitrary byte data. It differs from Base64 by removing easily misread characters (i.e. l, I, 0 and O) to improve human readability.<br><br>This operation encodes data in an ASCII string (with an alphabet of your choosing, presets included).<br><br>e.g. <code>hello world</code> becomes <code>StV1DL6CwTryKyV</code><br><br>Base58 is commonly used in cryptocurrencies (Bitcoin, Ripple, etc).",
infoURL: "https://wikipedia.org/wiki/Base58",
inputType: "byteArray",
outputType: "string",
args: [
@ -292,6 +296,7 @@ const OperationConfig = {
"From Base32": {
module: "Default",
description: "Base32 is a notation for encoding arbitrary byte data using a restricted set of symbols that can be conveniently used by humans and processed by computers. It uses a smaller set of characters than Base64, usually the uppercase alphabet and the numbers 2 to 7.",
infoURL: "https://wikipedia.org/wiki/Base32",
inputType: "string",
outputType: "byteArray",
args: [
@ -310,6 +315,7 @@ const OperationConfig = {
"To Base32": {
module: "Default",
description: "Base32 is a notation for encoding arbitrary byte data using a restricted set of symbols that can be conveniently used by humans and processed by computers. It uses a smaller set of characters than Base64, usually the uppercase alphabet and the numbers 2 to 7.",
infoURL: "https://wikipedia.org/wiki/Base32",
inputType: "byteArray",
outputType: "string",
args: [
@ -341,6 +347,7 @@ const OperationConfig = {
"Disassemble x86": {
module: "Shellcode",
description: "Disassembly is the process of translating machine language into assembly language.<br><br>This operation supports 64-bit, 32-bit and 16-bit code written for Intel or AMD x86 processors. It is particularly useful for reverse engineering shellcode.<br><br>Input should be in hexadecimal.",
infoURL: "https://wikipedia.org/wiki/X86",
inputType: "string",
outputType: "string",
args: [
@ -379,6 +386,7 @@ const OperationConfig = {
"XOR": {
module: "Default",
description: "XOR the input with the given key.<br>e.g. <code>fe023da5</code><br><br><strong>Options</strong><br><u>Null preserving:</u> If the current byte is 0x00 or the same as the key, skip it.<br><br><u>Scheme:</u><ul><li>Standard - key is unchanged after each round</li><li>Input differential - key is set to the value of the previous unprocessed byte</li><li>Output differential - key is set to the value of the previous processed byte</li></ul>",
infoURL: "https://wikipedia.org/wiki/XOR",
highlight: true,
highlightReverse: true,
inputType: "byteArray",
@ -604,6 +612,7 @@ const OperationConfig = {
"Standard Deviation": {
module: "Default",
description: "Computes the standard deviation of a number list. If an item in the string is not a number it is excluded from the list.<br><br>e.g. <code>0x0a 8 .5</code> becomes <code>4.089281382128433</code>",
infoURL: "https://wikipedia.org/wiki/Standard_deviation",
inputType: "string",
outputType: "BigNumber",
args: [
@ -645,6 +654,7 @@ const OperationConfig = {
"From Hex": {
module: "Default",
description: "Converts a hexadecimal byte string back into its raw value.<br><br>e.g. <code>ce 93 ce b5 ce b9 ce ac 20 cf 83 ce bf cf 85 0a</code> becomes the UTF-8 encoded string <code>Γειά σου</code>",
infoURL: "https://wikipedia.org/wiki/Hexadecimal",
highlight: "func",
highlightReverse: "func",
inputType: "string",
@ -660,6 +670,7 @@ const OperationConfig = {
"To Hex": {
module: "Default",
description: "Converts the input string to hexadecimal bytes separated by the specified delimiter.<br><br>e.g. The UTF-8 encoded string <code>Γειά σου</code> becomes <code>ce 93 ce b5 ce b9 ce ac 20 cf 83 ce bf cf 85 0a</code>",
infoURL: "https://wikipedia.org/wiki/Hexadecimal",
highlight: "func",
highlightReverse: "func",
inputType: "ArrayBuffer",
@ -675,6 +686,7 @@ const OperationConfig = {
"From Octal": {
module: "Default",
description: "Converts an octal byte string back into its raw value.<br><br>e.g. <code>316 223 316 265 316 271 316 254 40 317 203 316 277 317 205</code> becomes the UTF-8 encoded string <code>Γειά σου</code>",
infoURL: "https://wikipedia.org/wiki/Octal",
highlight: false,
highlightReverse: false,
inputType: "string",
@ -690,6 +702,7 @@ const OperationConfig = {
"To Octal": {
module: "Default",
description: "Converts the input string to octal bytes separated by the specified delimiter.<br><br>e.g. The UTF-8 encoded string <code>Γειά σου</code> becomes <code>316 223 316 265 316 271 316 254 40 317 203 316 277 317 205</code>",
infoURL: "https://wikipedia.org/wiki/Octal",
highlight: false,
highlightReverse: false,
inputType: "byteArray",
@ -746,6 +759,7 @@ const OperationConfig = {
"From Binary": {
module: "Default",
description: "Converts a binary string back into its raw form.<br><br>e.g. <code>01001000 01101001</code> becomes <code>Hi</code>",
infoURL: "https://wikipedia.org/wiki/Binary_code",
highlight: "func",
highlightReverse: "func",
inputType: "string",
@ -761,6 +775,7 @@ const OperationConfig = {
"To Binary": {
module: "Default",
description: "Displays the input data as a binary string.<br><br>e.g. <code>Hi</code> becomes <code>01001000 01101001</code>",
infoURL: "https://wikipedia.org/wiki/Binary_code",
highlight: "func",
highlightReverse: "func",
inputType: "byteArray",
@ -802,6 +817,7 @@ const OperationConfig = {
"From Hexdump": {
module: "Default",
description: "Attempts to convert a hexdump back into raw data. This operation supports many different hexdump variations, but probably not all. Make sure you verify that the data it gives you is correct before continuing analysis.",
infoURL: "https://wikipedia.org/wiki/Hex_dump",
highlight: "func",
highlightReverse: "func",
inputType: "string",
@ -811,6 +827,7 @@ const OperationConfig = {
"To Hexdump": {
module: "Default",
description: "Creates a hexdump of the input data, displaying both the hexadecimal values of each byte and an ASCII representation alongside.",
infoURL: "https://wikipedia.org/wiki/Hex_dump",
highlight: "func",
highlightReverse: "func",
inputType: "ArrayBuffer",
@ -836,6 +853,7 @@ const OperationConfig = {
"From Base": {
module: "Default",
description: "Converts a number to decimal from a given numerical base.",
infoURL: "https://wikipedia.org/wiki/Radix",
inputType: "string",
outputType: "BigNumber",
args: [
@ -849,6 +867,7 @@ const OperationConfig = {
"To Base": {
module: "Default",
description: "Converts a decimal number to a given numerical base.",
infoURL: "https://wikipedia.org/wiki/Radix",
inputType: "BigNumber",
outputType: "string",
args: [
@ -925,6 +944,7 @@ const OperationConfig = {
"Parse URI": {
module: "URL",
description: "Pretty prints complicated Uniform Resource Identifier (URI) strings for ease of reading. Particularly useful for Uniform Resource Locators (URLs) with a lot of arguments.",
infoURL: "https://wikipedia.org/wiki/Uniform_Resource_Identifier",
inputType: "string",
outputType: "string",
args: []
@ -973,6 +993,7 @@ const OperationConfig = {
"From Quoted Printable": {
module: "Default",
description: "Converts QP-encoded text back to standard text.",
infoURL: "https://wikipedia.org/wiki/Quoted-printable",
inputType: "string",
outputType: "byteArray",
args: []
@ -980,6 +1001,7 @@ const OperationConfig = {
"To Quoted Printable": {
module: "Default",
description: "Quoted-Printable, or QP encoding, is an encoding using printable ASCII characters (alphanumeric and the equals sign '=') to transmit 8-bit data over a 7-bit data path or, generally, over a medium which is not 8-bit clean. It is defined as a MIME content transfer encoding for use in e-mail.<br><br>QP works by using the equals sign '=' as an escape character. It also limits line length to 76, as some software has limits on line length.",
infoURL: "https://wikipedia.org/wiki/Quoted-printable",
inputType: "byteArray",
outputType: "string",
args: []
@ -987,6 +1009,7 @@ const OperationConfig = {
"From Punycode": {
module: "Encodings",
description: "Punycode is a way to represent Unicode with the limited character subset of ASCII supported by the Domain Name System.<br><br>e.g. <code>mnchen-3ya</code> decodes to <code>münchen</code>",
infoURL: "https://wikipedia.org/wiki/Punycode",
inputType: "string",
outputType: "string",
args: [
@ -1000,6 +1023,7 @@ const OperationConfig = {
"To Punycode": {
module: "Encodings",
description: "Punycode is a way to represent Unicode with the limited character subset of ASCII supported by the Domain Name System.<br><br>e.g. <code>münchen</code> encodes to <code>mnchen-3ya</code>",
infoURL: "https://wikipedia.org/wiki/Punycode",
inputType: "string",
outputType: "string",
args: [
@ -1102,6 +1126,7 @@ const OperationConfig = {
"Parse IPv6 address": {
module: "JSBN",
description: "Displays the longhand and shorthand versions of a valid IPv6 address.<br><br>Recognises all reserved ranges and parses encapsulated or tunnelled addresses including Teredo and 6to4.",
infoURL: "https://wikipedia.org/wiki/IPv6_address",
inputType: "string",
outputType: "string",
args: []
@ -1162,6 +1187,7 @@ const OperationConfig = {
"AES Decrypt": {
module: "Ciphers",
description: "Advanced Encryption Standard (AES) is a U.S. Federal Information Processing Standard (FIPS). It was selected after a 5-year process where 15 competing designs were evaluated.<br><br><b>Key:</b> The following algorithms will be used based on the size of the key:<ul><li>16 bytes = AES-128</li><li>24 bytes = AES-192</li><li>32 bytes = AES-256</li></ul><br><br><b>IV:</b> The Initialization Vector should be 16 bytes long. If not entered, it will default to 16 null bytes.<br><br><b>Padding:</b> In CBC and ECB mode, PKCS#7 padding will be used.<br><br><b>GCM Tag:</b> This field is ignored unless 'GCM' mode is used.",
infoURL: "https://wikipedia.org/wiki/Advanced_Encryption_Standard",
inputType: "string",
outputType: "string",
args: [
@ -1203,6 +1229,7 @@ const OperationConfig = {
"AES Encrypt": {
module: "Ciphers",
description: "Advanced Encryption Standard (AES) is a U.S. Federal Information Processing Standard (FIPS). It was selected after a 5-year process where 15 competing designs were evaluated.<br><br><b>Key:</b> The following algorithms will be used based on the size of the key:<ul><li>16 bytes = AES-128</li><li>24 bytes = AES-192</li><li>32 bytes = AES-256</li></ul>You can generate a password-based key using one of the KDF operations.<br><br><b>IV:</b> The Initialization Vector should be 16 bytes long. If not entered, it will default to 16 null bytes.<br><br><b>Padding:</b> In CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/Advanced_Encryption_Standard",
inputType: "string",
outputType: "string",
args: [
@ -1238,6 +1265,7 @@ const OperationConfig = {
"DES Decrypt": {
module: "Ciphers",
description: "DES is a previously dominant algorithm for encryption, and was published as an official U.S. Federal Information Processing Standard (FIPS). It is now considered to be insecure due to its small key size.<br><br><b>Key:</b> DES uses a key length of 8 bytes (64 bits).<br>Triple DES uses a key length of 24 bytes (192 bits).<br><br><b>IV:</b> The Initialization Vector should be 8 bytes long. If not entered, it will default to 8 null bytes.<br><br><b>Padding:</b> In CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/Data_Encryption_Standard",
inputType: "string",
outputType: "string",
args: [
@ -1273,6 +1301,7 @@ const OperationConfig = {
"DES Encrypt": {
module: "Ciphers",
description: "DES is a previously dominant algorithm for encryption, and was published as an official U.S. Federal Information Processing Standard (FIPS). It is now considered to be insecure due to its small key size.<br><br><b>Key:</b> DES uses a key length of 8 bytes (64 bits).<br>Triple DES uses a key length of 24 bytes (192 bits).<br><br>You can generate a password-based key using one of the KDF operations.<br><br><b>IV:</b> The Initialization Vector should be 8 bytes long. If not entered, it will default to 8 null bytes.<br><br><b>Padding:</b> In CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/Data_Encryption_Standard",
inputType: "string",
outputType: "string",
args: [
@ -1308,6 +1337,7 @@ const OperationConfig = {
"Triple DES Decrypt": {
module: "Ciphers",
description: "Triple DES applies DES three times to each block to increase key size.<br><br><b>Key:</b> Triple DES uses a key length of 24 bytes (192 bits).<br>DES uses a key length of 8 bytes (64 bits).<br><br><b>IV:</b> The Initialization Vector should be 8 bytes long. If not entered, it will default to 8 null bytes.<br><br><b>Padding:</b> In CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/Triple_DES",
inputType: "string",
outputType: "string",
args: [
@ -1343,6 +1373,7 @@ const OperationConfig = {
"Triple DES Encrypt": {
module: "Ciphers",
description: "Triple DES applies DES three times to each block to increase key size.<br><br><b>Key:</b> Triple DES uses a key length of 24 bytes (192 bits).<br>DES uses a key length of 8 bytes (64 bits).<br><br>You can generate a password-based key using one of the KDF operations.<br><br><b>IV:</b> The Initialization Vector should be 8 bytes long. If not entered, it will default to 8 null bytes.<br><br><b>Padding:</b> In CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/Triple_DES",
inputType: "string",
outputType: "string",
args: [
@ -1378,6 +1409,7 @@ const OperationConfig = {
"Blowfish Decrypt": {
module: "Ciphers",
description: "Blowfish is a symmetric-key block cipher designed in 1993 by Bruce Schneier and included in a large number of cipher suites and encryption products. AES now receives more attention.<br><br><b>IV:</b> The Initialization Vector should be 8 bytes long. If not entered, it will default to 8 null bytes.",
infoURL: "https://wikipedia.org/wiki/Blowfish_(cipher)",
inputType: "string",
outputType: "string",
args: [
@ -1413,6 +1445,7 @@ const OperationConfig = {
"Blowfish Encrypt": {
module: "Ciphers",
description: "Blowfish is a symmetric-key block cipher designed in 1993 by Bruce Schneier and included in a large number of cipher suites and encryption products. AES now receives more attention.<br><br><b>IV:</b> The Initialization Vector should be 8 bytes long. If not entered, it will default to 8 null bytes.",
infoURL: "https://wikipedia.org/wiki/Blowfish_(cipher)",
inputType: "string",
outputType: "string",
args: [
@ -1448,6 +1481,7 @@ const OperationConfig = {
"RC4": {
module: "Ciphers",
description: "RC4 (also known as ARC4) is a widely-used stream cipher designed by Ron Rivest. It is used in popular protocols such as SSL and WEP. Although remarkable for its simplicity and speed, the algorithm's history doesn't inspire confidence in its security.",
infoURL: "https://wikipedia.org/wiki/RC4",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1474,6 +1508,7 @@ const OperationConfig = {
"RC4 Drop": {
module: "Ciphers",
description: "It was discovered that the first few bytes of the RC4 keystream are strongly non-random and leak information about the key. We can defend against this attack by discarding the initial portion of the keystream. This modified algorithm is traditionally called RC4-drop.",
infoURL: "https://wikipedia.org/wiki/RC4",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1505,6 +1540,7 @@ const OperationConfig = {
"RC2 Decrypt": {
module: "Ciphers",
description: "RC2 (also known as ARC2) is a symmetric-key block cipher designed by Ron Rivest in 1987. 'RC' stands for 'Rivest Cipher'.<br><br><b>Key:</b> RC2 uses a variable size key.<br><br><b>IV:</b> To run the cipher in CBC mode, the Initialization Vector should be 8 bytes long. If the IV is left blank, the cipher will run in ECB mode.<br><br><b>Padding:</b> In both CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/RC2",
inputType: "string",
outputType: "string",
args: [
@ -1535,6 +1571,7 @@ const OperationConfig = {
"RC2 Encrypt": {
module: "Ciphers",
description: "RC2 (also known as ARC2) is a symmetric-key block cipher designed by Ron Rivest in 1987. 'RC' stands for 'Rivest Cipher'.<br><br><b>Key:</b> RC2 uses a variable size key.<br><br>You can generate a password-based key using one of the KDF operations.<br><br><b>IV:</b> To run the cipher in CBC mode, the Initialization Vector should be 8 bytes long. If the IV is left blank, the cipher will run in ECB mode.<br><br><b>Padding:</b> In both CBC and ECB mode, PKCS#7 padding will be used.",
infoURL: "https://wikipedia.org/wiki/RC2",
inputType: "string",
outputType: "string",
args: [
@ -1565,6 +1602,7 @@ const OperationConfig = {
"Pseudo-Random Number Generator": {
module: "Ciphers",
description: "A cryptographically-secure pseudo-random number generator (PRNG).<br><br>This operation uses the browser's built-in <code>crypto.getRandomValues()</code> method if available. If this cannot be found, it falls back to a Fortuna-based PRNG algorithm.",
infoURL: "https://wikipedia.org/wiki/Pseudorandom_number_generator",
inputType: "string",
outputType: "string",
args: [
@ -1583,6 +1621,7 @@ const OperationConfig = {
"Derive PBKDF2 key": {
module: "Ciphers",
description: "PBKDF2 is a password-based key derivation function. It is part of RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, specifically PKCS #5 v2.0, also published as Internet Engineering Task Force's RFC 2898.<br><br>In many applications of cryptography, user security is ultimately dependent on a password, and because a password usually can't be used directly as a cryptographic key, some processing is required.<br><br>A salt provides a large set of keys for any given password, and an iteration count increases the cost of producing keys from a password, thereby also increasing the difficulty of attack.<br><br>If you leave the salt argument empty, a random salt will be generated.",
infoURL: "https://wikipedia.org/wiki/PBKDF2",
inputType: "string",
outputType: "string",
args: [
@ -1653,6 +1692,7 @@ const OperationConfig = {
"Vigenère Encode": {
module: "Ciphers",
description: "The Vigenere cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution.",
infoURL: "https://wikipedia.org/wiki/Vigenère_cipher",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1668,6 +1708,7 @@ const OperationConfig = {
"Vigenère Decode": {
module: "Ciphers",
description: "The Vigenere cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution.",
infoURL: "https://wikipedia.org/wiki/Vigenère_cipher",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1683,6 +1724,7 @@ const OperationConfig = {
"Bifid Cipher Encode": {
module: "Ciphers",
description: "The Bifid cipher is a cipher which uses a Polybius square in conjunction with transposition, which can be fairly difficult to decipher without knowing the alphabet keyword.",
infoURL: "https://wikipedia.org/wiki/Bifid_cipher",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1698,6 +1740,7 @@ const OperationConfig = {
"Bifid Cipher Decode": {
module: "Ciphers",
description: "The Bifid cipher is a cipher which uses a Polybius square in conjunction with transposition, which can be fairly difficult to decipher without knowing the alphabet keyword.",
infoURL: "https://wikipedia.org/wiki/Bifid_cipher",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1713,6 +1756,7 @@ const OperationConfig = {
"Affine Cipher Encode": {
module: "Ciphers",
description: "The Affine cipher is a type of monoalphabetic substitution cipher, wherein each letter in an alphabet is mapped to its numeric equivalent, encrypted using simple mathematical function, <code>(ax + b) % 26</code>, and converted back to a letter.",
infoURL: "https://wikipedia.org/wiki/Affine_cipher",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1733,6 +1777,7 @@ const OperationConfig = {
"Affine Cipher Decode": {
module: "Ciphers",
description: "The Affine cipher is a type of monoalphabetic substitution cipher. To decrypt, each letter in an alphabet is mapped to its numeric equivalent, decrypted by a mathematical function, and converted back to a letter.",
infoURL: "https://wikipedia.org/wiki/Affine_cipher",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1753,6 +1798,7 @@ const OperationConfig = {
"Atbash Cipher": {
module: "Ciphers",
description: "Atbash is a mono-alphabetic substitution cipher originally used to encode the Hebrew alphabet. It has been modified here for use with the Latin alphabet.",
infoURL: "https://wikipedia.org/wiki/Atbash",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -1802,6 +1848,7 @@ const OperationConfig = {
"ROT13": {
module: "Default",
description: "A simple caesar substitution cipher which rotates alphabet characters by the specified amount (default 13).",
infoURL: "https://wikipedia.org/wiki/ROT13",
highlight: true,
highlightReverse: true,
inputType: "byteArray",
@ -1827,6 +1874,7 @@ const OperationConfig = {
"ROT47": {
module: "Default",
description: "A slightly more complex variation of a caesar cipher, which includes ASCII characters from 33 '!' to 126 '~'. Default rotation: 47.",
infoURL: "https://wikipedia.org/wiki/ROT13#Variants",
highlight: true,
highlightReverse: true,
inputType: "byteArray",
@ -1849,6 +1897,7 @@ const OperationConfig = {
"Parse User Agent": {
module: "HTTP",
description: "Attempts to identify and categorise information contained in a user-agent string.",
infoURL: "https://wikipedia.org/wiki/User_agent",
inputType: "string",
outputType: "string",
args: []
@ -1894,6 +1943,7 @@ const OperationConfig = {
"Encode NetBIOS Name": {
module: "Default",
description: "NetBIOS names as seen across the client interface to NetBIOS are exactly 16 bytes long. Within the NetBIOS-over-TCP protocols, a longer representation is used.<br><br>There are two levels of encoding. The first level maps a NetBIOS name into a domain system name. The second level maps the domain system name into the 'compressed' representation required for interaction with the domain name system.<br><br>This operation carries out the first level of encoding. See RFC 1001 for full details.",
infoURL: "https://wikipedia.org/wiki/NetBIOS",
inputType: "byteArray",
outputType: "byteArray",
args: [
@ -1907,6 +1957,7 @@ const OperationConfig = {
"Decode NetBIOS Name": {
module: "Default",
description: "NetBIOS names as seen across the client interface to NetBIOS are exactly 16 bytes long. Within the NetBIOS-over-TCP protocols, a longer representation is used.<br><br>There are two levels of encoding. The first level maps a NetBIOS name into a domain system name. The second level maps the domain system name into the 'compressed' representation required for interaction with the domain name system.<br><br>This operation decodes the first level of encoding. See RFC 1001 for full details.",
infoURL: "https://wikipedia.org/wiki/NetBIOS",
inputType: "byteArray",
outputType: "byteArray",
args: [
@ -2368,6 +2419,7 @@ const OperationConfig = {
"Regular expression": {
module: "Regex",
description: "Define your own regular expression (regex) to search the input data with, optionally choosing from a list of pre-defined patterns.<br><br>Supports extended regex syntax including the 'dot matches all' flag, named capture groups, full unicode coverage (including <code>\\p{}</code> categories and scripts as well as astral codes) and recursive matching.",
infoURL: "https://wikipedia.org/wiki/Regular_expression",
inputType: "string",
outputType: "html",
args: [
@ -2422,6 +2474,7 @@ const OperationConfig = {
"XPath expression": {
module: "Code",
description: "Extract information from an XML document with an XPath query",
infoURL: "https://wikipedia.org/wiki/XPath",
inputType: "string",
outputType: "string",
args: [
@ -2476,6 +2529,7 @@ const OperationConfig = {
"From UNIX Timestamp": {
module: "Default",
description: "Converts a UNIX timestamp to a datetime string.<br><br>e.g. <code>978346800</code> becomes <code>Mon 1 January 2001 11:00:00 UTC</code><br><br>A UNIX timestamp is a 32-bit value representing the number of seconds since January 1, 1970 UTC (the UNIX epoch).",
infoURL: "https://wikipedia.org/wiki/Unix_time",
inputType: "number",
outputType: "string",
args: [
@ -2489,6 +2543,7 @@ const OperationConfig = {
"To UNIX Timestamp": {
module: "Default",
description: "Parses a datetime string in UTC and returns the corresponding UNIX timestamp.<br><br>e.g. <code>Mon 1 January 2001 11:00:00</code> becomes <code>978346800</code><br><br>A UNIX timestamp is a 32-bit value representing the number of seconds since January 1, 1970 UTC (the UNIX epoch).",
infoURL: "https://wikipedia.org/wiki/Unix_time",
inputType: "string",
outputType: "string",
args: [
@ -3073,6 +3128,7 @@ const OperationConfig = {
"MD2": {
module: "Hashing",
description: "The MD2 (Message-Digest 2) algorithm is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers.<br><br>Although MD2 is no longer considered secure, even as of 2014, it remains in use in public key infrastructures as part of certificates generated with MD2 and RSA.",
infoURL: "https://wikipedia.org/wiki/MD2_(cryptography)",
inputType: "ArrayBuffer",
outputType: "string",
args: []
@ -3080,6 +3136,7 @@ const OperationConfig = {
"MD4": {
module: "Hashing",
description: "The MD4 (Message-Digest 4) algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has influenced later designs, such as the MD5, SHA-1 and RIPEMD algorithms.<br><br>The security of MD4 has been severely compromised.",
infoURL: "https://wikipedia.org/wiki/MD4",
inputType: "ArrayBuffer",
outputType: "string",
args: []
@ -3087,13 +3144,15 @@ const OperationConfig = {
"MD5": {
module: "Hashing",
description: "MD5 (Message-Digest 5) is a widely used hash function. It has been used in a variety of security applications and is also commonly used to check the integrity of files.<br><br>However, MD5 is not collision resistant and it isn't suitable for applications like SSL/TLS certificates or digital signatures that rely on this property.",
inputType: "ArrayBuffer",
infoURL: "https://wikipedia.org/wiki/MD5",
nputType: "ArrayBuffer",
outputType: "string",
args: []
},
"MD6": {
module: "Hashing",
description: "The MD6 (Message-Digest 6) algorithm is a cryptographic hash function. It uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs.",
infoURL: "https://wikipedia.org/wiki/MD6",
inputType: "string",
outputType: "string",
args: [
@ -3124,6 +3183,7 @@ const OperationConfig = {
"SHA1": {
module: "Hashing",
description: "The SHA (Secure Hash Algorithm) hash functions were designed by the NSA. SHA-1 is the most established of the existing SHA hash functions and it is used in a variety of security applications and protocols.<br><br>However, SHA-1's collision resistance has been weakening as new attacks are discovered or improved.",
infoURL: "https://wikipedia.org/wiki/SHA-1",
inputType: "ArrayBuffer",
outputType: "string",
args: []
@ -3131,6 +3191,7 @@ const OperationConfig = {
"SHA2": {
module: "Hashing",
description: "The SHA-2 (Secure Hash Algorithm 2) hash functions were designed by the NSA. SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA224, SHA256, SHA384, SHA512.<br><br><ul><li>SHA-512 operates on 64-bit words.</li><li>SHA-256 operates on 32-bit words.</li><li>SHA-384 is largely identical to SHA-512 but is truncated to 384 bytes.</li><li>SHA-224 is largely identical to SHA-256 but is truncated to 224 bytes.</li><li>SHA-512/224 and SHA-512/256 are truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4.</li></ul>",
infoURL: "https://wikipedia.org/wiki/SHA-2",
inputType: "ArrayBuffer",
outputType: "string",
args: [
@ -3144,6 +3205,7 @@ const OperationConfig = {
"SHA3": {
module: "Hashing",
description: "The SHA-3 (Secure Hash Algorithm 3) hash functions were released by NIST on August 5, 2015. Although part of the same series of standards, SHA-3 is internally quite different from the MD5-like structure of SHA-1 and SHA-2.<br><br>SHA-3 is a subset of the broader cryptographic primitive family Keccak designed by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche, building upon RadioGatún.",
infoURL: "https://wikipedia.org/wiki/SHA-3",
inputType: "ArrayBuffer",
outputType: "string",
args: [
@ -3189,6 +3251,7 @@ const OperationConfig = {
"RIPEMD": {
module: "Hashing",
description: "RIPEMD (RACE Integrity Primitives Evaluation Message Digest) is a family of cryptographic hash functions developed in Leuven, Belgium, by Hans Dobbertin, Antoon Bosselaers and Bart Preneel at the COSIC research group at the Katholieke Universiteit Leuven, and first published in 1996.<br><br>RIPEMD was based upon the design principles used in MD4, and is similar in performance to the more popular SHA-1.<br><br>",
infoURL: "https://wikipedia.org/wiki/RIPEMD",
inputType: "ArrayBuffer",
outputType: "string",
args: [
@ -3202,6 +3265,7 @@ const OperationConfig = {
"HAS-160": {
module: "Hashing",
description: "HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm. It is derived from SHA-1, with assorted changes intended to increase its security. It produces a 160-bit output.<br><br>HAS-160 is used in the same way as SHA-1. First it divides input in blocks of 512 bits each and pads the final block. A digest function updates the intermediate hash value by processing the input blocks in turn.<br><br>The message digest algorithm consists of 80 rounds.",
infoURL: "https://wikipedia.org/wiki/HAS-160",
inputType: "ArrayBuffer",
outputType: "string",
args: []
@ -3209,6 +3273,7 @@ const OperationConfig = {
"Whirlpool": {
module: "Hashing",
description: "Whirlpool is a cryptographic hash function designed by Vincent Rijmen (co-creator of AES) and Paulo S. L. M. Barreto, who first described it in 2000.<br><br>Several variants exist:<ul><li>Whirlpool-0 is the original version released in 2000.</li><li>Whirlpool-T is the first revision, released in 2001, improving the generation of the s-box.</li><li>Wirlpool is the latest revision, released in 2003, fixing a flaw in the difusion matrix.</li></ul>",
infoURL: "https://wikipedia.org/wiki/Whirlpool_(cryptography)",
inputType: "ArrayBuffer",
outputType: "string",
args: [
@ -3222,6 +3287,7 @@ const OperationConfig = {
"Snefru": {
module: "Hashing",
description: "Snefru is a cryptographic hash function invented by Ralph Merkle in 1990 while working at Xerox PARC. The function supports 128-bit and 256-bit output. It was named after the Egyptian Pharaoh Sneferu, continuing the tradition of the Khufu and Khafre block ciphers.<br><br>The original design of Snefru was shown to be insecure by Eli Biham and Adi Shamir who were able to use differential cryptanalysis to find hash collisions. The design was then modified by increasing the number of iterations of the main pass of the algorithm from two to eight.",
infoURL: "https://wikipedia.org/wiki/Snefru",
inputType: "ArrayBuffer",
outputType: "string",
args: [
@ -3280,6 +3346,7 @@ const OperationConfig = {
"HMAC": {
module: "Hashing",
description: "Keyed-Hash Message Authentication Codes (HMAC) are a mechanism for message authentication using cryptographic hash functions.",
infoURL: "https://wikipedia.org/wiki/HMAC",
inputType: "ArrayBuffer",
outputType: "string",
args: [
@ -3305,6 +3372,7 @@ const OperationConfig = {
"Fletcher-16 Checksum": {
module: "Hashing",
description: "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.",
infoURL: "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-16",
inputType: "byteArray",
outputType: "string",
args: []
@ -3312,6 +3380,7 @@ const OperationConfig = {
"Fletcher-32 Checksum": {
module: "Hashing",
description: "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.",
infoURL: "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-32",
inputType: "byteArray",
outputType: "string",
args: []
@ -3319,6 +3388,7 @@ const OperationConfig = {
"Fletcher-64 Checksum": {
module: "Hashing",
description: "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.",
infoURL: "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-64",
inputType: "byteArray",
outputType: "string",
args: []
@ -3326,6 +3396,7 @@ const OperationConfig = {
"Adler-32 Checksum": {
module: "Hashing",
description: "Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995, and is a modification of the Fletcher checksum. Compared to a cyclic redundancy check of the same length, it trades reliability for speed (preferring the latter).<br><br>Adler-32 is more reliable than Fletcher-16, and slightly less reliable than Fletcher-32.",
infoURL: "https://wikipedia.org/wiki/Adler-32",
inputType: "byteArray",
outputType: "string",
args: []
@ -3354,6 +3425,7 @@ const OperationConfig = {
"Entropy": {
module: "Default",
description: "Calculates the Shannon entropy of the input data which gives an idea of its randomness. 8 is the maximum.",
infoURL: "https://wikipedia.org/wiki/Entropy_(information_theory)",
inputType: "byteArray",
outputType: "html",
args: [
@ -3380,6 +3452,7 @@ const OperationConfig = {
"Chi Square": {
module: "Default",
description: "Calculates the Chi Square distribution of values.",
infoURL: "https://wikipedia.org/wiki/Chi-squared_distribution",
inputType: "ArrayBuffer",
outputType: "number",
args: []
@ -3394,6 +3467,7 @@ const OperationConfig = {
"Parse X.509 certificate": {
module: "PublicKey",
description: "X.509 is an ITU-T standard for a public key infrastructure (PKI) and Privilege Management Infrastructure (PMI). It is commonly involved with SSL/TLS security.<br><br>This operation displays the contents of a certificate in a human readable format, similar to the openssl command line tool.<br><br>Tags: X509, server hello, handshake",
infoURL: "https://wikipedia.org/wiki/X.509",
inputType: "string",
outputType: "string",
args: [
@ -3441,6 +3515,7 @@ const OperationConfig = {
"Parse ASN.1 hex string": {
module: "PublicKey",
description: "Abstract Syntax Notation One (ASN.1) is a standard and notation that describes rules and structures for representing, encoding, transmitting, and decoding data in telecommunications and computer networking.<br><br>This operation parses arbitrary ASN.1 data and presents the resulting tree.",
infoURL: "https://wikipedia.org/wiki/Abstract_Syntax_Notation_One",
inputType: "string",
outputType: "string",
args: [
@ -3525,6 +3600,7 @@ const OperationConfig = {
"Parse UNIX file permissions": {
module: "Default",
description: "Given a UNIX/Linux file permission string in octal or textual format, this operation explains which permissions are granted to which user groups.<br><br>Input should be in either octal (e.g. <code>755</code>) or textual (e.g. <code>drwxr-xr-x</code>) format.",
infoURL: "https://wikipedia.org/wiki/File_system_permissions#Traditional_Unix_permissions",
inputType: "string",
outputType: "string",
args: []
@ -3532,6 +3608,7 @@ const OperationConfig = {
"Swap endianness": {
module: "Default",
description: "Switches the data from big-endian to little-endian or vice-versa. Data can be read in as hexadecimal or raw bytes. It will be returned in the same format as it is entered.",
infoURL: "https://wikipedia.org/wiki/Endianness",
highlight: true,
highlightReverse: true,
inputType: "string",
@ -3593,6 +3670,7 @@ const OperationConfig = {
"Generate UUID": {
module: "Default",
description: "Generates an RFC 4122 version 4 compliant Universally Unique Identifier (UUID), also known as a Globally Unique Identifier (GUID).<br><br>A version 4 UUID relies on random numbers, in this case generated using <code>window.crypto</code> if available and falling back to <code>Math.random</code> if not.",
infoURL: "https://wikipedia.org/wiki/Universally_unique_identifier",
inputType: "string",
outputType: "string",
args: []
@ -3600,6 +3678,7 @@ const OperationConfig = {
"Substitute": {
module: "Ciphers",
description: "A substitution cipher allowing you to specify bytes to replace with other byte values. This can be used to create Caesar ciphers but is more powerful as any byte value can be substituted, not just letters, and the substitution values need not be in order.<br><br>Enter the bytes you want to replace in the Plaintext field and the bytes to replace them with in the Ciphertext field.<br><br>Non-printable bytes can be specified using string escape notation. For example, a line feed character can be written as either <code>\\n</code> or <code>\\x0a</code>.<br><br>Byte ranges can be specified using a hyphen. For example, the sequence <code>0123456789</code> can be written as <code>0-9</code>.",
infoURL: "https://wikipedia.org/wiki/Substitution_cipher",
inputType: "string",
outputType: "string",
args: [
@ -3658,6 +3737,7 @@ const OperationConfig = {
"To Morse Code": {
module: "Default",
description: "Translates alphanumeric characters into International Morse Code.<br><br>Ignores non-Morse characters.<br><br>e.g. <code>SOS</code> becomes <code>... --- ...</code>",
infoURL: "https://wikipedia.org/wiki/Morse_code",
inputType: "string",
outputType: "string",
args: [
@ -3681,6 +3761,7 @@ const OperationConfig = {
"From Morse Code": {
module: "Default",
description: "Translates Morse Code into (upper case) alphanumeric characters.",
infoURL: "https://wikipedia.org/wiki/Morse_code",
inputType: "string",
outputType: "string",
args: [
@ -3780,6 +3861,7 @@ const OperationConfig = {
"<br><br>",
"'Attempt to be context aware' will make the operation attempt to nicely transform variable and function names.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Snake_case",
inputType: "string",
outputType: "string",
args: [
@ -3801,6 +3883,7 @@ const OperationConfig = {
"<br><br>",
"'Attempt to be context aware' will make the operation attempt to nicely transform variable and function names.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Camel_case",
inputType: "string",
outputType: "string",
args: [
@ -3841,6 +3924,7 @@ const OperationConfig = {
"<br><br>",
"EXIF data from photos usually contains information about the image file itself as well as the device used to create it.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Exif",
inputType: "ArrayBuffer",
outputType: "string",
args: [],
@ -3865,6 +3949,7 @@ const OperationConfig = {
"<br><br>",
"EXIF data embedded in photos usually contains information about the image file itself as well as the device used to create it.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Exif",
inputType: "byteArray",
outputType: "byteArray",
args: []
@ -3914,6 +3999,7 @@ const OperationConfig = {
"From BCD": {
module: "Default",
description: "Binary-Coded Decimal (BCD) is a class of binary encodings of decimal numbers where each decimal digit is represented by a fixed number of bits, usually four or eight. Special bit patterns are sometimes used for a sign.",
infoURL: "https://wikipedia.org/wiki/Binary-coded_decimal",
inputType: "string",
outputType: "BigNumber",
args: [
@ -3943,6 +4029,7 @@ const OperationConfig = {
"To BCD": {
module: "Default",
description: "Binary-Coded Decimal (BCD) is a class of binary encodings of decimal numbers where each decimal digit is represented by a fixed number of bits, usually four or eight. Special bit patterns are sometimes used for a sign",
infoURL: "https://wikipedia.org/wiki/Binary-coded_decimal",
inputType: "BigNumber",
outputType: "string",
args: [
@ -4007,6 +4094,7 @@ const OperationConfig = {
"Generate TOTP": {
module: "Default",
description: "The Time-based One-Time Password algorithm (TOTP) is an algorithm that computes a one-time password from a shared secret key and the current time. It has been adopted as Internet Engineering Task Force standard RFC 6238, is the cornerstone of Initiative For Open Authentication (OATH), and is used in a number of two-factor authentication systems. A TOTP is an HOTP where the counter is the current time.<br><br>Enter the secret as the input or leave it blank for a random secret to be generated. T0 and T1 are in seconds.",
infoURL: "https://wikipedia.org/wiki/Time-based_One-time_Password_algorithm",
inputType: "byteArray",
outputType: "string",
args: [
@ -4040,6 +4128,7 @@ const OperationConfig = {
"Generate HOTP": {
module: "Default",
description: "The HMAC-based One-Time Password algorithm (HOTP) is an algorithm that computes a one-time password from a shared secret key and an incrementing counter. It has been adopted as Internet Engineering Task Force standard RFC 4226, is the cornerstone of Initiative For Open Authentication (OATH), and is used in a number of two-factor authentication systems.<br><br>Enter the secret as the input or leave it blank for a random secret to be generated.",
infoURL: "https://wikipedia.org/wiki/HMAC-based_One-time_Password_algorithm",
inputType: "byteArray",
outputType: "string",
args: [
@ -4081,6 +4170,7 @@ const OperationConfig = {
"Hamming Distance": {
module: "Default",
description: "In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other. In a more general context, the Hamming distance is one of several string metrics for measuring the edit distance between two sequences.",
infoURL: "https://wikipedia.org/wiki/Hamming_distance",
inputType: "string",
outputType: "string",
args: [
@ -4178,6 +4268,7 @@ const OperationConfig = {
"BSON serialise": {
module: "BSON",
description: "BSON is a computer data interchange format used mainly as a data storage and network transfer format in the MongoDB database. It is a binary form for representing simple data structures, associative arrays (called objects or documents in MongoDB), and various data types of specific interest to MongoDB. The name 'BSON' is based on the term JSON and stands for 'Binary JSON'.<br><br>Input data should be valid JSON.",
infoURL: "https://wikipedia.org/wiki/BSON",
inputType: "string",
outputType: "ArrayBuffer",
args: []
@ -4185,6 +4276,7 @@ const OperationConfig = {
"BSON deserialise": {
module: "BSON",
description: "BSON is a computer data interchange format used mainly as a data storage and network transfer format in the MongoDB database. It is a binary form for representing simple data structures, associative arrays (called objects or documents in MongoDB), and various data types of specific interest to MongoDB. The name 'BSON' is based on the term JSON and stands for 'Binary JSON'.<br><br>Input data should be in a raw bytes format.",
infoURL: "https://wikipedia.org/wiki/BSON",
inputType: "ArrayBuffer",
outputType: "string",
args: []
@ -4192,6 +4284,7 @@ const OperationConfig = {
"Generate PGP Key Pair": {
module: "PGP",
description: "Generates a new public/private PGP key pair. Supports RSA and Eliptic Curve (EC) keys.",
infoURL: "https://wikipedia.org/wiki/Pretty_Good_Privacy",
inputType: "string",
outputType: "string",
args: [
@ -4228,6 +4321,7 @@ const OperationConfig = {
"<br><br>",
"This function uses the Keybase implementation of PGP.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Pretty_Good_Privacy",
inputType: "string",
outputType: "string",
args: [
@ -4250,6 +4344,7 @@ const OperationConfig = {
"<br><br>",
"This function uses the Keybase implementation of PGP.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Pretty_Good_Privacy",
inputType: "string",
outputType: "string",
args: [
@ -4279,6 +4374,7 @@ const OperationConfig = {
"<br><br>",
"This function uses the Keybase implementation of PGP.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Pretty_Good_Privacy",
inputType: "string",
outputType: "string",
args: [
@ -4313,6 +4409,7 @@ const OperationConfig = {
"<br><br>",
"This function uses the Keybase implementation of PGP.",
].join("\n"),
infoURL: "https://wikipedia.org/wiki/Pretty_Good_Privacy",
inputType: "string",
outputType: "string",
args: [

9
src/web/HTMLOperation.js
View File

@ -20,6 +20,7 @@ const HTMLOperation = function(name, config, app, manager) {
this.name = name;
this.description = config.description;
this.infoURL = config.infoURL;
this.manualBake = config.manualBake || false;
this.config = config;
this.ingList = [];
@ -50,8 +51,14 @@ HTMLOperation.prototype.toStubHtml = function(removeIcon) {
let html = "<li class='operation'";
if (this.description) {
let popoverContent = this.description;
if (this.infoURL) {
popoverContent += "<hr><a href='" + this.infoURL + "' target='_blank'>More Information</a>";
}
html += " data-container='body' data-toggle='popover' data-placement='auto right'\
data-content=\"" + this.description + "\" data-html='true' data-trigger='hover'";
data-content=\"" + popoverContent + "\" data-html='true' data-trigger='hover'";
}
html += ">" + this.name;