| blob | c1a7a4d5842c908256ff8672fff2caa09fac6e21 |
1 # .tlv file generated by https://github.com/akkartik/teliva
2 # You may edit it if you are careful; however, you may see cryptic errors if you
3 # violate Teliva's assumptions.
4 #
5 # .tlv files are representations of Teliva programs. Teliva programs consist of
6 # sequences of definitions. Each definition is a table of key/value pairs. Keys
7 # and values are both strings.
8 #
9 # Lines in .tlv files always follow exactly one of the following forms:
10 # - comment lines at the top of the file starting with '#' at column 0
11 # - beginnings of definitions starting with '- ' at column 0, followed by a
12 # key/value pair
13 # - key/value pairs consisting of ' ' at column 0, containing either a
14 # spaceless value on the same line, or a multi-line value
15 # - multiline values indented by more than 2 spaces, starting with a '>'
16 #
17 # If these constraints are violated, Teliva may unceremoniously crash. Please
18 # report bugs at http://akkartik.name/contact
19 - __teliva_timestamp: original
20 str_helpers:
21 >-- some string helpers from http://lua-users.org/wiki/StringIndexing
22 >
23 >-- index characters using []
24 >getmetatable('').__index = function(str,i)
25 > if type(i) == 'number' then
26 > return str:sub(i,i)
27 > else
28 > return string[i]
29 > end
30 >end
31 >
32 >-- ranges using (), selected bytes using {}
33 >getmetatable('').__call = function(str,i,j)
34 > if type(i)~='table' then
35 > return str:sub(i,j)
36 > else
37 > local t={}
38 > for k,v in ipairs(i) do
39 > t[k]=str:sub(v,v)
40 > end
41 > return table.concat(t)
42 > end
43 >end
44 >
45 >-- iterate over an ordered sequence
46 >function q(x)
47 > if type(x) == 'string' then
48 > return x:gmatch('.')
49 > else
50 > return ipairs(x)
51 > end
52 >end
53 >
54 >-- insert within string
55 >function string.insert(str1, str2, pos)
56 > return str1:sub(1,pos)..str2..str1:sub(pos+1)
57 >end
58 >
59 >function string.remove(s, pos)
60 > return s:sub(1,pos-1)..s:sub(pos+1)
61 >end
62 >
63 >function string.pos(s, sub)
64 > return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
65 >end
66 >
67 >-- TODO: backport utf-8 support from Lua 5.3
68 - __teliva_timestamp: original
69 debugy:
70 >debugy = 5
71 - __teliva_timestamp: original
72 dbg:
73 >-- helper for debug by print; overlay debug information towards the right
74 >-- reset debugy every time you refresh screen
75 >function dbg(window, s)
76 > local oldy = 0
77 > local oldx = 0
78 > oldy, oldx = window:getyx()
79 > window:mvaddstr(debugy, 60, s)
80 > debugy = debugy+1
81 > window:mvaddstr(oldy, oldx, '')
82 >end
83 - __teliva_timestamp: original
84 check:
85 >function check(x, msg)
86 > if x then
87 > Window:addch('.')
88 > else
89 > print('F - '..msg)
90 > print(' '..str(x)..' is false/nil')
91 > teliva_num_test_failures = teliva_num_test_failures + 1
92 > -- overlay first test failure on editors
93 > if teliva_first_failure == nil then
94 > teliva_first_failure = msg
95 > end
96 > end
97 >end
98 - __teliva_timestamp: original
99 check_eq:
100 >function check_eq(x, expected, msg)
101 > if eq(x, expected) then
102 > Window:addch('.')
103 > else
104 > print('F - '..msg)
105 > print(' expected '..str(expected)..' but got '..str(x))
106 > teliva_num_test_failures = teliva_num_test_failures + 1
107 > -- overlay first test failure on editors
108 > if teliva_first_failure == nil then
109 > teliva_first_failure = msg
110 > end
111 > end
112 >end
113 - __teliva_timestamp: original
114 eq:
115 >function eq(a, b)
116 > if type(a) ~= type(b) then return false end
117 > if type(a) == 'table' then
118 > if #a ~= #b then return false end
119 > for k, v in pairs(a) do
120 > if b[k] ~= v then
121 > return false
122 > end
123 > end
124 > for k, v in pairs(b) do
125 > if a[k] ~= v then
126 > return false
127 > end
128 > end
129 > return true
130 > end
131 > return a == b
132 >end
133 - __teliva_timestamp: original
134 str:
135 >-- smarter tostring
136 >-- slow; used only for debugging
137 >function str(x)
138 > if type(x) == 'table' then
139 > local result = ''
140 > result = result..#x..'{'
141 > for k, v in pairs(x) do
142 > result = result..str(k)..'='..str(v)..', '
143 > end
144 > result = result..'}'
145 > return result
146 > elseif type(x) == 'string' then
147 > return '"'..x..'"'
148 > end
149 > return tostring(x)
150 >end
151 - __teliva_timestamp: original
152 find_index:
153 >function find_index(arr, x)
154 > for n, y in ipairs(arr) do
155 > if x == y then
156 > return n
157 > end
158 > end
159 >end
160 - __teliva_timestamp: original
161 trim:
162 >function trim(s)
163 > return s:gsub('^%s*', ''):gsub('%s*$', '')
164 >end
165 - __teliva_timestamp: original
166 split:
167 >function split(s, d)
168 > result = {}
169 > for match in (s..d):gmatch("(.-)"..d) do
170 > table.insert(result, match);
171 > end
172 > return result
173 >end
174 - __teliva_timestamp: original
175 map:
176 >-- only for arrays
177 >function map(l, f)
178 > result = {}
179 > for _, x in ipairs(l) do
180 > table.insert(result, f(x))
181 > end
182 > return result
183 >end
184 - __teliva_timestamp: original
185 reduce:
186 >-- only for arrays
187 >function reduce(l, f, init)
188 > result = init
189 > for _, x in ipairs(l) do
190 > result = f(result, x)
191 > end
192 > return result
193 >end
194 - __teliva_timestamp: original
195 filter:
196 >function filter(h, f)
197 > result = {}
198 > for k, v in pairs(h) do
199 > if f(k, v) then
200 > result[k] = v
201 > end
202 > end
203 > return result
204 >end
205 - __teliva_timestamp: original
206 ifilter:
207 >-- only for arrays
208 >function ifilter(l, f)
209 > result = {}
210 > for _, x in ipairs(l) do
211 > if f(x) then
212 > table.insert(result, x)
213 > end
214 > end
215 > return result
216 >end
217 - __teliva_timestamp: original
218 sort_letters:
219 >function sort_letters(s)
220 > tmp = {}
221 > for i=1,#s do
222 > table.insert(tmp, s[i])
223 > end
224 > table.sort(tmp)
225 > local result = ''
226 > for _, c in pairs(tmp) do
227 > result = result..c
228 > end
229 > return result
230 >end
231 >
232 >function test_sort_letters(s)
233 > check_eq(sort_letters(''), '', 'test_sort_letters: empty')
234 > check_eq(sort_letters('ba'), 'ab', 'test_sort_letters: non-empty')
235 > check_eq(sort_letters('abba'), 'aabb', 'test_sort_letters: duplicates')
236 >end
237 - __teliva_timestamp: original
238 count_letters:
239 >-- TODO: handle unicode
240 >function count_letters(s)
241 > local result = {}
242 > for i=1,s:len() do
243 > local c = s[i]
244 > if result[c] == nil then
245 > result[c] = 1
246 > else
247 > result[c] = result[c] + 1
248 > end
249 > end
250 > return result
251 >end
252 - __teliva_timestamp: original
253 count:
254 >-- turn an array of elements into a map from elements to their frequency
255 >-- analogous to count_letters for non-strings
256 >function count(a)
257 > local result = {}
258 > for i, v in ipairs(a) do
259 > if result[v] == nil then
260 > result[v] = 1
261 > else
262 > result[v] = result[v] + 1
263 > end
264 > end
265 > return result
266 >end
267 - __teliva_timestamp: original
268 union:
269 >function union(a, b)
270 > for k, v in pairs(b) do
271 > a[k] = v
272 > end
273 > return a
274 >end
275 - __teliva_timestamp: original
276 subtract:
277 >-- set subtraction
278 >function subtract(a, b)
279 > for k, v in pairs(b) do
280 > a[k] = nil
281 > end
282 > return a
283 >end
284 - __teliva_timestamp: original
285 all:
286 >-- universal quantifier on sets
287 >function all(s, f)
288 > for k, v in pairs(s) do
289 > if not f(k, v) then
290 > return false
291 > end
292 > end
293 > return true
294 >end
295 - __teliva_timestamp: original
296 to_array:
297 >-- turn a set into an array
298 >-- drops values
299 >function to_array(h)
300 > local result = {}
301 > for k, _ in pairs(h) do
302 > table.insert(result, k)
303 > end
304 > return result
305 >end
306 - __teliva_timestamp: original
307 append:
308 >-- concatenate list 'elems' into 'l', modifying 'l' in the process
309 >function append(l, elems)
310 > for i=1,#elems do
311 > table.insert(l, elems[i])
312 > end
313 >end
314 - __teliva_timestamp: original
315 prepend:
316 >-- concatenate list 'elems' into the start of 'l', modifying 'l' in the process
317 >function prepend(l, elems)
318 > for i=1,#elems do
319 > table.insert(l, i, elems[i])
320 > end
321 >end
322 - __teliva_timestamp: original
323 all_but:
324 >function all_but(x, idx)
325 > if type(x) == 'table' then
326 > local result = {}
327 > for i, elem in ipairs(x) do
328 > if i ~= idx then
329 > table.insert(result,elem)
330 > end
331 > end
332 > return result
333 > elseif type(x) == 'string' then
334 > if idx < 1 then return x:sub(1) end
335 > return x:sub(1, idx-1) .. x:sub(idx+1)
336 > else
337 > error('all_but: unsupported type '..type(x))
338 > end
339 >end
340 >
341 >function test_all_but()
342 > check_eq(all_but('', 0), '', 'all_but: empty')
343 > check_eq(all_but('abc', 0), 'abc', 'all_but: invalid low index')
344 > check_eq(all_but('abc', 4), 'abc', 'all_but: invalid high index')
345 > check_eq(all_but('abc', 1), 'bc', 'all_but: first index')
346 > check_eq(all_but('abc', 3), 'ab', 'all_but: final index')
347 > check_eq(all_but('abc', 2), 'ac', 'all_but: middle index')
348 >end
349 - __teliva_timestamp: original
350 set:
351 >function set(l)
352 > local result = {}
353 > for i, elem in ipairs(l) do
354 > result[elem] = true
355 > end
356 > return result
357 >end
358 - __teliva_timestamp: original
359 set_eq:
360 >function set_eq(l1, l2)
361 > return eq(set(l1), set(l2))
362 >end
363 >
364 >function test_set_eq()
365 > check(set_eq({1}, {1}), 'set_eq: identical')
366 > check(not set_eq({1, 2}, {1, 3}), 'set_eq: different')
367 > check(set_eq({1, 2}, {2, 1}), 'set_eq: order')
368 > check(set_eq({1, 2, 2}, {2, 1}), 'set_eq: duplicates')
369 >end
370 - __teliva_timestamp: original
371 clear:
372 >function clear(lines)
373 > while #lines > 0 do
374 > table.remove(lines)
375 > end
376 >end
377 - __teliva_timestamp: original
378 zap:
379 >function zap(target, src)
380 > clear(target)
381 > append(target, src)
382 >end
383 - __teliva_timestamp: original
384 mfactorial:
385 >-- memoized version of factorial
386 >-- doesn't memoize recursive calls, but may be good enough
387 >mfactorial = memo1(factorial)
388 - __teliva_timestamp: original
389 factorial:
390 >function factorial(n)
391 > local result = 1
392 > for i=1,n do
393 > result = result*i
394 > end
395 > return result
396 >end
397 - __teliva_timestamp: original
398 memo1:
399 >-- a higher-order function that takes a function of a single arg
400 >-- (that never returns nil)
401 >-- and returns a memoized version of it
402 >function memo1(f)
403 > local memo = {}
404 > return function(x)
405 > if memo[x] == nil then
406 > memo[x] = f(x)
407 > end
408 > return memo[x]
409 > end
410 >end
411 >
412 >-- mfactorial doesn't seem noticeably faster
413 >function test_memo1()
414 > for i=0,30 do
415 > check_eq(mfactorial(i), factorial(i), 'memo1 over factorial: '..str(i))
416 > end
417 >end
418 - __teliva_timestamp: original
419 num_permutations:
420 >-- number of permutations of n distinct objects, taken r at a time
421 >function num_permutations(n, r)
422 > return factorial(n)/factorial(n-r)
423 >end
424 >
425 >-- mfactorial doesn't seem noticeably faster
426 >function test_memo1()
427 > for i=0,30 do
428 > for j=0,i do
429 > check_eq(num_permutations(i, j), mfactorial(i)/mfactorial(i-j), 'num_permutations memoizes: '..str(i)..'P'..str(j))
430 > end
431 > end
432 >end
433 - __teliva_timestamp: original
434 menu:
435 >-- To show app-specific hotkeys in the menu bar, add hotkey/command
436 >-- arrays of strings to the menu array.
437 >menu = {
438 > {'^h', 'backspace'},
439 >}
440 - __teliva_timestamp: original
441 Window:
442 >Window = curses.stdscr()
443 - __teliva_timestamp: original
444 doc:blurb:
445 >Show all anagrams of a given word
446 - __teliva_timestamp: original
447 word:
448 >word = ''
449 - __teliva_timestamp: original
450 cursor:
451 >cursor = 1
452 - __teliva_timestamp: original
453 main:
454 >function main()
455 > Window:nodelay(true)
456 > while true do
457 > render(Window)
458 > update(Window)
459 > end
460 >end
461 - __teliva_timestamp: original
462 update:
463 >function update(window)
464 > local key
465 > while true do
466 > key = window:getch()
467 > if key then break end
468 > end
469 > if key == curses.KEY_LEFT then
470 > if cursor > 1 then
471 > cursor = cursor-1
472 > end
473 > elseif key == curses.KEY_RIGHT then
474 > if cursor <= #word then
475 > cursor = cursor+1
476 > end
477 > elseif key == curses.KEY_BACKSPACE or key == 8 or key == 127 then -- ctrl-h, ctrl-?, delete
478 > if cursor > 1 then
479 > cursor = cursor-1
480 > word = word:remove(cursor)
481 > end
482 > elseif key >= 32 and key < 127 then
483 > word = word:insert(string.char(key), cursor-1)
484 > cursor = cursor+1
485 > end
486 >end
487 - __teliva_timestamp: original
488 render:
489 >function render(window)
490 > window:clear()
491 >
492 > local prompt_str = ' what is your name? '
493 > window:attron(curses.A_REVERSE)
494 > window:mvaddstr(0, 0, prompt_str)
495 > window:attroff(curses.A_REVERSE)
496 > window:addstr(' ')
497 > window:attron(curses.A_BOLD)
498 > window:addstr(word)
499 > window:attroff(curses.A_BOLD)
500 > window:mvaddstr(2, 0, '')
501 > local results = anagrams(word)
502 > if #results > 0 then
503 > window:attron(curses.A_REVERSE)
504 > print(#results..' anagrams')
505 > window:attroff(curses.A_REVERSE)
506 > for i, w in ipairs(results) do
507 > window:addstr(w)
508 > window:addstr(' ')
509 > end
510 > end
511 >
512 > window:mvaddstr(0, string.len(prompt_str)+cursor, '')
513 > window:refresh()
514 >end
515 - __teliva_timestamp:
516 >Mon Feb 21 17:42:28 2022
517 anagrams:
518 >function anagrams(word)
519 > return gather(sort_letters(word))
520 >end
521 - __teliva_timestamp:
522 >Mon Feb 21 18:18:07 2022
523 gather:
524 >function gather(s)
525 > if s == '' then return {} end
526 > local result = {}
527 > for i=1, #s do
528 > if i == 1 or s[i] ~= s[i-1] then
529 > append(result, combine(s[i], gather(all_but(s, i))))
530 > end
531 > end
532 > return result
533 >end
534 - __teliva_timestamp: original
535 __teliva_note:
536 >basic version
537 combine:
538 >-- return 'l' with each element prefixed with 'prefix'
539 >function combine(prefix, l)
540 > if #l == 0 then return {prefix} end
541 > local result = {}
542 > for _, elem in ipairs(l) do
543 > table.insert(result, prefix..elem)
544 > end
545 > return result
546 >end
547 >
548 >function test_combine()
549 > check_eq(combine('abc', {}), {'abc'}, 'test_combine: empty list')
550 >end
551 - __teliva_timestamp:
552 >Sat Mar 5 15:24:00 2022
553 count_anagrams:
554 >function count_anagrams(s)
555 > local result = factorial(s:len())
556 > local letter_counts = count_letters(s)
557 > for l, cnt in pairs(letter_counts) do
558 > result = result / factorial(cnt)
559 > end
560 > return result
561 >end
562 - __teliva_timestamp:
563 >Sat Mar 5 15:53:23 2022
564 key_pressed:
565 >-- only works when nodelay (non-blocking keyboard)
566 >function key_pressed(window)
567 > local c = window:getch()
568 > if c == nil then return false end
569 > window:ungetch(c)
570 > return true
571 >end
572 - __teliva_timestamp:
573 >Sat Mar 5 15:55:34 2022
574 render:
575 >function render(window)
576 > window:clear()
577 >
578 > local prompt_str = ' what is your name? '
579 > window:attron(curses.A_REVERSE)
580 > window:mvaddstr(0, 0, prompt_str)
581 > window:attroff(curses.A_REVERSE)
582 > window:addstr(' ')
583 > window:attron(curses.A_BOLD)
584 > window:addstr(word)
585 > window:attroff(curses.A_BOLD)
586 > window:mvaddstr(2, 0, '')
587 > if #word > 0 then
588 > local num_anagrams = count_anagrams(word)
589 > window:attron(curses.A_REVERSE)
590 > print(num_anagrams..' anagrams')
591 > window:attroff(curses.A_REVERSE)
592 > local results = anagrams(word)
593 > if results == nil then -- interrupted
594 > window:addstr('...')
595 > else
596 > assert(#results == num_anagrams, "something's wrong; the count is unexpected")
597 > for i, w in ipairs(results) do
598 > window:addstr(w)
599 > window:addstr(' ')
600 > if key_pressed(window) then
601 > break
602 > end
603 > end
604 > end
605 > end
606 >
607 > window:mvaddstr(0, string.len(prompt_str)+cursor, '')
608 > window:refresh()
609 >end
610 - __teliva_timestamp:
611 >Sat Mar 5 15:56:35 2022
612 __teliva_note:
613 >restart computation when a key is pressed
614 gather:
615 >-- return a list of unique permutations of a sorted string 's'
616 >-- the letters in 's' must be in alphabetical order, so that duplicates are adjacent
617 >-- this function can take a long time for long strings, so we make it interruptible
618 >-- if a key is pressed, it returns nil
619 >-- since it's recursive, we also need to handle recursive calls returning nil
620 >function gather(s)
621 > if s == '' then return {} end
622 > local result = {}
623 > for i=1, #s do
624 > if i == 1 or s[i] ~= s[i-1] then
625 > local subresult = gather(all_but(s, i))
626 > if subresult == nil then return nil end -- interrupted
627 > append(result, combine(s[i], subresult))
628 > end
629 > if key_pressed(Window) then return nil end -- interrupted
630 > end
631 > return result
632 >end