Marc Mintel
5397309103
Some checks failed
Build & Deploy / 🔍 Prepare (push) Successful in 20s
Build & Deploy / 🧪 QA (push) Failing after 34s
Build & Deploy / 🏗️ Build (push) Has started running
Build & Deploy / 🚀 Deploy (push) Has been cancelled
Build & Deploy / 🧪 Smoke Test (push) Has been cancelled
Build & Deploy / ⚡ Lighthouse (push) Has been cancelled
Build & Deploy / 🔔 Notify (push) Has been cancelled
89 lines
3.0 KiB
Plaintext
89 lines
3.0 KiB
Plaintext
"use strict";
|
|
/*
|
|
* Copyright The OpenTelemetry Authors
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* https://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
exports.ModuleNameTrie = exports.ModuleNameSeparator = void 0;
|
|
exports.ModuleNameSeparator = '/';
|
|
/**
|
|
* Node in a `ModuleNameTrie`
|
|
*/
|
|
class ModuleNameTrieNode {
|
|
hooks = [];
|
|
children = new Map();
|
|
}
|
|
/**
|
|
* Trie containing nodes that represent a part of a module name (i.e. the parts separated by forward slash)
|
|
*/
|
|
class ModuleNameTrie {
|
|
_trie = new ModuleNameTrieNode();
|
|
_counter = 0;
|
|
/**
|
|
* Insert a module hook into the trie
|
|
*
|
|
* @param {Hooked} hook Hook
|
|
*/
|
|
insert(hook) {
|
|
let trieNode = this._trie;
|
|
for (const moduleNamePart of hook.moduleName.split(exports.ModuleNameSeparator)) {
|
|
let nextNode = trieNode.children.get(moduleNamePart);
|
|
if (!nextNode) {
|
|
nextNode = new ModuleNameTrieNode();
|
|
trieNode.children.set(moduleNamePart, nextNode);
|
|
}
|
|
trieNode = nextNode;
|
|
}
|
|
trieNode.hooks.push({ hook, insertedId: this._counter++ });
|
|
}
|
|
/**
|
|
* Search for matching hooks in the trie
|
|
*
|
|
* @param {string} moduleName Module name
|
|
* @param {boolean} maintainInsertionOrder Whether to return the results in insertion order
|
|
* @param {boolean} fullOnly Whether to return only full matches
|
|
* @returns {Hooked[]} Matching hooks
|
|
*/
|
|
search(moduleName, { maintainInsertionOrder, fullOnly } = {}) {
|
|
let trieNode = this._trie;
|
|
const results = [];
|
|
let foundFull = true;
|
|
for (const moduleNamePart of moduleName.split(exports.ModuleNameSeparator)) {
|
|
const nextNode = trieNode.children.get(moduleNamePart);
|
|
if (!nextNode) {
|
|
foundFull = false;
|
|
break;
|
|
}
|
|
if (!fullOnly) {
|
|
results.push(...nextNode.hooks);
|
|
}
|
|
trieNode = nextNode;
|
|
}
|
|
if (fullOnly && foundFull) {
|
|
results.push(...trieNode.hooks);
|
|
}
|
|
if (results.length === 0) {
|
|
return [];
|
|
}
|
|
if (results.length === 1) {
|
|
return [results[0].hook];
|
|
}
|
|
if (maintainInsertionOrder) {
|
|
results.sort((a, b) => a.insertedId - b.insertedId);
|
|
}
|
|
return results.map(({ hook }) => hook);
|
|
}
|
|
}
|
|
exports.ModuleNameTrie = ModuleNameTrie;
|
|
//# sourceMappingURL=ModuleNameTrie.js.map |