typespec-vscode 0.57.0-dev.1 → 0.57.0-dev.3

package/ThirdPartyNotices.txt

@@ -10,10 +10,8 @@ granted herein, whether by implication, estoppel or otherwise.
 
 1. balanced-match version 1.0.2 (https://github.com/juliangruber/balanced-match)
 2. brace-expansion version 2.0.1 (https://github.com/juliangruber/brace-expansion)
-3. lru-cache version 6.0.0 (https://github.com/isaacs/node-lru-cache)
-4. minimatch version 5.1.6 (https://github.com/isaacs/minimatch)
-5. semver version 7.6.0 (https://github.com/npm/node-semver)
-6. yallist version 4.0.0 (https://github.com/isaacs/yallist)
+3. minimatch version 5.1.6 (https://github.com/isaacs/minimatch)
+4. semver version 7.6.2 (https://github.com/npm/node-semver)
 
 
 %% balanced-match NOTICES AND INFORMATION BEGIN HERE
@@ -72,28 +70,6 @@ SOFTWARE.
 END OF brace-expansion NOTICES AND INFORMATION
 
 
-%% lru-cache NOTICES AND INFORMATION BEGIN HERE
-=====================================================
-The ISC License
-
-Copyright (c) Isaac Z. Schlueter and Contributors
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
-IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-
-=====================================================");
-END OF lru-cache NOTICES AND INFORMATION
-
-
 %% minimatch NOTICES AND INFORMATION BEGIN HERE
 =====================================================
 The ISC License
@@ -135,26 +111,4 @@ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
 IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 
 =====================================================");
-END OF semver NOTICES AND INFORMATION
-
-
-%% yallist NOTICES AND INFORMATION BEGIN HERE
-=====================================================
-The ISC License
-
-Copyright (c) Isaac Z. Schlueter and Contributors
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
-IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-
-=====================================================");
-END OF yallist NOTICES AND INFORMATION
+END OF semver NOTICES AND INFORMATION

package/dist/src/extension.cjs

@@ -19440,7 +19440,7 @@ let SemVer$2 = class SemVer {
     do {
       const a = this.build[i];
       const b = other.build[i];
-      debug('prerelease compare', i, a, b);
+      debug('build compare', i, a, b);
       if (a === undefined && b === undefined) {
         return 0
       } else if (b === undefined) {
@@ -19600,780 +19600,46 @@ const parse = (version, options, throwErrors = false) => {
 
 var parse_1 = parse;
 
-var iterator;
-var hasRequiredIterator;
-
-function requireIterator () {
-	if (hasRequiredIterator) return iterator;
-	hasRequiredIterator = 1;
-	iterator = function (Yallist) {
-	  Yallist.prototype[Symbol.iterator] = function* () {
-	    for (let walker = this.head; walker; walker = walker.next) {
-	      yield walker.value;
-	    }
-	  };
-	};
-	return iterator;
-}
-
-var yallist = Yallist$1;
-
-Yallist$1.Node = Node;
-Yallist$1.create = Yallist$1;
-
-function Yallist$1 (list) {
-  var self = this;
-  if (!(self instanceof Yallist$1)) {
-    self = new Yallist$1();
-  }
-
-  self.tail = null;
-  self.head = null;
-  self.length = 0;
-
-  if (list && typeof list.forEach === 'function') {
-    list.forEach(function (item) {
-      self.push(item);
-    });
-  } else if (arguments.length > 0) {
-    for (var i = 0, l = arguments.length; i < l; i++) {
-      self.push(arguments[i]);
-    }
-  }
-
-  return self
-}
-
-Yallist$1.prototype.removeNode = function (node) {
-  if (node.list !== this) {
-    throw new Error('removing node which does not belong to this list')
-  }
-
-  var next = node.next;
-  var prev = node.prev;
-
-  if (next) {
-    next.prev = prev;
-  }
-
-  if (prev) {
-    prev.next = next;
-  }
-
-  if (node === this.head) {
-    this.head = next;
-  }
-  if (node === this.tail) {
-    this.tail = prev;
-  }
-
-  node.list.length--;
-  node.next = null;
-  node.prev = null;
-  node.list = null;
-
-  return next
-};
-
-Yallist$1.prototype.unshiftNode = function (node) {
-  if (node === this.head) {
-    return
-  }
-
-  if (node.list) {
-    node.list.removeNode(node);
-  }
-
-  var head = this.head;
-  node.list = this;
-  node.next = head;
-  if (head) {
-    head.prev = node;
-  }
-
-  this.head = node;
-  if (!this.tail) {
-    this.tail = node;
-  }
-  this.length++;
-};
-
-Yallist$1.prototype.pushNode = function (node) {
-  if (node === this.tail) {
-    return
-  }
-
-  if (node.list) {
-    node.list.removeNode(node);
-  }
-
-  var tail = this.tail;
-  node.list = this;
-  node.prev = tail;
-  if (tail) {
-    tail.next = node;
-  }
-
-  this.tail = node;
-  if (!this.head) {
-    this.head = node;
-  }
-  this.length++;
-};
-
-Yallist$1.prototype.push = function () {
-  for (var i = 0, l = arguments.length; i < l; i++) {
-    push(this, arguments[i]);
-  }
-  return this.length
-};
-
-Yallist$1.prototype.unshift = function () {
-  for (var i = 0, l = arguments.length; i < l; i++) {
-    unshift(this, arguments[i]);
-  }
-  return this.length
-};
-
-Yallist$1.prototype.pop = function () {
-  if (!this.tail) {
-    return undefined
-  }
-
-  var res = this.tail.value;
-  this.tail = this.tail.prev;
-  if (this.tail) {
-    this.tail.next = null;
-  } else {
-    this.head = null;
-  }
-  this.length--;
-  return res
-};
-
-Yallist$1.prototype.shift = function () {
-  if (!this.head) {
-    return undefined
-  }
-
-  var res = this.head.value;
-  this.head = this.head.next;
-  if (this.head) {
-    this.head.prev = null;
-  } else {
-    this.tail = null;
-  }
-  this.length--;
-  return res
-};
-
-Yallist$1.prototype.forEach = function (fn, thisp) {
-  thisp = thisp || this;
-  for (var walker = this.head, i = 0; walker !== null; i++) {
-    fn.call(thisp, walker.value, i, this);
-    walker = walker.next;
-  }
-};
-
-Yallist$1.prototype.forEachReverse = function (fn, thisp) {
-  thisp = thisp || this;
-  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {
-    fn.call(thisp, walker.value, i, this);
-    walker = walker.prev;
-  }
-};
-
-Yallist$1.prototype.get = function (n) {
-  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
-    // abort out of the list early if we hit a cycle
-    walker = walker.next;
-  }
-  if (i === n && walker !== null) {
-    return walker.value
-  }
-};
-
-Yallist$1.prototype.getReverse = function (n) {
-  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
-    // abort out of the list early if we hit a cycle
-    walker = walker.prev;
-  }
-  if (i === n && walker !== null) {
-    return walker.value
-  }
-};
-
-Yallist$1.prototype.map = function (fn, thisp) {
-  thisp = thisp || this;
-  var res = new Yallist$1();
-  for (var walker = this.head; walker !== null;) {
-    res.push(fn.call(thisp, walker.value, this));
-    walker = walker.next;
-  }
-  return res
-};
-
-Yallist$1.prototype.mapReverse = function (fn, thisp) {
-  thisp = thisp || this;
-  var res = new Yallist$1();
-  for (var walker = this.tail; walker !== null;) {
-    res.push(fn.call(thisp, walker.value, this));
-    walker = walker.prev;
-  }
-  return res
-};
-
-Yallist$1.prototype.reduce = function (fn, initial) {
-  var acc;
-  var walker = this.head;
-  if (arguments.length > 1) {
-    acc = initial;
-  } else if (this.head) {
-    walker = this.head.next;
-    acc = this.head.value;
-  } else {
-    throw new TypeError('Reduce of empty list with no initial value')
-  }
-
-  for (var i = 0; walker !== null; i++) {
-    acc = fn(acc, walker.value, i);
-    walker = walker.next;
-  }
-
-  return acc
-};
-
-Yallist$1.prototype.reduceReverse = function (fn, initial) {
-  var acc;
-  var walker = this.tail;
-  if (arguments.length > 1) {
-    acc = initial;
-  } else if (this.tail) {
-    walker = this.tail.prev;
-    acc = this.tail.value;
-  } else {
-    throw new TypeError('Reduce of empty list with no initial value')
-  }
-
-  for (var i = this.length - 1; walker !== null; i--) {
-    acc = fn(acc, walker.value, i);
-    walker = walker.prev;
-  }
-
-  return acc
-};
-
-Yallist$1.prototype.toArray = function () {
-  var arr = new Array(this.length);
-  for (var i = 0, walker = this.head; walker !== null; i++) {
-    arr[i] = walker.value;
-    walker = walker.next;
-  }
-  return arr
-};
-
-Yallist$1.prototype.toArrayReverse = function () {
-  var arr = new Array(this.length);
-  for (var i = 0, walker = this.tail; walker !== null; i++) {
-    arr[i] = walker.value;
-    walker = walker.prev;
-  }
-  return arr
-};
-
-Yallist$1.prototype.slice = function (from, to) {
-  to = to || this.length;
-  if (to < 0) {
-    to += this.length;
-  }
-  from = from || 0;
-  if (from < 0) {
-    from += this.length;
-  }
-  var ret = new Yallist$1();
-  if (to < from || to < 0) {
-    return ret
-  }
-  if (from < 0) {
-    from = 0;
-  }
-  if (to > this.length) {
-    to = this.length;
-  }
-  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
-    walker = walker.next;
-  }
-  for (; walker !== null && i < to; i++, walker = walker.next) {
-    ret.push(walker.value);
-  }
-  return ret
-};
-
-Yallist$1.prototype.sliceReverse = function (from, to) {
-  to = to || this.length;
-  if (to < 0) {
-    to += this.length;
-  }
-  from = from || 0;
-  if (from < 0) {
-    from += this.length;
-  }
-  var ret = new Yallist$1();
-  if (to < from || to < 0) {
-    return ret
-  }
-  if (from < 0) {
-    from = 0;
-  }
-  if (to > this.length) {
-    to = this.length;
-  }
-  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {
-    walker = walker.prev;
-  }
-  for (; walker !== null && i > from; i--, walker = walker.prev) {
-    ret.push(walker.value);
-  }
-  return ret
-};
-
-Yallist$1.prototype.splice = function (start, deleteCount, ...nodes) {
-  if (start > this.length) {
-    start = this.length - 1;
-  }
-  if (start < 0) {
-    start = this.length + start;
-  }
-
-  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
-    walker = walker.next;
-  }
-
-  var ret = [];
-  for (var i = 0; walker && i < deleteCount; i++) {
-    ret.push(walker.value);
-    walker = this.removeNode(walker);
-  }
-  if (walker === null) {
-    walker = this.tail;
-  }
-
-  if (walker !== this.head && walker !== this.tail) {
-    walker = walker.prev;
-  }
-
-  for (var i = 0; i < nodes.length; i++) {
-    walker = insert(this, walker, nodes[i]);
-  }
-  return ret;
-};
-
-Yallist$1.prototype.reverse = function () {
-  var head = this.head;
-  var tail = this.tail;
-  for (var walker = head; walker !== null; walker = walker.prev) {
-    var p = walker.prev;
-    walker.prev = walker.next;
-    walker.next = p;
-  }
-  this.head = tail;
-  this.tail = head;
-  return this
-};
-
-function insert (self, node, value) {
-  var inserted = node === self.head ?
-    new Node(value, null, node, self) :
-    new Node(value, node, node.next, self);
-
-  if (inserted.next === null) {
-    self.tail = inserted;
-  }
-  if (inserted.prev === null) {
-    self.head = inserted;
-  }
-
-  self.length++;
-
-  return inserted
-}
-
-function push (self, item) {
-  self.tail = new Node(item, self.tail, null, self);
-  if (!self.head) {
-    self.head = self.tail;
-  }
-  self.length++;
-}
-
-function unshift (self, item) {
-  self.head = new Node(item, null, self.head, self);
-  if (!self.tail) {
-    self.tail = self.head;
-  }
-  self.length++;
-}
-
-function Node (value, prev, next, list) {
-  if (!(this instanceof Node)) {
-    return new Node(value, prev, next, list)
-  }
-
-  this.list = list;
-  this.value = value;
-
-  if (prev) {
-    prev.next = this;
-    this.prev = prev;
-  } else {
-    this.prev = null;
-  }
-
-  if (next) {
-    next.prev = this;
-    this.next = next;
-  } else {
-    this.next = null;
-  }
-}
-
-try {
-  // add if support for Symbol.iterator is present
-  requireIterator()(Yallist$1);
-} catch (er) {}
-
-// A linked list to keep track of recently-used-ness
-const Yallist = yallist;
-
-const MAX = Symbol('max');
-const LENGTH = Symbol('length');
-const LENGTH_CALCULATOR = Symbol('lengthCalculator');
-const ALLOW_STALE = Symbol('allowStale');
-const MAX_AGE = Symbol('maxAge');
-const DISPOSE = Symbol('dispose');
-const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
-const LRU_LIST = Symbol('lruList');
-const CACHE = Symbol('cache');
-const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
-
-const naiveLength = () => 1;
-
-// lruList is a yallist where the head is the youngest
-// item, and the tail is the oldest.  the list contains the Hit
-// objects as the entries.
-// Each Hit object has a reference to its Yallist.Node.  This
-// never changes.
-//
-// cache is a Map (or PseudoMap) that matches the keys to
-// the Yallist.Node object.
 class LRUCache {
-  constructor (options) {
-    if (typeof options === 'number')
-      options = { max: options };
-
-    if (!options)
-      options = {};
-
-    if (options.max && (typeof options.max !== 'number' || options.max < 0))
-      throw new TypeError('max must be a non-negative number')
-    // Kind of weird to have a default max of Infinity, but oh well.
-    this[MAX] = options.max || Infinity;
-
-    const lc = options.length || naiveLength;
-    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc;
-    this[ALLOW_STALE] = options.stale || false;
-    if (options.maxAge && typeof options.maxAge !== 'number')
-      throw new TypeError('maxAge must be a number')
-    this[MAX_AGE] = options.maxAge || 0;
-    this[DISPOSE] = options.dispose;
-    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
-    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
-    this.reset();
-  }
-
-  // resize the cache when the max changes.
-  set max (mL) {
-    if (typeof mL !== 'number' || mL < 0)
-      throw new TypeError('max must be a non-negative number')
-
-    this[MAX] = mL || Infinity;
-    trim(this);
-  }
-  get max () {
-    return this[MAX]
-  }
-
-  set allowStale (allowStale) {
-    this[ALLOW_STALE] = !!allowStale;
-  }
-  get allowStale () {
-    return this[ALLOW_STALE]
-  }
-
-  set maxAge (mA) {
-    if (typeof mA !== 'number')
-      throw new TypeError('maxAge must be a non-negative number')
-
-    this[MAX_AGE] = mA;
-    trim(this);
-  }
-  get maxAge () {
-    return this[MAX_AGE]
-  }
-
-  // resize the cache when the lengthCalculator changes.
-  set lengthCalculator (lC) {
-    if (typeof lC !== 'function')
-      lC = naiveLength;
-
-    if (lC !== this[LENGTH_CALCULATOR]) {
-      this[LENGTH_CALCULATOR] = lC;
-      this[LENGTH] = 0;
-      this[LRU_LIST].forEach(hit => {
-        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
-        this[LENGTH] += hit.length;
-      });
-    }
-    trim(this);
-  }
-  get lengthCalculator () { return this[LENGTH_CALCULATOR] }
-
-  get length () { return this[LENGTH] }
-  get itemCount () { return this[LRU_LIST].length }
-
-  rforEach (fn, thisp) {
-    thisp = thisp || this;
-    for (let walker = this[LRU_LIST].tail; walker !== null;) {
-      const prev = walker.prev;
-      forEachStep(this, fn, walker, thisp);
-      walker = prev;
-    }
-  }
-
-  forEach (fn, thisp) {
-    thisp = thisp || this;
-    for (let walker = this[LRU_LIST].head; walker !== null;) {
-      const next = walker.next;
-      forEachStep(this, fn, walker, thisp);
-      walker = next;
-    }
-  }
-
-  keys () {
-    return this[LRU_LIST].toArray().map(k => k.key)
-  }
-
-  values () {
-    return this[LRU_LIST].toArray().map(k => k.value)
-  }
-
-  reset () {
-    if (this[DISPOSE] &&
-        this[LRU_LIST] &&
-        this[LRU_LIST].length) {
-      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value));
-    }
-
-    this[CACHE] = new Map(); // hash of items by key
-    this[LRU_LIST] = new Yallist(); // list of items in order of use recency
-    this[LENGTH] = 0; // length of items in the list
-  }
-
-  dump () {
-    return this[LRU_LIST].map(hit =>
-      isStale(this, hit) ? false : {
-        k: hit.key,
-        v: hit.value,
-        e: hit.now + (hit.maxAge || 0)
-      }).toArray().filter(h => h)
-  }
-
-  dumpLru () {
-    return this[LRU_LIST]
-  }
-
-  set (key, value, maxAge) {
-    maxAge = maxAge || this[MAX_AGE];
-
-    if (maxAge && typeof maxAge !== 'number')
-      throw new TypeError('maxAge must be a number')
-
-    const now = maxAge ? Date.now() : 0;
-    const len = this[LENGTH_CALCULATOR](value, key);
-
-    if (this[CACHE].has(key)) {
-      if (len > this[MAX]) {
-        del(this, this[CACHE].get(key));
-        return false
-      }
-
-      const node = this[CACHE].get(key);
-      const item = node.value;
-
-      // dispose of the old one before overwriting
-      // split out into 2 ifs for better coverage tracking
-      if (this[DISPOSE]) {
-        if (!this[NO_DISPOSE_ON_SET])
-          this[DISPOSE](key, item.value);
-      }
-
-      item.now = now;
-      item.maxAge = maxAge;
-      item.value = value;
-      this[LENGTH] += len - item.length;
-      item.length = len;
-      this.get(key);
-      trim(this);
-      return true
-    }
-
-    const hit = new Entry(key, value, len, now, maxAge);
-
-    // oversized objects fall out of cache automatically.
-    if (hit.length > this[MAX]) {
-      if (this[DISPOSE])
-        this[DISPOSE](key, value);
-
-      return false
-    }
-
-    this[LENGTH] += hit.length;
-    this[LRU_LIST].unshift(hit);
-    this[CACHE].set(key, this[LRU_LIST].head);
-    trim(this);
-    return true
-  }
-
-  has (key) {
-    if (!this[CACHE].has(key)) return false
-    const hit = this[CACHE].get(key).value;
-    return !isStale(this, hit)
+  constructor () {
+    this.max = 1000;
+    this.map = new Map();
   }
 
   get (key) {
-    return get(this, key, true)
-  }
-
-  peek (key) {
-    return get(this, key, false)
-  }
-
-  pop () {
-    const node = this[LRU_LIST].tail;
-    if (!node)
-      return null
-
-    del(this, node);
-    return node.value
-  }
-
-  del (key) {
-    del(this, this[CACHE].get(key));
-  }
-
-  load (arr) {
-    // reset the cache
-    this.reset();
-
-    const now = Date.now();
-    // A previous serialized cache has the most recent items first
-    for (let l = arr.length - 1; l >= 0; l--) {
-      const hit = arr[l];
-      const expiresAt = hit.e || 0;
-      if (expiresAt === 0)
-        // the item was created without expiration in a non aged cache
-        this.set(hit.k, hit.v);
-      else {
-        const maxAge = expiresAt - now;
-        // dont add already expired items
-        if (maxAge > 0) {
-          this.set(hit.k, hit.v, maxAge);
-        }
-      }
+    const value = this.map.get(key);
+    if (value === undefined) {
+      return undefined
+    } else {
+      // Remove the key from the map and add it to the end
+      this.map.delete(key);
+      this.map.set(key, value);
+      return value
     }
   }
 
-  prune () {
-    this[CACHE].forEach((value, key) => get(this, key, false));
+  delete (key) {
+    return this.map.delete(key)
   }
-}
 
-const get = (self, key, doUse) => {
-  const node = self[CACHE].get(key);
-  if (node) {
-    const hit = node.value;
-    if (isStale(self, hit)) {
-      del(self, node);
-      if (!self[ALLOW_STALE])
-        return undefined
-    } else {
-      if (doUse) {
-        if (self[UPDATE_AGE_ON_GET])
-          node.value.now = Date.now();
-        self[LRU_LIST].unshiftNode(node);
-      }
-    }
-    return hit.value
-  }
-};
+  set (key, value) {
+    const deleted = this.delete(key);
 
-const isStale = (self, hit) => {
-  if (!hit || (!hit.maxAge && !self[MAX_AGE]))
-    return false
-
-  const diff = Date.now() - hit.now;
-  return hit.maxAge ? diff > hit.maxAge
-    : self[MAX_AGE] && (diff > self[MAX_AGE])
-};
+    if (!deleted && value !== undefined) {
+      // If cache is full, delete the least recently used item
+      if (this.map.size >= this.max) {
+        const firstKey = this.map.keys().next().value;
+        this.delete(firstKey);
+      }
 
-const trim = self => {
-  if (self[LENGTH] > self[MAX]) {
-    for (let walker = self[LRU_LIST].tail;
-      self[LENGTH] > self[MAX] && walker !== null;) {
-      // We know that we're about to delete this one, and also
-      // what the next least recently used key will be, so just
-      // go ahead and set it now.
-      const prev = walker.prev;
-      del(self, walker);
-      walker = prev;
+      this.map.set(key, value);
     }
-  }
-};
-
-const del = (self, node) => {
-  if (node) {
-    const hit = node.value;
-    if (self[DISPOSE])
-      self[DISPOSE](hit.key, hit.value);
 
-    self[LENGTH] -= hit.length;
-    self[CACHE].delete(hit.key);
-    self[LRU_LIST].removeNode(node);
-  }
-};
-
-class Entry {
-  constructor (key, value, length, now, maxAge) {
-    this.key = key;
-    this.value = value;
-    this.length = length;
-    this.now = now;
-    this.maxAge = maxAge || 0;
+    return this
   }
 }
 
-const forEachStep = (self, fn, node, thisp) => {
-  let hit = node.value;
-  if (isStale(self, hit)) {
-    del(self, node);
-    if (!self[ALLOW_STALE])
-      hit = undefined;
-  }
-  if (hit)
-    fn.call(thisp, hit.value, hit.key, self);
-};
-
-var lruCache = LRUCache;
+var lrucache = LRUCache;
 
 const SemVer = semver;
 const compare$6 = (a, b, loose) =>
@@ -20814,8 +20080,8 @@ function requireRange () {
 
 	range = Range;
 
-	const LRU = lruCache;
-	const cache = new LRU({ max: 1000 });
+	const LRU = lrucache;
+	const cache = new LRU();
 
 	const parseOptions = parseOptions_1;
 	const Comparator = requireComparator();
@@ -21086,9 +20352,10 @@ function requireRange () {
 	// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5
 	// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do
 	// 1.2 - 3.4 => >=1.2.0 <3.5.0-0
+	// TODO build?
 	const hyphenReplace = incPr => ($0,
 	  from, fM, fm, fp, fpr, fb,
-	  to, tM, tm, tp, tpr, tb) => {
+	  to, tM, tm, tp, tpr) => {
 	  if (isX(fM)) {
 	    from = '';
 	  } else if (isX(fm)) {
@@ -21777,8 +21044,116 @@ var api = {};
 
 var node = main$3;
 
+const TRACE_PREFIX = /^\[Trace.*?\] /iu;
+const DEBUG_PREFIX = /^\[Debug.*?\] /iu;
+const INFO_PREFIX = /^\[Info.*?\] /iu;
+const WARN_PREFIX = /^\[Warn.*?\] /iu;
+const ERROR_PREFIX = /^\[Error.*?\] /iu;
+class TypeSpecLogOutputChannel {
+    delegate;
+    constructor(name) {
+        this.delegate = require$$0$1.window.createOutputChannel(name, { log: true });
+    }
+    get logLevel() {
+        return this.delegate.logLevel;
+    }
+    get onDidChangeLogLevel() {
+        return this.delegate.onDidChangeLogLevel;
+    }
+    trace(message, ...args) {
+        this.delegate.trace(message, ...args);
+    }
+    debug(message, ...args) {
+        this.delegate.debug(message, ...args);
+    }
+    info(message, ...args) {
+        this.delegate.info(message, ...args);
+    }
+    warn(message, ...args) {
+        this.delegate.warn(message, ...args);
+    }
+    error(error, ...args) {
+        this.delegate.error(error, ...args);
+    }
+    get name() {
+        return this.delegate.name;
+    }
+    replace(value) {
+        this.delegate.replace(value);
+    }
+    clear() {
+        this.delegate.clear();
+    }
+    show(column, preserveFocus) {
+        // eslint-disable-next-line deprecation/deprecation
+        this.delegate.show(column, preserveFocus);
+    }
+    hide() {
+        this.delegate.hide();
+    }
+    dispose() {
+        this.delegate.dispose();
+    }
+    append(value) {
+        this.logToDelegate(value);
+    }
+    appendLine(value) {
+        this.logToDelegate(value);
+    }
+    preLevel = "";
+    logToDelegate(value) {
+        if (TRACE_PREFIX.test(value)) {
+            this.preLevel = "trace";
+            this.delegate.trace(value.replace(TRACE_PREFIX, ""));
+        }
+        else if (DEBUG_PREFIX.test(value)) {
+            this.preLevel = "debug";
+            this.delegate.debug(value.replace(DEBUG_PREFIX, ""));
+        }
+        else if (INFO_PREFIX.test(value)) {
+            this.preLevel = "info";
+            this.delegate.info(value.replace(INFO_PREFIX, ""));
+        }
+        else if (WARN_PREFIX.test(value)) {
+            this.preLevel = "warning";
+            this.delegate.warn(value.replace(WARN_PREFIX, ""));
+        }
+        else if (ERROR_PREFIX.test(value)) {
+            this.preLevel = "error";
+            this.delegate.error(value.replace(ERROR_PREFIX, ""));
+        }
+        else {
+            // a msg sent without a level prefix should be because a message is sent by calling multiple appendLine()
+            // so just log it with the previous level
+            switch (this.preLevel) {
+                case "trace":
+                    this.delegate.trace(value);
+                    break;
+                case "debug":
+                    this.delegate.debug(value);
+                    break;
+                case "info":
+                    this.delegate.info(value);
+                    break;
+                case "warning":
+                    this.delegate.warn(value);
+                    break;
+                case "error":
+                    this.delegate.error(value);
+                    break;
+                default:
+                    this.delegate.debug(`Log Message with invalid log level (${this.preLevel}). Raw message: ${value}`);
+            }
+        }
+    }
+}
+
 let client;
-const outputChannel = require$$0$1.window.createOutputChannel("TypeSpec");
+/**
+ * Workaround: LogOutputChannel doesn't work well with LSP RemoteConsole, so having a customized LogOutputChannel to make them work together properly
+ * More detail can be found at https://github.com/microsoft/vscode-discussions/discussions/1149
+ */
+const outputChannel = new TypeSpecLogOutputChannel("TypeSpec");
 async function activate(context) {
     context.subscriptions.push(require$$0$1.commands.registerCommand("typespec.showOutputChannel", () => {
         outputChannel.show(true /*preserveFocus*/);
@@ -21793,10 +21168,12 @@ async function restartTypeSpecServer() {
     if (client) {
         await client.stop();
         await client.start();
+        outputChannel.debug("TypeSpec server restarted");
     }
 }
 async function launchLanguageClient(context) {
     const exe = await resolveTypeSpecServer(context);
+    outputChannel.debug("TypeSpec server resolved as ", exe);
     const options = {
         synchronize: {
             // Synchronize the setting section 'typespec' to the server
@@ -21816,20 +21193,22 @@ async function launchLanguageClient(context) {
         outputChannel,
     };
     const name = "TypeSpec";
-    const id = "typespecLanguageServer";
+    const id = "typespec";
     try {
         client = new node.LanguageClient(id, name, { run: exe, debug: exe }, options);
         await client.start();
+        outputChannel.debug("TypeSpec server started");
     }
     catch (e) {
         if (typeof e === "string" && e.startsWith("Launching server using command")) {
             const workspaceFolder = require$$0$1.workspace.workspaceFolders?.[0]?.uri?.fsPath ?? "";
-            client?.error([
+            outputChannel.error([
                 `TypeSpec server executable was not found: '${exe.command}' is not found. Make sure either:`,
                 ` - TypeSpec is installed locally at the root of this workspace ("${workspaceFolder}") or in a parent directory.`,
                 " - TypeSpec is installed globally with `npm install -g @typespec/compiler'.",
                 " - TypeSpec server path is configured with https://github.com/microsoft/typespec#installing-vs-code-extension.",
-            ].join("\n"), undefined, false);
+            ].join("\n"));
+            outputChannel.error("Error detail", e);
             throw `TypeSpec server executable was not found: '${exe.command}' is not found.`;
         }
         else {
@@ -21846,6 +21225,7 @@ async function resolveTypeSpecServer(context) {
         // we use CLI instead of NODE_OPTIONS environment variable in this case
         // because --nolazy is not supported by NODE_OPTIONS.
         const options = nodeOptions?.split(" ").filter((o) => o) ?? [];
+        outputChannel.debug("TypeSpec server resolved in development mode");
         return { command: "node", args: [...options, script, ...args] };
     }
     const options = {
@@ -21863,11 +21243,15 @@ async function resolveTypeSpecServer(context) {
     const workspaceFolder = require$$0$1.workspace.workspaceFolders?.[0]?.uri?.fsPath ?? "";
     // Default to tsp-server on PATH, which would come from `npm install -g
     // @typespec/compiler` in a vanilla setup.
-    if (!serverPath) {
+    if (serverPath) {
+        outputChannel.debug(`Server path loaded from VS Code configuration: ${serverPath}`);
+    }
+    else {
         serverPath = await resolveLocalCompiler(workspaceFolder);
     }
     if (!serverPath) {
         const executable = process.platform === "win32" ? "tsp-server.cmd" : "tsp-server";
+        outputChannel.debug(`Can't resolve server path, try to use default value ${executable}.`);
         return { command: executable, args, options };
     }
     const variableResolver = new VSCodeVariableResolver({
@@ -21875,6 +21259,7 @@ async function resolveTypeSpecServer(context) {
         workspaceRoot: workspaceFolder, // workspaceRoot is deprecated but we still support it for backwards compatibility.
     });
     serverPath = variableResolver.resolve(serverPath);
+    outputChannel.debug(`Server path expanded to: ${serverPath}`);
     if (!serverPath.endsWith(".js")) {
         // Allow path to tsp-server.cmd to be passed.
         if (await isFile$1(serverPath)) {
@@ -21900,15 +21285,22 @@ async function resolveLocalCompiler(baseDir) {
         stat: promises.stat,
     };
     try {
+        outputChannel.debug(`Try to resolve compiler from local, baseDir: ${baseDir}`);
         const executable = await resolveModule(host, "@typespec/compiler", {
             baseDir,
         });
         if (executable.type === "module") {
+            outputChannel.debug(`Resolved compiler from local: ${executable.path}`);
             return executable.path;
         }
+        else {
+            outputChannel.debug(`Failed to resolve compiler from local. Unexpected executable type: ${executable.type}`);
+        }
     }
     catch (e) {
         // Couldn't find the module
+        outputChannel.debug("Exception when resolving compiler from local", e);
+        return undefined;
     }
     return undefined;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "typespec-vscode",
-  "version": "0.57.0-dev.1",
+  "version": "0.57.0-dev.3",
   "author": "Microsoft Corporation",
   "description": "TypeSpec language support for VS Code",
   "homepage": "https://typespec.io",
@@ -25,7 +25,7 @@
   "type": "module",
   "main": "./dist/src/extension.cjs",
   "engines": {
-    "vscode": "^1.88.0"
+    "vscode": "^1.89.0"
   },
   "activationEvents": [
     "onLanguage:typespec",
@@ -59,13 +59,24 @@
     ],
     "configuration": [
       {
-        "title": "TypeSpec Language Server Path",
+        "title": "TypeSpec",
         "properties": {
           "typespec.tsp-server.path": {
             "type": "string",
             "default": "",
             "description": "Path to `tsp-server` command that runs the TypeSpec language server.\n\nIf not specified, then `tsp-server` found on PATH is used.\n\nExample (User): /usr/local/bin/tsp-server\nExample (Workspace): ${workspaceFolder}/node_modules/@typespec/compiler",
             "scope": "machine-overridable"
+          },
+          "typespec.trace.server": {
+            "scope": "window",
+            "type": "string",
+            "enum": [
+              "off",
+              "messages",
+              "verbose"
+            ],
+            "default": "off",
+            "description": "Define whether/how the TypeSpec language server should send traces to client. For the traces to show properly in vscode Output, make sure 'Log Level' is also set to 'Trace' so that they won't be filtered at client side, which can be set through 'Developer: Set Log Level...' command."
           }
         }
       }
@@ -121,17 +132,17 @@
     "@rollup/plugin-node-resolve": "~15.2.3",
     "@rollup/plugin-typescript": "~11.1.6",
     "@types/node": "~18.11.19",
-    "@types/vscode": "~1.88.0",
+    "@types/vscode": "~1.89.0",
     "@typespec/compiler": "~0.56.0 || >=0.57.0-dev <0.57.0",
     "@typespec/internal-build-utils": "~0.56.0 || >=0.57.0-dev <0.57.0",
-    "@vitest/coverage-v8": "^1.5.0",
-    "@vitest/ui": "^1.5.0",
-    "@vscode/vsce": "~2.25.0",
+    "@vitest/coverage-v8": "^1.6.0",
+    "@vitest/ui": "^1.6.0",
+    "@vscode/vsce": "~2.26.1",
     "c8": "^9.1.0",
-    "rimraf": "~5.0.5",
-    "rollup": "~4.14.3",
+    "rimraf": "~5.0.7",
+    "rollup": "~4.17.2",
     "typescript": "~5.4.5",
-    "vitest": "^1.5.0",
+    "vitest": "^1.6.0",
     "vscode-languageclient": "~9.0.1"
   },
   "dependencies": {},