search-algoritm 1.4.1 → 1.5.1

package/CHANGELOG.md

@@ -1,19 +1,24 @@
 # Changelog
 
-All notable 
+All notable changes to this project will be documented in this file.
 
- to this project will be documented in this file.
+---
+## [1.5.0] - 2026-03-05
+### Changed
+- Fixed default export for easier import: `const searchAlgoritm = require('search-algoritm')`.
+- Consolidated all helper functions (`normalize`, `levenshtein`, `tokenize`, `matchScore`, `calculateItemScore`) into the main module.
+- Module now works out-of-the-box without requiring `src/searchAlgoritm.js`.
+- Solves previous errors: `TypeError: searchAlgoritm is not a function` and `ReferenceError: normalize is not defined`.
 
- ---
+---
 ## [1.4.1] - 2026-03-05
 ### Notice
 - Update due to error in version. 1.3.0 never released.
 
-
 ---
 ## [1.4.0] - 2026-03-05
 ### Added
-- Search algorithm now dynamically scans **all string fields** in any object.
+- Search algoritm now dynamically scans **all string fields** in any object.
 - Fuzzy search, tokenization, and scoring applied across all fields.
 - Stopwords filtering, normalization, and accent-insensitive search preserved.
 
@@ -51,7 +56,6 @@ All notable
 - Added `version-status.js` and `postinstall` script to display the current package version status after installation (patch).
 
 ---
-
 ## [1.1.0] - 2025-12-01
 ### Added
 - **Accent-insensitive search** (`é → e`) for better matching of text with diacritics.
@@ -64,13 +68,11 @@ All notable
 - Improved fuzzy matching algoritm for more accurate relevance scoring.
 
 ---
-
 ## [1.0.1] - 2025-12-01
 ### Changed
 - Bumped version due to NPM error preventing re-publishing of 1.0.0.
 
 ---
-
 ## [1.0.0] - 2025-12-01
 ### Added
 - Initial release of **search-algoritm** npm package.

package/index.js

@@ -1,4 +1,3 @@
 // search-algoritm/index.js
-const { searchAlgoritm } = require('./src/searchAlgoritm');
-
+const searchAlgoritm = require('./src/searchAlgoritm'); // default export
 module.exports = searchAlgoritm;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "search-algoritm",
-  "version": "1.4.1",
+  "version": "1.5.1",
   "description": "Simple and lightweight fuzzy search algoritm for titles and descriptions.",
   "main": "index.js",
   "scripts": {

package/src/searchAlgoritm.js

@@ -1,143 +1,147 @@
-console.log('[searchAlgoritm] 🔍 Module loaded');
-
-/**
- * Normalize text: lowercase, remove accents, trim, remove simple plurals
- * @param {string} str
- * @returns {string}
- */
-const normalize = (str = '') =>
-  String(str)
-    .toLowerCase()
-    .normalize('NFD')
-    .replace(/[\u0300-\u036f]/g, '')
-    .replace(/s$/, '')
-    .trim();
-
-/**
- * Levenshtein distance (edit distance)
- */
-const levenshtein = (a, b) => {
-  if (a === b) return 0;
-  if (!a) return b.length;
-  if (!b) return a.length;
-
-  const matrix = Array.from({ length: b.length + 1 }, () =>
-    new Array(a.length + 1)
-  );
-
-  for (let i = 0; i <= b.length; i++) matrix[i][0] = i;
-  for (let j = 0; j <= a.length; j++) matrix[0][j] = j;
-
-  for (let i = 1; i <= b.length; i++) {
-    for (let j = 1; j <= a.length; j++) {
-      matrix[i][j] =
-        b[i - 1] === a[j - 1]
-          ? matrix[i - 1][j - 1]
-          : Math.min(
-              matrix[i - 1][j - 1] + 1,
-              matrix[i][j - 1] + 1,
-              matrix[i - 1][j] + 1
-            );
-    }
-  }
-
-  return matrix[b.length][a.length];
-};
-
-/**
- * Stopwords
- */
-const stopWords = new Set([
-  'and', 'the', 'of', 'a', 'i', 'in', 'on', 'for', 'with',
-  'en', 'ett', 'och', 'från', 'med', 'på', 'för'
-]);
-
-/**
- * Tokenize text
- */
-const tokenize = (text) =>
-  normalize(text)
-    .split(/\s+/)
-    .filter(word => word && !stopWords.has(word));
-
-/**
- * Fuzzy match score
- */
-const matchScore = (text, query) => {
-  if (!text || !query) return 0;
-
-  const queryTokens = tokenize(query);
-  const textTokens = tokenize(text);
-
-  if (!queryTokens.length || !textTokens.length) return 0;
-
-  let score = 0;
-
-  for (const qWord of queryTokens) {
-    if (textTokens.includes(qWord)) {
-      score += 25;
-      continue;
+const searchAlgoritm = (() => {
+  console.log('[searchAlgoritm] 🔍 Module loaded');
+
+  /**
+   * Normalize text: lowercase, remove accents, trim, remove simple plurals
+   * @param {string} str
+   * @returns {string}
+   */
+  const normalize = (str = '') =>
+    String(str)
+      .toLowerCase()
+      .normalize('NFD')
+      .replace(/[\u0300-\u036f]/g, '')
+      .replace(/s$/, '')
+      .trim();
+
+  /**
+   * Levenshtein distance (edit distance)
+   */
+  const levenshtein = (a, b) => {
+    if (a === b) return 0;
+    if (!a) return b.length;
+    if (!b) return a.length;
+
+    const matrix = Array.from({ length: b.length + 1 }, () =>
+      new Array(a.length + 1)
+    );
+
+    for (let i = 0; i <= b.length; i++) matrix[i][0] = i;
+    for (let j = 0; j <= a.length; j++) matrix[0][j] = j;
+
+    for (let i = 1; i <= b.length; i++) {
+      for (let j = 1; j <= a.length; j++) {
+        matrix[i][j] =
+          b[i - 1] === a[j - 1]
+            ? matrix[i - 1][j - 1]
+            : Math.min(
+                matrix[i - 1][j - 1] + 1,
+                matrix[i][j - 1] + 1,
+                matrix[i - 1][j] + 1
+              );
+      }
     }
 
-    let bestSim = 0;
-
-    for (const tw of textTokens) {
-      const dist = levenshtein(tw, qWord);
-      const sim = (1 - dist / Math.max(tw.length, qWord.length)) * 100;
-      if (sim > bestSim) bestSim = sim;
-    }
+    return matrix[b.length][a.length];
+  };
+
+  /**
+   * Stopwords
+   */
+  const stopWords = new Set([
+    'and', 'the', 'of', 'a', 'i', 'in', 'on', 'for', 'with',
+    'en', 'ett', 'och', 'från', 'med', 'på', 'för'
+  ]);
+
+  /**
+   * Tokenize text
+   */
+  const tokenize = (text) =>
+    normalize(text)
+      .split(/\s+/)
+      .filter(word => word && !stopWords.has(word));
+
+  /**
+   * Fuzzy match score
+   */
+  const matchScore = (text, query) => {
+    if (!text || !query) return 0;
+
+    const queryTokens = tokenize(query);
+    const textTokens = tokenize(text);
+
+    if (!queryTokens.length || !textTokens.length) return 0;
+
+    let score = 0;
+
+    for (const qWord of queryTokens) {
+      if (textTokens.includes(qWord)) {
+        score += 25;
+        continue;
+      }
 
-    if (bestSim > 50) score += bestSim / 2;
-  }
+      let bestSim = 0;
 
-  if (textTokens.join(' ').includes(queryTokens.join(' '))) {
-    score += 20;
-  }
+      for (const tw of textTokens) {
+        const dist = levenshtein(tw, qWord);
+        const sim = (1 - dist / Math.max(tw.length, qWord.length)) * 100;
+        if (sim > bestSim) bestSim = sim;
+      }
 
-  return Math.min(Math.round(score), 100);
-};
+      if (bestSim > 50) score += bestSim / 2;
+    }
 
-/**
- * Score item by scanning all string fields
- */
-const calculateItemScore = (item, query) => {
-  let score = 0;
+    if (textTokens.join(' ').includes(queryTokens.join(' '))) {
+      score += 20;
+    }
 
-  for (const key in item) {
-    if (typeof item[key] === 'string') {
-      const cacheKey = `_lc_${key}`;
-      if (!item[cacheKey]) {
-        item[cacheKey] = normalize(item[key]);
+    return Math.min(Math.round(score), 100);
+  };
+
+  /**
+   * Score item by scanning all string fields
+   */
+  const calculateItemScore = (item, query) => {
+    let score = 0;
+
+    for (const key in item) {
+      if (typeof item[key] === 'string') {
+        const cacheKey = `_lc_${key}`;
+        if (!item[cacheKey]) {
+          item[cacheKey] = normalize(item[key]);
+        }
+        score += matchScore(item[cacheKey], query);
       }
-      score += matchScore(item[cacheKey], query);
     }
-  }
 
-  return score;
-};
+    return score;
+  };
 
-/**
- * Main search function
- */
-const searchAlgoritm = (query, dataList, enableLog = false) => {
-  if (!query || !Array.isArray(dataList)) return [];
+  /**
+   * Main search function
+   */
+  const searchAlgoritm = (query, dataList, enableLog = false) => {
+    if (!query || !Array.isArray(dataList)) return [];
 
-  const normalizedQuery = normalize(query);
+    const normalizedQuery = normalize(query);
 
-  const results = dataList
-    .map(item => ({
-      ...item,
-      _score: calculateItemScore(item, normalizedQuery)
-    }))
-    .filter(item => item._score > 0)
-    .sort((a, b) => b._score - a._score);
+    const results = dataList
+      .map(item => ({
+        ...item,
+        _score: calculateItemScore(item, normalizedQuery)
+      }))
+      .filter(item => item._score > 0)
+      .sort((a, b) => b._score - a._score);
+
+    if (enableLog) {
+      console.log(`[searchAlgoritm] 🔎 Query: "${query}", results: ${results.length}`);
+    }
 
-  if (enableLog) {
-    console.log(`[searchAlgoritm] 🔎 Query: "${query}", results: ${results.length}`);
-  }
+    return results;
+  };
 
-  return results;
-};
+  // Exponera funktionerna du behöver
+  return searchAlgoritm;
+})();
 
-/* Default export */
 module.exports = searchAlgoritm;