1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
;;; tissue --- Text based issue tracker
;;; Copyright © 2022, 2023 Arun Isaac <arunisaac@systemreboot.net>
;;;
;;; This file is part of tissue.
;;;
;;; tissue is free software: you can redistribute it and/or modify it
;;; under the terms of the GNU General Public License as published by
;;; the Free Software Foundation, either version 3 of the License, or
;;; (at your option) any later version.
;;;
;;; tissue is distributed in the hope that it will be useful, but
;;; WITHOUT ANY WARRANTY; without even the implied warranty of
;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
;;; General Public License for more details.
;;;
;;; You should have received a copy of the GNU General Public License
;;; along with tissue. If not, see <https://www.gnu.org/licenses/>.
(import (rnrs hashtables)
(srfi srfi-64)
(srfi srfi-71)
(ice-9 match)
(tissue issue))
(define hashtable-prepend!
(@@ (tissue issue) hashtable-prepend!))
(define list-line->alist
(@@ (tissue issue) list-line->alist))
(define file-details
(@@ (tissue issue) file-details))
(define (hashtable->alist hashtable)
"Convert @var{hashtable} to association list with keys sorted as
strings."
(let ((keys values (hashtable-entries hashtable)))
(sort (map cons
(vector->list keys)
(vector->list values))
(match-lambda*
(((key1 . _) (key2 . _))
(let ((maybe-symbol->string (lambda (x)
(if (symbol? x)
(symbol->string x)
x))))
(string<? (maybe-symbol->string key1)
(maybe-symbol->string key2))))))))
(test-begin "issue")
(test-equal "Parse list line with multiple key-value pairs"
'((status "unclear")
(keywords "dangerous feature" "ui"))
(list-line->alist "* keywords: ui, dangerous feature, status: unclear"))
(test-equal "Parse list line with repeated keys"
'((keywords "foo")
(status "unclear")
(keywords "dangerous feature" "ui"))
(list-line->alist "* keywords: ui, dangerous feature, status: unclear, keywords: foo"))
(test-equal "Parse key-value list lines case insensitively"
'((keywords "dangerous feature" "ui"))
(list-line->alist "* Keywords: ui, dangerous feature"))
(test-equal "Return keywords in order"
'((keywords "foo" "bar" "fubar"))
(call-with-input-string "* keywords: foo, bar, fubar"
(compose hashtable->alist file-details)))
(let ((hashtable (make-eq-hashtable)))
(hashtable-set! hashtable 'keywords (list "foo" "bar"))
(hashtable-prepend! hashtable 'keywords (list "foobar" "fubar"))
(test-equal "hashtable-prepend! should prepend, not append"
'((keywords "fubar" "foobar" "foo" "bar"))
(hashtable->alist hashtable)))
(test-equal "Do not parse definition-like lines as key-value pairs"
'()
(call-with-input-string "* term: This is a definition of term."
(compose hashtable->alist file-details)))
(test-equal "Parse keywords even if they are long"
'((keywords "this is a long keyword"))
(call-with-input-string "* keywords: this is a long keyword"
(compose hashtable->alist file-details)))
(test-equal "Parse checkboxes"
'((completed-tasks . 1)
(tasks . 2))
(call-with-input-string "* [ ] foo
* [x] bar"
(compose hashtable->alist file-details)))
(test-end "issue")
|
