@ddunigma/node 1.0.10

package/LICENCE

@@ -0,0 +1,9 @@
+Copyright 2025 i3l3
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/README.md

@@ -0,0 +1,23 @@
+## ddunigma-node
+
+### Overview
+Node.js implementation of [ddunigma](https://github.com/i3l3/ddunigma) (Python original)
+
+### Credits
+- Original Python Implementation by:
+  - [@i3ls](https://github.com/i3l3)
+  - [@gunu3371](https://github.com/gunu3371)
+- Original Repository: [ddunigma](https://github.com/i3l3/ddunigma)
+
+### Usage
+```js
+import { Ddu64 } from 'ddunigma-node'
+
+const ddu64 = new Ddu64(); //default encode utf-8
+
+const answer = "뜌땨어 고수가 될거야!"
+const encoded = ddu64.encode(answer);
+console.log(encoded);
+const decoded = ddu64.decode(encoded);
+console.log(decoded);
+```

package/dist/cjs/index.js

@@ -0,0 +1,158 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Ddu64 = void 0;
+class Ddu64 {
+    constructor(dduChar, paddingChar) {
+        this.dduCharKr = ["뜌", "땨", "이", "우", "야", "!", "?", "."];
+        this.paddingCharKr = "뭐";
+        this.defaultEncoding = "utf-8";
+        this.dduChar = dduChar || this.dduCharKr;
+        this.paddingChar = paddingChar || this.paddingCharKr;
+        this.bitLengthMap = new Map();
+        this.binaryLookup = new Array(256);
+        this.dduBinaryLookup = new Map();
+        this.dduBinaryLookupKr = new Map();
+        this.paddingRegex = new Map();
+        for (let i = 0; i < 256; i++) {
+            this.binaryLookup[i] = i.toString(2).padStart(8, '0');
+        }
+        this.dduChar.forEach((char, index) => {
+            this.dduBinaryLookup.set(char, index);
+        });
+        this.dduCharKr.forEach((char, index) => {
+            this.dduBinaryLookupKr.set(char, index);
+        });
+        this.paddingRegex.set('default', new RegExp(this.paddingChar, "g"));
+        this.paddingRegex.set('KR', new RegExp(this.paddingCharKr, "g"));
+    }
+    getLargestPowerOfTwo(n) {
+        let power = Math.floor(Math.log2(n));
+        return Math.pow(2, power);
+    }
+    getBitLength(setLength) {
+        let cached = this.bitLengthMap.get(setLength);
+        if (cached === undefined) {
+            cached = Math.ceil(Math.log2(setLength));
+            this.bitLengthMap.set(setLength, cached);
+        }
+        return cached;
+    }
+    *splitString(s, length) {
+        const len = s.length;
+        for (let i = 0; i < len; i += length) {
+            yield s.slice(i, Math.min(i + length, len));
+        }
+    }
+    getSelectedSets(option) {
+        if (option === "KR") {
+            return {
+                dduSet: this.dduCharKr,
+                padChar: this.paddingCharKr,
+                dduLength: this.dduCharKr.length,
+                bitLength: this.getBitLength(this.dduCharKr.length),
+                lookupTable: this.dduBinaryLookupKr,
+                paddingRegExp: this.paddingRegex.get('KR')
+            };
+        }
+        return {
+            dduSet: this.dduChar,
+            padChar: this.paddingChar,
+            dduLength: this.dduChar.length,
+            bitLength: this.getBitLength(this.dduChar.length),
+            lookupTable: this.dduBinaryLookup,
+            paddingRegExp: this.paddingRegex.get('default')
+        };
+    }
+    getSelectedSets64(option) {
+        const baseSet = this.getSelectedSets(option);
+        const powerOfTwoLength = this.getLargestPowerOfTwo(baseSet.dduSet.length);
+        return Object.assign(Object.assign({}, baseSet), { dduSet: baseSet.dduSet.slice(0, powerOfTwoLength), dduLength: powerOfTwoLength, bitLength: Math.log2(powerOfTwoLength) });
+    }
+    bufferToDduBinary(input, bitLength) {
+        const bufferLength = input.length;
+        let encodedBin = '';
+        for (let i = 0; i < bufferLength; i++) {
+            encodedBin += this.binaryLookup[input[i]];
+        }
+        const dduBinary = Array.from(this.splitString(encodedBin, bitLength));
+        const padding = bitLength - dduBinary[dduBinary.length - 1].length;
+        if (padding > 0) {
+            dduBinary[dduBinary.length - 1] += '0'.repeat(padding);
+        }
+        return { dduBinary, padding };
+    }
+    dduBinaryToBuffer(decodedBin, paddingCount) {
+        const paddingBits = paddingCount * 2;
+        if (paddingBits > 0) {
+            decodedBin = decodedBin.slice(0, -paddingBits);
+        }
+        const chunkCount = Math.floor(decodedBin.length / 8);
+        const buffer = new Array(chunkCount);
+        for (let i = 0; i < chunkCount; i++) {
+            const start = i * 8;
+            buffer[i] = parseInt(decodedBin.slice(start, start + 8), 2);
+        }
+        return buffer;
+    }
+    encode(input, option = "default", encoding = this.defaultEncoding) {
+        const bufferInput = typeof input === 'string' ? Buffer.from(input, encoding) : input;
+        const { dduSet, padChar, dduLength, bitLength } = this.getSelectedSets(option);
+        const { dduBinary, padding } = this.bufferToDduBinary(bufferInput, bitLength);
+        let resultString = "";
+        for (const char of dduBinary) {
+            const charInt = parseInt(char, 2);
+            const quotient = Math.floor(charInt / dduLength);
+            const remainder = charInt % dduLength;
+            resultString += dduSet[quotient] + dduSet[remainder];
+        }
+        if (padding > 0) {
+            return resultString + padChar.repeat(Math.floor(padding / 2));
+        }
+        return resultString;
+    }
+    encode64(input, option = "default", encoding = this.defaultEncoding) {
+        const bufferInput = typeof input === 'string' ? Buffer.from(input, encoding) : input;
+        const { dduSet, padChar, bitLength } = this.getSelectedSets64(option);
+        const { dduBinary, padding } = this.bufferToDduBinary(bufferInput, bitLength);
+        let resultString = "";
+        for (const char of dduBinary) {
+            const charInt = parseInt(char, 2);
+            resultString += dduSet[charInt];
+        }
+        if (padding > 0) {
+            return resultString + padChar.repeat(Math.floor(padding / 2));
+        }
+        return resultString;
+    }
+    decode(input, option = "default", encoding = this.defaultEncoding) {
+        const { dduSet, dduLength, bitLength, lookupTable, paddingRegExp } = this.getSelectedSets(option);
+        const paddingCount = (input.match(paddingRegExp) || []).length;
+        input = input.replace(paddingRegExp, '');
+        let dduBinary = "";
+        for (let i = 0; i < input.length; i += 2) {
+            const firstIndex = lookupTable.get(input[i]);
+            const secondIndex = lookupTable.get(input[i + 1]);
+            if (firstIndex === undefined || secondIndex === undefined)
+                continue;
+            const value = firstIndex * dduLength + secondIndex;
+            dduBinary += value.toString(2).padStart(bitLength, '0');
+        }
+        const decoded = this.dduBinaryToBuffer(dduBinary, paddingCount);
+        return Buffer.from(decoded).toString(encoding);
+    }
+    decode64(input, option = "default", encoding = this.defaultEncoding) {
+        const { dduSet, bitLength, lookupTable, paddingRegExp } = this.getSelectedSets64(option);
+        const paddingCount = (input.match(paddingRegExp) || []).length;
+        input = input.replace(paddingRegExp, '');
+        let dduBinary = '';
+        for (let i = 0; i < input.length; i++) {
+            const charIndex = lookupTable.get(input[i]);
+            if (charIndex === undefined)
+                continue;
+            dduBinary += charIndex.toString(2).padStart(bitLength, '0');
+        }
+        const decoded = this.dduBinaryToBuffer(dduBinary, paddingCount);
+        return Buffer.from(decoded).toString(encoding);
+    }
+}
+exports.Ddu64 = Ddu64;

package/dist/cjs/package.json

@@ -0,0 +1,3 @@
+{
+    "type": "commonjs"
+}

package/dist/cjs/test/test1.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/cjs/test/test1.js

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const __1 = require("..");
+const koreanChars = [
+    // 기본 자음+모음 조합
+    "가", "나", "다", "라", "마", "바", "사", "아", "자", "차", "카", "타", "파", "하",
+    "개", "내", "대", "래", "매", "배", "새", "애", "재", "채", "캐", "태", "패", "해",
+    "고", "노", "도", "로", "모", "보", "소", "오", "조", "초", "코", "토", "포", "호",
+    "구", "누", "두", "루", "무", "부", "수", "우", "주", "추", "쿠", "투", "푸", "후",
+    "그", "느", "드", "르", "므", "브", "스", "으", "즈", "츠", "크", "트", "프", "흐",
+    "기", "니", "디", "리", "미", "비", "시", "이", "지", "치", "키", "티", "피", "히",
+    "게", "네", "데", "레", "메", "베", "세", "에", "제", "체", "케", "테", "페", "헤",
+    "겨", "녀", "더", "려", "며", "벼", "셔", "여", "져", "쳐", "켜", "텨", "펴", "혀",
+    "교", "뇨", "됴", "료", "묘", "뵤", "쇼", "요", "죠", "쵸", "쿄", "툐", "표", "효",
+    "규", "뉴", "듀", "류", "뮤", "뷰", "슈", "유", "쥬", "츄", "큐", "튜", "퓨", "휴",
+    // 받침 있는 조합
+    "각", "낙", "닥", "락", "막", "박", "삭", "악", "작", "착", "칵", "탁", "팍", "학",
+    "갑", "납", "답", "랍", "맙", "밥", "삽", "압", "잡", "찹", "캅", "탑", "팝", "합",
+    "곡", "녹", "독", "록", "목", "복", "속", "옥", "족", "촉", "콕", "톡", "폭", "혹",
+    "국", "눅", "둑", "룩", "묵", "북", "숙", "욱", "죽", "축", "쿡", "툭", "푹", "훅",
+    "극", "늑", "득", "륵", "믁", "븍", "슥", "윽", "즉", "츰", "큭", "특", "픅", "흑",
+    "금", "늠", "듬", "름", "뭄", "붐", "숨", "음", "줌", "춤", "큼", "틈", "품", "흠",
+    "갈", "날", "달", "랄", "말", "발", "살", "알", "잘", "찰", "칼", "탈", "팔", "할",
+    "감", "남", "담", "람", "맘", "밤", "샘", "암", "잠", "참", "캄", "탐", "팜", "함",
+    "건", "넌", "던", "런", '먼'
+]; //129
+const ddu64 = new __1.Ddu64(["D", "d", "U", "u", "T", "t", "A", "a"], "응");
+const answer = "안녕 나 안보고싶었어?12";
+const encoded = ddu64.encode64(answer);
+console.log(encoded);
+const decoded = ddu64.decode64(encoded);
+console.log(decoded);
+console.log("=-==");
+const encoded_eng = ddu64.encode(answer, "KR");
+console.log(encoded_eng);
+const decoded_eng = ddu64.decode(encoded_eng, "KR");
+console.log(decoded_eng);
+console.log("=-==");
+const ddu64_other = new __1.Ddu64(koreanChars, "즁");
+const answer2 = "안녕나안보고싶었어?스스로칭찬하려니까부담되는걸?하지만기록은완성해야하니까어쩔수없지~엘리시아는상냥하고,친근하고,귀엽고,똑똑하고아름다운소녀야.그녀의초대를거절하거나그녀를냉정하게대할수있는사람은없어.전설속의엘프처럼모든이의마음을사로잡고13명의영웅을이곳에모았으면서첫번째자리를양보하는겸손함까지...영웅들에게엘리시아는가장믿음직스럽고사랑받는동료야.너희도그렇게생각하지?1";
+const encoded2 = ddu64_other.encode64(answer2);
+console.log(encoded2);
+const decoded2 = ddu64_other.decode64(encoded2);
+console.log(decoded2);

package/dist/index.d.ts

@@ -0,0 +1,24 @@
+export declare class Ddu64 {
+    private readonly dduChar;
+    private readonly paddingChar;
+    private readonly dduCharKr;
+    private readonly paddingCharKr;
+    private readonly defaultEncoding;
+    private readonly bitLengthMap;
+    private readonly binaryLookup;
+    private readonly dduBinaryLookup;
+    private readonly dduBinaryLookupKr;
+    private readonly paddingRegex;
+    constructor(dduChar?: string[], paddingChar?: string);
+    private getLargestPowerOfTwo;
+    private getBitLength;
+    private splitString;
+    private getSelectedSets;
+    private getSelectedSets64;
+    private bufferToDduBinary;
+    private dduBinaryToBuffer;
+    encode(input: Buffer | string, option?: string, encoding?: BufferEncoding): string;
+    encode64(input: Buffer | string, option?: string, encoding?: BufferEncoding): string;
+    decode(input: string, option?: string, encoding?: BufferEncoding): string;
+    decode64(input: string, option?: string, encoding?: BufferEncoding): string;
+}

package/dist/mjs/index.js

@@ -0,0 +1,166 @@
+export class Ddu64 {
+    dduChar;
+    paddingChar;
+    dduCharKr = ["뜌", "땨", "이", "우", "야", "!", "?", "."];
+    paddingCharKr = "뭐";
+    defaultEncoding = "utf-8";
+    bitLengthMap;
+    binaryLookup;
+    dduBinaryLookup;
+    dduBinaryLookupKr;
+    paddingRegex;
+    constructor(dduChar, paddingChar) {
+        this.dduChar = dduChar || this.dduCharKr;
+        this.paddingChar = paddingChar || this.paddingCharKr;
+        this.bitLengthMap = new Map();
+        this.binaryLookup = new Array(256);
+        this.dduBinaryLookup = new Map();
+        this.dduBinaryLookupKr = new Map();
+        this.paddingRegex = new Map();
+        for (let i = 0; i < 256; i++) {
+            this.binaryLookup[i] = i.toString(2).padStart(8, '0');
+        }
+        this.dduChar.forEach((char, index) => {
+            this.dduBinaryLookup.set(char, index);
+        });
+        this.dduCharKr.forEach((char, index) => {
+            this.dduBinaryLookupKr.set(char, index);
+        });
+        this.paddingRegex.set('default', new RegExp(this.paddingChar, "g"));
+        this.paddingRegex.set('KR', new RegExp(this.paddingCharKr, "g"));
+    }
+    getLargestPowerOfTwo(n) {
+        let power = Math.floor(Math.log2(n));
+        return 2 ** power;
+    }
+    getBitLength(setLength) {
+        let cached = this.bitLengthMap.get(setLength);
+        if (cached === undefined) {
+            cached = Math.ceil(Math.log2(setLength));
+            this.bitLengthMap.set(setLength, cached);
+        }
+        return cached;
+    }
+    *splitString(s, length) {
+        const len = s.length;
+        for (let i = 0; i < len; i += length) {
+            yield s.slice(i, Math.min(i + length, len));
+        }
+    }
+    getSelectedSets(option) {
+        if (option === "KR") {
+            return {
+                dduSet: this.dduCharKr,
+                padChar: this.paddingCharKr,
+                dduLength: this.dduCharKr.length,
+                bitLength: this.getBitLength(this.dduCharKr.length),
+                lookupTable: this.dduBinaryLookupKr,
+                paddingRegExp: this.paddingRegex.get('KR')
+            };
+        }
+        return {
+            dduSet: this.dduChar,
+            padChar: this.paddingChar,
+            dduLength: this.dduChar.length,
+            bitLength: this.getBitLength(this.dduChar.length),
+            lookupTable: this.dduBinaryLookup,
+            paddingRegExp: this.paddingRegex.get('default')
+        };
+    }
+    getSelectedSets64(option) {
+        const baseSet = this.getSelectedSets(option);
+        const powerOfTwoLength = this.getLargestPowerOfTwo(baseSet.dduSet.length);
+        return {
+            ...baseSet,
+            dduSet: baseSet.dduSet.slice(0, powerOfTwoLength),
+            dduLength: powerOfTwoLength,
+            bitLength: Math.log2(powerOfTwoLength)
+        };
+    }
+    bufferToDduBinary(input, bitLength) {
+        const bufferLength = input.length;
+        let encodedBin = '';
+        for (let i = 0; i < bufferLength; i++) {
+            encodedBin += this.binaryLookup[input[i]];
+        }
+        const dduBinary = Array.from(this.splitString(encodedBin, bitLength));
+        const padding = bitLength - dduBinary[dduBinary.length - 1].length;
+        if (padding > 0) {
+            dduBinary[dduBinary.length - 1] += '0'.repeat(padding);
+        }
+        return { dduBinary, padding };
+    }
+    dduBinaryToBuffer(decodedBin, paddingCount) {
+        const paddingBits = paddingCount * 2;
+        if (paddingBits > 0) {
+            decodedBin = decodedBin.slice(0, -paddingBits);
+        }
+        const chunkCount = Math.floor(decodedBin.length / 8);
+        const buffer = new Array(chunkCount);
+        for (let i = 0; i < chunkCount; i++) {
+            const start = i * 8;
+            buffer[i] = parseInt(decodedBin.slice(start, start + 8), 2);
+        }
+        return buffer;
+    }
+    encode(input, option = "default", encoding = this.defaultEncoding) {
+        const bufferInput = typeof input === 'string' ? Buffer.from(input, encoding) : input;
+        const { dduSet, padChar, dduLength, bitLength } = this.getSelectedSets(option);
+        const { dduBinary, padding } = this.bufferToDduBinary(bufferInput, bitLength);
+        let resultString = "";
+        for (const char of dduBinary) {
+            const charInt = parseInt(char, 2);
+            const quotient = Math.floor(charInt / dduLength);
+            const remainder = charInt % dduLength;
+            resultString += dduSet[quotient] + dduSet[remainder];
+        }
+        if (padding > 0) {
+            return resultString + padChar.repeat(Math.floor(padding / 2));
+        }
+        return resultString;
+    }
+    encode64(input, option = "default", encoding = this.defaultEncoding) {
+        const bufferInput = typeof input === 'string' ? Buffer.from(input, encoding) : input;
+        const { dduSet, padChar, bitLength } = this.getSelectedSets64(option);
+        const { dduBinary, padding } = this.bufferToDduBinary(bufferInput, bitLength);
+        let resultString = "";
+        for (const char of dduBinary) {
+            const charInt = parseInt(char, 2);
+            resultString += dduSet[charInt];
+        }
+        if (padding > 0) {
+            return resultString + padChar.repeat(Math.floor(padding / 2));
+        }
+        return resultString;
+    }
+    decode(input, option = "default", encoding = this.defaultEncoding) {
+        const { dduSet, dduLength, bitLength, lookupTable, paddingRegExp } = this.getSelectedSets(option);
+        const paddingCount = (input.match(paddingRegExp) || []).length;
+        input = input.replace(paddingRegExp, '');
+        let dduBinary = "";
+        for (let i = 0; i < input.length; i += 2) {
+            const firstIndex = lookupTable.get(input[i]);
+            const secondIndex = lookupTable.get(input[i + 1]);
+            if (firstIndex === undefined || secondIndex === undefined)
+                continue;
+            const value = firstIndex * dduLength + secondIndex;
+            dduBinary += value.toString(2).padStart(bitLength, '0');
+        }
+        const decoded = this.dduBinaryToBuffer(dduBinary, paddingCount);
+        return Buffer.from(decoded).toString(encoding);
+    }
+    decode64(input, option = "default", encoding = this.defaultEncoding) {
+        const { dduSet, bitLength, lookupTable, paddingRegExp } = this.getSelectedSets64(option);
+        const paddingCount = (input.match(paddingRegExp) || []).length;
+        input = input.replace(paddingRegExp, '');
+        let dduBinary = '';
+        for (let i = 0; i < input.length; i++) {
+            const charIndex = lookupTable.get(input[i]);
+            if (charIndex === undefined)
+                continue;
+            dduBinary += charIndex.toString(2).padStart(bitLength, '0');
+        }
+        const decoded = this.dduBinaryToBuffer(dduBinary, paddingCount);
+        return Buffer.from(decoded).toString(encoding);
+    }
+}

package/dist/mjs/package.json

@@ -0,0 +1,3 @@
+{
+    "type": "module"
+}

package/dist/mjs/test/test1.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/test/test1.js

@@ -0,0 +1,42 @@
+import { Ddu64 } from "..";
+const koreanChars = [
+    // 기본 자음+모음 조합
+    "가", "나", "다", "라", "마", "바", "사", "아", "자", "차", "카", "타", "파", "하",
+    "개", "내", "대", "래", "매", "배", "새", "애", "재", "채", "캐", "태", "패", "해",
+    "고", "노", "도", "로", "모", "보", "소", "오", "조", "초", "코", "토", "포", "호",
+    "구", "누", "두", "루", "무", "부", "수", "우", "주", "추", "쿠", "투", "푸", "후",
+    "그", "느", "드", "르", "므", "브", "스", "으", "즈", "츠", "크", "트", "프", "흐",
+    "기", "니", "디", "리", "미", "비", "시", "이", "지", "치", "키", "티", "피", "히",
+    "게", "네", "데", "레", "메", "베", "세", "에", "제", "체", "케", "테", "페", "헤",
+    "겨", "녀", "더", "려", "며", "벼", "셔", "여", "져", "쳐", "켜", "텨", "펴", "혀",
+    "교", "뇨", "됴", "료", "묘", "뵤", "쇼", "요", "죠", "쵸", "쿄", "툐", "표", "효",
+    "규", "뉴", "듀", "류", "뮤", "뷰", "슈", "유", "쥬", "츄", "큐", "튜", "퓨", "휴",
+    // 받침 있는 조합
+    "각", "낙", "닥", "락", "막", "박", "삭", "악", "작", "착", "칵", "탁", "팍", "학",
+    "갑", "납", "답", "랍", "맙", "밥", "삽", "압", "잡", "찹", "캅", "탑", "팝", "합",
+    "곡", "녹", "독", "록", "목", "복", "속", "옥", "족", "촉", "콕", "톡", "폭", "혹",
+    "국", "눅", "둑", "룩", "묵", "북", "숙", "욱", "죽", "축", "쿡", "툭", "푹", "훅",
+    "극", "늑", "득", "륵", "믁", "븍", "슥", "윽", "즉", "츰", "큭", "특", "픅", "흑",
+    "금", "늠", "듬", "름", "뭄", "붐", "숨", "음", "줌", "춤", "큼", "틈", "품", "흠",
+    "갈", "날", "달", "랄", "말", "발", "살", "알", "잘", "찰", "칼", "탈", "팔", "할",
+    "감", "남", "담", "람", "맘", "밤", "샘", "암", "잠", "참", "캄", "탐", "팜", "함",
+    "건", "넌", "던", "런", '먼'
+]; //129
+const ddu64 = new Ddu64(["D", "d", "U", "u", "T", "t", "A", "a"], "응");
+const answer = "안녕 나 안보고싶었어?12";
+const encoded = ddu64.encode64(answer);
+console.log(encoded);
+const decoded = ddu64.decode64(encoded);
+console.log(decoded);
+console.log("=-==");
+const encoded_eng = ddu64.encode(answer, "KR");
+console.log(encoded_eng);
+const decoded_eng = ddu64.decode(encoded_eng, "KR");
+console.log(decoded_eng);
+console.log("=-==");
+const ddu64_other = new Ddu64(koreanChars, "즁");
+const answer2 = "안녕나안보고싶었어?스스로칭찬하려니까부담되는걸?하지만기록은완성해야하니까어쩔수없지~엘리시아는상냥하고,친근하고,귀엽고,똑똑하고아름다운소녀야.그녀의초대를거절하거나그녀를냉정하게대할수있는사람은없어.전설속의엘프처럼모든이의마음을사로잡고13명의영웅을이곳에모았으면서첫번째자리를양보하는겸손함까지...영웅들에게엘리시아는가장믿음직스럽고사랑받는동료야.너희도그렇게생각하지?1";
+const encoded2 = ddu64_other.encode64(answer2);
+console.log(encoded2);
+const decoded2 = ddu64_other.decode64(encoded2);
+console.log(decoded2);

package/package.json

@@ -0,0 +1,27 @@
+{
+  "name": "@ddunigma/node",
+  "version": "1.0.10",
+  "main": "dist/cjs/index.js",
+  "module": "dist/mjs/index.js",
+  "types": "dist/index.d.ts",
+  "type": "module",
+  "scripts": {
+    "test": "tsx ./src/test/test.ts",
+    "build": "rm -rf dist/* && tsc -p tsconfig.json && tsc -p tsconfig-cjs.json && sh postProcess.sh",
+    "test1": "tsx ./src/test/test1.ts"
+  },
+  "exports": {
+    ".": {
+      "import": "./dist/mjs/index.js",
+      "require": "./dist/cjs/index.js"
+    }
+  },
+  "author": "",
+  "license": "ISC",
+  "description": "",
+  "devDependencies": {
+    "@types/node": "^22.13.0",
+    "tsx": "^4.19.2",
+    "typescript": "^5.7.3"
+  }
+}