dandri/Fermi
1
0
Fork 0
mirror of https://github.com/MathMan05/Fermi.git synced 2026-03-29 09:19:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

move the pollyfills

Browse Source
This commit is contained in:
MathMan05
2025-10-29 15:34:44 -05:00
parent 345d4535d3
commit 2d0591aba0
3 changed files with 40 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
src/webpage/favorites.ts
View File

@@ -38,44 +38,7 @@ type favandfreqimp = Omit<
| "heard_sound_frecency"
| "played_sound_frecency"
>;
Set.prototype.intersection ||= function <T>(set: Set<T>) {
const newSet = new Set();
for (const elm of this) {
if (set.has(elm)) {
newSet.add(elm);
}
}
return newSet;
};
Set.prototype.difference ||= function <T>(set: Set<T>) {
const newSet = new Set();
for (const elm of this) {
if (!set.has(elm)) {
newSet.add(elm);
}
}
return newSet;
};
Set.prototype.symmetricDifference ||= function <T>(set: Set<T>) {
const newSet = new Set();
for (const elm of this) {
if (!set.has(elm)) {
newSet.add(elm);
}
}
for (const elm of set) {
if (!this.has(elm)) {
newSet.add(elm);
}
}
return newSet;
};
Set.prototype.isDisjointFrom ||= function <T>(set: Set<T>) {
return this.symmetricDifference(set).size === 0;
};
Set.prototype.union ||= function <T>(set: Set<T>) {
return new Set([...this, ...set]);
};
export class Favorites {
owner: Localuser;
// ----- stuff that needs to store ----

1
src/webpage/index.ts
View File

@@ -6,6 +6,7 @@ import {MarkDown} from "./markdown.js";
import {Message} from "./message.js";
import {File} from "./file.js";
import {I18n} from "./i18n.js";
import "./utils/pollyfills.js";
if (window.location.pathname === "/app") {
window.location.pathname = "/channels/@me";
}

38
src/webpage/utils/pollyfills.ts Normal file
View File

@@ -0,0 +1,38 @@
Set.prototype.intersection ||= function <T>(set: Set<T>) {
const newSet = new Set();
for (const elm of this) {
if (set.has(elm)) {
newSet.add(elm);
}
}
return newSet;
};
Set.prototype.difference ||= function <T>(set: Set<T>) {
const newSet = new Set();
for (const elm of this) {
if (!set.has(elm)) {
newSet.add(elm);
}
}
return newSet;
};
Set.prototype.symmetricDifference ||= function <T>(set: Set<T>) {
const newSet = new Set();
for (const elm of this) {
if (!set.has(elm)) {
newSet.add(elm);
}
}
for (const elm of set) {
if (!this.has(elm)) {
newSet.add(elm);
}
}
return newSet;
};
Set.prototype.isDisjointFrom ||= function <T>(set: Set<T>) {
return this.symmetricDifference(set).size === 0;
};
Set.prototype.union ||= function <T>(set: Set<T>) {
return new Set([...this, ...set]);
};