@linkdotnet/stringoperations - npm Package Compare versions

Comparing version 0.4.1 to 0.4.2

dist/data-structure/rope.d.ts

@@ -65,2 +65,9 @@ /**
     /**
+     * Inserts a string into the current rope and returns the merger
+     * @param rope New rope to add to the current one
+     * @param index Zero based index where the new rope has to be inserted
+     * @returns The merged rope
+     */
+    insertString(text: string, index: number): Rope;
+    /**
      * Deletes a substring from the rope
@@ -67,0 +74,0 @@ * @param startIndex Inclusive starting index

dist/data-structure/rope.js

@@ -98,2 +98,11 @@ "use strict";
     /**
+     * Inserts a string into the current rope and returns the merger
+     * @param rope New rope to add to the current one
+     * @param index Zero based index where the new rope has to be inserted
+     * @returns The merged rope
+     */
+    insertString(text, index) {
+        return this.insert(Rope.create(text), index);
+    }
+    /**
      * Deletes a substring from the rope
@@ -100,0 +109,0 @@ * @param startIndex Inclusive starting index

dist/index.d.ts

@@ -8,1 +8,2 @@ export { getLongestCommonSubstring } from './edit-distance/longest-common-substring';
 export { contains, findAll } from './search/boyer-moore';
+export { isPalindrom } from './search/palindrom';

dist/index.js

 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.findAll = exports.contains = exports.Rope = exports.Trie = exports.getHammingDistance = exports.getLevenshteinDistance = exports.getClosestWords = exports.getClosestWord = exports.getLongestCommonSubsequence = exports.getLongestCommonSubstring = void 0;
+exports.isPalindrom = exports.findAll = exports.contains = exports.Rope = exports.Trie = exports.getHammingDistance = exports.getLevenshteinDistance = exports.getClosestWords = exports.getClosestWord = exports.getLongestCommonSubsequence = exports.getLongestCommonSubstring = void 0;
 var longest_common_substring_1 = require("./edit-distance/longest-common-substring");
@@ -21,1 +21,3 @@ Object.defineProperty(exports, "getLongestCommonSubstring", { enumerable: true, get: function () { return longest_common_substring_1.getLongestCommonSubstring; } });
 Object.defineProperty(exports, "findAll", { enumerable: true, get: function () { return boyer_moore_1.findAll; } });
+var palindrom_1 = require("./search/palindrom");
+Object.defineProperty(exports, "isPalindrom", { enumerable: true, get: function () { return palindrom_1.isPalindrom; } });

package.json

 {
   "name": "@linkdotnet/stringoperations",
-  "version": "0.4.1",
+  "version": "0.4.2",
   "description": "Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.",
@@ -26,3 +26,4 @@ "main": "dist/index.js",
     "trie",
-    "boyer moore"
+    "boyer moore",
+    "palindrom"
   ],
@@ -29,0 +30,0 @@ "author": "LinkDotNet",

README.md

@@ -73,2 +73,3 @@ # String Operations for TypeScript
 ## Search
- * Boyer-Moore
+ * Boyer-Moore
+ * Palindrom

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

40568

increased by4.15%

Number of package files

21

increased by10.53%

Lines of code

832

increased by4.79%

Number of lines in readme file

74

increased by1.37%

No dependency changes