Cool_Tools/CyberChef
1
0
Fork 0
mirror of synced 2025-02-20 12:11:07 +01:00
Code Releases Activity

Update hexadecimal sort after review

Browse Source 
- Use Array.map instead of for-loop
- Add test case
This commit is contained in:
Chris van Marle 2018-10-12 15:39:06 +02:00
parent 3b3c27072f
commit ba24e12454
2 changed files with 20 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
src/core/operations/Sort.mjs
View File

@ -143,22 +143,18 @@ class Sort extends Operation {
* @returns {number}
*/
static _hexadecimalSort(a, b) {
const a_ = a.split(/([^\da-f]+)/i),
let a_ = a.split(/([^\da-f]+)/i),
b_ = b.split(/([^\da-f]+)/i);
for (let i = 0; i < a_.length; ++i) {
const t = parseInt(a_[i], 16);
if (!isNaN(t)) {
a_[i] = t;
}
}
a_ = a_.map(v => {
const t = parseInt(v, 16);
return isNaN(t) ? v : t;
});
for (let i = 0; i < b_.length; ++i) {
const t = parseInt(b_[i], 16);
if (!isNaN(t)) {
b_[i] = t;
}
}
b_ = b_.map(v => {
const t = parseInt(v, 16);
return isNaN(t) ? v : t;
});
for (let i = 0; i < a_.length && i < b.length; ++i) {
if (isNaN(a_[i]) && !isNaN(b_[i])) return 1; // Numbers after non-numbers

11
test/tests/operations/SeqUtils.mjs
View File

@ -30,4 +30,15 @@ TestRegister.addTests([
}
],
},
{
name: "SeqUtils - Hexadecimal sort",
input: "06,08,0a,0d,0f,1,10,11,12,13,14,15,16,17,18,19,1a,1b,1c,1d,1e,1f,2,3,4,5,7,9,b,c,e",
expectedOutput: "1,2,3,4,5,06,7,08,9,0a,b,c,0d,e,0f,10,11,12,13,14,15,16,17,18,19,1a,1b,1c,1d,1e,1f",
recipeConfig: [
{
"op": "Sort",
"args": ["Comma", false, "Numeric (hexadecimal)"]
}
],
},
]);