-
Notifications
You must be signed in to change notification settings - Fork 2
/
ibus-table-to-quail-rules.el
77 lines (66 loc) · 3.04 KB
/
ibus-table-to-quail-rules.el
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
;;; ibus-table-to-quail-rules.el --- Convert IBus -*- lexical-binding: t -*-
;;; table to Quail rules
;; Copyright (C) 2015 Chris Feng
;; Author: Chris Feng <chris.w.feng@gmail.com>
;; Keywords: i18n
;; This file is not part of GNU Emacs.
;; This file 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.
;; This file 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 this file. If not, see <http://www.gnu.org/licenses/>.
;;; Commentary:
;; This file should be run as a Emacs script with an ibus table data as the
;; only argument. Currently, only the TABLE entry is used.
;;; Code:
(let ((data
(with-temp-buffer
(message "Reading %s..." (car argv))
(insert-file-contents (car argv))
;; Get text between BEGIN_TABLE and END_TABLE
(goto-char (point-min))
(delete-region (point-min) (search-forward "\nBEGIN_TABLE\n"))
(goto-char (point-max))
(delete-region (search-backward "\nEND_TABLE\n") (point-max))
;; Convert text to a list (rows) of another list (columns)
(mapcar 'split-string (split-string (buffer-string) "\n" t))))
(hash (make-hash-table :test 'equal)))
(message "Converting...")
(mapc (lambda (i)
(let* ((key (elt i 0))
(translation (elt i 1))
(frequency (string-to-int (elt i 2)))
(key-length (length key)))
(dotimes (j key-length)
(let ((key* (substring key 0 (1+ j))))
(puthash key*
(nconc (gethash key* hash)
`((,translation ,frequency ,(- key-length j))))
hash)))))
data)
(message "Finishing...")
(maphash (lambda (key val)
(prin1
`(,key
,(let ((translation
(delete-dups
(mapcar 'car
(sort val
(lambda (a b)
(let ((a-group (elt a 2))
(b-group (elt b 2)))
(if (/= a-group b-group)
(< a-group b-group)
(> (cadr a) (cadr b))))))))))
(if (and (= 1 (length translation))
(= 1 (length (car translation))))
(car translation)
(vconcat translation)))))
(terpri))
hash))
;;; ibus-table-to-quail-rules.el ends here