tickets

5.5 KB

1. // lib/util.hl — small helpers every topic shares (env, storage path, URLs, lists, text checks, Vienna time).
2. // Statics only; no topic logic here.
3. import { env } from 'hl:proc'
4. import { timestamp } from 'hl:time'
6. // ---- env and storage -----------------------------------------------------------------------
7. static envOr = (name, fallback) => {
8. let v = env(name)
9. return v != null && v.trim() != '' ? v.trim() : fallback
10. }
12. // THE TABLE DIRECTORY of every hl:mpackdb table (storage/mpackdb/; TICKETS_STORAGE moves it — the gate runs on its
13. // own). Relative paths resolve against the ENTRY SCRIPT's directory (project.hl's) — tools must pass an absolute one.
14. static storageDir = env('TICKETS_STORAGE') != null ? env('TICKETS_STORAGE') : './storage/mpackdb'
16. // ---- the URLs a person uses ------------------------------------------------------------------
17. static ticketHref = (project, number) => { return '/projects/' + project + '/' + number }
18. static ticketApiHref = (project, number) => { return '/api/projects/' + project + '/tickets/' + number }
19. static projectHrefOf = (project) => { return '/projects/' + project }
20. static settingsHrefOf = (project) => { return '/projects/' + project + '/settings' }
22. // ---- lists and records -----------------------------------------------------------------------
23. // an empty list written to hl:mpackdb comes back as an empty hybrid (`.length` null):
24. // every read of a found list goes through here
25. static countOf = (list) => {
26. if (list == null) { return 0 }
27. let n = list.length
28. return n == null ? 0 : n
29. }
30. static first = (list) => { return countOf(list) > 0 ? list[0] : null }
32. // every record is written as a whole (hl:mpackdb's update replaces it)
33. static merged = (rec, changes) => {
34. let out = {}
35. for (k of rec.keys()) { out[k] = rec[k] }
36. for (k of changes.keys()) { out[k] = changes[k] }
37. return out
38. }
40. // insertion sorts (no list sort() in the language, hybriel #6) — stable; they sort their copy and return it
41. static oldestFirst = (rows, field) => {
42. let i = 1
43. while (i < rows.length) {
44. let cur = rows[i]
45. let j = i - 1
46. while (j >= 0 && rows[j][field] > cur[field]) {
47. rows[j + 1] = rows[j]
48. j = j - 1
49. }
50. rows[j + 1] = cur
51. i = i + 1
52. }
53. return rows
54. }
55. static newestFirst = (rows, field) => {
56. let i = 1
57. while (i < rows.length) {
58. let cur = rows[i]
59. let j = i - 1
60. while (j >= 0 && rows[j][field] < cur[field]) {
61. rows[j + 1] = rows[j]
62. j = j - 1
63. }
64. rows[j + 1] = cur
65. i = i + 1
66. }
67. return rows
68. }
70. // ---- text ---------------------------------------------------------------------------------------
71. static clean = (s) => { return s == null ? '' : ('' + s).trim() }
73. // a query value, percent-encoded (encodeURIComponent is a global, hybriel#14)
74. static encode = (s) => { return encodeURIComponent('' + s) }
76. // a string of ASCII digits only (a ticket number in a URL); '' is not
77. static isDigits = (s) => {
78. if (s == null) { return false }
79. let t = '' + s
80. if (t.length == 0 || t.length > 12) { return false }
81. let i = 0
82. while (i < t.length) {
83. let c = t.charCodeAt(i)
84. if (c < 48 || c > 57) { return false }
85. i = i + 1
86. }
87. return true
88. }
90. // only lowercase hex (ident's one-time codes are 48 hex)
91. static isHex = (s, max) => {
92. if (s == null || hlTypeName(s) != 'String' || s.length == 0 || s.length > max) { return false }
93. let i = 0
94. while (i < s.length) {
95. let c = s.charCodeAt(i)
96. if (!((c >= 48 && c <= 57) || (c >= 97 && c <= 102))) { return false }
97. i = i + 1
98. }
99. return true
100. }
102. // a short one-line text: trimmed, at most `max` characters, no control characters
103. static plainError = (s, max, what) => {
104. if (s == null || hlTypeName(s) != 'String') { return what + ' must be text' }
105. let t = s.trim()
106. if (t.length > max) { return what + ' is too long (at most ' + max + ' characters)' }
107. let i = 0
108. while (i < t.length) {
109. let c = t.charCodeAt(i)
110. if (c < 32 || c == 127) { return what + ' must be one line without control characters' }
111. i = i + 1
112. }
113. return null
114. }
116. // ---- time: epoch ms → "YYYY-MM-DD HH:MM" in Europe/Vienna (ticket #10) ---------------------------
117. // hl:time has no time zones (now() + a UTC timestamp() only; "timezones are a userland
118. // concern" — its header). This is the smallest correct userland rule for Vienna: the EU
119. // rule in force since 1996 — CEST (UTC+2) from the last Sunday of March 01:00 UTC to the
120. // last Sunday of October 01:00 UTC, CET (UTC+1) otherwise. Storage stays epoch ms (UTC);
121. // only the rendering shifts. Checked against node's Intl (tests/localtime.hl + the gate).
122. static DAY = 86400000
123. static HOUR = 3600000
125. // integer division for a >= 0 (the language has `%` but no floor in the core)
126. static idiv = (a, b) => { return (a - a % b) / b }
128. // days since 1970-01-01 of a civil date (H. Hinnant's days_from_civil, years >= 1970)
129. static daysFromCivil = (y, m, d) => {
130. let yy = m <= 2 ? y - 1 : y
131. let era = idiv(yy, 400)
132. let yoe = yy - era * 400
133. let mp = m > 2 ? m - 3 : m + 9
134. let doy = idiv(153 * mp + 2, 5) + d - 1
135. let doe = yoe * 365 + idiv(yoe, 4) - idiv(yoe, 100) + doy
136. return era * 146097 + doe - 719468
137. }
139. // the last Sunday of a 31-day month (March, October), 01:00 UTC, as epoch ms
140. static lastSundayAt1 = (y, m) => {
141. let days = daysFromCivil(y, m, 31)
142. let wd = (days + 4) % 7 // 0 = Sunday: 1970-01-01 was a Thursday
143. return (days - wd) * DAY + HOUR
144. }
146. static viennaOffset = (ms) => {
147. let y = toNumber(timestamp(ms).slice(0, 4))
148. return ms >= lastSundayAt1(y, 3) && ms < lastSundayAt1(y, 10) ? 2 * HOUR : HOUR
149. }
151. // "YYYY-MM-DD HH:MM", Vienna wall time — what a person reads
152. static localStamp = (ms) => {
153. let t = timestamp(ms + viennaOffset(ms))
154. return t.slice(0, 10) + ' ' + t.slice(11, 16)
155. }