custom-electron-titlebar 3.2.5 → 3.2.9

package/lib/vs/base/browser/mouseEvent.js

@@ -1,146 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
- *  Copyright (c) Microsoft Corporation. All rights reserved.
- *  Licensed under the MIT License. See License.txt in the project root for license information.
- *--------------------------------------------------------------------------------------------*/
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.StandardWheelEvent = exports.DragMouseEvent = exports.StandardMouseEvent = void 0;
-const browser = __importStar(require("vs/base/browser/browser"));
-const iframe_1 = require("vs/base/browser/iframe");
-const platform = __importStar(require("vs/base/common/platform"));
-class StandardMouseEvent {
-    constructor(e) {
-        this.timestamp = Date.now();
-        this.browserEvent = e;
-        this.leftButton = e.button === 0;
-        this.middleButton = e.button === 1;
-        this.rightButton = e.button === 2;
-        this.buttons = e.buttons;
-        this.target = e.target;
-        this.detail = e.detail || 1;
-        if (e.type === 'dblclick') {
-            this.detail = 2;
-        }
-        this.ctrlKey = e.ctrlKey;
-        this.shiftKey = e.shiftKey;
-        this.altKey = e.altKey;
-        this.metaKey = e.metaKey;
-        if (typeof e.pageX === 'number') {
-            this.posx = e.pageX;
-            this.posy = e.pageY;
-        }
-        else {
-            // Probably hit by MSGestureEvent
-            this.posx = e.clientX + document.body.scrollLeft + document.documentElement.scrollLeft;
-            this.posy = e.clientY + document.body.scrollTop + document.documentElement.scrollTop;
-        }
-        // Find the position of the iframe this code is executing in relative to the iframe where the event was captured.
-        let iframeOffsets = iframe_1.IframeUtils.getPositionOfChildWindowRelativeToAncestorWindow(self, e.view);
-        this.posx -= iframeOffsets.left;
-        this.posy -= iframeOffsets.top;
-    }
-    preventDefault() {
-        this.browserEvent.preventDefault();
-    }
-    stopPropagation() {
-        this.browserEvent.stopPropagation();
-    }
-}
-exports.StandardMouseEvent = StandardMouseEvent;
-class DragMouseEvent extends StandardMouseEvent {
-    constructor(e) {
-        super(e);
-        this.dataTransfer = e.dataTransfer;
-    }
-}
-exports.DragMouseEvent = DragMouseEvent;
-class StandardWheelEvent {
-    constructor(e, deltaX = 0, deltaY = 0) {
-        this.browserEvent = e || null;
-        this.target = e ? (e.target || e.targetNode || e.srcElement) : null;
-        this.deltaY = deltaY;
-        this.deltaX = deltaX;
-        if (e) {
-            // Old (deprecated) wheel events
-            let e1 = e;
-            let e2 = e;
-            // vertical delta scroll
-            if (typeof e1.wheelDeltaY !== 'undefined') {
-                this.deltaY = e1.wheelDeltaY / 120;
-            }
-            else if (typeof e2.VERTICAL_AXIS !== 'undefined' && e2.axis === e2.VERTICAL_AXIS) {
-                this.deltaY = -e2.detail / 3;
-            }
-            else if (e.type === 'wheel') {
-                // Modern wheel event
-                // https://developer.mozilla.org/en-US/docs/Web/API/WheelEvent
-                const ev = e;
-                if (ev.deltaMode === ev.DOM_DELTA_LINE) {
-                    // the deltas are expressed in lines
-                    this.deltaY = -e.deltaY;
-                }
-                else {
-                    this.deltaY = -e.deltaY / 40;
-                }
-            }
-            // horizontal delta scroll
-            if (typeof e1.wheelDeltaX !== 'undefined') {
-                if (browser.isSafari && platform.isWindows) {
-                    this.deltaX = -(e1.wheelDeltaX / 120);
-                }
-                else {
-                    this.deltaX = e1.wheelDeltaX / 120;
-                }
-            }
-            else if (typeof e2.HORIZONTAL_AXIS !== 'undefined' && e2.axis === e2.HORIZONTAL_AXIS) {
-                this.deltaX = -e.detail / 3;
-            }
-            else if (e.type === 'wheel') {
-                // Modern wheel event
-                // https://developer.mozilla.org/en-US/docs/Web/API/WheelEvent
-                const ev = e;
-                if (ev.deltaMode === ev.DOM_DELTA_LINE) {
-                    // the deltas are expressed in lines
-                    this.deltaX = -e.deltaX;
-                }
-                else {
-                    this.deltaX = -e.deltaX / 40;
-                }
-            }
-            // Assume a vertical scroll if nothing else worked
-            if (this.deltaY === 0 && this.deltaX === 0 && e.wheelDelta) {
-                this.deltaY = e.wheelDelta / 120;
-            }
-        }
-    }
-    preventDefault() {
-        if (this.browserEvent) {
-            this.browserEvent.preventDefault();
-        }
-    }
-    stopPropagation() {
-        if (this.browserEvent) {
-            this.browserEvent.stopPropagation();
-        }
-    }
-}
-exports.StandardWheelEvent = StandardWheelEvent;

package/lib/vs/base/common/arrays.d.ts

@@ -1,149 +0,0 @@
-import { CancellationToken } from 'vs/base/common/cancellation';
-import { ISplice } from 'vs/base/common/sequence';
-/**
- * Returns the last element of an array.
- * @param array The array.
- * @param n Which element from the end (default is zero).
- */
-export declare function tail<T>(array: ArrayLike<T>, n?: number): T;
-export declare function tail2<T>(arr: T[]): [T[], T];
-export declare function equals<T>(one: ReadonlyArray<T> | undefined, other: ReadonlyArray<T> | undefined, itemEquals?: (a: T, b: T) => boolean): boolean;
-export declare function binarySearch<T>(array: ReadonlyArray<T>, key: T, comparator: (op1: T, op2: T) => number): number;
-/**
- * Takes a sorted array and a function p. The array is sorted in such a way that all elements where p(x) is false
- * are located before all elements where p(x) is true.
- * @returns the least x for which p(x) is true or array.length if no element fullfills the given function.
- */
-export declare function findFirstInSorted<T>(array: ReadonlyArray<T>, p: (x: T) => boolean): number;
-declare type Compare<T> = (a: T, b: T) => number;
-/**
- * Like `Array#sort` but always stable. Usually runs a little slower `than Array#sort`
- * so only use this when actually needing stable sort.
- */
-export declare function mergeSort<T>(data: T[], compare: Compare<T>): T[];
-export declare function groupBy<T>(data: ReadonlyArray<T>, compare: (a: T, b: T) => number): T[][];
-/**
- * Diffs two *sorted* arrays and computes the splices which apply the diff.
- */
-export declare function sortedDiff<T>(before: ReadonlyArray<T>, after: ReadonlyArray<T>, compare: (a: T, b: T) => number): ISplice<T>[];
-/**
- * Takes two *sorted* arrays and computes their delta (removed, added elements).
- * Finishes in `Math.min(before.length, after.length)` steps.
- */
-export declare function delta<T>(before: ReadonlyArray<T>, after: ReadonlyArray<T>, compare: (a: T, b: T) => number): {
-    removed: T[];
-    added: T[];
-};
-/**
- * Returns the top N elements from the array.
- *
- * Faster than sorting the entire array when the array is a lot larger than N.
- *
- * @param array The unsorted array.
- * @param compare A sort function for the elements.
- * @param n The number of elements to return.
- * @return The first n elemnts from array when sorted with compare.
- */
-export declare function top<T>(array: ReadonlyArray<T>, compare: (a: T, b: T) => number, n: number): T[];
-/**
- * Asynchronous variant of `top()` allowing for splitting up work in batches between which the event loop can run.
- *
- * Returns the top N elements from the array.
- *
- * Faster than sorting the entire array when the array is a lot larger than N.
- *
- * @param array The unsorted array.
- * @param compare A sort function for the elements.
- * @param n The number of elements to return.
- * @param batch The number of elements to examine before yielding to the event loop.
- * @return The first n elemnts from array when sorted with compare.
- */
-export declare function topAsync<T>(array: T[], compare: (a: T, b: T) => number, n: number, batch: number, token?: CancellationToken): Promise<T[]>;
-/**
- * @returns New array with all falsy values removed. The original array IS NOT modified.
- */
-export declare function coalesce<T>(array: ReadonlyArray<T | undefined | null>): T[];
-/**
- * Remove all falsey values from `array`. The original array IS modified.
- */
-export declare function coalesceInPlace<T>(array: Array<T | undefined | null>): void;
-/**
- * Moves the element in the array for the provided positions.
- */
-export declare function move(array: any[], from: number, to: number): void;
-/**
- * @returns false if the provided object is an array and not empty.
- */
-export declare function isFalsyOrEmpty(obj: any): boolean;
-/**
- * @returns True if the provided object is an array and has at least one element.
- */
-export declare function isNonEmptyArray<T>(obj: T[] | undefined | null): obj is T[];
-export declare function isNonEmptyArray<T>(obj: readonly T[] | undefined | null): obj is readonly T[];
-/**
- * Removes duplicates from the given array. The optional keyFn allows to specify
- * how elements are checked for equalness by returning a unique string for each.
- */
-export declare function distinct<T>(array: ReadonlyArray<T>, keyFn?: (t: T) => string): T[];
-export declare function distinctES6<T>(array: ReadonlyArray<T>): T[];
-export declare function uniqueFilter<T>(keyFn: (t: T) => string): (t: T) => boolean;
-export declare function lastIndex<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean): number;
-/**
- * @deprecated ES6: use `Array.findIndex`
- */
-export declare function firstIndex<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean): number;
-/**
- * @deprecated ES6: use `Array.find`
- */
-export declare function first<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean, notFoundValue: T): T;
-export declare function first<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean): T | undefined;
-export declare function firstOrDefault<T, NotFound = T>(array: ReadonlyArray<T>, notFoundValue: NotFound): T | NotFound;
-export declare function firstOrDefault<T>(array: ReadonlyArray<T>): T | undefined;
-export declare function commonPrefixLength<T>(one: ReadonlyArray<T>, other: ReadonlyArray<T>, equals?: (a: T, b: T) => boolean): number;
-export declare function flatten<T>(arr: T[][]): T[];
-export declare function range(to: number): number[];
-export declare function range(from: number, to: number): number[];
-export declare function index<T>(array: ReadonlyArray<T>, indexer: (t: T) => string): {
-    [key: string]: T;
-};
-export declare function index<T, R>(array: ReadonlyArray<T>, indexer: (t: T) => string, mapper: (t: T) => R): {
-    [key: string]: R;
-};
-/**
- * Inserts an element into an array. Returns a function which, when
- * called, will remove that element from the array.
- */
-export declare function insert<T>(array: T[], element: T): () => void;
-/**
- * Removes an element from an array if it can be found.
- */
-export declare function remove<T>(array: T[], element: T): T | undefined;
-/**
- * Insert `insertArr` inside `target` at `insertIndex`.
- * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array
- */
-export declare function arrayInsert<T>(target: T[], insertIndex: number, insertArr: T[]): T[];
-/**
- * Uses Fisher-Yates shuffle to shuffle the given array
- */
-export declare function shuffle<T>(array: T[], _seed?: number): void;
-/**
- * Pushes an element to the start of the array, if found.
- */
-export declare function pushToStart<T>(arr: T[], value: T): void;
-/**
- * Pushes an element to the end of the array, if found.
- */
-export declare function pushToEnd<T>(arr: T[], value: T): void;
-/**
- * @deprecated ES6: use `Array.find`
- */
-export declare function find<T>(arr: ArrayLike<T>, predicate: (value: T, index: number, arr: ArrayLike<T>) => any): T | undefined;
-export declare function mapArrayOrNot<T, U>(items: T | T[], fn: (_: T) => U): U | U[];
-export declare function asArray<T>(x: T | T[]): T[];
-/**
- * @deprecated Use `Array.from` or `[...iter]`
- */
-export declare function toArray<T>(iterable: IterableIterator<T>): T[];
-export declare function getRandomElement<T>(arr: T[]): T | undefined;
-export {};