@theia/core 1.53.0-next.55 → 1.53.0-next.64

package/src/browser/tree/tree-navigation.ts

@@ -1,58 +1,58 @@
-// *****************************************************************************
-// Copyright (C) 2017 TypeFox and others.
-//
-// This program and the accompanying materials are made available under the
-// terms of the Eclipse Public License v. 2.0 which is available at
-// http://www.eclipse.org/legal/epl-2.0.
-//
-// This Source Code may also be made available under the following Secondary
-// Licenses when the conditions for such availability set forth in the Eclipse
-// Public License v. 2.0 are satisfied: GNU General Public License, version 2
-// with the GNU Classpath Exception which is available at
-// https://www.gnu.org/software/classpath/license.html.
-//
-// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
-// *****************************************************************************
-
-import { injectable } from 'inversify';
-import { TreeNode } from './tree';
-
-@injectable()
-export class TreeNavigationService {
-
-    protected index: number = -1;
-    protected nodes: TreeNode[] = [];
-
-    get next(): TreeNode | undefined {
-        return this.nodes[this.index + 1];
-    }
-
-    get prev(): TreeNode | undefined {
-        return this.nodes[this.index - 1];
-    }
-
-    advance(): TreeNode | undefined {
-        const node = this.next;
-        if (node) {
-            this.index = this.index + 1;
-            return node;
-        }
-        return undefined;
-    }
-
-    retreat(): TreeNode | undefined {
-        const node = this.prev;
-        if (node) {
-            this.index = this.index - 1;
-            return node;
-        }
-        return undefined;
-    }
-
-    push(node: TreeNode): void {
-        this.nodes = this.nodes.slice(0, this.index + 1);
-        this.nodes.push(node);
-        this.index = this.index + 1;
-    }
-
-}
+// *****************************************************************************
+// Copyright (C) 2017 TypeFox and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+
+import { injectable } from 'inversify';
+import { TreeNode } from './tree';
+
+@injectable()
+export class TreeNavigationService {
+
+    protected index: number = -1;
+    protected nodes: TreeNode[] = [];
+
+    get next(): TreeNode | undefined {
+        return this.nodes[this.index + 1];
+    }
+
+    get prev(): TreeNode | undefined {
+        return this.nodes[this.index - 1];
+    }
+
+    advance(): TreeNode | undefined {
+        const node = this.next;
+        if (node) {
+            this.index = this.index + 1;
+            return node;
+        }
+        return undefined;
+    }
+
+    retreat(): TreeNode | undefined {
+        const node = this.prev;
+        if (node) {
+            this.index = this.index - 1;
+            return node;
+        }
+        return undefined;
+    }
+
+    push(node: TreeNode): void {
+        this.nodes = this.nodes.slice(0, this.index + 1);
+        this.nodes.push(node);
+        this.index = this.index + 1;
+    }
+
+}

package/src/browser/tree/tree-preference.ts

@@ -1,50 +1,50 @@
-// *****************************************************************************
-// Copyright (C) 2024 STMicroelectronics and others.
-//
-// This program and the accompanying materials are made available under the
-// terms of the Eclipse Public License v. 2.0 which is available at
-// http://www.eclipse.org/legal/epl-2.0.
-//
-// This Source Code may also be made available under the following Secondary
-// Licenses when the conditions for such availability set forth in the Eclipse
-// Public License v. 2.0 are satisfied: GNU General Public License, version 2
-// with the GNU Classpath Exception which is available at
-// https://www.gnu.org/software/classpath/license.html.
-//
-// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
-// *****************************************************************************
-
-import { interfaces } from 'inversify';
-import { PreferenceProxy, PreferenceContribution, PreferenceSchema } from '../preferences';
-import { PreferenceProxyFactory } from '../preferences/injectable-preference-proxy';
-import { nls } from '../../common/nls';
-
-export const PREFERENCE_NAME_TREE_INDENT = 'workbench.tree.indent';
-
-export const treePreferencesSchema: PreferenceSchema = {
-    type: 'object',
-    properties: {
-        [PREFERENCE_NAME_TREE_INDENT]: {
-            description: nls.localizeByDefault('Controls tree indentation in pixels.'),
-            type: 'number',
-            default: 8,
-            minimum: 4,
-            maximum: 40
-        },
-    }
-};
-
-export class TreeConfiguration {
-    [PREFERENCE_NAME_TREE_INDENT]: number;
-}
-
-export const TreePreferences = Symbol('treePreferences');
-export type TreePreferences = PreferenceProxy<TreeConfiguration>;
-
-export function bindTreePreferences(bind: interfaces.Bind): void {
-    bind(TreePreferences).toDynamicValue(ctx => {
-        const factory = ctx.container.get<PreferenceProxyFactory>(PreferenceProxyFactory);
-        return factory(treePreferencesSchema);
-    }).inSingletonScope();
-    bind(PreferenceContribution).toConstantValue({ schema: treePreferencesSchema });
-}
+// *****************************************************************************
+// Copyright (C) 2024 STMicroelectronics and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+
+import { interfaces } from 'inversify';
+import { PreferenceProxy, PreferenceContribution, PreferenceSchema } from '../preferences';
+import { PreferenceProxyFactory } from '../preferences/injectable-preference-proxy';
+import { nls } from '../../common/nls';
+
+export const PREFERENCE_NAME_TREE_INDENT = 'workbench.tree.indent';
+
+export const treePreferencesSchema: PreferenceSchema = {
+    type: 'object',
+    properties: {
+        [PREFERENCE_NAME_TREE_INDENT]: {
+            description: nls.localizeByDefault('Controls tree indentation in pixels.'),
+            type: 'number',
+            default: 8,
+            minimum: 4,
+            maximum: 40
+        },
+    }
+};
+
+export class TreeConfiguration {
+    [PREFERENCE_NAME_TREE_INDENT]: number;
+}
+
+export const TreePreferences = Symbol('treePreferences');
+export type TreePreferences = PreferenceProxy<TreeConfiguration>;
+
+export function bindTreePreferences(bind: interfaces.Bind): void {
+    bind(TreePreferences).toDynamicValue(ctx => {
+        const factory = ctx.container.get<PreferenceProxyFactory>(PreferenceProxyFactory);
+        return factory(treePreferencesSchema);
+    }).inSingletonScope();
+    bind(PreferenceContribution).toConstantValue({ schema: treePreferencesSchema });
+}

package/src/browser/tree/tree-search.ts

@@ -1,128 +1,128 @@
-// *****************************************************************************
-// Copyright (C) 2018 TypeFox and others.
-//
-// This program and the accompanying materials are made available under the
-// terms of the Eclipse Public License v. 2.0 which is available at
-// http://www.eclipse.org/legal/epl-2.0.
-//
-// This Source Code may also be made available under the following Secondary
-// Licenses when the conditions for such availability set forth in the Eclipse
-// Public License v. 2.0 are satisfied: GNU General Public License, version 2
-// with the GNU Classpath Exception which is available at
-// https://www.gnu.org/software/classpath/license.html.
-//
-// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
-// *****************************************************************************
-
-import { inject, injectable, postConstruct } from 'inversify';
-import { Disposable, DisposableCollection } from '../../common/disposable';
-import { Event, Emitter } from '../../common/event';
-import { Tree, TreeNode } from './tree';
-import { TreeDecoration } from './tree-decorator';
-import { FuzzySearch } from './fuzzy-search';
-import { TopDownTreeIterator } from './tree-iterator';
-import { LabelProvider } from '../label-provider';
-
-@injectable()
-export class TreeSearch implements Disposable {
-
-    @inject(Tree)
-    protected readonly tree: Tree;
-
-    @inject(FuzzySearch)
-    protected readonly fuzzySearch: FuzzySearch;
-
-    @inject(LabelProvider)
-    protected readonly labelProvider: LabelProvider;
-
-    protected readonly disposables = new DisposableCollection();
-    protected readonly filteredNodesEmitter = new Emitter<ReadonlyArray<Readonly<TreeNode>>>();
-
-    protected _filterResult: FuzzySearch.Match<TreeNode>[] = [];
-    protected _filteredNodes: ReadonlyArray<Readonly<TreeNode>> = [];
-    protected _filteredNodesAndParents: Set<string> = new Set();
-
-    @postConstruct()
-    protected init(): void {
-        this.disposables.push(this.filteredNodesEmitter);
-    }
-
-    getHighlights(): Map<string, TreeDecoration.CaptionHighlight> {
-        return new Map(this._filterResult.map(m => [m.item.id, this.toCaptionHighlight(m)] as [string, TreeDecoration.CaptionHighlight]));
-    }
-
-    /**
-     * Resolves to all the visible tree nodes that match the search pattern.
-     */
-    async filter(pattern: string | undefined): Promise<ReadonlyArray<Readonly<TreeNode>>> {
-        const { root } = this.tree;
-        this._filteredNodesAndParents = new Set();
-        if (!pattern || !root) {
-            this._filterResult = [];
-            this._filteredNodes = [];
-            this.fireFilteredNodesChanged(this._filteredNodes);
-            return [];
-        }
-        const items = [...new TopDownTreeIterator(root)];
-        const transform = (node: TreeNode) => this.labelProvider.getName(node);
-        this._filterResult = await this.fuzzySearch.filter({
-            items,
-            pattern,
-            transform
-        });
-        this._filteredNodes = this._filterResult.map(({ item }) => {
-            this.addAllParentsToFilteredSet(item);
-            return item;
-        });
-        this.fireFilteredNodesChanged(this._filteredNodes);
-        return this._filteredNodes.slice();
-    }
-
-    protected addAllParentsToFilteredSet(node: TreeNode): void {
-        let toAdd: TreeNode | undefined = node;
-        while (toAdd && !this._filteredNodesAndParents.has(toAdd.id)) {
-            this._filteredNodesAndParents.add(toAdd.id);
-            toAdd = toAdd.parent;
-        };
-    }
-
-    /**
-     * Returns with the filtered nodes after invoking the `filter` method.
-     */
-    get filteredNodes(): ReadonlyArray<Readonly<TreeNode>> {
-        return this._filteredNodes.slice();
-    }
-
-    /**
-     * Event that is fired when the filtered nodes have been changed.
-     */
-    get onFilteredNodesChanged(): Event<ReadonlyArray<Readonly<TreeNode>>> {
-        return this.filteredNodesEmitter.event;
-    }
-
-    passesFilters(node: TreeNode): boolean {
-        return this._filteredNodesAndParents.has(node.id);
-    }
-
-    dispose(): void {
-        this.disposables.dispose();
-    }
-
-    protected fireFilteredNodesChanged(nodes: ReadonlyArray<Readonly<TreeNode>>): void {
-        this.filteredNodesEmitter.fire(nodes);
-    }
-
-    protected toCaptionHighlight(match: FuzzySearch.Match<TreeNode>): TreeDecoration.CaptionHighlight {
-        return {
-            ranges: match.ranges.map(this.mapRange.bind(this))
-        };
-    }
-
-    protected mapRange(range: FuzzySearch.Range): TreeDecoration.CaptionHighlight.Range {
-        const { offset, length } = range;
-        return {
-            offset,
-            length
-        };
-    }
-}
+// *****************************************************************************
+// Copyright (C) 2018 TypeFox and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+
+import { inject, injectable, postConstruct } from 'inversify';
+import { Disposable, DisposableCollection } from '../../common/disposable';
+import { Event, Emitter } from '../../common/event';
+import { Tree, TreeNode } from './tree';
+import { TreeDecoration } from './tree-decorator';
+import { FuzzySearch } from './fuzzy-search';
+import { TopDownTreeIterator } from './tree-iterator';
+import { LabelProvider } from '../label-provider';
+
+@injectable()
+export class TreeSearch implements Disposable {
+
+    @inject(Tree)
+    protected readonly tree: Tree;
+
+    @inject(FuzzySearch)
+    protected readonly fuzzySearch: FuzzySearch;
+
+    @inject(LabelProvider)
+    protected readonly labelProvider: LabelProvider;
+
+    protected readonly disposables = new DisposableCollection();
+    protected readonly filteredNodesEmitter = new Emitter<ReadonlyArray<Readonly<TreeNode>>>();
+
+    protected _filterResult: FuzzySearch.Match<TreeNode>[] = [];
+    protected _filteredNodes: ReadonlyArray<Readonly<TreeNode>> = [];
+    protected _filteredNodesAndParents: Set<string> = new Set();
+
+    @postConstruct()
+    protected init(): void {
+        this.disposables.push(this.filteredNodesEmitter);
+    }
+
+    getHighlights(): Map<string, TreeDecoration.CaptionHighlight> {
+        return new Map(this._filterResult.map(m => [m.item.id, this.toCaptionHighlight(m)] as [string, TreeDecoration.CaptionHighlight]));
+    }
+
+    /**
+     * Resolves to all the visible tree nodes that match the search pattern.
+     */
+    async filter(pattern: string | undefined): Promise<ReadonlyArray<Readonly<TreeNode>>> {
+        const { root } = this.tree;
+        this._filteredNodesAndParents = new Set();
+        if (!pattern || !root) {
+            this._filterResult = [];
+            this._filteredNodes = [];
+            this.fireFilteredNodesChanged(this._filteredNodes);
+            return [];
+        }
+        const items = [...new TopDownTreeIterator(root)];
+        const transform = (node: TreeNode) => this.labelProvider.getName(node);
+        this._filterResult = await this.fuzzySearch.filter({
+            items,
+            pattern,
+            transform
+        });
+        this._filteredNodes = this._filterResult.map(({ item }) => {
+            this.addAllParentsToFilteredSet(item);
+            return item;
+        });
+        this.fireFilteredNodesChanged(this._filteredNodes);
+        return this._filteredNodes.slice();
+    }
+
+    protected addAllParentsToFilteredSet(node: TreeNode): void {
+        let toAdd: TreeNode | undefined = node;
+        while (toAdd && !this._filteredNodesAndParents.has(toAdd.id)) {
+            this._filteredNodesAndParents.add(toAdd.id);
+            toAdd = toAdd.parent;
+        };
+    }
+
+    /**
+     * Returns with the filtered nodes after invoking the `filter` method.
+     */
+    get filteredNodes(): ReadonlyArray<Readonly<TreeNode>> {
+        return this._filteredNodes.slice();
+    }
+
+    /**
+     * Event that is fired when the filtered nodes have been changed.
+     */
+    get onFilteredNodesChanged(): Event<ReadonlyArray<Readonly<TreeNode>>> {
+        return this.filteredNodesEmitter.event;
+    }
+
+    passesFilters(node: TreeNode): boolean {
+        return this._filteredNodesAndParents.has(node.id);
+    }
+
+    dispose(): void {
+        this.disposables.dispose();
+    }
+
+    protected fireFilteredNodesChanged(nodes: ReadonlyArray<Readonly<TreeNode>>): void {
+        this.filteredNodesEmitter.fire(nodes);
+    }
+
+    protected toCaptionHighlight(match: FuzzySearch.Match<TreeNode>): TreeDecoration.CaptionHighlight {
+        return {
+            ranges: match.ranges.map(this.mapRange.bind(this))
+        };
+    }
+
+    protected mapRange(range: FuzzySearch.Range): TreeDecoration.CaptionHighlight.Range {
+        const { offset, length } = range;
+        return {
+            offset,
+            length
+        };
+    }
+}