/usr/share/uim/rk.scm is in libuim-data 1:1.8.6+gh20161003.0.d63dadd-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | ;;;
;;; Copyright (c) 2003-2013 uim Project https://github.com/uim/uim
;;;
;;; All rights reserved.
;;;
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;; 1. Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;; 2. Redistributions in binary form must reproduce the above copyright
;;; notice, this list of conditions and the following disclaimer in the
;;; documentation and/or other materials provided with the distribution.
;;; 3. Neither the name of authors nor the names of its contributors
;;; may be used to endorse or promote products derived from this software
;;; without specific prior written permission.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND
;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
;;; ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE
;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
;;; SUCH DAMAGE.
;;;;
;;
; following functions are implemented within C
; rk-lib-find-seq
; rk-lib-find-partial-seq
; rk-lib-find-partial-seqs
; rk-lib-expect-seq
; rk-lib-expect-key?
;
; back match is mainly used for Hangul
;
; if "table" is provided as a rule for rk-context-new, functions in ;
; ct.scm are used to search from sorted text file.
(define-record 'rk-context
'((rule ())
(seq ())
(immediate-commit #f)
(back-match #f)
(find-seq #f)
(find-partial-seq #f)
(find-cands-incl-minimal-partial #f)
(expect-seq #f)
(expect-key-for-seq? #f)))
(define rk-context-new-internal rk-context-new)
(define rk-context-new
(lambda (rule immediate-commit back)
(if (string? rule)
(require "ct.scm"))
(let* ((use-table? (string? rule))
(find-seq (if use-table?
ct-lib-find-seq
rk-lib-find-seq))
(find-partial-seq (if use-table?
ct-lib-find-partial-seq
rk-lib-find-partial-seq))
(find-cands-incl-minimal-partial (if use-table?
ct-find-cands-incl-minimal-partial
rk-find-cands-incl-minimal-partial))
(expect-seq (if use-table?
ct-lib-expect-seq
rk-lib-expect-seq))
(expect-key-for-seq? (if use-table?
ct-lib-expect-key-for-seq?
rk-lib-expect-key-for-seq?)))
(rk-context-new-internal rule
()
immediate-commit
back
find-seq
find-partial-seq
find-cands-incl-minimal-partial
expect-seq
expect-key-for-seq?))))
;; back match
(define rk-find-longest-back-match
(lambda (rule seq find-seq)
(if (not (null? seq))
(if (find-seq seq rule)
seq
(rk-find-longest-back-match rule (cdr seq) find-seq))
'())))
;; back match
(define rk-find-longest-head
(lambda (rseq rule find-seq)
(let ((seq (reverse rseq)))
(if (find-seq seq rule)
seq
(if (not (null? rseq))
(rk-find-longest-head (cdr rseq) rule find-seq)
'())))))
;; back match
(define rk-check-back-commit
(lambda (rkc rule rseq)
(let* ((seq (reverse rseq))
(len (length seq))
(find-seq (rk-context-find-seq rkc))
(find-partial-seq (rk-context-find-partial-seq rkc))
(longest-tail (rk-find-longest-back-match rule seq find-seq))
(longest-head (reverse (rk-find-longest-head rseq rule find-seq)))
(head
(truncate-list seq
(- len (length longest-tail))))
(partial (find-partial-seq seq rule))
(tail-partial
(if (not (null? longest-tail))
(find-partial-seq longest-tail rule)
#f))
(c (find-seq longest-tail rule))
(t (find-seq seq rule))
(res #f))
(and
(if (> len 0)
#t
#f)
(if partial
#f
#t)
(if (and c t)
#f
#t)
(if (not tail-partial)
(let ((matched (find-seq (reverse longest-head) rule))
(tail (reverse (truncate-list (reverse seq)
(- len
(length longest-head))))))
(if matched
(set! res (cadr matched)))
(if (and
res
(or
(not (null? longest-tail))
(find-partial-seq tail rule)))
(rk-context-set-seq! rkc tail)
(rk-context-set-seq! rkc '())) ;; no match in rule
#f)
#t)
(let ((matched (find-seq head rule)))
(if matched
(set! res (cadr matched)))
(rk-context-set-seq! rkc (reverse longest-tail))))
res)))
;;
(define rk-partial-seq?
(lambda (rkc s)
(if (null? s)
#f
((rk-context-find-partial-seq rkc) (reverse s) (rk-context-rule rkc)))))
;; API
(define rk-partial?
(lambda (rkc)
(if (rk-context-back-match rkc)
(if (not (null? (rk-context-seq rkc)))
#t
#f)
(rk-partial-seq?
rkc
(rk-context-seq rkc)))))
;; API
(define rk-current-seq
(lambda (rkc)
(let* ((s (rk-context-seq rkc))
(rule (rk-context-rule rkc))
(find-seq (rk-context-find-seq rkc)))
(find-seq (reverse s) rule))))
;; API
(define rk-flush
(lambda (context)
(rk-context-set-seq! context ())))
;; API
(define rk-backspace
(lambda (context)
(if
(pair? (rk-context-seq context))
(begin
(rk-context-set-seq! context
(cdr (rk-context-seq context)))
;; If the sequence contains only non-representable keysyms after
;; the deletion, flush them.
(if (and
(pair? (rk-context-seq context))
(null? (remove
(lambda (x)
(and
(intern-key-symbol x)
(not (symbol-bound? (string->symbol x)))))
(rk-context-seq context))))
(rk-flush context))
#t)
#f)))
;; API
(define rk-delete
(lambda (context)
(if
(pair? (rk-context-seq context))
(begin
(rk-context-set-seq! context
(cdr (rk-context-seq context)))
;; If the sequence contains only non-representable keysyms after
;; the deletion, flush them.
(if (and
(not (null? (rk-context-seq context)))
(null? (remove
(lambda (x)
(and
(intern-key-symbol x)
(not (symbol-bound? (string->symbol x)))))
(rk-context-seq context))))
(rk-flush context))
#t)
#f)))
; Merges two strings that have been converted, for example
; ("¤ó" "¥ó" "¡¡") ("1" "1" "1") --> ("¤ó1" "¥ó1" "¡¡1").
; SEQ1 and SEQ2 must be proper lists having the same length.
; A disgusting hack for implementing ("n" "1") --> ("¤ó1").
; Anyone with the time, skill and passion, please clean this up :-(
(define rk-merge-seqs
(lambda (seq1 seq2)
(if (and (pair? seq1) (pair? seq2))
(cons (string-append (car seq1) (car seq2))
(rk-merge-seqs (cdr seq1) (cdr seq2)))
; This should be () when we reach the end of the lists, or
; whatever passed as SEQ1 if SEQ2 is #f
seq1)))
;; front match
(define rk-proc-tail
(lambda (context seq)
(let* ((rule (rk-context-rule context))
(find-seq (rk-context-find-seq context))
(old-seq
(find-seq
(reverse (rk-context-seq context)) rule))
(res #f))
(if old-seq
(begin
(rk-flush context)
(let ((new-res (rk-push-key! context (car seq)))
(old (cadr old-seq)))
(if new-res
(let ((newlst (if (list? (car new-res))
new-res
(list new-res)))
(oldlst (if (list? (car old))
old
(list old))))
(set! res (append oldlst newlst)))
(set! res old))))
;;
(if (not (null? (rk-context-seq context)))
(begin
(rk-flush context)
(set! res
(rk-push-key! context (car seq))))))
res)))
(define rk-proc-end-seq
(lambda (context seq s)
(if (rk-context-immediate-commit context)
(if seq
(let ((latter (cadr seq)))
(rk-context-set-seq! context (cdar seq))
(if (not (null? latter))
latter
#f))
(begin
(rk-context-set-seq! context '())
#f))
(begin
(rk-context-set-seq! context s)
#f))))
;; API
;; return list of all expected next characters for the current partial sequence
;; return '() if current rkc is not partial
(define rk-expect
(lambda (rkc)
(let ((s (reverse (rk-context-seq rkc)))
(rule (rk-context-rule rkc))
(expect-seq (rk-context-expect-seq rkc)))
(expect-seq s rule))))
;; API
;; return #t if the key is expected as a next character in the partial sequence
;; this should be faster than rk-expect
(define rk-expect-key?
(lambda (rkc key)
(let ((s (reverse (rk-context-seq rkc)))
(rule (rk-context-rule rkc))
(expect-key-for-seq? (rk-context-expect-key-for-seq? rkc)))
(expect-key-for-seq? s rule key))))
;; back match
(define rk-push-key-back-match
(lambda (rkc key)
(let* ((cur-seq (rk-context-seq rkc))
(new-seq (cons key cur-seq))
(rule (rk-context-rule rkc)))
(rk-context-set-seq! rkc new-seq)
(rk-check-back-commit rkc rule new-seq))))
;; front match
(define rk-push-key-front-match
(lambda (rkc key)
(let* ((s (cons key (rk-context-seq rkc)))
(rule (rk-context-rule rkc))
(find-seq (rk-context-find-seq rkc))
(res (if (rk-partial-seq? rkc s)
(begin
(rk-context-set-seq! rkc s)
#f)
(let ((seq (find-seq (reverse s) rule)))
(if seq
(rk-proc-end-seq rkc seq s)
(rk-proc-tail rkc s))))))
res)))
;; API
;; returns the rule entry that exactly matches with current pending
;; key sequence. rkc will not be altered.
(define rk-peek-terminal-match
(lambda (rkc)
(let ((rule-entry (rk-current-seq rkc)))
(and rule-entry
(cadr rule-entry)))))
;; API
;;ĶŬÅö¡£rk.scm¤òÍý²ò¤¹¤ë¤«¡¢¤¢¤È¤Ç¤´¤Ã¤½¤êÀ߷פ·¤Ê¤ª¤¹»ö¡£
;;
;; The procedure name is confusable. I suggest rk-terminate-input!
;; -- YamaKen 2004-10-25
(define rk-push-key-last!
(lambda (rkc)
(let* ((s (rk-context-seq rkc))
(rule (rk-context-rule rkc))
(find-seq (rk-context-find-seq rkc))
(seq (find-seq (reverse s) rule)))
(rk-proc-end-seq rkc seq s))))
;; API
;; returns string list or #f
(define rk-push-key!
(lambda (rkc key)
(if (rk-context-back-match rkc)
;; mainly for Hangul
(rk-push-key-back-match rkc key)
;; for other languages
(rk-push-key-front-match rkc key))))
;; API
(define rk-pending
(lambda (c)
(string-list-concat
;; remove keysyms not representable in IM
(filter-map
(lambda (x) (if (intern-key-symbol x)
(if (symbol-bound? (string->symbol x))
(symbol-value (string->symbol x))
"")
x))
(rk-context-seq c)))))
;; API
;; return matched candidates including partial match with minimal
;; extra key sequences
;;
;; Here is the example of returned list. "a", "k" is expected keys,
;; a-cand0, a-cand1, k-cand0 is correcponding partialy matching candidates.
;; cand0, cand1 are exact matching candidates.
;;
;; ((("cand0" "cand1") . "") (("a-cand0" "a-cand1") . "a") (("k-cand0") . "k"))
;;
(define rk-cands-with-minimal-partial
(lambda (rkc)
(let ((find-cands (rk-context-find-cands-incl-minimal-partial rkc)))
(find-cands (reverse (rk-context-seq rkc)) (rk-context-rule rkc)))))
;;
(define rk-find-cands-incl-minimal-partial
(lambda (seq rule)
(let* ((exact (rk-lib-find-seq seq rule))
(partial-seqs (rk-lib-find-partial-seqs seq rule))
(seqlen (length seq))
(min-size
(if (not (null? partial-seqs))
(apply min (filter-map
(lambda (x)
(let ((len (length (caar x))))
(if (<= len seqlen)
#f
len))) partial-seqs))
0))
(partial
(filter (lambda (x)
(= (length (caar x)) min-size))
partial-seqs))
(exact-cands (if exact (cons (cadr exact) "") #f))
(pseqs
(map (lambda (x) (caar x)) partial))
(pseqs-residual-str
(map (lambda (y)
(substring (apply string-append y)
(length seq) (length y))) pseqs))
(pcands (map (lambda (x) (cadr x)) partial))
(plst (map (lambda (x y) (cons x y)) pcands pseqs-residual-str))
)
(if exact-cands
(cons exact-cands plst)
plst))))
|