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
|
;;; sml-util.el --- Utility functions for sml-mode
;; Copyright (C) 1999-2000 Stefan Monnier <monnier@cs.yale.edu>
;;
;; This program 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 of the License, or
;; (at your option) any later version.
;;
;; This program 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 program; if not, write to the Free Software
;; Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
;;; Commentary:
;;; Code:
(require 'cl) ;for `reduce'
(require 'sml-compat)
;;
(defun flatten (ls &optional acc)
(if (null ls) acc
(let ((rest (flatten (cdr ls) acc))
(head (car ls)))
(if (listp head)
(flatten head rest)
(cons head rest)))))
(defun sml-preproc-alist (al)
"Expand an alist AL where keys can be lists of keys into a normal one."
(reduce (lambda (x al)
(let ((k (car x))
(v (cdr x)))
(if (consp k)
(append (mapcar (lambda (y) (cons y v)) k) al)
(cons x al))))
al
:initial-value nil
:from-end t))
;;;
;;; defmap
;;;
(defun custom-create-map (m bs args)
(let (inherit dense suppress)
(while args
(let ((key (first args))
(val (second args)))
(cond
((eq key :dense) (setq dense val))
((eq key :inherit) (setq inherit val))
((eq key :group) )
;;((eq key :suppress) (setq suppress val))
(t (message "Uknown argument %s in defmap" key))))
(setq args (cddr args)))
(unless (keymapp m)
(setq bs (append m bs))
(setq m (if dense (make-keymap) (make-sparse-keymap))))
(dolist (b bs)
(let ((keys (car b))
(binding (cdr b)))
(dolist (key (if (consp keys) keys (list keys)))
(cond
((symbolp key)
(substitute-key-definition key binding m global-map))
((null binding)
(unless (keymapp (lookup-key m key)) (define-key m key binding)))
((let ((o (lookup-key m key)))
(or (null o) (numberp o) (eq o 'undefined)))
(define-key m key binding))))))
(cond
((keymapp inherit) (set-keymap-parent m inherit))
((consp inherit) (set-keymap-parents m inherit)))
m))
(defmacro defmap (m bs doc &rest args)
`(defconst ,m
(custom-create-map (if (boundp ',m) ,m) ,bs ,(cons 'list args))
,doc))
;; defsyntax ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun custom-create-syntax (css args)
(let ((st (make-syntax-table (cadr (memq :copy args)))))
(dolist (cs css)
(let ((char (car cs))
(syntax (cdr cs)))
(if (sequencep char)
(mapcar* (lambda (c) (modify-syntax-entry c syntax st)) char)
(modify-syntax-entry char syntax st))))
st))
(defmacro defsyntax (st css doc &rest args)
`(defconst ,st (custom-create-syntax ,css ,(cons 'list args)) ,doc))
;;;;
;;;; Compatibility info
;;;;
(defvar sml-builtin-nested-comments-flag
(ignore-errors
(not (equal (let ((st (make-syntax-table)))
(modify-syntax-entry ?\* ". 23n" st) st)
(let ((st (make-syntax-table)))
(modify-syntax-entry ?\* ". 23" st) st))))
"Non-nil means this Emacs understands the `n' in syntax entries.")
(provide 'sml-util)
;;; sml-util.el ends here
|
