tracker

3.2 KB

1. // lib/util.hl — small helpers every topic shares (env, paths, dates, lists, text), each ONCE (mission 028: they were copied
2. // into follows, users, shows, watches, tmdbsync, catalog, franchises, details, people, merge, search, shortids).
3. import { env } from 'hl:proc'
4. import { now, timestamp } from 'hl:time'
5. import { randomBytes } from 'hl:crypto'
7. // an environment value, trimmed — `fallback` when it is not set or empty
8. static envOr = (&name, &fallback) => {
9. v = env(name)
10. return v != null && v.trim() != '' ? v.trim() : fallback
11. }
12. // every table and file of the app's data: TRACKER_STORAGE, else storage/mpackdb beside project.hl (relative paths resolve
13. // against the ENTRY script)
14. static storageDir = envOr('TRACKER_STORAGE', './storage/mpackdb')
15. // the image files: a title's poster (tmdb.hl syncPoster) and a person's photo (people.hl syncProfile), served by images.hl
16. static postersDir = storageDir + '/posters'
17. static profilesDir = storageDir + '/profiles'
19. // a new record id: 16 hex (self-assigned — hl:mpackdb's own generated @id can repeat within one millisecond, hybriel#113)
20. static newId = () => { return randomBytes(8, 'hex') }
21. static hexDigits = '0123456789abcdef'
23. // today as 'YYYY-MM-DD' (UTC, like the rest of the app — hl:time has no time zones)
24. static todayStr = () => { return timestamp(now()).slice(0, 10) }
25. // a stored date ('YYYY-MM-DD…') or '' when it is none
26. static dateOr = (&v) => { return v != null && hlTypeName(v) == 'String' && v.length >= 4 ? v : '' }
28. // a text value or null when it is none or only white space (the value itself, not trimmed)
29. static textOr = (&v) => { return v != null && hlTypeName(v) == 'String' && v.trim() != '' ? v : null }
30. // an id (a string or a number) that is there
31. static hasId = (&v) => { return v != null && ('' + v).trim() != '' }
33. static listOr = (&v) => { return v == null ? [] : v }
34. static countOfList = (&list) => {
35. if (list == null) { return 0 }
36. n = list.length
37. return n == null ? 0 : n
38. }
39. static firstOf = (&list) => { return countOfList(list) > 0 ? list[0] : null }
41. // ---- sorting, hand-written (no list sort(), hybriel#1): a bottom-up merge sort of { key, … }, newest (largest) key first,
42. // stable — the public lists (catalog.hl), a person's filmography and /people (people.hl). Tracker#37 (mission 032): it starts
43. // from the runs that are already in order (not from single entries) — same result, but a list that is nearly sorted (/people:
44. // 105k people, 3 runs) costs one merge pass: 0.15 s instead of 1.6 s on the live copy
45. static mergeDesc = (&a, &b) => {
46. out = []
47. let i = 0
48. let j = 0
49. while (i < a.length && j < b.length) {
50. if (b[j].key > a[i].key) { out.push(b[j]) j = j + 1 } else { out.push(a[i]) i = i + 1 }
51. }
52. while (i < a.length) { out.push(a[i]) i = i + 1 }
53. while (j < b.length) { out.push(b[j]) j = j + 1 }
54. return out
55. }
56. static sortDesc = (&list) => {
57. if (list.length == 0) { return [] }
58. let runs = []
59. let run = []
60. for (x of list) {
61. if (run.length > 0 && x.key > run[run.length - 1].key) { runs.push(run) run = [] }
62. run.push(x)
63. }
64. runs.push(run)
65. while (runs.length > 1) {
66. let next = []
67. let k = 0
68. while (k + 1 < runs.length) { next.push(mergeDesc(runs[k], runs[k + 1])) k = k + 2 }
69. if (k < runs.length) { next.push(runs[k]) }
70. runs = next
71. }
72. return runs[0]
73. }