chore: disable delete confirmation in VS Code explorer

Disable the confirmation dialog when deleting files in the VS Code explorer to streamline the development workflow and reduce friction during file management operations.
This commit is contained in:
Falck
2026-04-25 15:56:37 +08:00
parent c998f8beda
commit e5d578a849
947 changed files with 114025 additions and 1 deletions

154
website/node_modules/side-channel-list/test/index.js generated vendored Normal file
View File

@@ -0,0 +1,154 @@
'use strict';
var test = require('tape');
var getSideChannelList = require('../');
test('getSideChannelList', function (t) {
t.test('export', function (st) {
st.equal(typeof getSideChannelList, 'function', 'is a function');
st.equal(getSideChannelList.length, 0, 'takes no arguments');
var channel = getSideChannelList();
st.ok(channel, 'is truthy');
st.equal(typeof channel, 'object', 'is an object');
st.end();
});
t.test('assert', function (st) {
var channel = getSideChannelList();
st['throws'](
function () { channel.assert({}); },
TypeError,
'nonexistent value throws'
);
var o = {};
channel.set(o, 'data');
st.doesNotThrow(function () { channel.assert(o); }, 'existent value noops');
st.end();
});
t.test('has', function (st) {
var channel = getSideChannelList();
/** @type {unknown[]} */ var o = [];
st.equal(channel.has(o), false, 'nonexistent value yields false');
channel.set(o, 'foo');
st.equal(channel.has(o), true, 'existent value yields true');
st.equal(channel.has('abc'), false, 'non object value non existent yields false');
channel.set('abc', 'foo');
st.equal(channel.has('abc'), true, 'non object value that exists yields true');
st.end();
});
t.test('get', function (st) {
var channel = getSideChannelList();
var o = {};
st.equal(channel.get(o), undefined, 'nonexistent value yields undefined');
var data = {};
channel.set(o, data);
st.equal(channel.get(o), data, '"get" yields data set by "set"');
st.end();
});
t.test('set', function (st) {
var channel = getSideChannelList();
var o = function () {};
st.equal(channel.get(o), undefined, 'value not set');
channel.set(o, 42);
st.equal(channel.get(o), 42, 'value was set');
channel.set(o, Infinity);
st.equal(channel.get(o), Infinity, 'value was set again');
var o2 = {};
channel.set(o2, 17);
st.equal(channel.get(o), Infinity, 'o is not modified');
st.equal(channel.get(o2), 17, 'o2 is set');
channel.set(o, 14);
st.equal(channel.get(o), 14, 'o is modified');
st.equal(channel.get(o2), 17, 'o2 is not modified');
st.end();
});
t.test('delete', function (st) {
var channel = getSideChannelList();
var o = {};
st.equal(channel['delete']({}), false, 'nonexistent value yields false');
channel.set(o, 42);
st.equal(channel.has(o), true, 'value is set');
st.equal(channel['delete']({}), false, 'nonexistent value still yields false');
st.equal(channel['delete'](o), true, 'deleted value yields true');
st.equal(channel.has(o), false, 'value is no longer set');
st.end();
});
t.test('delete: first node in a multi-node list', function (st) {
var channel = getSideChannelList();
channel.set('a', 1);
channel.set('b', 2);
st.equal(channel['delete']('b'), true, 'deleting first data node yields true');
st.equal(channel.has('a'), true, 'second node is still present after deleting first');
st.equal(channel.get('a'), 1, 'second node value is intact after deleting first');
st.equal(channel.has('b'), false, 'deleted node is gone');
st.end();
});
t.test('delete: last remaining node empties the list', function (st) {
var channel = getSideChannelList();
channel.set('a', 1);
channel.set('b', 2);
st.equal(channel['delete']('b'), true, 'delete first node');
st.equal(channel['delete']('a'), true, 'delete second (last) node');
st.equal(channel.has('a'), false, 'a is gone');
st.equal(channel.has('b'), false, 'b is gone');
st.equal(channel.get('a'), undefined, 'get a yields undefined');
channel.set('c', 3);
st.equal(channel.get('c'), 3, 'can set new values after emptying');
st.end();
});
t.test('delete: middle node in a multi-node list', function (st) {
var channel = getSideChannelList();
channel.set('a', 1);
channel.set('b', 2);
channel.set('c', 3);
st.equal(channel['delete']('b'), true, 'deleting middle node yields true');
st.equal(channel.get('a'), 1, 'first node still intact');
st.equal(channel.has('b'), false, 'middle node is gone');
st.equal(channel.get('c'), 3, 'last node still intact');
st.end();
});
t.end();
});