/
its.el
1585 lines (1418 loc) · 53.7 KB
/
its.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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
;;; its.el --- Input Translation System AKA "ITS(uDekirunDa!)"
;; Copyright (C) 1999,2000 PFU LIMITED
;; Author: NIIBE Yutaka <gniibe@fsij.org>
;; KATAYAMA Yoshio <kate@pfu.co.jp>
;; Maintainer: TOMURA Satoru <tomura@etl.go.jp>
;; Keywords: mule, multilingual, input method
;; This file is part of EGG.
;; EGG 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 2, or (at your option)
;; any later version.
;; EGG 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 GNU Emacs; see the file COPYING. If not, write to the
;; Free Software Foundation, Inc., 59 Temple Place - Suite 330,
;; Boston, MA 02111-1307, USA.
;;; Commentary:
;;; Code:
(eval-when-compile
(require 'cl))
(require 'egg-edep)
(defgroup its nil
"Input Translation System of Tamago 4."
:group 'egg)
(defcustom its-enable-fullwidth-alphabet t
"*Enable fullwidth symbol input."
:group 'its :type 'boolean)
(defcustom its-barf-on-invalid-keyseq nil
"*Don't allow invalid key sequence in input buffer, if non-NIL."
:group 'its :type 'boolean)
(defcustom its-delete-by-keystroke nil
"*Delete characters as if cancel input keystroke, if nin-NIL.
This variable is overriden by `its-delete-by-character'."
:group 'its :type 'boolean)
(defcustom its-delete-by-character nil
"*Delete a character as a unit even if just after input, if nin-NIL.
This variable override `its-delete-by-keystroke'."
:group 'its :type 'boolean)
(defcustom its-fence-invisible nil
"*Make fences invisible, if nin-NIL."
:group 'its :type 'boolean)
(defcustom its-fence-open "|"
"*String of fence start mark. (should not be null string)"
:group 'its :type '(string :valid-regexp ".+"))
(defcustom its-fence-continue "+"
"*String of fence start mark. (should not be null string)"
:group 'its :type '(string :valid-regexp ".+"))
(defcustom its-fence-close "|"
"*String of fence end mark. (should not be null string)"
:group 'its :type '(string :valid-regexp ".+"))
(defcustom its-fence-face nil
"*Face (or alist of languages and faces) of text in fences."
:group 'its
:type '(choice face
(repeat :tag "Language-Face alist"
(cons :tag "Language-Face"
(choice :tag "Language"
(const Japanese)
(const Chinese-GB)
(const Chinese-CNS)
(const Korean)
(const :tag "Default" t)
(symbol :tag "Other"))
face))))
(defvar its-current-map nil)
(make-variable-buffer-local 'its-current-map)
(put 'its-current-map 'permanent-local t)
(defvar its-current-select-func nil)
(make-variable-buffer-local 'its-current-select-func)
(put 'its-current-select-func 'permanent-local t)
(defvar its-previous-select-func nil)
(make-variable-buffer-local 'its-previous-select-func)
(put 'its-previous-select-func 'permanent-local t)
(defvar its-current-language nil)
(make-variable-buffer-local 'its-current-language)
(put 'its-current-language 'permanent-local t)
;; Data structure in ITS
;; (1) SYL and CURSOR
;;
;; "SYL" stands for something like a syllable.
;;
;; <SYL> ::= ( <output> . ( <keyseq> . <terminal> )) ; Determined: DSYL
;; | <state> ; Intermediate: ISYL
;; | ( <output> . <point> ) ; Verbatim: VSYL
;; | nil ; None
;;
;; ;<state> ::=
;; ; ( <output> . ( <keyseq> . <key-state-table/terminal> ))
;;
;; <keyseq> ::= "string" of key sequence
;; <output> ::= "string"
;;
;; <point> ::= integer which specifies point
;;
;; <cursor> ::= nil ; Previous SYL is active (input will go that SYL)
;; | t ; input makes new SYL. DEL deletes previous SYL
;; | its-cursor ; DEL breaks previous SYL, input makes new SYL
;; Data structures in ITS
;; (2) State machine which recognizes SYL
;;
;; <state> ::= ( <output> <keyseq> . <key-state-table/terminal> )
;;
;; <key-state-table/terminal> ::= <key-state-table> ; intermediate state
;; | <terminal> ; terminal state
;;
;; <key-state-table> ::= ( <key-state-alist> . <expr-output-back-list> )
;; <key-state-alist> ::= ( <key-state> ... )
;; <key-state> ::= ( <key> . <state> )
;; <key> ::= Positive INTEGER which specifies KEY STROKE
;; | -1 ; means END of key stroke
;;
;; Only applicable for last transition.
;; <expr-output-back-list> ::= ( (<output> . (<keyexpr> . <howmanyback>))... )
;; <keyexpr> ::= something like "[a-z]" which specifies class of key.
;; | NIL; means ANY of key (except END of the key stroke)
;;
;;
;; <keyseq> ::= "string"
;;
;; <terminal> ::= nil
;; | <howmanyback>
;;
;; <howmanyback> ::= integer which specifies how many key strokes we go back
;;
;; <output> ::= "string"
;; Data structure in ITS (3) Map
;;
;; <map> ::= ( <name> <indicator> <language> . <start-state> )
;; <name> ::= "string"
;; <indicator> ::= "string"
;; <language> ::= "string"
;; <start-state> ::= <state>
;;
(defsubst its-new-state (output keyseq back)
(cons output (cons keyseq back)))
(defsubst its-new-map (name indicator language)
(cons name (cons indicator (cons language (its-new-state "" "" nil)))))
(defsubst its-get-indicator (map)
(nth 1 map))
(defsubst its-get-language (map)
(nth 2 map))
(defsubst its-get-start-state (map)
(nthcdr 3 map))
(defsubst its-get-kst/t (state)
(cdr (cdr state)))
(defsubst its-set-kst (state kst)
(setcdr (cdr state) kst))
(defsubst its-get-keyseq (state)
(car (cdr state)))
(defsubst its-set-keyseq (state keyseq)
(setcar (cdr state) keyseq))
(defun its-get-keyseq-cooked (state)
(let ((keyseq (its-get-keyseq state))
(back (its-get-kst/t state)))
(if back
(substring keyseq 0 back)
keyseq)))
(defsubst its-kst-p (kst/t)
(not (or (numberp kst/t) (null kst/t))))
(defun its-get-output (syl/state &optional no-eval)
(setq syl/state (car syl/state))
(cond ((null (consp syl/state))
syl/state)
((and (null no-eval) (eq (car syl/state) 'eval))
(eval (mapcar (lambda (s) (if (stringp s) (copy-sequence s) s))
(cdr syl/state))))
(t
(copy-sequence syl/state))))
(defsubst its-set-output (state output)
(setcar state output))
(defsubst its-get-keyseq-syl (syl)
(let ((l (cdr syl)))
(cond ((stringp l) ; DSYL
l)
((numberp l) ; VSYL
(car syl))
((numberp (cdr l))
(substring (car l) 0 (cdr l)))
(t
(car l)))))
(defsubst its-eob-keyexpr (eob)
(car (cdr eob)))
(defsubst its-eob-back (eob)
(cdr (cdr eob)))
(defsubst its-make-class+back (class back)
(cons class back))
(defsubst its-make-otherwise (output class+back)
(cons output class+back))
(defsubst its-DSYL-with-back-p (syl)
(and (consp (cdr syl))
(numberp (its-get-kst/t syl))))
(defsubst its-concrete-DSYL-p (syl)
(stringp (cdr syl)))
(defsubst its-make-concrete-DSYL (syl)
(if (consp (cdr syl))
(cons (its-get-output syl) (its-get-keyseq-syl syl))
syl))
;;
;;
(require 'its-keydef)
(defvar its-mode-map
(let ((map (make-sparse-keymap))
(i 33))
(define-key map "\C-a" 'its-beginning-of-input-buffer)
(define-key map "\C-b" 'its-backward-SYL)
(define-key map "\C-c" 'its-cancel-input)
(define-key map "\C-d" 'its-delete-SYL)
(define-key map "\C-e" 'its-end-of-input-buffer)
(define-key map "\C-f" 'its-forward-SYL)
(define-key map "\C-g" 'its-select-previous-mode)
(define-key map "\C-]" 'its-cancel-input)
(define-key map "\C-h" 'its-mode-help-command)
(define-key map "\C-k" 'its-kill-line)
;; (define-key map "\C-l" 'its-exit-mode)
(define-key map "\C-m" 'its-exit-mode) ; RET
(define-key map [return] 'its-exit-mode)
(define-key map "\C-t" 'its-transpose-chars)
(define-key map "\C-w" 'its-kick-convert-region)
(define-key map "\C-y" 'its-yank)
(define-key map "\M-y" 'its-yank-pop)
(define-key map [backspace] 'its-delete-backward-SYL)
(define-key map [delete] 'its-delete-backward-SYL)
(define-key map [(meta backspace)] 'its-delete-backward-SYL-by-keystroke)
(define-key map [(meta delete)] 'its-delete-backward-SYL-by-keystroke)
(define-key map [right] 'its-forward-SYL)
(define-key map [left] 'its-backward-SYL)
(while (< i 127)
(define-key map (vector i) 'its-self-insert-char)
(setq i (1+ i)))
(define-key map " " 'its-kick-convert-region-or-self-insert)
(define-key map "\177" 'its-delete-backward-SYL)
;;
(define-key map "\M-p" 'its-previous-map)
(define-key map "\M-n" 'its-next-map)
(define-key map "\M-h" 'its-hiragana) ; hiragana-region for input-buffer
(define-key map "\M-k" 'its-katakana)
(define-key map "\M-<" 'its-half-width)
(define-key map "\M->" 'its-full-width)
map)
"Keymap for ITS mode.")
(fset 'its-mode-map its-mode-map)
(defvar its-fence-mode nil)
(make-variable-buffer-local 'its-fence-mode)
(put 'its-fence-mode 'permanent-local t)
(defvar egg-sub-mode-map-alist nil)
(or (assq 'its-fence-mode egg-sub-mode-map-alist)
(setq egg-sub-mode-map-alist (cons '(its-fence-mode . its-mode-map)
egg-sub-mode-map-alist)))
(defun its-enter/leave-fence (&optional old new)
(setq its-fence-mode (its-in-fence-p)))
(add-hook 'egg-enter/leave-fence-hook 'its-enter/leave-fence)
(defconst its-setup-fence-before-insert-SYL nil)
(defun its-get-fence-face (lang)
(if (null (consp its-fence-face))
its-fence-face
(cdr (or (assq lang its-fence-face)
(assq t its-fence-face)))))
(defun its-put-cursor (cursor)
(unless (eq its-barf-on-invalid-keyseq 'its-keyseq-test)
(let ((p (point))
(str (copy-sequence "!")))
(set-text-properties 0 1 (list 'read-only t
'invisible 'egg
'intangible 'its-part-2
'its-cursor cursor
'point-entered 'egg-enter/leave-fence
'point-left 'egg-enter/leave-fence
'modification-hooks '(egg-modify-fence))
str)
(insert str)
(goto-char p))))
(defun its-set-cursor-status (cursor)
(delete-region (point) (1+ (point)))
(its-put-cursor cursor)
cursor)
(defvar its-context nil)
;;
;; +-- START property
;; | --- CURSOR Property
;; | /
;; v v v-- END Property
;; |SYL SYL ^ SYL|
;; ^^^ ^^^ ^^^------ SYL Property
;; <-------><---->
;; intangible intangible
;; 1 2
;;
(defun its-setup-fence-mode ()
(let ((open-props '(its-start t intangible its-part-1))
(close-props '(rear-nonsticky t its-end t intangible its-part-2))
(p (point)) p1)
(if (or (null (stringp its-fence-open)) (zerop (length its-fence-open))
(null (stringp its-fence-continue)) (zerop (length its-fence-continue))
(null (stringp its-fence-close)) (zerop (length its-fence-close)))
(error "invalid fence"))
;; Put open-fence before inhibit-read-only to detect read-only
(insert (if its-context its-fence-continue its-fence-open))
(egg-setup-invisibility-spec)
(let ((inhibit-read-only t))
(setq p1 (point))
(add-text-properties p p1 open-props)
(if its-context
(put-text-property p p1 'its-context its-context))
(insert its-fence-close)
(add-text-properties p1 (point) close-props)
(if its-fence-invisible
(put-text-property p (point) 'invisible 'egg))
(put-text-property p (point) 'read-only t)
(goto-char p1)
(its-define-select-keys its-mode-map t)
(its-put-cursor t))))
(defun its-start (key context)
(let ((its-setup-fence-before-insert-SYL t)
(its-context context))
(its-input nil key)))
(defun its-restart (str set-prop beginning context)
(let ((its-context context)
p)
(its-setup-fence-mode)
(setq p (point))
(put-text-property 0 (length str) 'intangible 'its-part-1 str)
(insert str)
(if set-prop
(progn
(delete-region (point) (1+ (point)))
(its-setup-yanked-portion p (point))))
(if beginning
(its-beginning-of-input-buffer))))
(defun its-self-insert-char ()
(interactive)
(let ((inhibit-read-only t)
(key last-command-event)
(cursor (get-text-property (point) 'its-cursor))
(syl (get-text-property (1- (point)) 'its-syl)))
(cond
((or (eq cursor t)
(not (eq (get-text-property (1- (point)) 'its-map) its-current-map)))
(put-text-property (- (point) (length (its-get-output syl))) (point)
'its-syl (its-make-concrete-DSYL syl))
(setq syl nil))
(cursor
(setq syl nil)))
(its-input syl key)))
(defun its-current-language-length ()
(+ (if (eq (get-text-property (1- (point)) 'egg-lang) its-current-language)
(- (point) (previous-single-property-change (point) 'egg-lang))
0)
(if (eq (get-text-property (1+ (point)) 'egg-lang) its-current-language)
(- (next-single-property-change (1+ (point)) 'egg-lang) (point) 1)
0)))
(defun its-initial-ISYL ()
(its-get-start-state (symbol-value its-current-map)))
(defun its-make-VSYL (keyseq)
(cons keyseq (length keyseq)))
(defun its-input-error ()
(error "Invalid Romaji Sequence"))
(defvar its-stroke-input-alist nil)
(defun its-input (syl key)
(let ((output (car syl))
(k/kk/s (cdr syl))
(stroke (assq its-current-language its-stroke-input-alist)))
(or syl (setq syl (its-initial-ISYL)))
(cond
((numberp k/kk/s)
;; k/kk/s is "point in keyseq"
(its-input-to-vsyl syl key k/kk/s output))
((and (or its-barf-on-invalid-keyseq stroke)
(null (its-keyseq-acceptable-p (vector key) syl)))
;; signal before altering
(its-input-error))
(t
;; It's ISYL
(its-state-machine syl key 'its-buffer-ins/del-SYL)
(if (and stroke (>= (its-current-language-length) (cdr stroke)))
(its-kick-convert-region))))))
(defun its-input-to-vsyl (syl key point output)
(if (< key 0)
(its-set-cursor-status t)
(let ((len (length output)))
(if (= len point)
;; point is at end of VSYL. Don't need to call state machine.
(its-buffer-ins/del-SYL
(its-make-VSYL (concat output (vector key))) syl nil)
;; point is at middle of VSYL.
(let ((new-keyseq (concat (substring output 0 point)
(vector key)
(substring output point))))
(its-state-machine-keyseq new-keyseq 'its-buffer-ins/del-SYL))))))
;;;
;;; ITS State Machine
;;;
(defvar its-disable-special-action nil)
;; Return CURSOR
(defun its-state-machine (state key emit)
(let ((next-state (its-get-next-state state key))
expr-output-back kst/t output keyseq back)
(cond
;; proceed to next status
((and next-state
(not (and its-disable-special-action
(eq (its-get-kst/t next-state) t))))
(setq kst/t (its-get-kst/t next-state)
output (its-get-output next-state)
keyseq (its-get-keyseq next-state))
(cond
;; Special actions.
((eq kst/t t)
(if (stringp output)
(let ((its-current-language t))
(funcall emit (cons output keyseq) state 'its-cursor))
(funcall emit (cons "" keyseq) state 'its-cursor)
(apply (car output) (cdr output))))
;; Still, it's a intermediate state.
((its-kst-p kst/t)
(funcall emit next-state state nil))
;; It's negative integer which specifies how many
;; characters we go backwards
(kst/t
(funcall emit next-state state 'its-cursor)
(its-state-machine-keyseq (substring keyseq kst/t) emit (< key 0)))
;; Here we arrive to a terminal state.
;; Emit a DSYL, and go ahead.
(t
(funcall emit next-state state 'its-cursor))))
;; push back by otherwise status
((and (>= key 0)
(setq expr-output-back (its-get-otherwise state key)))
(setq keyseq (concat (its-get-keyseq state) (vector key))
back (its-eob-back expr-output-back))
(funcall emit
(cons (or (its-get-output expr-output-back)
(its-get-output
(its-goto-state (substring keyseq 0 back))))
(cons keyseq back))
state t)
(its-state-machine-keyseq
(substring keyseq back) emit))
((eq its-barf-on-invalid-keyseq 'its-keyseq-test)
'its-keyseq-test-failed)
;; No next state for KEY. It's invalid sequence.
(its-barf-on-invalid-keyseq
(its-input-error))
(t
;; XXX Should make DSYL (instead of VSYL)?
(setq keyseq (concat (its-get-keyseq state) (if (> key 0) (vector key))))
(funcall emit (its-make-VSYL keyseq) state nil)))))
(defvar its-latest-SYL nil "The latest SYL inserted.")
(defsubst its-update-latest-SYL (syl)
(setq its-latest-SYL syl))
;; Return CURSOR
(defun its-state-machine-keyseq (keyseq emit &optional eol)
(let ((i 0)
(len (length keyseq))
(syl (its-initial-ISYL))
cursor)
(while (< i len)
(cond
((numberp (cdr syl))
;; VSYL - no need looping
(funcall emit
(its-make-VSYL (concat (car syl) (substring keyseq i)))
syl nil)
(setq cursor nil
i len))
(t
(setq cursor (its-state-machine syl (aref keyseq i) emit))))
(if (eq cursor 'its-keyseq-test-failed)
(setq i len)
(setq syl (if cursor (its-initial-ISYL) its-latest-SYL)
i (1+ i))))
(if (and eol (not (eq cursor 'its-keyseq-test-failed)))
(its-state-machine syl -1 emit)
cursor)))
(defun its-buffer-ins/del-SYL (newsyl oldsyl cursor)
(if its-setup-fence-before-insert-SYL
(progn
(setq its-setup-fence-before-insert-SYL nil)
(its-setup-fence-mode)))
(let ((inhibit-read-only t)
(output (copy-sequence (its-get-output newsyl)))
(face (its-get-fence-face its-current-language)))
(its-buffer-delete-SYL oldsyl)
(its-update-latest-SYL newsyl)
(add-text-properties 0 (length output)
(list 'its-map its-current-map
'its-syl newsyl
'egg-lang its-current-language
'read-only t
'intangible 'its-part-1)
output)
(if face
(egg-set-face 0 (length output) face output))
(insert output)
(its-set-cursor-status cursor)))
(defun its-buffer-delete-SYL (syl)
(let ((len (length (its-get-output syl))))
(delete-region (- (point) len) (point))))
(defun its-get-next-state (state key)
(let ((kst/t (its-get-kst/t state)))
(and (listp kst/t)
(cdr (assq key (car kst/t))))))
;; XXX XXX XXX
(defun its-otherwise-match (expr key)
(or (null expr) ; <expr>::= NIL means "ANY"
(let ((case-fold-search nil))
(string-match expr (char-to-string key)))))
(defun its-get-otherwise (state key)
(let* ((kst/t (its-get-kst/t state))
(ebl (cdr kst/t))
expr-output-back)
(while ebl
(setq expr-output-back (car ebl))
(let ((expr (its-eob-keyexpr expr-output-back)))
(if (its-otherwise-match expr key)
(setq ebl nil)
(setq ebl (cdr ebl)))))
expr-output-back))
(defun its-keyseq-acceptable-p (keyseq &optional syl eol)
(let ((i 0)
(len (length keyseq))
(its-barf-on-invalid-keyseq 'its-keyseq-test)
(its-latest-SYL nil)
(emit (lambda (nsyl osyl cursor)
(its-update-latest-SYL nsyl)
cursor))
(its-current-map its-current-map)
(its-current-select-func its-current-select-func)
(its-current-language its-current-language)
(its-zhuyin its-zhuyin)
(its-previous-select-func its-previous-select-func)
cursor)
(if (null syl)
(setq syl (its-initial-ISYL)))
(if (numberp (cdr syl))
nil
(while (and syl (< i len))
(setq cursor (its-state-machine syl (aref keyseq i) emit))
(cond
((eq cursor 'its-keyseq-test-failed)
(setq syl nil))
(cursor
(setq syl (its-initial-ISYL)))
(t
its-latest-SYL))
(setq i (1+ i)))
(if (and syl eol)
(setq cursor (its-state-machine syl -1 emit)))
(not (eq cursor 'its-keyseq-test-failed)))))
;;;
;;; Name --> map
;;;
;;; ITS name: string
(defvar its-map-alist nil)
(defun its-get-map (name)
(assoc name its-map-alist))
(defun its-register-map (map)
(let* ((name (car map))
(place (assoc name its-map-alist)))
(if place
(setcdr place (cdr map))
(setq its-map-alist (cons map its-map-alist)))
map))
(defmacro define-its-state-machine (map name indicator lang doc &rest exprs)
(let ((its-current-map map))
(set map (its-new-map name indicator
(if (eq (car-safe lang) 'quote) (nth 1 lang) lang)))
(eval (cons 'progn exprs))
(set map (its-map-compaction (symbol-value map))))
`(defconst ,map (its-map-rebuild ',(symbol-value map)) ,doc))
(defmacro define-its-state-machine-append (map &rest exprs)
`(let ((func (lambda () (let ((its-current-map ',map)) ,@exprs)))
(hook ',(intern (concat (symbol-name map) "-hook"))))
(if (null (boundp ',map))
(add-hook hook func t)
(funcall func)
(run-hooks hook)
(set hook nil))))
;; Data structure for map compaction
;; <node> ::= (<count> <node#> <original node>) ; atom
;; | (<count> <node#> (<node> . <node>)) ; cons cell
;;
;; <count> ::= integer ; 0 or negative - usage count
;; ; positive - generated common sub-tree
;;
;; <node#> ::= integer ; subject to compaction
;; | nil ; not subject to compaction
(defvar its-compaction-enable nil)
(defvar its-compaction-hash-table)
(defvar its-compaction-integer-table)
(defvar its-compaction-counter-1)
(defvar its-compaction-counter-2)
(defvar its-compaction-list)
(defun its-map-compaction (map)
(if its-compaction-enable
(let ((its-compaction-hash-table (make-vector 1000 nil))
(its-compaction-integer-table (make-vector 138 nil))
(its-compaction-counter-1 1)
(its-compaction-counter-2 0)
(its-compaction-list nil))
(its-map-compaction-internal map nil nil)
(cons (vconcat (nreverse its-compaction-list)) map))
map))
(defmacro its-compaction-set-lr (node lr val)
`(if (eq ,lr 'car) (setcar ,node ,val) (setcdr ,node ,val)))
(defmacro its-compaction-new-node ()
'(1- (setq its-compaction-counter-1 (1+ its-compaction-counter-1))))
(defmacro its-compaction-new-cse (node)
`(1- (setq its-compaction-list (cons ,node its-compaction-list)
its-compaction-counter-2 (1+ its-compaction-counter-2))))
(defmacro its-concat (&rest args)
`(concat ,@(mapcar (lambda (arg)
(if (stringp arg)
arg
`(if (numberp ,arg) (number-to-string ,arg) ,arg)))
args)))
(defmacro its-compaction-hash (name node parent lr type)
(if (null type)
`(let ((hash (intern (its-concat ,@name) its-compaction-hash-table)))
(if (null (boundp hash))
(car (set hash (list* (its-compaction-new-node) ,parent ,lr)))
(setq hash (symbol-value hash))
(if (consp (cdr hash))
(setcdr hash (its-compaction-set-lr
(cadr hash) (cddr hash)
(its-compaction-new-cse ,node))))
(its-compaction-set-lr ,parent ,lr (cdr hash))
(car hash)))
`(let ((hash ,(if (eq type 'integer)
`(intern (its-concat ,@name) its-compaction-hash-table)
`(aref its-compaction-integer-table (+ ,node 10)))))
(if (null ,(if (eq type 'integer) '(boundp hash) 'hash))
(setq hash (,@(if (eq type 'integer)
'(set hash)
`(aset its-compaction-integer-table (+ ,node 10)))
(cons (its-compaction-new-node)
(its-compaction-new-cse ,node))))
,(if (eq type 'integer) '(setq hash (symbol-value hash))))
(its-compaction-set-lr ,parent ,lr (cdr hash))
(car hash))))
(defun its-map-compaction-internal (map parent lr &optional force)
(cond
((consp map)
(let* ((candidate (or (null (stringp (car map))) (cdr map)))
(sexp (or force (eq (car map) 'eval)))
(l (its-map-compaction-internal (car map) map 'car sexp))
(r (its-map-compaction-internal (cdr map) map 'cdr sexp)))
(if (or sexp (and candidate l r))
(its-compaction-hash (l " " r) map parent lr nil))))
((stringp map)
(its-compaction-hash ("STR" map) map parent lr nil))
((integerp map)
(if (and (>= map -10) (< map 128))
(its-compaction-hash nil map parent lr small-int)
(its-compaction-hash ("INT" map) map parent lr integer)))
((null map) 0)
((symbolp map)
(its-compaction-hash ("SYM" (symbol-name map)) map parent lr nil))))
(defvar its-map-rebuild-subtrees)
(defun its-map-rebuild (map)
(if (vectorp (car map))
(let ((its-map-rebuild-subtrees (car map))
(len (length (car map)))
(i 0)
node)
(while (< i len)
(setq node (aref its-map-rebuild-subtrees i))
(if (consp node)
(its-map-rebuild-1 node))
(setq i (1+ i)))
(its-map-rebuild-1 (cdr map))
(cdr map))
map))
(defun its-map-rebuild-1 (map)
(let (lr)
(while (consp map)
(if (consp (setq lr (car map)))
(its-map-rebuild-1 lr)
(if (integerp lr)
(setcar map (aref its-map-rebuild-subtrees lr))))
(setq lr map
map (cdr map)))
(if (integerp map)
(setcdr lr (aref its-map-rebuild-subtrees map)))))
;;
;; Construct State Machine
;;
(defun its-defrule (input output &optional back enable-overwrite)
"$BF~NO(B INPUT $B$rG'<1$7(B, OUTPUT $B$r=PNO$9$k$h$&$K%9%F!<%H%^%7%s$r9=@.$9$k!#(B
BACK $B$,(B($BIi$N(B)$B@0?t$N;~$O(B, OUTPUT $B$r=PNO$7$?8e(B, BACK $B$NJ,(B key stroke $B$r(B
$BLa$C$FF0$/$b$N$H$9$k!#JQ495,B'$O$b$C$H$b:G6a$K(B its-define-state-machine
$B$5$l$?JQ49I=$KEPO?$5$l$k!#(B
Return last state."
(let ((state (its-goto-state input (if enable-overwrite t 'dup-check))))
(its-set-output state output)
(its-set-kst state back)
state))
(defun its-defrule* (input output &optional interim-output enable-overwrite)
(let* ((state (its-goto-state input (if enable-overwrite t 'dup-check))))
(its-set-kst state nil)
(its-set-interim-terminal-state state output)
(if interim-output
(its-set-output state interim-output))
state))
(defvar its-parent-states)
(defun its-goto-state (input &optional build-if-none)
(let ((len (length input))
(i 0)
(state (its-initial-ISYL))
brand-new next-state key)
(setq its-parent-states nil)
(while (< i len)
(setq its-parent-states (cons state its-parent-states)
key (aref input i)
i (1+ i)
next-state (its-get-next-state state key))
(cond
(next-state
(setq state next-state))
((null build-if-none)
(error "No such state (%s)" input))
(t
(if (not (or brand-new (= i 1) (its-get-kst/t state)))
(its-set-interim-terminal-state state))
(setq state (its-make-next-state state key
(concat (its-get-output state)
(list key)))
brand-new t))))
(if (and (eq build-if-none 'dup-check) (null brand-new))
(error "Duplicated definition (%s)" input))
state))
(defun its-set-interim-terminal-state (state &optional output)
(its-make-next-state state -1 (or output (its-get-output state t)))
(its-defrule-otherwise state output))
(defun its-defoutput (input display)
(let ((state (its-goto-state input)))
(its-set-output state display)))
(defun its-define-otherwise (state otherwise)
(let ((kst (its-get-kst/t state)))
(if kst
(setcdr kst (cons otherwise (cdr kst)))
(its-set-kst state (cons nil (cons otherwise nil))))))
(defun its-defrule-otherwise (state output &optional class back)
(its-define-otherwise
state
(its-make-otherwise output (its-make-class+back class (or back -1)))))
(defun its-make-next-state (state key output &optional back)
(let ((next-state (its-new-state output
(concat (its-get-keyseq state)
(if (> key 0) (list key)))
back))
(kst (its-get-kst/t state)))
(cond
((null kst)
(its-set-kst state (list (list (cons key next-state)))))
((consp kst)
(setcar kst (cons (cons key next-state) (car kst))))
(t
(error "Can't make new state after %S" (its-get-keyseq state))))
next-state))
(defmacro its-defrule-select-mode-temporally (input select-func)
`(its-defrule ,input '(its-select-mode-temporally
,(intern (concat "its-select-"
(symbol-name select-func))))
t))
;;;
(defun its-set-part-1 (beg end)
(let ((inhibit-point-motion-hooks t)
(str (buffer-substring beg end)))
(goto-char beg)
(delete-region beg end)
(put-text-property 0 (- end beg) 'intangible 'its-part-1 str)
(insert str)))
(defun its-set-part-2 (beg end)
(let ((inhibit-point-motion-hooks t)
(str (buffer-substring beg end)))
(goto-char beg)
(delete-region beg end)
(put-text-property 0 (- end beg) 'intangible 'its-part-2 str)
(insert str)))
(defun its-search-beginning ()
(if (get-text-property (1- (point)) 'its-start)
(point)
(previous-single-property-change (point) 'its-start)))
(defun its-search-end ()
(if (get-text-property (point) 'its-end)
(point)
(next-single-property-change (point) 'its-end)))
(defun its-beginning-of-input-buffer ()
(interactive)
(let ((inhibit-read-only t))
(its-input-end)
(let ((begpos (its-search-beginning)))
(its-set-part-2 begpos (point))
(goto-char begpos))
(its-put-cursor t)))
(defun its-end-of-input-buffer ()
(interactive)
(let ((inhibit-read-only t))
(its-input-end)
(let ((endpos (its-search-end)))
(its-set-part-1 (point) endpos)
(goto-char endpos))
(its-put-cursor t)))
(defun its-kill-line (n)
(interactive "p")
(let ((inhibit-read-only t))
(its-input-end)
(if (> n 0)
(if (= (its-search-beginning) (point))
(its-cancel-input)
(delete-region (its-search-end) (point))
(its-put-cursor t))
(if (= (its-search-end) (point))
(its-cancel-input)
(delete-region (its-search-beginning) (point))
(its-put-cursor t)))))
(defun its-cancel-input ()
(interactive)
(let ((inhibit-read-only t))
(delete-region (its-search-beginning) (its-search-end))
(its-put-cursor t)
(its-exit-mode-internal)))
;; TODO: move in VSYL
(defun its-backward-SYL (n)
(interactive "p")
(let ((inhibit-read-only t)
syl p old-point)
(its-input-end)
(setq syl (get-text-property (1- (point)) 'its-syl)
p (point)
old-point (point))
(while (and syl (> n 0))
(setq p (- p (length (its-get-output syl))))
(setq syl (get-text-property (1- p) 'its-syl))
(setq n (1- n)))
;; Make SYLs have property of "part 2"
(its-set-part-2 p old-point)
(goto-char p)
(its-put-cursor t)
(if (> n 0)
(signal 'beginning-of-buffer nil))))
;; TODO: move in VSYL
(defun its-forward-SYL (n)
(interactive "p")
(let ((inhibit-read-only t)
syl p old-point)
(its-input-end)
(setq syl (get-text-property (point) 'its-syl)
p (point)
old-point (point))
(while (and syl (> n 0))
(setq p (+ p (length (its-get-output syl))))
(setq syl (get-text-property p 'its-syl))
(setq n (1- n)))
;; Make SYLs have property of "part 1"
(its-set-part-1 old-point p)
(goto-char p)
(its-put-cursor t)
(if (> n 0)
(signal 'end-of-buffer nil))))
;; TODO: handle VSYL. KILLFLAG
(defun its-delete-SYL (n killflag)
(interactive "p\nP")
(let ((inhibit-read-only t)
syl p)
(its-input-end)
(setq syl (get-text-property (point) 'its-syl)