@genome-spy/app 0.72.0 → 0.74.0
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/LICENSE +1 -1
- package/dist/AbortablePromiseCache-3gHJdF3E.js +96 -0
- package/dist/blosc-oa0DlI6G.js +692 -0
- package/dist/browser-Dvlo92rx.js +126 -0
- package/dist/chunk-CPXzm0be.js +11 -0
- package/dist/chunk-INHXZS53-fPMmEwMt.js +13 -0
- package/dist/esm-B8-vSu-c.js +369 -0
- package/dist/esm-BDFRLEuD.js +1248 -0
- package/dist/esm-BygJiwh0.js +573 -0
- package/dist/esm-CGX-qz1d.js +155 -0
- package/dist/esm-Cmo4qEPr.js +1015 -0
- package/dist/esm-CuMSzCHy.js +298 -0
- package/dist/esm-D-WfYOx7.js +461 -0
- package/dist/esm-DCCYNvaz.js +1426 -0
- package/dist/esm-n0auOe11.js +121 -0
- package/dist/index.es.js +41053 -51422
- package/dist/index.js +1100 -1095
- package/dist/lz4-jZ0zyLBa.js +626 -0
- package/dist/parquetRead-CJe1UPsz.js +1609 -0
- package/dist/schema.json +11254 -4920
- package/dist/style.css +2 -1
- package/dist/zstd-C6ksIG9r.js +583 -0
- package/package.json +14 -5
- package/dist/AbortablePromiseCache-Dj0vzLnp.js +0 -149
- package/dist/blosc-D1xNXZJs.js +0 -719
- package/dist/browser-0iNU5Wit.js +0 -138
- package/dist/chunk-INHXZS53-DiyuLb3Z.js +0 -14
- package/dist/index-BUsSzlHg.js +0 -1771
- package/dist/index-BYsZN7b0.js +0 -1597
- package/dist/index-C7wOh6y1.js +0 -657
- package/dist/index-CRaQAuki.js +0 -326
- package/dist/index-D9v1PCj9.js +0 -507
- package/dist/index-GDOuv_D5.js +0 -266
- package/dist/index-Gt44EOIH.js +0 -628
- package/dist/inflate-GtwLkvSP.js +0 -1048
- package/dist/lz4-1Ws5oVWR.js +0 -640
- package/dist/parquetRead-BnAGCa4_.js +0 -1663
- package/dist/unzip-Bac01w6X.js +0 -1492
- package/dist/zstd-C4EcZnjq.js +0 -603
|
@@ -0,0 +1,298 @@
|
|
|
1
|
+
//#region ../../node_modules/gff-nostream/esm/util.js
|
|
2
|
+
var e = {};
|
|
3
|
+
for (let t = 0; t < 256; t++) {
|
|
4
|
+
let n = t.toString(16).toUpperCase().padStart(2, "0");
|
|
5
|
+
e[n] = String.fromCharCode(t), e[n.toLowerCase()] = String.fromCharCode(t);
|
|
6
|
+
}
|
|
7
|
+
function t(t) {
|
|
8
|
+
let n = t.indexOf("%");
|
|
9
|
+
if (n === -1) return t;
|
|
10
|
+
let r = "", i = 0, a = n;
|
|
11
|
+
for (; a < t.length;) if (t[a] === "%" && a + 2 < t.length) {
|
|
12
|
+
r += t.slice(i, a);
|
|
13
|
+
let n = e[t.slice(a + 1, a + 3)];
|
|
14
|
+
n === void 0 ? r += t.slice(a, a + 3) : r += n, a += 3, i = a;
|
|
15
|
+
} else a++;
|
|
16
|
+
return r + t.slice(i);
|
|
17
|
+
}
|
|
18
|
+
function n(e) {
|
|
19
|
+
if (e.length === 0 || e === ".") return {};
|
|
20
|
+
let n = {}, r = e.length;
|
|
21
|
+
e[r - 1] === "\n" && (r = e[r - 2] === "\r" ? r - 2 : r - 1, e = e.slice(0, r));
|
|
22
|
+
let i = 0;
|
|
23
|
+
for (; i < r;) {
|
|
24
|
+
let a = e.indexOf(";", i);
|
|
25
|
+
if (a === -1 && (a = r), a > i) {
|
|
26
|
+
let r = e.indexOf("=", i);
|
|
27
|
+
if (r !== -1 && r < a && r + 1 < a) {
|
|
28
|
+
let o = e.slice(i, r), s = n[o];
|
|
29
|
+
s || (s = [], n[o] = s);
|
|
30
|
+
let c = r + 1;
|
|
31
|
+
for (; c < a;) {
|
|
32
|
+
let n = e.indexOf(",", c);
|
|
33
|
+
if ((n === -1 || n > a) && (n = a), n > c) {
|
|
34
|
+
let r = e.slice(c, n);
|
|
35
|
+
s.push(t(r));
|
|
36
|
+
}
|
|
37
|
+
c = n + 1;
|
|
38
|
+
}
|
|
39
|
+
}
|
|
40
|
+
}
|
|
41
|
+
i = a + 1;
|
|
42
|
+
}
|
|
43
|
+
return n;
|
|
44
|
+
}
|
|
45
|
+
function r(e) {
|
|
46
|
+
if (e.length === 0 || e === ".") return {};
|
|
47
|
+
let t = {}, n = e.length;
|
|
48
|
+
e[n - 1] === "\n" && (n = e[n - 2] === "\r" ? n - 2 : n - 1, e = e.slice(0, n));
|
|
49
|
+
let r = 0;
|
|
50
|
+
for (; r < n;) {
|
|
51
|
+
let i = e.indexOf(";", r);
|
|
52
|
+
if (i === -1 && (i = n), i > r) {
|
|
53
|
+
let n = e.indexOf("=", r);
|
|
54
|
+
if (n !== -1 && n < i && n + 1 < i) {
|
|
55
|
+
let a = e.slice(r, n), o = t[a];
|
|
56
|
+
o || (o = [], t[a] = o);
|
|
57
|
+
let s = n + 1;
|
|
58
|
+
for (; s < i;) {
|
|
59
|
+
let t = e.indexOf(",", s);
|
|
60
|
+
(t === -1 || t > i) && (t = i), t > s && o.push(e.slice(s, t)), s = t + 1;
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
}
|
|
64
|
+
r = i + 1;
|
|
65
|
+
}
|
|
66
|
+
return t;
|
|
67
|
+
}
|
|
68
|
+
function i(e) {
|
|
69
|
+
return e.length === 0 || e === "." ? null : t(e);
|
|
70
|
+
}
|
|
71
|
+
function a(e) {
|
|
72
|
+
return e.length === 0 || e === "." ? null : e;
|
|
73
|
+
}
|
|
74
|
+
function o(e) {
|
|
75
|
+
let t = e.split(" "), r = t[0], o = t[1], s = t[2], c = t[3], l = t[4], u = t[5], d = t[6], f = t[7], p = t[8];
|
|
76
|
+
return {
|
|
77
|
+
seq_id: i(r),
|
|
78
|
+
source: i(o),
|
|
79
|
+
type: i(s),
|
|
80
|
+
start: c.length === 0 || c === "." ? null : +c,
|
|
81
|
+
end: l.length === 0 || l === "." ? null : +l,
|
|
82
|
+
score: u.length === 0 || u === "." ? null : +u,
|
|
83
|
+
strand: a(d),
|
|
84
|
+
phase: a(f),
|
|
85
|
+
attributes: p.length === 0 || p === "." ? null : n(p)
|
|
86
|
+
};
|
|
87
|
+
}
|
|
88
|
+
function s(e) {
|
|
89
|
+
let t = e.split(" "), n = t[0], i = t[1], o = t[2], s = t[3], c = t[4], l = t[5], u = t[6], d = t[7], f = t[8];
|
|
90
|
+
return {
|
|
91
|
+
seq_id: a(n),
|
|
92
|
+
source: a(i),
|
|
93
|
+
type: a(o),
|
|
94
|
+
start: s.length === 0 || s === "." ? null : +s,
|
|
95
|
+
end: c.length === 0 || c === "." ? null : +c,
|
|
96
|
+
score: l.length === 0 || l === "." ? null : +l,
|
|
97
|
+
strand: a(u),
|
|
98
|
+
phase: a(d),
|
|
99
|
+
attributes: f.length === 0 || f === "." ? null : r(f)
|
|
100
|
+
};
|
|
101
|
+
}
|
|
102
|
+
var c = new Set([
|
|
103
|
+
"start",
|
|
104
|
+
"end",
|
|
105
|
+
"seq_id",
|
|
106
|
+
"score",
|
|
107
|
+
"type",
|
|
108
|
+
"source",
|
|
109
|
+
"phase",
|
|
110
|
+
"strand"
|
|
111
|
+
]);
|
|
112
|
+
function l(e) {
|
|
113
|
+
if (e === "+") return 1;
|
|
114
|
+
if (e === "-") return -1;
|
|
115
|
+
if (e === ".") return 0;
|
|
116
|
+
}
|
|
117
|
+
function u(e, n) {
|
|
118
|
+
if (e.length === 0 || e === ".") return;
|
|
119
|
+
let r = e.length;
|
|
120
|
+
e[r - 1] === "\n" && (r = e[r - 2] === "\r" ? r - 2 : r - 1, e = e.slice(0, r));
|
|
121
|
+
let i = 0;
|
|
122
|
+
for (; i < r;) {
|
|
123
|
+
let a = e.indexOf(";", i);
|
|
124
|
+
if (a === -1 && (a = r), a > i) {
|
|
125
|
+
let r = e.indexOf("=", i);
|
|
126
|
+
if (r !== -1 && r < a && r + 1 < a) {
|
|
127
|
+
let o = e.slice(i, r);
|
|
128
|
+
if (o === "_lineHash") {
|
|
129
|
+
i = a + 1;
|
|
130
|
+
continue;
|
|
131
|
+
}
|
|
132
|
+
let s = o.toLowerCase();
|
|
133
|
+
c.has(s) && (s += "2");
|
|
134
|
+
let l = [], u = r + 1;
|
|
135
|
+
for (; u < a;) {
|
|
136
|
+
let n = e.indexOf(",", u);
|
|
137
|
+
if ((n === -1 || n > a) && (n = a), n > u) {
|
|
138
|
+
let r = e.slice(u, n);
|
|
139
|
+
l.push(t(r));
|
|
140
|
+
}
|
|
141
|
+
u = n + 1;
|
|
142
|
+
}
|
|
143
|
+
n[s] = l.length === 1 ? l[0] : l;
|
|
144
|
+
}
|
|
145
|
+
}
|
|
146
|
+
i = a + 1;
|
|
147
|
+
}
|
|
148
|
+
}
|
|
149
|
+
function d(e, t) {
|
|
150
|
+
if (e.length === 0 || e === ".") return;
|
|
151
|
+
let n = e.length;
|
|
152
|
+
e[n - 1] === "\n" && (n = e[n - 2] === "\r" ? n - 2 : n - 1, e = e.slice(0, n));
|
|
153
|
+
let r = 0;
|
|
154
|
+
for (; r < n;) {
|
|
155
|
+
let i = e.indexOf(";", r);
|
|
156
|
+
if (i === -1 && (i = n), i > r) {
|
|
157
|
+
let n = e.indexOf("=", r);
|
|
158
|
+
if (n !== -1 && n < i && n + 1 < i) {
|
|
159
|
+
let a = e.slice(r, n);
|
|
160
|
+
if (a === "_lineHash") {
|
|
161
|
+
r = i + 1;
|
|
162
|
+
continue;
|
|
163
|
+
}
|
|
164
|
+
let o = a.toLowerCase();
|
|
165
|
+
c.has(o) && (o += "2");
|
|
166
|
+
let s = [], l = n + 1;
|
|
167
|
+
for (; l < i;) {
|
|
168
|
+
let t = e.indexOf(",", l);
|
|
169
|
+
(t === -1 || t > i) && (t = i), t > l && s.push(e.slice(l, t)), l = t + 1;
|
|
170
|
+
}
|
|
171
|
+
t[o] = s.length === 1 ? s[0] : s;
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
r = i + 1;
|
|
175
|
+
}
|
|
176
|
+
}
|
|
177
|
+
function f(e) {
|
|
178
|
+
let n = e.split(" "), r = n[0], i = n[1], a = n[2], o = n[3], s = n[4], c = n[5], d = n[6], f = n[7], p = n[8], m = {
|
|
179
|
+
refName: r.length === 0 || r === "." ? "" : t(r),
|
|
180
|
+
source: i.length === 0 || i === "." ? null : t(i),
|
|
181
|
+
type: a.length === 0 || a === "." ? null : t(a),
|
|
182
|
+
start: o.length === 0 || o === "." ? 0 : o - 1,
|
|
183
|
+
end: s.length === 0 || s === "." ? 0 : +s,
|
|
184
|
+
score: c.length === 0 || c === "." ? void 0 : +c,
|
|
185
|
+
strand: l(d),
|
|
186
|
+
phase: f.length === 0 || f === "." ? void 0 : +f,
|
|
187
|
+
subfeatures: []
|
|
188
|
+
};
|
|
189
|
+
return u(p, m), m;
|
|
190
|
+
}
|
|
191
|
+
function p(e) {
|
|
192
|
+
let t = e.split(" "), n = t[0], r = t[1], i = t[2], a = t[3], o = t[4], s = t[5], c = t[6], u = t[7], f = t[8], p = {
|
|
193
|
+
refName: n.length === 0 || n === "." ? "" : n,
|
|
194
|
+
source: r.length === 0 || r === "." ? null : r,
|
|
195
|
+
type: i.length === 0 || i === "." ? null : i,
|
|
196
|
+
start: a.length === 0 || a === "." ? 0 : a - 1,
|
|
197
|
+
end: o.length === 0 || o === "." ? 0 : +o,
|
|
198
|
+
score: s.length === 0 || s === "." ? void 0 : +s,
|
|
199
|
+
strand: l(c),
|
|
200
|
+
phase: u.length === 0 || u === "." ? void 0 : +u,
|
|
201
|
+
subfeatures: []
|
|
202
|
+
};
|
|
203
|
+
return d(f, p), p;
|
|
204
|
+
}
|
|
205
|
+
//#endregion
|
|
206
|
+
//#region ../../node_modules/gff-nostream/esm/api.js
|
|
207
|
+
function m(e) {
|
|
208
|
+
return _(g(e));
|
|
209
|
+
}
|
|
210
|
+
function h(e) {
|
|
211
|
+
return v(g(e));
|
|
212
|
+
}
|
|
213
|
+
function g(e) {
|
|
214
|
+
let t = e.split(/\r?\n/), n = [];
|
|
215
|
+
for (let e = 0; e < t.length; e++) {
|
|
216
|
+
let r = t[e];
|
|
217
|
+
if (r.length === 0 || r[0] === "#") {
|
|
218
|
+
if (r.startsWith("##FASTA")) break;
|
|
219
|
+
continue;
|
|
220
|
+
}
|
|
221
|
+
if (r[0] === ">") break;
|
|
222
|
+
n.push({
|
|
223
|
+
line: r,
|
|
224
|
+
start: 0,
|
|
225
|
+
end: 0,
|
|
226
|
+
hasEscapes: r.includes("%")
|
|
227
|
+
});
|
|
228
|
+
}
|
|
229
|
+
return n;
|
|
230
|
+
}
|
|
231
|
+
function _(e) {
|
|
232
|
+
let t = [], n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
|
|
233
|
+
for (let i = 0; i < e.length; i++) {
|
|
234
|
+
let a = e[i], c = a.hasEscapes ? o(a.line) : s(a.line);
|
|
235
|
+
c.child_features = [], c.derived_features = [], a.lineHash !== void 0 && (c.attributes ||= {}, c.attributes._lineHash = [String(a.lineHash)]);
|
|
236
|
+
let l = c.attributes, u = l?.ID, d = l?.Parent;
|
|
237
|
+
if (!u && !d) {
|
|
238
|
+
t.push([c]);
|
|
239
|
+
continue;
|
|
240
|
+
}
|
|
241
|
+
let f;
|
|
242
|
+
if (u) {
|
|
243
|
+
let e = u[0], i = n.get(e);
|
|
244
|
+
if (i) i.push(c), f = i;
|
|
245
|
+
else {
|
|
246
|
+
f = [c], d || t.push(f), n.set(e, f);
|
|
247
|
+
let i = r.get(e);
|
|
248
|
+
if (i) {
|
|
249
|
+
for (let e = 0; e < i.length; e++) c.child_features.push(i[e]);
|
|
250
|
+
r.delete(e);
|
|
251
|
+
}
|
|
252
|
+
}
|
|
253
|
+
} else f = [c];
|
|
254
|
+
if (d) for (let e = 0; e < d.length; e++) {
|
|
255
|
+
let t = d[e], i = n.get(t);
|
|
256
|
+
if (i) for (let e = 0; e < i.length; e++) i[e].child_features.push(f);
|
|
257
|
+
else {
|
|
258
|
+
let e = r.get(t);
|
|
259
|
+
e || (e = [], r.set(t, e)), e.push(f);
|
|
260
|
+
}
|
|
261
|
+
}
|
|
262
|
+
}
|
|
263
|
+
return t;
|
|
264
|
+
}
|
|
265
|
+
function v(e) {
|
|
266
|
+
let t = [], n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
|
|
267
|
+
for (let i = 0; i < e.length; i++) {
|
|
268
|
+
let a = e[i], o = a.hasEscapes ? f(a.line) : p(a.line);
|
|
269
|
+
a.lineHash !== void 0 && (o._lineHash = String(a.lineHash));
|
|
270
|
+
let s = o.id, c = o.parent;
|
|
271
|
+
if (!s && !c) {
|
|
272
|
+
t.push(o);
|
|
273
|
+
continue;
|
|
274
|
+
}
|
|
275
|
+
if (s && !n.get(s)) {
|
|
276
|
+
c || t.push(o), n.set(s, o);
|
|
277
|
+
let e = r.get(s);
|
|
278
|
+
if (e) {
|
|
279
|
+
for (let t = 0; t < e.length; t++) o.subfeatures.push(e[t]);
|
|
280
|
+
r.delete(s);
|
|
281
|
+
}
|
|
282
|
+
}
|
|
283
|
+
if (c) {
|
|
284
|
+
let e = Array.isArray(c) ? c : [c];
|
|
285
|
+
for (let t = 0; t < e.length; t++) {
|
|
286
|
+
let i = e[t], a = n.get(i);
|
|
287
|
+
if (a) a.subfeatures.push(o);
|
|
288
|
+
else {
|
|
289
|
+
let e = r.get(i);
|
|
290
|
+
e || (e = [], r.set(i, e)), e.push(o);
|
|
291
|
+
}
|
|
292
|
+
}
|
|
293
|
+
}
|
|
294
|
+
}
|
|
295
|
+
return t;
|
|
296
|
+
}
|
|
297
|
+
//#endregion
|
|
298
|
+
export { _ as parseRecords, v as parseRecordsJBrowse, m as parseStringSync, h as parseStringSyncJBrowse };
|