@alwatr/djb2-hash 1.1.18 → 2.0.0

package/dist/main.js

@@ -0,0 +1,5 @@
+/* 📦 @alwatr/djb2-hash v2.0.0 */
+function f(d){let b=5381;for(let c=d.length-1;c>=0;c--)b=(b<<5)+b^d.charCodeAt(c);return b>>>0}export{f as djb2Hash};
+
+//# debugId=6E05DA394BDA707B64756E2164756E21
+//# sourceMappingURL=main.js.map

package/dist/main.js.map

@@ -0,0 +1,10 @@
+{
+  "version": 3,
+  "sources": ["../src/main.ts"],
+  "sourcesContent": [
+    "/**\n * DJB2 hash algorithm but faster!\n *\n * This implementation is based on Daniel J. Bernstein's popular 'times 33' hash algorithm,\n * commonly known as DJB2. It's known for its simplicity, speed, and good distribution properties\n * for short strings, making it suitable for general purpose hashing needs.\n *\n * Performance improvements in this version:\n * - Uses right-to-left iteration to avoid repeated length lookups\n * - Employs bit shifting operations for faster computation\n * - Final right shift ensures unsigned 32-bit integer output\n *\n * @param {string} str - The input string to be hashed\n * @returns {number} A 32-bit unsigned integer hash value\n *\n * @example\n * // Returns a numeric hash value\n * const hashValue = djb2Hash(\"hello world\");\n */\nexport function djb2Hash(str: string): number {\n  // 5381 is a prime number used as initial value in the DJB2 algorithm\n  let hashValue = 5381;\n\n  // Reverse loop for better performance - avoids repeated length property lookup\n  for (let i = str.length - 1; i >= 0; i--) {\n    // Using left shift (*2) and addition instead of multiplication by 33\n    // (hash * 33) is equivalent to ((hash << 5) + hash)\n    hashValue = ((hashValue << 5) + hashValue) ^ str.charCodeAt(i);\n  }\n\n  return hashValue >>> 0;\n}\n"
+  ],
+  "mappings": ";AAmBO,SAAS,CAAQ,CAAC,EAAqB,CAE5C,IAAI,EAAY,KAGhB,QAAS,EAAI,EAAI,OAAS,EAAG,GAAK,EAAG,IAGnC,GAAc,GAAa,GAAK,EAAa,EAAI,WAAW,CAAC,EAG/D,OAAO,IAAc",
+  "debugId": "6E05DA394BDA707B64756E2164756E21",
+  "names": []
+}

package/package.json

@@ -1,24 +1,24 @@
 {
   "name": "@alwatr/djb2-hash",
   "description": "A fast, non-cryptographic hash function based on DJB2.",
-  "version": "1.1.18",
+  "version": "2.0.0",
   "author": "S. Ali Mihandoost <ali.mihandoost@gmail.com>",
   "bugs": "https://github.com/Alwatr/nanolib/issues",
   "devDependencies": {
-    "@alwatr/nano-build": "6.4.2",
-    "@alwatr/prettier-config": "6.0.2",
-    "@alwatr/tsconfig-base": "6.0.4",
+    "@alwatr/nano-build": "7.0.0",
+    "@alwatr/prettier-config": "7.0.0",
+    "@alwatr/tsconfig-base": "7.0.0",
     "typescript": "^5.9.3"
   },
   "exports": {
     ".": {
       "types": "./dist/main.d.ts",
-      "import": "./dist/main.mjs",
-      "require": "./dist/main.cjs"
+      "default": "./dist/main.js"
     }
   },
   "files": [
-    "**/*.{js,mjs,cjs,map,d.ts,html,md,LEGAL.txt}",
+    "**/*.{js,mjs,cjs,ts,map,d.ts,html,LEGAL.txt}",
+    "README.md",
     "LICENSE",
     "!demo/**/*",
     "!**/*.test.js"
@@ -44,8 +44,6 @@
     "utils"
   ],
   "license": "MPL-2.0",
-  "main": "./dist/main.cjs",
-  "module": "./dist/main.mjs",
   "prettier": "@alwatr/prettier-config",
   "publishConfig": {
     "access": "public"
@@ -58,12 +56,12 @@
   "scripts": {
     "b": "bun run build",
     "build": "bun run build:ts && bun run build:es",
-    "build:es": "nano-build --preset=module",
+    "build:es": "nano-build --preset=module src/main.ts",
     "build:ts": "tsc --build",
     "c": "bun run clean",
     "cb": "bun run clean && bun run build",
     "clean": "rm -rfv dist *.tsbuildinfo",
-    "d": "bun run build:es && bun --enable-source-maps --trace-warnings",
+    "d": "bun run build:es && bun",
     "t": "bun run test",
     "test": "bun test",
     "w": "bun run watch",
@@ -74,5 +72,5 @@
   "sideEffects": false,
   "type": "module",
   "types": "./dist/main.d.ts",
-  "gitHead": "def1decf8f496f4b0d3d3ab952c346c689c30160"
+  "gitHead": "056102a1c8a563bbae8a290b6830450f467322a3"
 }

package/src/main.ts

@@ -0,0 +1,32 @@
+/**
+ * DJB2 hash algorithm but faster!
+ *
+ * This implementation is based on Daniel J. Bernstein's popular 'times 33' hash algorithm,
+ * commonly known as DJB2. It's known for its simplicity, speed, and good distribution properties
+ * for short strings, making it suitable for general purpose hashing needs.
+ *
+ * Performance improvements in this version:
+ * - Uses right-to-left iteration to avoid repeated length lookups
+ * - Employs bit shifting operations for faster computation
+ * - Final right shift ensures unsigned 32-bit integer output
+ *
+ * @param {string} str - The input string to be hashed
+ * @returns {number} A 32-bit unsigned integer hash value
+ *
+ * @example
+ * // Returns a numeric hash value
+ * const hashValue = djb2Hash("hello world");
+ */
+export function djb2Hash(str: string): number {
+  // 5381 is a prime number used as initial value in the DJB2 algorithm
+  let hashValue = 5381;
+
+  // Reverse loop for better performance - avoids repeated length property lookup
+  for (let i = str.length - 1; i >= 0; i--) {
+    // Using left shift (*2) and addition instead of multiplication by 33
+    // (hash * 33) is equivalent to ((hash << 5) + hash)
+    hashValue = ((hashValue << 5) + hashValue) ^ str.charCodeAt(i);
+  }
+
+  return hashValue >>> 0;
+}

package/CHANGELOG.md

@@ -1,98 +0,0 @@
-# Change Log
-
-All notable changes to this project will be documented in this file.
-See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
-
-## [1.1.18](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.17...@alwatr/djb2-hash@1.1.18) (2026-03-18)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.17](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.16...@alwatr/djb2-hash@1.1.17) (2026-03-16)
-
-### 🔨 Code Refactoring
-
-* migrate build scripts from yarn to bun across multiple packages ([d90e962](https://github.com/Alwatr/nanolib/commit/d90e962f15e5c951e191d5f02341279b6472abc3))
-
-## [1.1.16](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.15...@alwatr/djb2-hash@1.1.16) (2026-02-18)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.15](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.14...@alwatr/djb2-hash@1.1.15) (2025-12-23)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.14](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.13...@alwatr/djb2-hash@1.1.14) (2025-12-13)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.13](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.12...@alwatr/djb2-hash@1.1.13) (2025-12-10)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.12](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.11...@alwatr/djb2-hash@1.1.12) (2025-11-18)
-
-### 🔨 Code Refactoring
-
-* remove unnecessary type declarations from tsconfig.json files ([89bcc7d](https://github.com/Alwatr/nanolib/commit/89bcc7db839807110b80f8ba34414ea9734d9c75))
-
-## [1.1.11](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.10...@alwatr/djb2-hash@1.1.11) (2025-11-15)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.10](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.9...@alwatr/djb2-hash@1.1.10) (2025-11-15)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.9](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.8...@alwatr/djb2-hash@1.1.9) (2025-11-04)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.8](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.7...@alwatr/djb2-hash@1.1.8) (2025-10-06)
-
-### 🔗 Dependencies update
-
-* bump the npm-dependencies group with 4 updates ([9825815](https://github.com/Alwatr/nanolib/commit/982581552bbb4b97dca52af5e93a80937f0c3109))
-
-## [1.1.7](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.6...@alwatr/djb2-hash@1.1.7) (2025-09-27)
-
-### 🧹 Miscellaneous Chores
-
-* exclude test files from package distribution ([86f4f2f](https://github.com/Alwatr/nanolib/commit/86f4f2f5985845c5cf3a3a9398de7b2f98ce53e7))
-
-## [1.1.6](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.5...@alwatr/djb2-hash@1.1.6) (2025-09-22)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.5](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.4...@alwatr/djb2-hash@1.1.5) (2025-09-22)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.4](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.3...@alwatr/djb2-hash@1.1.4) (2025-09-21)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.3](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.2...@alwatr/djb2-hash@1.1.3) (2025-09-20)
-
-### 🐛 Bug Fixes
-
-* add sideEffects property to package.json files for better tree-shaking ([c7b9e74](https://github.com/Alwatr/nanolib/commit/c7b9e74e1920c8e35b438742de61883ca62da58c))
-* add sideEffects property to package.json files for better tree-shaking ([e8402c4](https://github.com/Alwatr/nanolib/commit/e8402c481a14a1f807a37aaa862a936713d26176))
-
-### 🧹 Miscellaneous Chores
-
-* remove duplicate sideEffects property from multiple package.json files ([b123f86](https://github.com/Alwatr/nanolib/commit/b123f86be81481de2314aae9bb2eeb629743d24c))
-* reorder keywords in package.json for consistency ([095b9c9](https://github.com/Alwatr/nanolib/commit/095b9c9c2d79d3a8bf3ebff7315a3becb8580ea1))
-
-## [1.1.2](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.1...@alwatr/djb2-hash@1.1.2) (2025-09-19)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## [1.1.1](https://github.com/Alwatr/nanolib/compare/@alwatr/djb2-hash@1.1.0...@alwatr/djb2-hash@1.1.1) (2025-09-15)
-
-**Note:** Version bump only for package @alwatr/djb2-hash
-
-## 1.1.0 (2025-09-14)
-
-### ✨ Features
-
-* add new @alwatr/djb2-hash package ([1718bd7](https://github.com/Alwatr/nanolib/commit/1718bd786d23e13664831f51bfd4e54e5059e710))

package/dist/main.cjs

@@ -1,3 +0,0 @@
-/** 📦 @alwatr/djb2-hash v1.1.18 */
-"use strict";var __defProp=Object.defineProperty;var __getOwnPropDesc=Object.getOwnPropertyDescriptor;var __getOwnPropNames=Object.getOwnPropertyNames;var __hasOwnProp=Object.prototype.hasOwnProperty;var __export=(target,all)=>{for(var name in all)__defProp(target,name,{get:all[name],enumerable:true})};var __copyProps=(to,from,except,desc)=>{if(from&&typeof from==="object"||typeof from==="function"){for(let key of __getOwnPropNames(from))if(!__hasOwnProp.call(to,key)&&key!==except)__defProp(to,key,{get:()=>from[key],enumerable:!(desc=__getOwnPropDesc(from,key))||desc.enumerable})}return to};var __toCommonJS=mod=>__copyProps(__defProp({},"__esModule",{value:true}),mod);var main_exports={};__export(main_exports,{djb2Hash:()=>djb2Hash});module.exports=__toCommonJS(main_exports);function djb2Hash(str){let hashValue=5381;for(let i=str.length-1;i>=0;i--){hashValue=(hashValue<<5)+hashValue^str.charCodeAt(i)}return hashValue>>>0}0&&(module.exports={djb2Hash});
-//# sourceMappingURL=main.cjs.map

package/dist/main.cjs.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../src/main.ts"],
-  "sourcesContent": ["/**\n * DJB2 hash algorithm but faster!\n *\n * This implementation is based on Daniel J. Bernstein's popular 'times 33' hash algorithm,\n * commonly known as DJB2. It's known for its simplicity, speed, and good distribution properties\n * for short strings, making it suitable for general purpose hashing needs.\n *\n * Performance improvements in this version:\n * - Uses right-to-left iteration to avoid repeated length lookups\n * - Employs bit shifting operations for faster computation\n * - Final right shift ensures unsigned 32-bit integer output\n *\n * @param {string} str - The input string to be hashed\n * @returns {number} A 32-bit unsigned integer hash value\n *\n * @example\n * // Returns a numeric hash value\n * const hashValue = djb2Hash(\"hello world\");\n */\nexport function djb2Hash(str: string): number {\n  // 5381 is a prime number used as initial value in the DJB2 algorithm\n  let hashValue = 5381;\n\n  // Reverse loop for better performance - avoids repeated length property lookup\n  for (let i = str.length - 1; i >= 0; i--) {\n    // Using left shift (*2) and addition instead of multiplication by 33\n    // (hash * 33) is equivalent to ((hash << 5) + hash)\n    hashValue = ((hashValue << 5) + hashValue) ^ str.charCodeAt(i);\n  }\n\n  return hashValue >>> 0;\n}\n"],
-  "mappings": ";qqBAAA,6GAmBO,SAAS,SAAS,IAAqB,CAE5C,IAAI,UAAY,KAGhB,QAAS,EAAI,IAAI,OAAS,EAAG,GAAK,EAAG,IAAK,CAGxC,WAAc,WAAa,GAAK,UAAa,IAAI,WAAW,CAAC,CAC/D,CAEA,OAAO,YAAc,CACvB",
-  "names": []
-}

package/dist/main.mjs

@@ -1,3 +0,0 @@
-/** 📦 @alwatr/djb2-hash v1.1.18 */
-function djb2Hash(str){let hashValue=5381;for(let i=str.length-1;i>=0;i--){hashValue=(hashValue<<5)+hashValue^str.charCodeAt(i)}return hashValue>>>0}export{djb2Hash};
-//# sourceMappingURL=main.mjs.map

package/dist/main.mjs.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../src/main.ts"],
-  "sourcesContent": ["/**\n * DJB2 hash algorithm but faster!\n *\n * This implementation is based on Daniel J. Bernstein's popular 'times 33' hash algorithm,\n * commonly known as DJB2. It's known for its simplicity, speed, and good distribution properties\n * for short strings, making it suitable for general purpose hashing needs.\n *\n * Performance improvements in this version:\n * - Uses right-to-left iteration to avoid repeated length lookups\n * - Employs bit shifting operations for faster computation\n * - Final right shift ensures unsigned 32-bit integer output\n *\n * @param {string} str - The input string to be hashed\n * @returns {number} A 32-bit unsigned integer hash value\n *\n * @example\n * // Returns a numeric hash value\n * const hashValue = djb2Hash(\"hello world\");\n */\nexport function djb2Hash(str: string): number {\n  // 5381 is a prime number used as initial value in the DJB2 algorithm\n  let hashValue = 5381;\n\n  // Reverse loop for better performance - avoids repeated length property lookup\n  for (let i = str.length - 1; i >= 0; i--) {\n    // Using left shift (*2) and addition instead of multiplication by 33\n    // (hash * 33) is equivalent to ((hash << 5) + hash)\n    hashValue = ((hashValue << 5) + hashValue) ^ str.charCodeAt(i);\n  }\n\n  return hashValue >>> 0;\n}\n"],
-  "mappings": ";AAmBO,SAAS,SAAS,IAAqB,CAE5C,IAAI,UAAY,KAGhB,QAAS,EAAI,IAAI,OAAS,EAAG,GAAK,EAAG,IAAK,CAGxC,WAAc,WAAa,GAAK,UAAa,IAAI,WAAW,CAAC,CAC/D,CAEA,OAAO,YAAc,CACvB",
-  "names": []
-}