@discordeno/utils 19.0.0-next.99fbe1e → 19.0.0-next.9aaba00
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/Collection.js +113 -2
- package/dist/Collection.js.map +1 -0
- package/dist/base64.js +262 -2
- package/dist/base64.js.map +1 -0
- package/dist/bucket.js +80 -2
- package/dist/bucket.js.map +1 -0
- package/dist/casing.d.ts +2 -2
- package/dist/casing.d.ts.map +1 -1
- package/dist/casing.js +51 -2
- package/dist/casing.js.map +1 -0
- package/dist/colors.js +471 -2
- package/dist/colors.js.map +1 -0
- package/dist/files.js +41 -2
- package/dist/files.js.map +1 -0
- package/dist/hash.js +19 -2
- package/dist/hash.js.map +1 -0
- package/dist/images.js +66 -2
- package/dist/images.js.map +1 -0
- package/dist/index.js +17 -2
- package/dist/index.js.map +1 -0
- package/dist/logger.js +130 -2
- package/dist/logger.js.map +1 -0
- package/dist/permissions.js +17 -2
- package/dist/permissions.js.map +1 -0
- package/dist/reactions.js +11 -2
- package/dist/reactions.js.map +1 -0
- package/dist/token.js +16 -2
- package/dist/token.js.map +1 -0
- package/dist/typeguards.js +15 -2
- package/dist/typeguards.js.map +1 -0
- package/dist/urlToBase64.js +9 -2
- package/dist/urlToBase64.js.map +1 -0
- package/dist/utils.js +14 -2
- package/dist/utils.js.map +1 -0
- package/package.json +2 -2
package/dist/Collection.js
CHANGED
|
@@ -1,2 +1,113 @@
|
|
|
1
|
-
|
|
2
|
-
//# sourceMappingURL=data:application/json;base64,{"version":3,"sources":["../src/Collection.ts"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/no-empty-interface\nexport interface PlaceHolderBot {}\n\nexport class Collection<K, V> extends Map<K, V> {\n  /**\n   * The maximum amount of items allowed in this collection. To disable cache, set it 0, set to undefined to make it infinite.\n   * @default undefined\n   */\n  maxSize: number | undefined\n  /** Handler to remove items from the collection every so often. */\n  sweeper: (CollectionSweeper<K, V> & { intervalId?: NodeJS.Timer }) | undefined\n\n  constructor(entries?: (ReadonlyArray<readonly [K, V]> | null) | Map<K, V>, options?: CollectionOptions<K, V>) {\n    super(entries ?? [])\n\n    this.maxSize = options?.maxSize\n\n    if (!options?.sweeper) return\n\n    this.startSweeper(options.sweeper)\n  }\n\n  startSweeper(options: CollectionSweeper<K, V>): NodeJS.Timer {\n    if (this.sweeper?.intervalId) clearInterval(this.sweeper.intervalId)\n\n    this.sweeper = options\n    this.sweeper.intervalId = setInterval(() => {\n      this.forEach((value, key) => {\n        if (!this.sweeper?.filter(value, key, options.bot)) return\n\n        this.delete(key)\n        return key\n      })\n    }, options.interval)\n\n    return this.sweeper.intervalId\n  }\n\n  stopSweeper(): void {\n    return clearInterval(this.sweeper?.intervalId)\n  }\n\n  changeSweeperInterval(newInterval: number): void {\n    if (this.sweeper == null) return\n\n    this.startSweeper({ filter: this.sweeper.filter, interval: newInterval })\n  }\n\n  changeSweeperFilter(newFilter: (value: V, key: K, bot: PlaceHolderBot) => boolean): void {\n    if (this.sweeper == null) return\n\n    this.startSweeper({ filter: newFilter, interval: this.sweeper.interval })\n  }\n\n  /** Add an item to the collection. Makes sure not to go above the maxSize. */\n  set(key: K, value: V): this {\n    // When this collection is maxSized make sure we can add first\n    if ((this.maxSize !== undefined || this.maxSize === 0) && this.size >= this.maxSize) {\n      return this\n    }\n\n    return super.set(key, value)\n  }\n\n  /** Add an item to the collection, no matter what the maxSize is. */\n  forceSet(key: K, value: V): this {\n    return super.set(key, value)\n  }\n\n  /** Convert the collection to an array. */\n  array(): V[] {\n    return [...this.values()]\n  }\n\n  /** Retrieve the value of the first element in this collection. */\n  first(): V | undefined {\n    return this.values().next().value\n  }\n\n  /** Retrieve the value of the last element in this collection. */\n  last(): V | undefined {\n    return [...this.values()][this.size - 1]\n  }\n\n  /** Retrieve the value of a random element in this collection. */\n  random(): V | undefined {\n    const array = [...this.values()]\n    return array[Math.floor(Math.random() * array.length)]\n  }\n\n  /** Find a specific element in this collection. */\n  find(callback: (value: V, key: K) => boolean): NonNullable<V> | undefined {\n    for (const key of this.keys()) {\n      const value = this.get(key)!\n      if (callback(value, key)) return value\n    }\n    // If nothing matched\n  }\n\n  /** Find all elements in this collection that match the given pattern. */\n  filter(callback: (value: V, key: K) => boolean): Collection<K, V> {\n    const relevant = new Collection<K, V>()\n    this.forEach((value, key) => {\n      if (callback(value, key)) relevant.set(key, value)\n    })\n\n    return relevant\n  }\n\n  /** Converts the collection into an array by running a callback on all items in the collection. */\n  map<T>(callback: (value: V, key: K) => T): T[] {\n    const results = []\n    for (const key of this.keys()) {\n      const value = this.get(key)!\n      results.push(callback(value, key))\n    }\n    return results\n  }\n\n  /** Check if one of the items in the collection matches the pattern. */\n  some(callback: (value: V, key: K) => boolean): boolean {\n    for (const key of this.keys()) {\n      const value = this.get(key)!\n      if (callback(value, key)) return true\n    }\n\n    return false\n  }\n\n  /** Check if all of the items in the collection matches the pattern. */\n  every(callback: (value: V, key: K) => boolean): boolean {\n    for (const key of this.keys()) {\n      const value = this.get(key)!\n      if (!callback(value, key)) return false\n    }\n\n    return true\n  }\n\n  /** Runs a callback on all items in the collection, merging them into a single value. */\n  reduce<T>(callback: (accumulator: T, value: V, key: K) => T, initialValue?: T): T {\n    let accumulator: T = initialValue!\n\n    for (const key of this.keys()) {\n      const value = this.get(key)!\n      accumulator = callback(accumulator, value, key)\n    }\n\n    return accumulator\n  }\n}\n\nexport interface CollectionOptions<K, V> {\n  /** Handler to clean out the items in the collection every so often. */\n  sweeper?: CollectionSweeper<K, V>\n  /** The maximum number of items allowed in the collection. */\n  maxSize?: number\n}\n\nexport interface CollectionSweeper<K, V> {\n  /** The filter to determine whether an element should be deleted or not */\n  filter: (value: V, key: K, ...args: any[]) => boolean\n  /** The interval in which the sweeper should run */\n  interval: number\n  /** The bot object itself */\n  bot?: PlaceHolderBot\n}\n"],"names":["Collection","Map","constructor","entries","options","maxSize","sweeper","startSweeper","intervalId","clearInterval","setInterval","forEach","value","key","filter","bot","delete","interval","stopSweeper","changeSweeperInterval","newInterval","changeSweeperFilter","newFilter","set","undefined","size","forceSet","array","values","first","next","last","random","Math","floor","length","find","callback","keys","get","relevant","map","results","push","some","every","reduce","initialValue","accumulator"],"mappings":"AAGA,OAAO,MAAMA,mBAAyBC,IASpCC,YAAYC,CAA6D,CAAEC,CAAiC,CAAE,CAK5G,GAJA,KAAK,CAACD,GAAW,EAAE,EAEnB,IAAI,CAACE,OAAO,CAAGD,GAASC,QAEpB,CAACD,GAASE,QAAS,MAAM,CAE7B,IAAI,CAACC,YAAY,CAACH,EAAQE,OAAO,CACnC,CAEAC,aAAaH,CAAgC,CAAgB,CAa3D,OAZI,IAAI,CAACE,OAAO,EAAEE,YAAYC,cAAc,IAAI,CAACH,OAAO,CAACE,UAAU,EAEnE,IAAI,CAACF,OAAO,CAAGF,EACf,IAAI,CAACE,OAAO,CAACE,UAAU,CAAGE,YAAY,IAAM,CAC1C,IAAI,CAACC,OAAO,CAAC,CAACC,EAAOC,IAAQ,CAC3B,GAAK,IAAI,CAACP,OAAO,EAAEQ,OAAOF,EAAOC,EAAKT,EAAQW,GAAG,EAGjD,OADA,IAAI,CAACC,MAAM,CAACH,GACLA,CAHmD,AAI5D,EACF,EAAGT,EAAQa,QAAQ,EAEZ,IAAI,CAACX,OAAO,CAACE,UAAU,AAChC,CAEAU,aAAoB,CAClB,OAAOT,cAAc,IAAI,CAACH,OAAO,EAAEE,WACrC,CAEAW,sBAAsBC,CAAmB,CAAQ,CAC3B,IAAI,EAApB,IAAI,CAACd,OAAO,EAEhB,IAAI,CAACC,YAAY,CAAC,CAAEO,OAAQ,IAAI,CAACR,OAAO,CAACQ,MAAM,CAAEG,SAAUG,CAAY,EACzE,CAEAC,oBAAoBC,CAA6D,CAAQ,CACnE,IAAI,EAApB,IAAI,CAAChB,OAAO,EAEhB,IAAI,CAACC,YAAY,CAAC,CAAEO,OAAQQ,EAAWL,SAAU,IAAI,CAACX,OAAO,CAACW,QAAQ,AAAC,EACzE,CAGAM,IAAIV,CAAM,CAAED,CAAQ,CAAQ,OAE1B,AAAI,AAAC,CAAA,AAAiBY,KAAAA,IAAjB,IAAI,CAACnB,OAAO,EAAkB,AAAiB,IAAjB,IAAI,CAACA,OAAO,AAAK,GAAM,IAAI,CAACoB,IAAI,EAAI,IAAI,CAACpB,OAAO,CAC1E,IAAI,CAGN,KAAK,CAACkB,GAAG,CAACV,EAAKD,EAFrB,AAGH,CAGAc,SAASb,CAAM,CAAED,CAAQ,CAAQ,CAC/B,OAAO,KAAK,CAACW,GAAG,CAACV,EAAKD,EACxB,CAGAe,OAAa,CACX,MAAO,IAAI,IAAI,CAACC,MAAM,GAAG,AAC3B,CAGAC,OAAuB,CACrB,OAAO,IAAI,CAACD,MAAM,GAAGE,IAAI,GAAGlB,KAAK,AACnC,CAGAmB,MAAsB,CACpB,MAAO,IAAI,IAAI,CAACH,MAAM,GAAG,CAAC,IAAI,CAACH,IAAI,CAAG,EAAE,AAC1C,CAGAO,QAAwB,CACtB,IAAML,EAAQ,IAAI,IAAI,CAACC,MAAM,GAAG,CAChC,OAAOD,CAAK,CAACM,KAAKC,KAAK,CAACD,KAAKD,MAAM,GAAKL,EAAMQ,MAAM,EAAE,AACxD,CAGAC,KAAKC,CAAuC,CAA8B,CACxE,IAAK,IAAMxB,KAAO,IAAI,CAACyB,IAAI,GAAI,CAC7B,IAAM1B,EAAQ,IAAI,CAAC2B,GAAG,CAAC1B,GACvB,GAAIwB,EAASzB,EAAOC,GAAM,OAAOD,CAAK,AACxC,CAEF,CAGAE,OAAOuB,CAAuC,CAAoB,CAChE,IAAMG,EAAW,IAAIxC,WAKrB,OAJA,IAAI,CAACW,OAAO,CAAC,CAACC,EAAOC,IAAQ,CACvBwB,EAASzB,EAAOC,IAAM2B,EAASjB,GAAG,CAACV,EAAKD,EAC9C,GAEO4B,CACT,CAGAC,IAAOJ,CAAiC,CAAO,CAC7C,IAAMK,EAAU,EAAE,CAClB,IAAK,IAAM7B,KAAO,IAAI,CAACyB,IAAI,GAAI,CAC7B,IAAM1B,EAAQ,IAAI,CAAC2B,GAAG,CAAC1B,GACvB6B,EAAQC,IAAI,CAACN,EAASzB,EAAOC,GAC/B,CACA,OAAO6B,CACT,CAGAE,KAAKP,CAAuC,CAAW,CACrD,IAAK,IAAMxB,KAAO,IAAI,CAACyB,IAAI,GAAI,CAC7B,IAAM1B,EAAQ,IAAI,CAAC2B,GAAG,CAAC1B,GACvB,GAAIwB,EAASzB,EAAOC,GAAM,MAAO,CAAA,CAAI,AACvC,CAEA,MAAO,CAAA,CACT,CAGAgC,MAAMR,CAAuC,CAAW,CACtD,IAAK,IAAMxB,KAAO,IAAI,CAACyB,IAAI,GAAI,CAC7B,IAAM1B,EAAQ,IAAI,CAAC2B,GAAG,CAAC1B,GACvB,GAAI,CAACwB,EAASzB,EAAOC,GAAM,MAAO,CAAA,CAAK,AACzC,CAEA,MAAO,CAAA,CACT,CAGAiC,OAAUT,CAAiD,CAAEU,CAAgB,CAAK,CAChF,IAAIC,EAAiBD,EAErB,IAAK,IAAMlC,KAAO,IAAI,CAACyB,IAAI,GAAI,CAC7B,IAAM1B,EAAQ,IAAI,CAAC2B,GAAG,CAAC1B,GACvBmC,EAAcX,EAASW,EAAapC,EAAOC,EAC7C,CAEA,OAAOmC,CACT,CACF,CAAC"}
|
|
1
|
+
// eslint-disable-next-line @typescript-eslint/no-empty-interface
|
|
2
|
+
export class Collection extends Map {
|
|
3
|
+
constructor(entries, options){
|
|
4
|
+
super(entries ?? []);
|
|
5
|
+
this.maxSize = options?.maxSize;
|
|
6
|
+
if (!options?.sweeper) return;
|
|
7
|
+
this.startSweeper(options.sweeper);
|
|
8
|
+
}
|
|
9
|
+
startSweeper(options) {
|
|
10
|
+
if (this.sweeper?.intervalId) clearInterval(this.sweeper.intervalId);
|
|
11
|
+
this.sweeper = options;
|
|
12
|
+
this.sweeper.intervalId = setInterval(()=>{
|
|
13
|
+
this.forEach((value, key)=>{
|
|
14
|
+
if (!this.sweeper?.filter(value, key, options.bot)) return;
|
|
15
|
+
this.delete(key);
|
|
16
|
+
return key;
|
|
17
|
+
});
|
|
18
|
+
}, options.interval);
|
|
19
|
+
return this.sweeper.intervalId;
|
|
20
|
+
}
|
|
21
|
+
stopSweeper() {
|
|
22
|
+
return clearInterval(this.sweeper?.intervalId);
|
|
23
|
+
}
|
|
24
|
+
changeSweeperInterval(newInterval) {
|
|
25
|
+
if (this.sweeper == null) return;
|
|
26
|
+
this.startSweeper({
|
|
27
|
+
filter: this.sweeper.filter,
|
|
28
|
+
interval: newInterval
|
|
29
|
+
});
|
|
30
|
+
}
|
|
31
|
+
changeSweeperFilter(newFilter) {
|
|
32
|
+
if (this.sweeper == null) return;
|
|
33
|
+
this.startSweeper({
|
|
34
|
+
filter: newFilter,
|
|
35
|
+
interval: this.sweeper.interval
|
|
36
|
+
});
|
|
37
|
+
}
|
|
38
|
+
/** Add an item to the collection. Makes sure not to go above the maxSize. */ set(key, value) {
|
|
39
|
+
// When this collection is maxSized make sure we can add first
|
|
40
|
+
if ((this.maxSize !== undefined || this.maxSize === 0) && this.size >= this.maxSize) {
|
|
41
|
+
return this;
|
|
42
|
+
}
|
|
43
|
+
return super.set(key, value);
|
|
44
|
+
}
|
|
45
|
+
/** Add an item to the collection, no matter what the maxSize is. */ forceSet(key, value) {
|
|
46
|
+
return super.set(key, value);
|
|
47
|
+
}
|
|
48
|
+
/** Convert the collection to an array. */ array() {
|
|
49
|
+
return [
|
|
50
|
+
...this.values()
|
|
51
|
+
];
|
|
52
|
+
}
|
|
53
|
+
/** Retrieve the value of the first element in this collection. */ first() {
|
|
54
|
+
return this.values().next().value;
|
|
55
|
+
}
|
|
56
|
+
/** Retrieve the value of the last element in this collection. */ last() {
|
|
57
|
+
return [
|
|
58
|
+
...this.values()
|
|
59
|
+
][this.size - 1];
|
|
60
|
+
}
|
|
61
|
+
/** Retrieve the value of a random element in this collection. */ random() {
|
|
62
|
+
const array = [
|
|
63
|
+
...this.values()
|
|
64
|
+
];
|
|
65
|
+
return array[Math.floor(Math.random() * array.length)];
|
|
66
|
+
}
|
|
67
|
+
/** Find a specific element in this collection. */ find(callback) {
|
|
68
|
+
for (const key of this.keys()){
|
|
69
|
+
const value = this.get(key);
|
|
70
|
+
if (callback(value, key)) return value;
|
|
71
|
+
}
|
|
72
|
+
// If nothing matched
|
|
73
|
+
}
|
|
74
|
+
/** Find all elements in this collection that match the given pattern. */ filter(callback) {
|
|
75
|
+
const relevant = new Collection();
|
|
76
|
+
this.forEach((value, key)=>{
|
|
77
|
+
if (callback(value, key)) relevant.set(key, value);
|
|
78
|
+
});
|
|
79
|
+
return relevant;
|
|
80
|
+
}
|
|
81
|
+
/** Converts the collection into an array by running a callback on all items in the collection. */ map(callback) {
|
|
82
|
+
const results = [];
|
|
83
|
+
for (const key of this.keys()){
|
|
84
|
+
const value = this.get(key);
|
|
85
|
+
results.push(callback(value, key));
|
|
86
|
+
}
|
|
87
|
+
return results;
|
|
88
|
+
}
|
|
89
|
+
/** Check if one of the items in the collection matches the pattern. */ some(callback) {
|
|
90
|
+
for (const key of this.keys()){
|
|
91
|
+
const value = this.get(key);
|
|
92
|
+
if (callback(value, key)) return true;
|
|
93
|
+
}
|
|
94
|
+
return false;
|
|
95
|
+
}
|
|
96
|
+
/** Check if all of the items in the collection matches the pattern. */ every(callback) {
|
|
97
|
+
for (const key of this.keys()){
|
|
98
|
+
const value = this.get(key);
|
|
99
|
+
if (!callback(value, key)) return false;
|
|
100
|
+
}
|
|
101
|
+
return true;
|
|
102
|
+
}
|
|
103
|
+
/** Runs a callback on all items in the collection, merging them into a single value. */ reduce(callback, initialValue) {
|
|
104
|
+
let accumulator = initialValue;
|
|
105
|
+
for (const key of this.keys()){
|
|
106
|
+
const value = this.get(key);
|
|
107
|
+
accumulator = callback(accumulator, value, key);
|
|
108
|
+
}
|
|
109
|
+
return accumulator;
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
//# sourceMappingURL=Collection.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/Collection.ts"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/no-empty-interface\nexport interface PlaceHolderBot {}\n\nexport class Collection<K, V> extends Map<K, V> {\n /**\n * The maximum amount of items allowed in this collection. To disable cache, set it 0, set to undefined to make it infinite.\n * @default undefined\n */\n maxSize: number | undefined\n /** Handler to remove items from the collection every so often. */\n sweeper: (CollectionSweeper<K, V> & { intervalId?: NodeJS.Timer }) | undefined\n\n constructor(entries?: (ReadonlyArray<readonly [K, V]> | null) | Map<K, V>, options?: CollectionOptions<K, V>) {\n super(entries ?? [])\n\n this.maxSize = options?.maxSize\n\n if (!options?.sweeper) return\n\n this.startSweeper(options.sweeper)\n }\n\n startSweeper(options: CollectionSweeper<K, V>): NodeJS.Timer {\n if (this.sweeper?.intervalId) clearInterval(this.sweeper.intervalId)\n\n this.sweeper = options\n this.sweeper.intervalId = setInterval(() => {\n this.forEach((value, key) => {\n if (!this.sweeper?.filter(value, key, options.bot)) return\n\n this.delete(key)\n return key\n })\n }, options.interval)\n\n return this.sweeper.intervalId\n }\n\n stopSweeper(): void {\n return clearInterval(this.sweeper?.intervalId)\n }\n\n changeSweeperInterval(newInterval: number): void {\n if (this.sweeper == null) return\n\n this.startSweeper({ filter: this.sweeper.filter, interval: newInterval })\n }\n\n changeSweeperFilter(newFilter: (value: V, key: K, bot: PlaceHolderBot) => boolean): void {\n if (this.sweeper == null) return\n\n this.startSweeper({ filter: newFilter, interval: this.sweeper.interval })\n }\n\n /** Add an item to the collection. Makes sure not to go above the maxSize. */\n set(key: K, value: V): this {\n // When this collection is maxSized make sure we can add first\n if ((this.maxSize !== undefined || this.maxSize === 0) && this.size >= this.maxSize) {\n return this\n }\n\n return super.set(key, value)\n }\n\n /** Add an item to the collection, no matter what the maxSize is. */\n forceSet(key: K, value: V): this {\n return super.set(key, value)\n }\n\n /** Convert the collection to an array. */\n array(): V[] {\n return [...this.values()]\n }\n\n /** Retrieve the value of the first element in this collection. */\n first(): V | undefined {\n return this.values().next().value\n }\n\n /** Retrieve the value of the last element in this collection. */\n last(): V | undefined {\n return [...this.values()][this.size - 1]\n }\n\n /** Retrieve the value of a random element in this collection. */\n random(): V | undefined {\n const array = [...this.values()]\n return array[Math.floor(Math.random() * array.length)]\n }\n\n /** Find a specific element in this collection. */\n find(callback: (value: V, key: K) => boolean): NonNullable<V> | undefined {\n for (const key of this.keys()) {\n const value = this.get(key)!\n if (callback(value, key)) return value\n }\n // If nothing matched\n }\n\n /** Find all elements in this collection that match the given pattern. */\n filter(callback: (value: V, key: K) => boolean): Collection<K, V> {\n const relevant = new Collection<K, V>()\n this.forEach((value, key) => {\n if (callback(value, key)) relevant.set(key, value)\n })\n\n return relevant\n }\n\n /** Converts the collection into an array by running a callback on all items in the collection. */\n map<T>(callback: (value: V, key: K) => T): T[] {\n const results = []\n for (const key of this.keys()) {\n const value = this.get(key)!\n results.push(callback(value, key))\n }\n return results\n }\n\n /** Check if one of the items in the collection matches the pattern. */\n some(callback: (value: V, key: K) => boolean): boolean {\n for (const key of this.keys()) {\n const value = this.get(key)!\n if (callback(value, key)) return true\n }\n\n return false\n }\n\n /** Check if all of the items in the collection matches the pattern. */\n every(callback: (value: V, key: K) => boolean): boolean {\n for (const key of this.keys()) {\n const value = this.get(key)!\n if (!callback(value, key)) return false\n }\n\n return true\n }\n\n /** Runs a callback on all items in the collection, merging them into a single value. */\n reduce<T>(callback: (accumulator: T, value: V, key: K) => T, initialValue?: T): T {\n let accumulator: T = initialValue!\n\n for (const key of this.keys()) {\n const value = this.get(key)!\n accumulator = callback(accumulator, value, key)\n }\n\n return accumulator\n }\n}\n\nexport interface CollectionOptions<K, V> {\n /** Handler to clean out the items in the collection every so often. */\n sweeper?: CollectionSweeper<K, V>\n /** The maximum number of items allowed in the collection. */\n maxSize?: number\n}\n\nexport interface CollectionSweeper<K, V> {\n /** The filter to determine whether an element should be deleted or not */\n filter: (value: V, key: K, ...args: any[]) => boolean\n /** The interval in which the sweeper should run */\n interval: number\n /** The bot object itself */\n bot?: PlaceHolderBot\n}\n"],"names":["Collection","Map","constructor","entries","options","maxSize","sweeper","startSweeper","intervalId","clearInterval","setInterval","forEach","value","key","filter","bot","delete","interval","stopSweeper","changeSweeperInterval","newInterval","changeSweeperFilter","newFilter","set","undefined","size","forceSet","array","values","first","next","last","random","Math","floor","length","find","callback","keys","get","relevant","map","results","push","some","every","reduce","initialValue","accumulator"],"mappings":"AAAA,iEAAiE;AAGjE,OAAO,MAAMA,mBAAyBC;IASpCC,YAAYC,OAA6D,EAAEC,OAAiC,CAAE;QAC5G,KAAK,CAACD,WAAW,EAAE;QAEnB,IAAI,CAACE,OAAO,GAAGD,SAASC;QAExB,IAAI,CAACD,SAASE,SAAS;QAEvB,IAAI,CAACC,YAAY,CAACH,QAAQE,OAAO;IACnC;IAEAC,aAAaH,OAAgC,EAAgB;QAC3D,IAAI,IAAI,CAACE,OAAO,EAAEE,YAAYC,cAAc,IAAI,CAACH,OAAO,CAACE,UAAU;QAEnE,IAAI,CAACF,OAAO,GAAGF;QACf,IAAI,CAACE,OAAO,CAACE,UAAU,GAAGE,YAAY,IAAM;YAC1C,IAAI,CAACC,OAAO,CAAC,CAACC,OAAOC,MAAQ;gBAC3B,IAAI,CAAC,IAAI,CAACP,OAAO,EAAEQ,OAAOF,OAAOC,KAAKT,QAAQW,GAAG,GAAG;gBAEpD,IAAI,CAACC,MAAM,CAACH;gBACZ,OAAOA;YACT;QACF,GAAGT,QAAQa,QAAQ;QAEnB,OAAO,IAAI,CAACX,OAAO,CAACE,UAAU;IAChC;IAEAU,cAAoB;QAClB,OAAOT,cAAc,IAAI,CAACH,OAAO,EAAEE;IACrC;IAEAW,sBAAsBC,WAAmB,EAAQ;QAC/C,IAAI,IAAI,CAACd,OAAO,IAAI,IAAI,EAAE;QAE1B,IAAI,CAACC,YAAY,CAAC;YAAEO,QAAQ,IAAI,CAACR,OAAO,CAACQ,MAAM;YAAEG,UAAUG;QAAY;IACzE;IAEAC,oBAAoBC,SAA6D,EAAQ;QACvF,IAAI,IAAI,CAAChB,OAAO,IAAI,IAAI,EAAE;QAE1B,IAAI,CAACC,YAAY,CAAC;YAAEO,QAAQQ;YAAWL,UAAU,IAAI,CAACX,OAAO,CAACW,QAAQ;QAAC;IACzE;IAEA,2EAA2E,GAC3EM,IAAIV,GAAM,EAAED,KAAQ,EAAQ;QAC1B,8DAA8D;QAC9D,IAAI,AAAC,CAAA,IAAI,CAACP,OAAO,KAAKmB,aAAa,IAAI,CAACnB,OAAO,KAAK,CAAA,KAAM,IAAI,CAACoB,IAAI,IAAI,IAAI,CAACpB,OAAO,EAAE;YACnF,OAAO,IAAI;QACb,CAAC;QAED,OAAO,KAAK,CAACkB,GAAG,CAACV,KAAKD;IACxB;IAEA,kEAAkE,GAClEc,SAASb,GAAM,EAAED,KAAQ,EAAQ;QAC/B,OAAO,KAAK,CAACW,GAAG,CAACV,KAAKD;IACxB;IAEA,wCAAwC,GACxCe,QAAa;QACX,OAAO;eAAI,IAAI,CAACC,MAAM;SAAG;IAC3B;IAEA,gEAAgE,GAChEC,QAAuB;QACrB,OAAO,IAAI,CAACD,MAAM,GAAGE,IAAI,GAAGlB,KAAK;IACnC;IAEA,+DAA+D,GAC/DmB,OAAsB;QACpB,OAAO;eAAI,IAAI,CAACH,MAAM;SAAG,CAAC,IAAI,CAACH,IAAI,GAAG,EAAE;IAC1C;IAEA,+DAA+D,GAC/DO,SAAwB;QACtB,MAAML,QAAQ;eAAI,IAAI,CAACC,MAAM;SAAG;QAChC,OAAOD,KAAK,CAACM,KAAKC,KAAK,CAACD,KAAKD,MAAM,KAAKL,MAAMQ,MAAM,EAAE;IACxD;IAEA,gDAAgD,GAChDC,KAAKC,QAAuC,EAA8B;QACxE,KAAK,MAAMxB,OAAO,IAAI,CAACyB,IAAI,GAAI;YAC7B,MAAM1B,QAAQ,IAAI,CAAC2B,GAAG,CAAC1B;YACvB,IAAIwB,SAASzB,OAAOC,MAAM,OAAOD;QACnC;IACA,qBAAqB;IACvB;IAEA,uEAAuE,GACvEE,OAAOuB,QAAuC,EAAoB;QAChE,MAAMG,WAAW,IAAIxC;QACrB,IAAI,CAACW,OAAO,CAAC,CAACC,OAAOC,MAAQ;YAC3B,IAAIwB,SAASzB,OAAOC,MAAM2B,SAASjB,GAAG,CAACV,KAAKD;QAC9C;QAEA,OAAO4B;IACT;IAEA,gGAAgG,GAChGC,IAAOJ,QAAiC,EAAO;QAC7C,MAAMK,UAAU,EAAE;QAClB,KAAK,MAAM7B,OAAO,IAAI,CAACyB,IAAI,GAAI;YAC7B,MAAM1B,QAAQ,IAAI,CAAC2B,GAAG,CAAC1B;YACvB6B,QAAQC,IAAI,CAACN,SAASzB,OAAOC;QAC/B;QACA,OAAO6B;IACT;IAEA,qEAAqE,GACrEE,KAAKP,QAAuC,EAAW;QACrD,KAAK,MAAMxB,OAAO,IAAI,CAACyB,IAAI,GAAI;YAC7B,MAAM1B,QAAQ,IAAI,CAAC2B,GAAG,CAAC1B;YACvB,IAAIwB,SAASzB,OAAOC,MAAM,OAAO,IAAI;QACvC;QAEA,OAAO,KAAK;IACd;IAEA,qEAAqE,GACrEgC,MAAMR,QAAuC,EAAW;QACtD,KAAK,MAAMxB,OAAO,IAAI,CAACyB,IAAI,GAAI;YAC7B,MAAM1B,QAAQ,IAAI,CAAC2B,GAAG,CAAC1B;YACvB,IAAI,CAACwB,SAASzB,OAAOC,MAAM,OAAO,KAAK;QACzC;QAEA,OAAO,IAAI;IACb;IAEA,sFAAsF,GACtFiC,OAAUT,QAAiD,EAAEU,YAAgB,EAAK;QAChF,IAAIC,cAAiBD;QAErB,KAAK,MAAMlC,OAAO,IAAI,CAACyB,IAAI,GAAI;YAC7B,MAAM1B,QAAQ,IAAI,CAAC2B,GAAG,CAAC1B;YACvBmC,cAAcX,SAASW,aAAapC,OAAOC;QAC7C;QAEA,OAAOmC;IACT;AACF,CAAC"}
|
package/dist/base64.js
CHANGED
|
@@ -1,2 +1,262 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
/**
|
|
2
|
+
* CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727
|
|
3
|
+
* Encodes a given Uint8Array, ArrayBuffer or string into RFC4648 base64 representation
|
|
4
|
+
* @param data
|
|
5
|
+
*/ export function encode(data) {
|
|
6
|
+
const uint8 = typeof data === 'string' ? new TextEncoder().encode(data) : data instanceof Uint8Array ? data : new Uint8Array(data);
|
|
7
|
+
let result = '';
|
|
8
|
+
let i;
|
|
9
|
+
const l = uint8.length;
|
|
10
|
+
for(i = 2; i < l; i += 3){
|
|
11
|
+
result += base64abc[uint8[i - 2] >> 2];
|
|
12
|
+
result += base64abc[(uint8[i - 2] & 0x03) << 4 | uint8[i - 1] >> 4];
|
|
13
|
+
result += base64abc[(uint8[i - 1] & 0x0f) << 2 | uint8[i] >> 6];
|
|
14
|
+
result += base64abc[uint8[i] & 0x3f];
|
|
15
|
+
}
|
|
16
|
+
if (i === l + 1) {
|
|
17
|
+
// 1 octet yet to write
|
|
18
|
+
result += base64abc[uint8[i - 2] >> 2];
|
|
19
|
+
result += base64abc[(uint8[i - 2] & 0x03) << 4];
|
|
20
|
+
result += '==';
|
|
21
|
+
}
|
|
22
|
+
if (i === l) {
|
|
23
|
+
// 2 octets yet to write
|
|
24
|
+
result += base64abc[uint8[i - 2] >> 2];
|
|
25
|
+
result += base64abc[(uint8[i - 2] & 0x03) << 4 | uint8[i - 1] >> 4];
|
|
26
|
+
result += base64abc[(uint8[i - 1] & 0x0f) << 2];
|
|
27
|
+
result += '=';
|
|
28
|
+
}
|
|
29
|
+
return result;
|
|
30
|
+
}
|
|
31
|
+
/**
|
|
32
|
+
* CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727
|
|
33
|
+
* Decodes RFC4648 base64 string into an Uint8Array
|
|
34
|
+
* @param data
|
|
35
|
+
*/ export function decode(data) {
|
|
36
|
+
if (data.length % 4 !== 0) {
|
|
37
|
+
throw new Error('Unable to parse base64 string.');
|
|
38
|
+
}
|
|
39
|
+
const index = data.indexOf('=');
|
|
40
|
+
if (index !== -1 && index < data.length - 2) {
|
|
41
|
+
throw new Error('Unable to parse base64 string.');
|
|
42
|
+
}
|
|
43
|
+
const missingOctets = data.endsWith('==') ? 2 : data.endsWith('=') ? 1 : 0;
|
|
44
|
+
const n = data.length;
|
|
45
|
+
const result = new Uint8Array(3 * (n / 4));
|
|
46
|
+
let buffer;
|
|
47
|
+
for(let i = 0, j = 0; i < n; i += 4, j += 3){
|
|
48
|
+
buffer = getBase64Code(data.charCodeAt(i)) << 18 | getBase64Code(data.charCodeAt(i + 1)) << 12 | getBase64Code(data.charCodeAt(i + 2)) << 6 | getBase64Code(data.charCodeAt(i + 3));
|
|
49
|
+
result[j] = buffer >> 16;
|
|
50
|
+
result[j + 1] = buffer >> 8 & 0xff;
|
|
51
|
+
result[j + 2] = buffer & 0xff;
|
|
52
|
+
}
|
|
53
|
+
return result.subarray(0, result.length - missingOctets);
|
|
54
|
+
}
|
|
55
|
+
/**
|
|
56
|
+
* CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727
|
|
57
|
+
* @param charCode
|
|
58
|
+
*/ function getBase64Code(charCode) {
|
|
59
|
+
if (charCode >= base64codes.length) {
|
|
60
|
+
throw new Error('Unable to parse base64 string.');
|
|
61
|
+
}
|
|
62
|
+
const code = base64codes[charCode];
|
|
63
|
+
if (code === 255) {
|
|
64
|
+
throw new Error('Unable to parse base64 string.');
|
|
65
|
+
}
|
|
66
|
+
return code;
|
|
67
|
+
}
|
|
68
|
+
// Copyright 2018-2021 the Deno authors. All rights reserved. MIT license.
|
|
69
|
+
const base64abc = [
|
|
70
|
+
'A',
|
|
71
|
+
'B',
|
|
72
|
+
'C',
|
|
73
|
+
'D',
|
|
74
|
+
'E',
|
|
75
|
+
'F',
|
|
76
|
+
'G',
|
|
77
|
+
'H',
|
|
78
|
+
'I',
|
|
79
|
+
'J',
|
|
80
|
+
'K',
|
|
81
|
+
'L',
|
|
82
|
+
'M',
|
|
83
|
+
'N',
|
|
84
|
+
'O',
|
|
85
|
+
'P',
|
|
86
|
+
'Q',
|
|
87
|
+
'R',
|
|
88
|
+
'S',
|
|
89
|
+
'T',
|
|
90
|
+
'U',
|
|
91
|
+
'V',
|
|
92
|
+
'W',
|
|
93
|
+
'X',
|
|
94
|
+
'Y',
|
|
95
|
+
'Z',
|
|
96
|
+
'a',
|
|
97
|
+
'b',
|
|
98
|
+
'c',
|
|
99
|
+
'd',
|
|
100
|
+
'e',
|
|
101
|
+
'f',
|
|
102
|
+
'g',
|
|
103
|
+
'h',
|
|
104
|
+
'i',
|
|
105
|
+
'j',
|
|
106
|
+
'k',
|
|
107
|
+
'l',
|
|
108
|
+
'm',
|
|
109
|
+
'n',
|
|
110
|
+
'o',
|
|
111
|
+
'p',
|
|
112
|
+
'q',
|
|
113
|
+
'r',
|
|
114
|
+
's',
|
|
115
|
+
't',
|
|
116
|
+
'u',
|
|
117
|
+
'v',
|
|
118
|
+
'w',
|
|
119
|
+
'x',
|
|
120
|
+
'y',
|
|
121
|
+
'z',
|
|
122
|
+
'0',
|
|
123
|
+
'1',
|
|
124
|
+
'2',
|
|
125
|
+
'3',
|
|
126
|
+
'4',
|
|
127
|
+
'5',
|
|
128
|
+
'6',
|
|
129
|
+
'7',
|
|
130
|
+
'8',
|
|
131
|
+
'9',
|
|
132
|
+
'+',
|
|
133
|
+
'/'
|
|
134
|
+
];
|
|
135
|
+
// CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727
|
|
136
|
+
const base64codes = [
|
|
137
|
+
255,
|
|
138
|
+
255,
|
|
139
|
+
255,
|
|
140
|
+
255,
|
|
141
|
+
255,
|
|
142
|
+
255,
|
|
143
|
+
255,
|
|
144
|
+
255,
|
|
145
|
+
255,
|
|
146
|
+
255,
|
|
147
|
+
255,
|
|
148
|
+
255,
|
|
149
|
+
255,
|
|
150
|
+
255,
|
|
151
|
+
255,
|
|
152
|
+
255,
|
|
153
|
+
255,
|
|
154
|
+
255,
|
|
155
|
+
255,
|
|
156
|
+
255,
|
|
157
|
+
255,
|
|
158
|
+
255,
|
|
159
|
+
255,
|
|
160
|
+
255,
|
|
161
|
+
255,
|
|
162
|
+
255,
|
|
163
|
+
255,
|
|
164
|
+
255,
|
|
165
|
+
255,
|
|
166
|
+
255,
|
|
167
|
+
255,
|
|
168
|
+
255,
|
|
169
|
+
255,
|
|
170
|
+
255,
|
|
171
|
+
255,
|
|
172
|
+
255,
|
|
173
|
+
255,
|
|
174
|
+
255,
|
|
175
|
+
255,
|
|
176
|
+
255,
|
|
177
|
+
255,
|
|
178
|
+
255,
|
|
179
|
+
255,
|
|
180
|
+
62,
|
|
181
|
+
255,
|
|
182
|
+
255,
|
|
183
|
+
255,
|
|
184
|
+
63,
|
|
185
|
+
52,
|
|
186
|
+
53,
|
|
187
|
+
54,
|
|
188
|
+
55,
|
|
189
|
+
56,
|
|
190
|
+
57,
|
|
191
|
+
58,
|
|
192
|
+
59,
|
|
193
|
+
60,
|
|
194
|
+
61,
|
|
195
|
+
255,
|
|
196
|
+
255,
|
|
197
|
+
255,
|
|
198
|
+
0,
|
|
199
|
+
255,
|
|
200
|
+
255,
|
|
201
|
+
255,
|
|
202
|
+
0,
|
|
203
|
+
1,
|
|
204
|
+
2,
|
|
205
|
+
3,
|
|
206
|
+
4,
|
|
207
|
+
5,
|
|
208
|
+
6,
|
|
209
|
+
7,
|
|
210
|
+
8,
|
|
211
|
+
9,
|
|
212
|
+
10,
|
|
213
|
+
11,
|
|
214
|
+
12,
|
|
215
|
+
13,
|
|
216
|
+
14,
|
|
217
|
+
15,
|
|
218
|
+
16,
|
|
219
|
+
17,
|
|
220
|
+
18,
|
|
221
|
+
19,
|
|
222
|
+
20,
|
|
223
|
+
21,
|
|
224
|
+
22,
|
|
225
|
+
23,
|
|
226
|
+
24,
|
|
227
|
+
25,
|
|
228
|
+
255,
|
|
229
|
+
255,
|
|
230
|
+
255,
|
|
231
|
+
255,
|
|
232
|
+
255,
|
|
233
|
+
255,
|
|
234
|
+
26,
|
|
235
|
+
27,
|
|
236
|
+
28,
|
|
237
|
+
29,
|
|
238
|
+
30,
|
|
239
|
+
31,
|
|
240
|
+
32,
|
|
241
|
+
33,
|
|
242
|
+
34,
|
|
243
|
+
35,
|
|
244
|
+
36,
|
|
245
|
+
37,
|
|
246
|
+
38,
|
|
247
|
+
39,
|
|
248
|
+
40,
|
|
249
|
+
41,
|
|
250
|
+
42,
|
|
251
|
+
43,
|
|
252
|
+
44,
|
|
253
|
+
45,
|
|
254
|
+
46,
|
|
255
|
+
47,
|
|
256
|
+
48,
|
|
257
|
+
49,
|
|
258
|
+
50,
|
|
259
|
+
51
|
|
260
|
+
];
|
|
261
|
+
|
|
262
|
+
//# sourceMappingURL=base64.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/base64.ts"],"sourcesContent":["/**\n * CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727\n * Encodes a given Uint8Array, ArrayBuffer or string into RFC4648 base64 representation\n * @param data\n */\nexport function encode(data: ArrayBuffer | string): string {\n const uint8 = typeof data === 'string' ? new TextEncoder().encode(data) : data instanceof Uint8Array ? data : new Uint8Array(data)\n let result = ''\n let i\n const l = uint8.length\n for (i = 2; i < l; i += 3) {\n result += base64abc[uint8[i - 2] >> 2]\n result += base64abc[((uint8[i - 2] & 0x03) << 4) | (uint8[i - 1] >> 4)]\n result += base64abc[((uint8[i - 1] & 0x0f) << 2) | (uint8[i] >> 6)]\n result += base64abc[uint8[i] & 0x3f]\n }\n if (i === l + 1) {\n // 1 octet yet to write\n result += base64abc[uint8[i - 2] >> 2]\n result += base64abc[(uint8[i - 2] & 0x03) << 4]\n result += '=='\n }\n if (i === l) {\n // 2 octets yet to write\n result += base64abc[uint8[i - 2] >> 2]\n result += base64abc[((uint8[i - 2] & 0x03) << 4) | (uint8[i - 1] >> 4)]\n result += base64abc[(uint8[i - 1] & 0x0f) << 2]\n result += '='\n }\n return result\n}\n\n/**\n * CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727\n * Decodes RFC4648 base64 string into an Uint8Array\n * @param data\n */\nexport function decode(data: string): Uint8Array {\n if (data.length % 4 !== 0) {\n throw new Error('Unable to parse base64 string.')\n }\n const index = data.indexOf('=')\n if (index !== -1 && index < data.length - 2) {\n throw new Error('Unable to parse base64 string.')\n }\n const missingOctets = data.endsWith('==') ? 2 : data.endsWith('=') ? 1 : 0\n const n = data.length\n const result = new Uint8Array(3 * (n / 4))\n let buffer\n for (let i = 0, j = 0; i < n; i += 4, j += 3) {\n buffer =\n (getBase64Code(data.charCodeAt(i)) << 18) |\n (getBase64Code(data.charCodeAt(i + 1)) << 12) |\n (getBase64Code(data.charCodeAt(i + 2)) << 6) |\n getBase64Code(data.charCodeAt(i + 3))\n result[j] = buffer >> 16\n result[j + 1] = (buffer >> 8) & 0xff\n result[j + 2] = buffer & 0xff\n }\n return result.subarray(0, result.length - missingOctets)\n}\n\n/**\n * CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727\n * @param charCode\n */\nfunction getBase64Code(charCode: number): number {\n if (charCode >= base64codes.length) {\n throw new Error('Unable to parse base64 string.')\n }\n const code = base64codes[charCode]\n if (code === 255) {\n throw new Error('Unable to parse base64 string.')\n }\n return code\n}\n\n// Copyright 2018-2021 the Deno authors. All rights reserved. MIT license.\nconst base64abc = [\n 'A',\n 'B',\n 'C',\n 'D',\n 'E',\n 'F',\n 'G',\n 'H',\n 'I',\n 'J',\n 'K',\n 'L',\n 'M',\n 'N',\n 'O',\n 'P',\n 'Q',\n 'R',\n 'S',\n 'T',\n 'U',\n 'V',\n 'W',\n 'X',\n 'Y',\n 'Z',\n 'a',\n 'b',\n 'c',\n 'd',\n 'e',\n 'f',\n 'g',\n 'h',\n 'i',\n 'j',\n 'k',\n 'l',\n 'm',\n 'n',\n 'o',\n 'p',\n 'q',\n 'r',\n 's',\n 't',\n 'u',\n 'v',\n 'w',\n 'x',\n 'y',\n 'z',\n '0',\n '1',\n '2',\n '3',\n '4',\n '5',\n '6',\n '7',\n '8',\n '9',\n '+',\n '/',\n]\n\n// CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727\nconst base64codes = [\n 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,\n 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 62, 255, 255, 255, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 255, 255, 255,\n 0, 255, 255, 255, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 255, 255, 255, 255, 255, 255, 26,\n 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51,\n]\n"],"names":["encode","data","uint8","TextEncoder","Uint8Array","result","i","l","length","base64abc","decode","Error","index","indexOf","missingOctets","endsWith","n","buffer","j","getBase64Code","charCodeAt","subarray","charCode","base64codes","code"],"mappings":"AAAA;;;;CAIC,GACD,OAAO,SAASA,OAAOC,IAA0B,EAAU;IACzD,MAAMC,QAAQ,OAAOD,SAAS,WAAW,IAAIE,cAAcH,MAAM,CAACC,QAAQA,gBAAgBG,aAAaH,OAAO,IAAIG,WAAWH,KAAK;IAClI,IAAII,SAAS;IACb,IAAIC;IACJ,MAAMC,IAAIL,MAAMM,MAAM;IACtB,IAAKF,IAAI,GAAGA,IAAIC,GAAGD,KAAK,EAAG;QACzBD,UAAUI,SAAS,CAACP,KAAK,CAACI,IAAI,EAAE,IAAI,EAAE;QACtCD,UAAUI,SAAS,CAAC,AAAEP,CAAAA,KAAK,CAACI,IAAI,EAAE,GAAG,IAAG,KAAM,IAAMJ,KAAK,CAACI,IAAI,EAAE,IAAI,EAAG;QACvED,UAAUI,SAAS,CAAC,AAAEP,CAAAA,KAAK,CAACI,IAAI,EAAE,GAAG,IAAG,KAAM,IAAMJ,KAAK,CAACI,EAAE,IAAI,EAAG;QACnED,UAAUI,SAAS,CAACP,KAAK,CAACI,EAAE,GAAG,KAAK;IACtC;IACA,IAAIA,MAAMC,IAAI,GAAG;QACf,uBAAuB;QACvBF,UAAUI,SAAS,CAACP,KAAK,CAACI,IAAI,EAAE,IAAI,EAAE;QACtCD,UAAUI,SAAS,CAAC,AAACP,CAAAA,KAAK,CAACI,IAAI,EAAE,GAAG,IAAG,KAAM,EAAE;QAC/CD,UAAU;IACZ,CAAC;IACD,IAAIC,MAAMC,GAAG;QACX,wBAAwB;QACxBF,UAAUI,SAAS,CAACP,KAAK,CAACI,IAAI,EAAE,IAAI,EAAE;QACtCD,UAAUI,SAAS,CAAC,AAAEP,CAAAA,KAAK,CAACI,IAAI,EAAE,GAAG,IAAG,KAAM,IAAMJ,KAAK,CAACI,IAAI,EAAE,IAAI,EAAG;QACvED,UAAUI,SAAS,CAAC,AAACP,CAAAA,KAAK,CAACI,IAAI,EAAE,GAAG,IAAG,KAAM,EAAE;QAC/CD,UAAU;IACZ,CAAC;IACD,OAAOA;AACT,CAAC;AAED;;;;CAIC,GACD,OAAO,SAASK,OAAOT,IAAY,EAAc;IAC/C,IAAIA,KAAKO,MAAM,GAAG,MAAM,GAAG;QACzB,MAAM,IAAIG,MAAM,kCAAiC;IACnD,CAAC;IACD,MAAMC,QAAQX,KAAKY,OAAO,CAAC;IAC3B,IAAID,UAAU,CAAC,KAAKA,QAAQX,KAAKO,MAAM,GAAG,GAAG;QAC3C,MAAM,IAAIG,MAAM,kCAAiC;IACnD,CAAC;IACD,MAAMG,gBAAgBb,KAAKc,QAAQ,CAAC,QAAQ,IAAId,KAAKc,QAAQ,CAAC,OAAO,IAAI,CAAC;IAC1E,MAAMC,IAAIf,KAAKO,MAAM;IACrB,MAAMH,SAAS,IAAID,WAAW,IAAKY,CAAAA,IAAI,CAAA;IACvC,IAAIC;IACJ,IAAK,IAAIX,IAAI,GAAGY,IAAI,GAAGZ,IAAIU,GAAGV,KAAK,GAAGY,KAAK,CAAC,CAAE;QAC5CD,SACE,AAACE,cAAclB,KAAKmB,UAAU,CAACd,OAAO,KACrCa,cAAclB,KAAKmB,UAAU,CAACd,IAAI,OAAO,KACzCa,cAAclB,KAAKmB,UAAU,CAACd,IAAI,OAAO,IAC1Ca,cAAclB,KAAKmB,UAAU,CAACd,IAAI;QACpCD,MAAM,CAACa,EAAE,GAAGD,UAAU;QACtBZ,MAAM,CAACa,IAAI,EAAE,GAAG,AAACD,UAAU,IAAK;QAChCZ,MAAM,CAACa,IAAI,EAAE,GAAGD,SAAS;IAC3B;IACA,OAAOZ,OAAOgB,QAAQ,CAAC,GAAGhB,OAAOG,MAAM,GAAGM;AAC5C,CAAC;AAED;;;CAGC,GACD,SAASK,cAAcG,QAAgB,EAAU;IAC/C,IAAIA,YAAYC,YAAYf,MAAM,EAAE;QAClC,MAAM,IAAIG,MAAM,kCAAiC;IACnD,CAAC;IACD,MAAMa,OAAOD,WAAW,CAACD,SAAS;IAClC,IAAIE,SAAS,KAAK;QAChB,MAAM,IAAIb,MAAM,kCAAiC;IACnD,CAAC;IACD,OAAOa;AACT;AAEA,0EAA0E;AAC1E,MAAMf,YAAY;IAChB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;CACD;AAED,kFAAkF;AAClF,MAAMc,cAAc;IAClB;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAC5I;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAAI;IAAK;IAAK;IAAK;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAK;IAAK;IAC/I;IAAG;IAAK;IAAK;IAAK;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAK;IAAK;IAAK;IAAK;IAAK;IAAK;IAC9I;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;CACjG"}
|
package/dist/bucket.js
CHANGED
|
@@ -1,2 +1,80 @@
|
|
|
1
|
-
import{delay
|
|
2
|
-
|
|
1
|
+
import { delay } from './utils.js';
|
|
2
|
+
export function createLeakyBucket({ max , refillInterval , refillAmount , tokens , waiting , ...rest }) {
|
|
3
|
+
return {
|
|
4
|
+
max,
|
|
5
|
+
refillInterval,
|
|
6
|
+
refillAmount: refillAmount > max ? max : refillAmount,
|
|
7
|
+
lastRefill: performance.now(),
|
|
8
|
+
allowAcquire: true,
|
|
9
|
+
nextRefill: function() {
|
|
10
|
+
return nextRefill(this);
|
|
11
|
+
},
|
|
12
|
+
tokens: function() {
|
|
13
|
+
return updateTokens(this);
|
|
14
|
+
},
|
|
15
|
+
acquire: async function(amount, highPriority) {
|
|
16
|
+
return await acquire(this, amount, highPriority);
|
|
17
|
+
},
|
|
18
|
+
tokensState: tokens ?? max,
|
|
19
|
+
waiting: waiting ?? [],
|
|
20
|
+
...rest
|
|
21
|
+
};
|
|
22
|
+
}
|
|
23
|
+
/** Update the tokens of that bucket.
|
|
24
|
+
* @returns {number} The amount of current available tokens.
|
|
25
|
+
*/ export function updateTokens(bucket) {
|
|
26
|
+
const timePassed = performance.now() - bucket.lastRefill;
|
|
27
|
+
const missedRefills = Math.floor(timePassed / bucket.refillInterval);
|
|
28
|
+
// The refill shall not exceed the max amount of tokens.
|
|
29
|
+
bucket.tokensState = Math.min(bucket.tokensState + bucket.refillAmount * missedRefills, bucket.max);
|
|
30
|
+
bucket.lastRefill += bucket.refillInterval * missedRefills;
|
|
31
|
+
return bucket.tokensState;
|
|
32
|
+
}
|
|
33
|
+
export function nextRefill(bucket) {
|
|
34
|
+
// Since this bucket is lazy update the tokens before calculating the next refill.
|
|
35
|
+
updateTokens(bucket);
|
|
36
|
+
return performance.now() - bucket.lastRefill + bucket.refillInterval;
|
|
37
|
+
}
|
|
38
|
+
export async function acquire(bucket, amount, highPriority = false) {
|
|
39
|
+
// To prevent the race condition of 2 acquires happening at once,
|
|
40
|
+
// check whether its currently allowed to acquire.
|
|
41
|
+
if (!bucket.allowAcquire) {
|
|
42
|
+
// create, push, and wait until the current running acquiring is finished.
|
|
43
|
+
await new Promise((resolve)=>{
|
|
44
|
+
if (highPriority) {
|
|
45
|
+
bucket.waiting.unshift(resolve);
|
|
46
|
+
} else {
|
|
47
|
+
bucket.waiting.push(resolve);
|
|
48
|
+
}
|
|
49
|
+
});
|
|
50
|
+
// Somehow another acquire has started,
|
|
51
|
+
// so need to wait again.
|
|
52
|
+
if (!bucket.allowAcquire) {
|
|
53
|
+
return await acquire(bucket, amount);
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
bucket.allowAcquire = false;
|
|
57
|
+
// Since the bucket is lazy update the tokens now,
|
|
58
|
+
// and also get the current amount of available tokens
|
|
59
|
+
const currentTokens = updateTokens(bucket);
|
|
60
|
+
// It's possible that more than available tokens have been acquired,
|
|
61
|
+
// so calculate the amount of milliseconds to wait until this acquire is good to go.
|
|
62
|
+
if (currentTokens < amount) {
|
|
63
|
+
const tokensNeeded = amount - currentTokens;
|
|
64
|
+
const refillsNeeded = Math.ceil(tokensNeeded / bucket.refillAmount);
|
|
65
|
+
const waitTime = bucket.refillInterval * refillsNeeded;
|
|
66
|
+
await delay(waitTime);
|
|
67
|
+
// Update the tokens again to ensure nothing has been missed.
|
|
68
|
+
updateTokens(bucket);
|
|
69
|
+
}
|
|
70
|
+
// In order to not subtract too much from the tokens,
|
|
71
|
+
// calculate what is actually needed to subtract.
|
|
72
|
+
const toSubtract = (amount % bucket.refillAmount) ?? amount;
|
|
73
|
+
bucket.tokensState -= toSubtract;
|
|
74
|
+
// Allow the next acquire to happen.
|
|
75
|
+
bucket.allowAcquire = true;
|
|
76
|
+
// If there is an acquire waiting, let it continue.
|
|
77
|
+
bucket.waiting.shift()?.();
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
//# sourceMappingURL=bucket.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/bucket.ts"],"sourcesContent":["import type { PickPartial } from '@discordeno/types'\nimport { delay } from './utils.js'\n\n/** A Leaky Bucket.\n * Useful for rate limiting purposes.\n * This uses `performance.now()` instead of `Date.now()` for higher accuracy.\n *\n * NOTE: This bucket is lazy, means it only updates when a related method is called.\n */\nexport interface LeakyBucket {\n /** How many tokens this bucket can hold. */\n max: number\n /** Amount of tokens gained per interval.\n * If bigger than `max` it will be pressed to `max`.\n */\n refillAmount: number\n /** Interval at which the bucket gains tokens. */\n refillInterval: number\n\n /** Acquire tokens from the bucket.\n * Resolves when the tokens are acquired and available.\n * @param {boolean} [highPriority=false] Whether this acquire is should be done asap.\n */\n acquire: (amount: number, highPriority?: boolean) => Promise<void>\n\n /** Returns the number of milliseconds until the next refill. */\n nextRefill: () => number\n\n /** Current tokens in the bucket. */\n tokens: () => number\n\n /** @private Internal track of when the last refill of tokens was.\n * DO NOT TOUCH THIS! Unless you know what you are doing ofc :P\n */\n lastRefill: number\n\n /** @private Internal state of whether currently it is allowed to acquire tokens.\n * DO NOT TOUCH THIS! Unless you know what you are doing ofc :P\n */\n allowAcquire: boolean\n\n /** @private Internal number of currently available tokens.\n * DO NOT TOUCH THIS! Unless you know what you are doing ofc :P\n */\n tokensState: number\n\n /** @private Internal array of promises necessary to guarantee no race conditions.\n * DO NOT TOUCH THIS! Unless you know what you are doing ofc :P\n */\n waiting: Array<(_?: unknown) => void>\n}\n\nexport function createLeakyBucket({\n max,\n refillInterval,\n refillAmount,\n tokens,\n waiting,\n ...rest\n}: Omit<PickPartial<LeakyBucket, 'max' | 'refillInterval' | 'refillAmount'>, 'tokens'> & {\n /** Current tokens in the bucket.\n * @default max\n */\n tokens?: number\n}): LeakyBucket {\n return {\n max,\n refillInterval,\n refillAmount: refillAmount > max ? max : refillAmount,\n lastRefill: performance.now(),\n allowAcquire: true,\n\n nextRefill: function () {\n return nextRefill(this)\n },\n\n tokens: function () {\n return updateTokens(this)\n },\n\n acquire: async function (amount, highPriority) {\n return await acquire(this, amount, highPriority)\n },\n\n tokensState: tokens ?? max,\n waiting: waiting ?? [],\n\n ...rest,\n }\n}\n\n/** Update the tokens of that bucket.\n * @returns {number} The amount of current available tokens.\n */\nexport function updateTokens(bucket: LeakyBucket): number {\n const timePassed = performance.now() - bucket.lastRefill\n const missedRefills = Math.floor(timePassed / bucket.refillInterval)\n\n // The refill shall not exceed the max amount of tokens.\n bucket.tokensState = Math.min(bucket.tokensState + bucket.refillAmount * missedRefills, bucket.max)\n bucket.lastRefill += bucket.refillInterval * missedRefills\n\n return bucket.tokensState\n}\n\nexport function nextRefill(bucket: LeakyBucket): number {\n // Since this bucket is lazy update the tokens before calculating the next refill.\n updateTokens(bucket)\n\n return performance.now() - bucket.lastRefill + bucket.refillInterval\n}\n\nexport async function acquire(bucket: LeakyBucket, amount: number, highPriority = false): Promise<void> {\n // To prevent the race condition of 2 acquires happening at once,\n // check whether its currently allowed to acquire.\n if (!bucket.allowAcquire) {\n // create, push, and wait until the current running acquiring is finished.\n await new Promise((resolve) => {\n if (highPriority) {\n bucket.waiting.unshift(resolve)\n } else {\n bucket.waiting.push(resolve)\n }\n })\n\n // Somehow another acquire has started,\n // so need to wait again.\n if (!bucket.allowAcquire) {\n return await acquire(bucket, amount)\n }\n }\n\n bucket.allowAcquire = false\n // Since the bucket is lazy update the tokens now,\n // and also get the current amount of available tokens\n const currentTokens = updateTokens(bucket)\n\n // It's possible that more than available tokens have been acquired,\n // so calculate the amount of milliseconds to wait until this acquire is good to go.\n if (currentTokens < amount) {\n const tokensNeeded = amount - currentTokens\n const refillsNeeded = Math.ceil(tokensNeeded / bucket.refillAmount)\n\n const waitTime = bucket.refillInterval * refillsNeeded\n await delay(waitTime)\n\n // Update the tokens again to ensure nothing has been missed.\n updateTokens(bucket)\n }\n\n // In order to not subtract too much from the tokens,\n // calculate what is actually needed to subtract.\n const toSubtract = amount % bucket.refillAmount ?? amount\n bucket.tokensState -= toSubtract\n\n // Allow the next acquire to happen.\n bucket.allowAcquire = true\n // If there is an acquire waiting, let it continue.\n bucket.waiting.shift()?.()\n}\n"],"names":["delay","createLeakyBucket","max","refillInterval","refillAmount","tokens","waiting","rest","lastRefill","performance","now","allowAcquire","nextRefill","updateTokens","acquire","amount","highPriority","tokensState","bucket","timePassed","missedRefills","Math","floor","min","Promise","resolve","unshift","push","currentTokens","tokensNeeded","refillsNeeded","ceil","waitTime","toSubtract","shift"],"mappings":"AACA,SAASA,KAAK,QAAQ,aAAY;AAmDlC,OAAO,SAASC,kBAAkB,EAChCC,IAAG,EACHC,eAAc,EACdC,aAAY,EACZC,OAAM,EACNC,QAAO,EACP,GAAGC,MAMJ,EAAe;IACd,OAAO;QACLL;QACAC;QACAC,cAAcA,eAAeF,MAAMA,MAAME,YAAY;QACrDI,YAAYC,YAAYC,GAAG;QAC3BC,cAAc,IAAI;QAElBC,YAAY,WAAY;YACtB,OAAOA,WAAW,IAAI;QACxB;QAEAP,QAAQ,WAAY;YAClB,OAAOQ,aAAa,IAAI;QAC1B;QAEAC,SAAS,eAAgBC,MAAM,EAAEC,YAAY,EAAE;YAC7C,OAAO,MAAMF,QAAQ,IAAI,EAAEC,QAAQC;QACrC;QAEAC,aAAaZ,UAAUH;QACvBI,SAASA,WAAW,EAAE;QAEtB,GAAGC,IAAI;IACT;AACF,CAAC;AAED;;CAEC,GACD,OAAO,SAASM,aAAaK,MAAmB,EAAU;IACxD,MAAMC,aAAaV,YAAYC,GAAG,KAAKQ,OAAOV,UAAU;IACxD,MAAMY,gBAAgBC,KAAKC,KAAK,CAACH,aAAaD,OAAOf,cAAc;IAEnE,wDAAwD;IACxDe,OAAOD,WAAW,GAAGI,KAAKE,GAAG,CAACL,OAAOD,WAAW,GAAGC,OAAOd,YAAY,GAAGgB,eAAeF,OAAOhB,GAAG;IAClGgB,OAAOV,UAAU,IAAIU,OAAOf,cAAc,GAAGiB;IAE7C,OAAOF,OAAOD,WAAW;AAC3B,CAAC;AAED,OAAO,SAASL,WAAWM,MAAmB,EAAU;IACtD,kFAAkF;IAClFL,aAAaK;IAEb,OAAOT,YAAYC,GAAG,KAAKQ,OAAOV,UAAU,GAAGU,OAAOf,cAAc;AACtE,CAAC;AAED,OAAO,eAAeW,QAAQI,MAAmB,EAAEH,MAAc,EAAEC,eAAe,KAAK,EAAiB;IACtG,iEAAiE;IACjE,kDAAkD;IAClD,IAAI,CAACE,OAAOP,YAAY,EAAE;QACxB,0EAA0E;QAC1E,MAAM,IAAIa,QAAQ,CAACC,UAAY;YAC7B,IAAIT,cAAc;gBAChBE,OAAOZ,OAAO,CAACoB,OAAO,CAACD;YACzB,OAAO;gBACLP,OAAOZ,OAAO,CAACqB,IAAI,CAACF;YACtB,CAAC;QACH;QAEA,uCAAuC;QACvC,yBAAyB;QACzB,IAAI,CAACP,OAAOP,YAAY,EAAE;YACxB,OAAO,MAAMG,QAAQI,QAAQH;QAC/B,CAAC;IACH,CAAC;IAEDG,OAAOP,YAAY,GAAG,KAAK;IAC3B,kDAAkD;IAClD,sDAAsD;IACtD,MAAMiB,gBAAgBf,aAAaK;IAEnC,oEAAoE;IACpE,oFAAoF;IACpF,IAAIU,gBAAgBb,QAAQ;QAC1B,MAAMc,eAAed,SAASa;QAC9B,MAAME,gBAAgBT,KAAKU,IAAI,CAACF,eAAeX,OAAOd,YAAY;QAElE,MAAM4B,WAAWd,OAAOf,cAAc,GAAG2B;QACzC,MAAM9B,MAAMgC;QAEZ,6DAA6D;QAC7DnB,aAAaK;IACf,CAAC;IAED,qDAAqD;IACrD,iDAAiD;IACjD,MAAMe,aAAalB,CAAAA,SAASG,OAAOd,YAAY,AAAD,KAAKW;IACnDG,OAAOD,WAAW,IAAIgB;IAEtB,oCAAoC;IACpCf,OAAOP,YAAY,GAAG,IAAI;IAC1B,mDAAmD;IACnDO,OAAOZ,OAAO,CAAC4B,KAAK;AACtB,CAAC"}
|
package/dist/casing.d.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import type { Camelize, Snakelize } from '@discordeno/types';
|
|
2
|
-
export declare
|
|
3
|
-
export declare
|
|
2
|
+
export declare function camelize<T>(object: T): Camelize<T>;
|
|
3
|
+
export declare function snakelize<T>(object: T): Snakelize<T>;
|
|
4
4
|
export declare function snakeToCamelCase(str: string): string;
|
|
5
5
|
export declare function camelToSnakeCase(str: string): string;
|
|
6
6
|
//# sourceMappingURL=casing.d.ts.map
|
package/dist/casing.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"casing.d.ts","sourceRoot":"","sources":["../src/casing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE5D,
|
|
1
|
+
{"version":3,"file":"casing.d.ts","sourceRoot":"","sources":["../src/casing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE5D,wBAAgB,QAAQ,CAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAcnD;AAED,wBAAgB,SAAS,CAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAerD;AAED,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAepD;AAED,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAapD"}
|