@linkdotnet/stringoperations
Advanced tools
Comparing version 0.1.0 to 0.1.1
@@ -0,0 +0,0 @@ { |
@@ -0,0 +0,0 @@ { |
{ | ||
"name": "@linkdotnet/stringoperations", | ||
"version": "0.1.0", | ||
"version": "0.1.1", | ||
"description": "Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.", | ||
@@ -37,7 +37,5 @@ "main": "dist/index.js", | ||
"jasmine-ts": "^0.3.0", | ||
"ts-node": "^7.0.1" | ||
}, | ||
"dependencies": { | ||
"ts-node": "^7.0.1", | ||
"typescript": "^4.2.3" | ||
} | ||
} |
# String Operations for TypeScript | ||
 | ||
This library implements some basic string algorithm. | ||
This library implements some basic string algorithm as well as data structures for a better way of handling strings. | ||
## How to install | ||
`npm i @linkdotnet/stringoperations` | ||
## Currently implemented algorithms | ||
@@ -6,0 +10,0 @@ ### Edit-Distances |
@@ -0,0 +0,0 @@ export class Rope { |
@@ -0,0 +0,0 @@ export class Trie { |
@@ -0,0 +0,0 @@ export function getLargestCommonSubstring (one: string, two: string, ignoreCase = false) { |
@@ -0,0 +0,0 @@ export function getLevenshteinDistance (one: string, two: string, ignoreCase = false, substitutionCost = 1, abortCost = Number.MAX_SAFE_INTEGER): number { |
@@ -0,0 +0,0 @@ import { Trie } from '../../src/data-structure/trie' |
@@ -0,0 +0,0 @@ import { getLargestCommonSubsequence } from '../../src/edit-distance/largest-common-subsequence' |
@@ -0,0 +0,0 @@ import { getLargestCommonSubstring } from '../../src/edit-distance/largest-common-substring' |
@@ -0,0 +0,0 @@ import { getLevenshteinDistance } from '../src/edit-distance/levenshtein' |
@@ -0,0 +0,0 @@ { |
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
0
17
20747
13
18
370
- Removedtypescript@^4.2.3
- Removedtypescript@4.9.5(transitive)