@alwatr/djb2-hash 1.1.2 → 1.1.4

package/CHANGELOG.md

@@ -3,6 +3,22 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
+## [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

package/dist/main.cjs

@@ -1,3 +1,4 @@
-/* @alwatr/djb2-hash v1.1.2 */
+/** 📦 @alwatr/djb2-hash v1.1.4 */
+__dev_mode__: console.debug("📦 @alwatr/djb2-hash v1.1.4");
 "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

@@ -2,6 +2,6 @@
   "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",
+  "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 +1,4 @@
-/* @alwatr/djb2-hash v1.1.2 */
+/** 📦 @alwatr/djb2-hash v1.1.4 */
+__dev_mode__: console.debug("📦 @alwatr/djb2-hash v1.1.4");
 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

@@ -2,6 +2,6 @@
   "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",
+  "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": []
 }

package/package.json

@@ -1,13 +1,13 @@
 {
   "name": "@alwatr/djb2-hash",
   "description": "A fast, non-cryptographic hash function based on DJB2.",
-  "version": "1.1.2",
+  "version": "1.1.4",
   "author": "S. Ali Mihandoost <ali.mihandoost@gmail.com>",
   "bugs": "https://github.com/Alwatr/nanolib/issues",
   "devDependencies": {
-    "@alwatr/nano-build": "6.2.1",
-    "@alwatr/prettier-config": "5.0.3",
-    "@alwatr/tsconfig-base": "6.0.1",
+    "@alwatr/nano-build": "6.3.1",
+    "@alwatr/prettier-config": "5.0.4",
+    "@alwatr/tsconfig-base": "6.0.2",
     "jest": "^30.1.3",
     "typescript": "^5.9.2"
   },
@@ -27,10 +27,10 @@
   "keywords": [
     "alwatr",
     "browser",
-    "esm",
-    "hash",
     "djb2",
     "djb2-hash",
+    "esm",
+    "hash",
     "hash-string",
     "javascript",
     "module",
@@ -71,7 +71,8 @@
     "watch:es": "yarn run build:es --watch",
     "watch:ts": "yarn run build:ts --watch --preserveWatchOutput"
   },
+  "sideEffects": false,
   "type": "module",
   "types": "./dist/main.d.ts",
-  "gitHead": "7af0290f1dc91cce15d1324c026354a81c7e64ca"
+  "gitHead": "912cbccc4aae450a2cd2bbb401b898e00af05386"
 }