strc 2.0.3 → 2.0.5

package/src/freqMap.js

@@ -0,0 +1,112 @@
+import { prefix } from "./meta";
+
+export const freqMap = {
+    ESCAPE_BYTE: 0xFF,
+    TOP_COUNT: 254,
+    SPLITTER: " \u200B",
+
+    compress(text, splitter = this.SPLITTER) {
+        const freq = {};
+        for (let char of text) {
+            freq[char] = (freq[char] || 0) + 1;
+        }
+
+        const topChars = Object.entries(freq)
+            .sort((a, b) => b[1] - a[1])
+            .slice(0, this.TOP_COUNT)
+            .map(entry => entry[0]);
+
+        const charToIndex = new Map(topChars.map((char, i) => [char, i]));
+        
+        let header = String.fromCharCode(topChars.length) + topChars.join('');
+        
+        let bytes = [];
+        for (let char of text) {
+            if (charToIndex.has(char)) {
+                /* frequent */
+                bytes.push(charToIndex.get(char));
+            } else {
+                /* rare */
+                bytes.push(this.ESCAPE_BYTE);
+                const code = char.charCodeAt(0);
+                bytes.push((code >> 8) & 0xFF);
+                bytes.push(code & 0xFF);
+            }
+        }
+
+        /* to UTF16 */
+        let compressedBody = "";
+        for (let i = 0; i < bytes.length; i += 2) {
+            const b1 = bytes[i];
+            const b2 = (i + 1 < bytes.length) ? bytes[i + 1] : 0x00;
+            compressedBody += String.fromCharCode((b1 << 8) | b2);
+        }
+
+        return header + splitter + compressedBody;
+    },
+
+    decompress(compressedText, splitter = this.SPLITTER) {
+        const parts = compressedText.split(splitter);
+
+        if (parts.length < 2) {
+            throw new Error(prefix+'Invalid freqMap data: splitter not found');
+        }
+
+        const headerPart = parts[0];
+        const bodyPart = parts.slice(1).join(splitter);
+
+        const topCount = headerPart.charCodeAt(0);
+        const topChars = headerPart.substring(1, topCount + 1);
+        
+        let bytes = [];
+        for (let i = 0; i < bodyPart.length; i++) {
+            const code = bodyPart.charCodeAt(i);
+            bytes.push((code >> 8) & 0xFF);
+            bytes.push(code & 0xFF);
+        }
+
+        let result = "";
+        for (let i = 0; i < bytes.length; i++) {
+            const b = bytes[i];
+            if (b === this.ESCAPE_BYTE) {
+                const charCode = (bytes[i + 1] << 8) | bytes[i + 2];
+                result += String.fromCharCode(charCode);
+                i += 2;
+            } else if (b < topCount) {
+                result += topChars[b];
+            }
+        }
+        return result;
+    },
+
+    /**
+     * 0 = Fail
+     * 1 = Success
+     * 2 = Remove last character (Success)
+     * @param {string} text
+     * @param {string?} splitter
+     * @returns {number|[number, number, string, string]}
+     */
+    test(text, splitter = this.SPLITTER) {
+        try {
+            if (text.includes(splitter)) return 0;
+            const packed = this.compress(text, splitter);
+            const unpacked = this.decompress(packed, splitter);
+            if (packed.length < text.length) {
+                if (unpacked == text) return [1, packed.length, splitter, packed];
+                else if (unpacked.slice(0,-1) == text) return [2, packed.length, splitter, packed];
+                else return 0;
+            }
+            return 0;
+        } catch (_) {
+            return 0;
+        }
+    }
+};
+
+export const freqMapSplitters = [
+    " \u200B","\u0000",
+    "\u001F", "\u0001",
+    "\uFFFD", "\u2022",
+    "|§|",    "\uFEFF"
+];

package/src/index.js

@@ -1,62 +1,19 @@
-const JUSTC = require('justc');
-
-const name__ = 'JSSC';
-const prefix = name__+': ';
+import JUSTC from 'justc';
+import { name__, prefix } from './meta';
 if ((String.fromCharCode(65536).charCodeAt(0) === 65536) || !(String.fromCharCode(256).charCodeAt(0) === 256)) {
     throw new Error(prefix+'Supported UTF-16 only!')
 }
 
-function stringCodes(str) {
-    let output = [];
-    let max = 0;
-    let maxCharCode = 0;
-    let min = Infinity;
-    String(str).split('').forEach(char => {
-        const code = char.charCodeAt();
-        output.push(code);
-        max = Math.max(max, code.toString().length);
-        maxCharCode = Math.max(maxCharCode, code);
-        min = Math.min(min, code.toString().length);
-    });
-    return {max, output, maxCharCode, min};
-}
-
-function codesString(cds) {
-    let output = '';
-    cds.forEach(code => {
-        output += String.fromCharCode(code);
-    });
-    return output
-}
-
-function charCode(num) {
-    return String.fromCharCode(num + 32);
-}
-function checkChar(cde) {
-    return cde % 65535 === cde
-}
-
-function stringChunks(str, num) {
-    const output = [];
-    for (let i = 0; i < str.length; i += num) {
-        output.push(str.slice(i, i + num))
-    }
-    return output
-}
-function chunkArray(array, num) {
-    const result = [];
-    for (let i = 0; i < array.length; i += num) {
-        result.push(array.slice(i, i + num));
-    }
-    return result;
-}
-
-function decToBin(num, wnum) {
-    return num.toString(2).padStart(wnum, '0');
-}
-function binToDec(str) {
-    return parseInt(str, 2);
-}
+import { 
+    stringCodes, 
+    codesString,
+    charCode,
+    checkChar,
+    stringChunks,
+    chunkArray,
+    decToBin,
+    binToDec
+} from './utils';
 
 function charsBase() {
     const charsBase = {};
@@ -596,116 +553,7 @@ function decompressSequences(str) {
     return result;
 }
 
-const freqMap = {
-    ESCAPE_BYTE: 0xFF,
-    TOP_COUNT: 254,
-    SPLITTER: " \u200B",
-
-    compress(text, splitter = this.SPLITTER) {
-        const freq = {};
-        for (let char of text) {
-            freq[char] = (freq[char] || 0) + 1;
-        }
-
-        const topChars = Object.entries(freq)
-            .sort((a, b) => b[1] - a[1])
-            .slice(0, this.TOP_COUNT)
-            .map(entry => entry[0]);
-
-        const charToIndex = new Map(topChars.map((char, i) => [char, i]));
-        
-        let header = String.fromCharCode(topChars.length) + topChars.join('');
-        
-        let bytes = [];
-        for (let char of text) {
-            if (charToIndex.has(char)) {
-                /* frequent */
-                bytes.push(charToIndex.get(char));
-            } else {
-                /* rare */
-                bytes.push(this.ESCAPE_BYTE);
-                const code = char.charCodeAt(0);
-                bytes.push((code >> 8) & 0xFF);
-                bytes.push(code & 0xFF);
-            }
-        }
-
-        /* to UTF16 */
-        let compressedBody = "";
-        for (let i = 0; i < bytes.length; i += 2) {
-            const b1 = bytes[i];
-            const b2 = (i + 1 < bytes.length) ? bytes[i + 1] : 0x00;
-            compressedBody += String.fromCharCode((b1 << 8) | b2);
-        }
-
-        return header + splitter + compressedBody;
-    },
-
-    decompress(compressedText, splitter = this.SPLITTER) {
-        const parts = compressedText.split(splitter);
-
-        if (parts.length < 2) {
-            throw new Error(prefix+'Invalid freqMap data: splitter not found');
-        }
-
-        const headerPart = parts[0];
-        const bodyPart = parts.slice(1).join(splitter);
-
-        const topCount = headerPart.charCodeAt(0);
-        const topChars = headerPart.substring(1, topCount + 1);
-        
-        let bytes = [];
-        for (let i = 0; i < bodyPart.length; i++) {
-            const code = bodyPart.charCodeAt(i);
-            bytes.push((code >> 8) & 0xFF);
-            bytes.push(code & 0xFF);
-        }
-
-        let result = "";
-        for (let i = 0; i < bytes.length; i++) {
-            const b = bytes[i];
-            if (b === this.ESCAPE_BYTE) {
-                const charCode = (bytes[i + 1] << 8) | bytes[i + 2];
-                result += String.fromCharCode(charCode);
-                i += 2;
-            } else if (b < topCount) {
-                result += topChars[b];
-            }
-        }
-        return result;
-    },
-
-    /**
-     * 0 = Fail
-     * 1 = Success
-     * 2 = Remove last character (Success)
-     * @param {string} text
-     * @param {string?} splitter
-     * @returns {number|[number, number, string, string]}
-     */
-    test(text, splitter = this.SPLITTER) {
-        try {
-            if (text.includes(splitter)) return 0;
-            const packed = this.compress(text, splitter);
-            const unpacked = this.decompress(packed, splitter);
-            if (packed.length < text.length) {
-                if (unpacked == text) return [1, packed.length, splitter, packed];
-                else if (unpacked.slice(0,-1) == text) return [2, packed.length, splitter, packed];
-                else return 0;
-            }
-            return 0;
-        } catch (_) {
-            return 0;
-        }
-    }
-};
-
-const freqMapSplitters = [
-    " \u200B","\u0000",
-    "\u001F", "\u0001",
-    "\uFFFD", "\u2022",
-    "|§|",    "\uFEFF"
-];
+import { freqMap, freqMapSplitters } from './freqMap';
 
 function segments(str) {
     if (typeof str !== 'string' || str.length === 0) return [];

package/src/meta.js

@@ -0,0 +1,2 @@
+export const name__ = 'JSSC';
+export const prefix = name__+': ';

package/src/prefix.sh

@@ -0,0 +1,3 @@
+for file in dist/jssc.js dist/jssc.cjs dist/jssc.mjs index.js index.min.js; do
+    printf "/*\n\n%s\n\n*/\n\n" "$(cat src/prefix.txt)" | cat - "$file" > temp.js && mv temp.js "$file"
+done

package/src/prefix.txt

@@ -0,0 +1,34 @@
+MIT License
+
+Copyright (c) 2025-2026 JustDeveloper <https://justdeveloper.is-a.dev/>
+
+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.
+
+*/
+
+/*
+    __         _______________  __
+    \ \    __ / / __/ __/ ___/ / /
+     > >  / // /\ \_\ \/ /__  < < 
+    /_/   \___/___/___/\___/   \_\
+
+     JavaScript String Compressor 
+         https://jssc.js.org/     
+
+    npm i strc

package/src/utils.js

@@ -0,0 +1,51 @@
+export function stringCodes(str) {
+    let output = [];
+    let max = 0;
+    let maxCharCode = 0;
+    let min = Infinity;
+    String(str).split('').forEach(char => {
+        const code = char.charCodeAt();
+        output.push(code);
+        max = Math.max(max, code.toString().length);
+        maxCharCode = Math.max(maxCharCode, code);
+        min = Math.min(min, code.toString().length);
+    });
+    return {max, output, maxCharCode, min};
+}
+
+export function codesString(cds) {
+    let output = '';
+    cds.forEach(code => {
+        output += String.fromCharCode(code);
+    });
+    return output
+}
+
+export function charCode(num) {
+    return String.fromCharCode(num + 32);
+}
+export function checkChar(cde) {
+    return cde % 65535 === cde
+}
+
+export function stringChunks(str, num) {
+    const output = [];
+    for (let i = 0; i < str.length; i += num) {
+        output.push(str.slice(i, i + num))
+    }
+    return output
+}
+export function chunkArray(array, num) {
+    const result = [];
+    for (let i = 0; i < array.length; i += num) {
+        result.push(array.slice(i, i + num));
+    }
+    return result;
+}
+
+export function decToBin(num, wnum) {
+    return num.toString(2).padStart(wnum, '0');
+}
+export function binToDec(str) {
+    return parseInt(str, 2);
+}