@prelude/radix-trie
Advanced tools
Comparing version 0.0.2 to 0.1.0
@@ -21,1 +21,2 @@ export declare type Edge = { | ||
export declare const longestPrefix: (trie: t, input: string, offset?: number) => string | undefined; | ||
export declare const has: (trie: t, input: string, offset?: number) => any; |
"use strict"; | ||
Object.defineProperty(exports, "__esModule", { value: true }); | ||
exports.longestPrefix = exports.longestPrefixLength = exports.firstPrefix = exports.firstPrefixLength = exports.prefixes = exports.prefixLengths = exports.of = exports.empty = exports.insert = void 0; | ||
exports.has = exports.longestPrefix = exports.longestPrefixLength = exports.firstPrefix = exports.firstPrefixLength = exports.prefixes = exports.prefixLengths = exports.of = exports.empty = exports.insert = void 0; | ||
/** @returns shared prefix length. */ | ||
@@ -117,2 +117,18 @@ const shared = (lhs, rhs, rhsOffset = 0) => { | ||
exports.longestPrefix = longestPrefix; | ||
const has = (trie, input, offset = 0) => { | ||
const char = input[offset]; | ||
const edge = trie[char]; | ||
if (!edge) { | ||
return false; | ||
} | ||
const n = edge.P.length; | ||
return shared(edge.P, input, offset) === n ? | ||
input.length === offset + n ? | ||
edge.E : | ||
edge.N ? | ||
(0, exports.has)(edge.N, input, offset + n) : | ||
false : | ||
false; | ||
}; | ||
exports.has = has; | ||
//# sourceMappingURL=index.js.map |
@@ -21,1 +21,2 @@ export declare type Edge = { | ||
export declare const longestPrefix: (trie: t, input: string, offset?: number) => string | undefined; | ||
export declare const has: (trie: t, input: string, offset?: number) => any; |
@@ -105,2 +105,17 @@ /** @returns shared prefix length. */ | ||
}; | ||
export const has = (trie, input, offset = 0) => { | ||
const char = input[offset]; | ||
const edge = trie[char]; | ||
if (!edge) { | ||
return false; | ||
} | ||
const n = edge.P.length; | ||
return shared(edge.P, input, offset) === n ? | ||
input.length === offset + n ? | ||
edge.E : | ||
edge.N ? | ||
has(edge.N, input, offset + n) : | ||
false : | ||
false; | ||
}; | ||
//# sourceMappingURL=index.js.map |
{ | ||
"name": "@prelude/radix-trie", | ||
"version": "0.0.2", | ||
"version": "0.1.0", | ||
"description": "Radix trie module.", | ||
@@ -5,0 +5,0 @@ "type": "module", |
@@ -152,1 +152,18 @@ | ||
} | ||
export const has = | ||
(trie: t, input: string, offset = 0) => { | ||
const char = input[offset] | ||
const edge = trie[char] | ||
if (!edge) { | ||
return false | ||
} | ||
const n = edge.P.length | ||
return shared(edge.P, input, offset) === n ? | ||
input.length === offset + n ? | ||
edge.E : | ||
edge.N ? | ||
has(edge.N, input, offset + n) : | ||
false : | ||
false | ||
} |
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
27583
453