118 | 118 |
`(sort-constructor ,_sort-body))
|
119 | 119 |
|
120 | 120 |
(defun sort-is-derived-from (sort)
|
|
121 |
(declare (type sort* sort)
|
|
122 |
(optimize (speed 3) (safety 0)))
|
121 | 123 |
(let ((df (sort-derived-from sort)))
|
122 | 124 |
(if df
|
123 | 125 |
(or (sort-is-derived-from df)
|
|
125 | 127 |
nil)))
|
126 | 128 |
|
127 | 129 |
(defun get-original-sort (sort)
|
|
130 |
(declare (type sort* sort)
|
|
131 |
(optimize (speed 3) (safety 0)))
|
128 | 132 |
(let ((res sort))
|
129 | 133 |
(loop (if (null (sort-derived-from res))
|
130 | 134 |
(return nil)
|
|
143 | 147 |
(values symbol))
|
144 | 148 |
(if (sort-is-hidden sort)
|
145 | 149 |
:h
|
146 | |
:v))
|
|
150 |
:v))
|
147 | 151 |
|
148 | 152 |
(defun print-sort-object (obj stream &rest ignore)
|
149 | 153 |
(declare (ignore ignore))
|
|
156 | 160 |
(defun new-general-sort (id module &optional hidden)
|
157 | 161 |
(declare (type symbol id)
|
158 | 162 |
(type module module)
|
159 | |
(type (or null t) hidden))
|
|
163 |
(optimize (speed 3) (safety 0)))
|
160 | 164 |
(let ((sort (sort* id hidden)))
|
161 | 165 |
(setf (sort-module sort) module)
|
162 | 166 |
(set-object-context-module sort module)
|
|
168 | 172 |
(defun get-sort-named (sort-name module)
|
169 | 173 |
(declare (type symbol sort-name)
|
170 | 174 |
(type module module)
|
171 | |
(values (or null sort-struct)))
|
|
175 |
(optimize (speed 3) (safety 0)))
|
172 | 176 |
(find-in-assoc-table *sort-table* (cons sort-name module)))
|
173 | 177 |
|
174 | 178 |
(defun clear-tmp-sort-cache () (setq *sort-table* nil))
|
175 | 179 |
(defun register-sort-cache (sort)
|
176 | 180 |
(declare (type sort-struct sort)
|
177 | |
(values t))
|
|
181 |
(optimize (speed 3) (safety 0)))
|
178 | 182 |
(add-to-assoc-table *sort-table* (cons (sort-id sort)
|
179 | 183 |
(sort-module sort))
|
180 | 184 |
sort))
|
181 | |
|
182 | |
;;; ************
|
183 | |
;;; RECORD&CLASS________________
|
184 | |
;;; ************
|
185 | |
;;; structure of instances of record or classe sorts. inherits %sort.
|
186 | |
;;;
|
187 | |
;;; additional slots:
|
188 | |
;;; slots : slot information
|
189 | |
;;; idconstr : class/record id constructor,
|
190 | |
;;; a pair of (method . pattern-variable).
|
191 | |
;;; constr : class/record constructor method.
|
192 | |
;;; maker : list of methods for make.Foo operations.
|
193 | |
;;;
|
194 | |
;;; slot information is a list of slot-info, which is a 6-tuple
|
195 | |
;;; (slot-name sort default attribute-constructor reader writer), where
|
196 | |
;;; 0 slot-name : slots' name, a string.
|
197 | |
;;; 1 sort : the sort of the slot's value.
|
198 | |
;;; 2 default : the default value (pre-term, i.e., string or sequence of
|
199 | |
;;; tokens.)
|
200 | |
;;; 3 attribute-id : the attribute name constructor,
|
201 | |
;;; a pair of (method . pattern-variable).
|
202 | |
;;; 4 reader : attribute reader method.
|
203 | |
;;; 5 writer : attribute writer method.
|
204 | |
;;;
|
205 | |
;;; * NOTE * `pattern-variable's are used for constructing record/class
|
206 | |
;;; template term (generalizing constructor terms in axioms).
|
207 | |
;;;
|
208 | |
|
209 | |
(defstruct (crsort (:include sort* (-type 'crsort))
|
210 | |
(:copier nil)
|
211 | |
(:constructor make-crsort)
|
212 | |
(:constructor crsort* (id &optional hidden))
|
213 | |
(:print-function print-cr-sort-object))
|
214 | |
(slots nil :type list) ; slot informations.
|
215 | |
(idconstr nil :type list) ; id constructor info.
|
216 | |
(constr nil :type t) ; term constructor method.
|
217 | |
(maker nil :type list) ; list of methods for `make.Foo'
|
218 | |
; operations.
|
219 | |
(copy nil :type (or null t)) ; t iff the sort is a copy.
|
220 | |
)
|
221 | |
|
222 | |
(eval-when (:execute :load-toplevel)
|
223 | |
(setf (get 'crsort :print) 'print-sort-internal)
|
224 | |
(setf (symbol-function 'is-crsort) (symbol-function 'crsort-p))
|
225 | |
(setf (get 'crsort :type-predicate) (symbol-function 'crsort-p))
|
226 | |
)
|
227 | |
|
228 | |
(defun print-cr-sort-object (obj stream &rest ignore)
|
229 | |
(print-sort-object obj stream ignore))
|
230 | |
|
231 | |
;;; Class sort _________________
|
232 | |
;;;
|
233 | |
|
234 | |
(defstruct (class-sort (:include crsort (-type 'class-sort))
|
235 | |
(:copier nil)
|
236 | |
(:constructor make-class-sort)
|
237 | |
(:constructor class-sort* (id &optional hidden))
|
238 | |
(:print-function print-class-sort-object))
|
239 | |
)
|
240 | |
|
241 | |
(eval-when (:execute :load-toplevel)
|
242 | |
(setf (get 'class-sort :type-predicate) (symbol-function 'class-sort-p))
|
243 | |
(setf (symbol-function 'is-class-sort) (symbol-function 'class-sort-p))
|
244 | |
(setf (get 'class-sort :print) 'print-sort-internal))
|
245 | |
|
246 | |
(defun print-class-sort-object (obj stream &rest ignore)
|
247 | |
(print-sort-object obj stream ignore))
|
248 | |
|
249 | |
;;; Record sort ________________
|
250 | |
|
251 | |
(defstruct (record-sort (:include crsort (-type 'record-sort))
|
252 | |
(:constructor make-record-sort)
|
253 | |
(:constructor record-sort* (id &optional hidden))
|
254 | |
(:print-function print-record-sort-object)
|
255 | |
(:copier nil))
|
256 | |
)
|
257 | |
|
258 | |
(eval-when (:execute :load-toplevel)
|
259 | |
(setf (get 'record-sort :type-predicate)
|
260 | |
(symbol-function 'record-sort-p))
|
261 | |
(setf (get 'record-sort :print) 'print-sort-internal)
|
262 | |
(setf (symbol-function 'is-record-sort)
|
263 | |
(symbol-function 'record-sort-p)))
|
264 | |
|
265 | |
(defun print-record-sort-object (obj stream &rest ignore)
|
266 | |
(print-sort-object obj stream ignore))
|
267 | |
|
268 | |
;;; Primitive structure accessors ----------------------------------------------
|
269 | |
|
270 | |
;;; (defmacro crsort-slots (_s) `(%crsort-slots ,_s))
|
271 | |
;;; (defmacro crsort-id (_s) `(crsort-idconstr ,_s))
|
272 | |
;;; (defmacro crsort-constr (_s) `(crsort-constr ,_s))
|
273 | |
(defmacro crsort-constr-method (_s) `(crsort-constr ,_s)) ; synonym
|
274 | |
(defmacro crsort-id-method (_s) `(car (crsort-idconstr ,_s)))
|
275 | |
(defmacro crsort-id-variable (_s) `(cdr (crsort-idconstr ,_s)))
|
276 | |
;;; (defmacro crsort-maker (_s) `(%crsort-maker ,_s))
|
277 | |
(defmacro crsort-make-1 (_s) `(car (crsort-maker ,_s)))
|
278 | |
(defmacro crsort-make-2 (_s) `(cadr (crsort-maker ,_s)))
|
279 | |
;;; (defmacro crsort-copy (_s) `(crsort-copy ,_s))
|
280 | |
(defmacro crsort-is-a-copy (_s) `(crsort-copy ,_s))
|
281 | |
|
282 | |
;;; the following two are only for class sort
|
283 | |
(defmacro crsort-make-3 (_s) `(caddr (crsort-maker ,_s)))
|
284 | |
(defmacro crsort-make-4 (_s) `(cadddr (crsort-maker ,_s)))
|
285 | |
|
286 | |
;;; Primitive Constructors -----------------------------------------------------
|
287 | |
|
288 | |
(defun create-cr-sort (p-type id module constructor inhabited slots hidden)
|
289 | |
(declare (type symbol p-type id)
|
290 | |
(type module module)
|
291 | |
(type t constructor)
|
292 | |
(type (or null t) inhabited hidden)
|
293 | |
(type list slots)
|
294 | |
(values crsort))
|
295 | |
(let ((s (if (eq p-type 'class-sort)
|
296 | |
(class-sort* id)
|
297 | |
(record-sort* id))))
|
298 | |
(setf (sort-module s) module
|
299 | |
(sort-constructor s) constructor
|
300 | |
(sort-inhabited s) inhabited
|
301 | |
(crsort-slots s) slots
|
302 | |
(crsort-hidden s) hidden)
|
303 | |
(setf (crsort-maker s) (if (eq p-type 'class-sort)
|
304 | |
(list nil nil nil nil)
|
305 | |
(list nil nil)))
|
306 | |
(set-object-context-module s module)
|
307 | |
s))
|
308 | |
|
309 | |
(defun new-record-sort (id module &optional hidden)
|
310 | |
(declare (type symbol id)
|
311 | |
(type module module)
|
312 | |
(type (or null t) hidden)
|
313 | |
(values crsort))
|
314 | |
(create-cr-sort 'record-sort ; type
|
315 | |
id ; id
|
316 | |
module ;
|
317 | |
nil ; constructor
|
318 | |
nil ; inhabited
|
319 | |
nil ; slots
|
320 | |
hidden))
|
321 | |
|
322 | |
(defun new-class-sort (id module &optional hidden)
|
323 | |
(declare (type symbol id)
|
324 | |
(type module module)
|
325 | |
(type (or null t) hidden)
|
326 | |
(values crsort))
|
327 | |
(create-cr-sort 'class-sort
|
328 | |
id
|
329 | |
module
|
330 | |
nil
|
331 | |
nil
|
332 | |
nil
|
333 | |
hidden))
|
334 | |
|
335 | |
;;; Type Predicates ------------------------------------------------------------
|
336 | |
|
337 | |
;;; (defmacro crsort-p (_s)
|
338 | |
;;; `(and (chaos-object? ,_s) (memq (object-type ,_s) '(record-sort
|
339 | |
;;; class-sort))))
|
340 | |
;;; (defmacro record-sort-p (_s) `(is-record-sort ,_s))
|
341 | |
;;; (defmacro class-sort-p (_s) `(is-class-sort ,_s))
|
342 | |
|
343 | |
;;; Accessors For Slot Informations --------------------------------------------
|
344 | |
|
345 | |
(defmacro find-slot-info (slot-name sort) ` (assoc ,slot-name (crsort-slots ,sort)
|
346 | |
:test #'equal))
|
347 | |
(defmacro cr-slot-name (_slot-info) `(car ,_slot-info))
|
348 | |
(defmacro cr-slot-sort (_slot-info) `(cadr ,_slot-info))
|
349 | |
(defmacro cr-slot-default (_slot-info) `(caddr ,_slot-info))
|
350 | |
(defmacro cr-slot-attribute-id (_slot-info) `(cadddr ,_slot-info))
|
351 | |
(defmacro cr-slot-attribute-id-method (_slot-info) `(car (cadddr ,_slot-info)))
|
352 | |
(defmacro cr-slot-attribute-id-variable (_slot-info) `(cdr (cadddr ,_slot-info)))
|
353 | |
(defmacro cr-slot-reader (_slot-info) `(nth 4 ,_slot-info))
|
354 | |
(defmacro cr-slot-writer (_slot-info) `(nth 5 ,_slot-info))
|
355 | |
|
356 | |
;;; getting infos via slot-name.
|
357 | |
|
358 | |
(defmacro get-slot-sort (_slot-name _s)
|
359 | |
`(cr-slot-sort (find-slot-info ,_slot-name ,_s)))
|
360 | |
(defmacro get-slot-default (_slot-name _s)
|
361 | |
`(cr-slot-default (find-slot-info ,_slot-name ,_s)))
|
362 | |
(defmacro get-attribute-id (_slot-name _s)
|
363 | |
`(cr-slot-attribute-id (find-slot-info ,_slot-name ,_s)))
|
364 | |
(defmacro get-attribute-id-method (_slot-name _s)
|
365 | |
`(cr-slot-attribute-id-method (find-slot-info ,_slot-name ,_s)))
|
366 | |
(defmacro get-attribute-id-variable (_slot-name _s)
|
367 | |
`(cr-slot-attribute-id-variable (find-slot-info ,_slot-name ,_s)))
|
368 | |
(defmacro get-slot-reader (_slot-name _s)
|
369 | |
`(cr-slot-reader (find-slot-info ,_slot-name ,_s)))
|
370 | |
(defmacro get-slot-writer (_slot-name _s)
|
371 | |
`(cr-slot-writer (find-slot-info ,_slot-name ,_s)))
|
372 | 185 |
|
373 | 186 |
;;; *****
|
374 | 187 |
;;; BSORT____________________
|
|
403 | 216 |
(type module module)
|
404 | 217 |
(type list info)
|
405 | 218 |
(type (or null t) hidden)
|
406 | |
(values bsort))
|
|
219 |
(optimize (speed 3) (safety 0)))
|
407 | 220 |
(let ((bs (bsort* id hidden)))
|
408 | 221 |
(setf (sort-module bs) module
|
409 | 222 |
(bsort-info bs) info)
|
|
436 | 249 |
|
437 | 250 |
(defun get-builtin-sort-named (sort-name)
|
438 | 251 |
(declare (type symbol sort-name)
|
439 | |
(values (or null bsort)))
|
|
252 |
(optimize (speed 3) (safety 0)))
|
440 | 253 |
(find-in-assoc-table *builtin-sort-table* sort-name #'eq))
|
441 | 254 |
|
442 | 255 |
(defun register-builtin-sort (sort)
|
443 | 256 |
(declare (type bsort sort)
|
444 | |
(values t))
|
|
257 |
(optimize (speed 3) (safety 0)))
|
445 | 258 |
(add-to-assoc-table *builtin-sort-table* (sort-id sort) sort #'eq))
|
446 | 259 |
|
447 | 260 |
(defun clear-builtin-sorts ()
|
|
486 | 299 |
(type (or null module) module)
|
487 | 300 |
(type list and-components)
|
488 | 301 |
(type (or null t) hidden)
|
489 | |
(values and-sort))
|
|
302 |
(optimize (speed 3) (safety 0)))
|
490 | 303 |
(let ((as (and-sort* id hidden)))
|
491 | 304 |
(setf (sort-module as) module
|
492 | 305 |
(and-sort-components as) and-components)
|
493 | 306 |
(set-object-context-module as module)
|
494 | 307 |
as))
|
495 | |
|
496 | |
;;; Predicates -----------------------------------------------------------------
|
497 | |
|
498 | |
;;; (defmacro and-sort-p (_object) `(is-and-sort ,_object))
|
499 | |
|
500 | |
#|| not used
|
501 | |
(defmacro is-and-sort-term (term)
|
502 | |
(once-only (term)
|
503 | |
`(and (term? ,term) (and-sort-p (term-body ,term)))))
|
504 | |
||#
|
505 | 308 |
|
506 | 309 |
;;; *******
|
507 | 310 |
;;; OR-SORT__________________
|
|
528 | 331 |
(defun print-or-sort-object (obj stream &rest ignore)
|
529 | 332 |
(print-sort-object obj stream ignore))
|
530 | 333 |
|
531 | |
;;; Primitve accessors ---------------------------------------------------------
|
532 | |
|
533 | |
;;; (defmacro or-sort-components (_or-sort)
|
534 | |
;;; `(%or-sort-components ,_or-sort))
|
535 | |
|
536 | 334 |
;;; Primitve constructor -------------------------------------------------------
|
537 | 335 |
|
538 | 336 |
(defun new-or-sort (id &optional module or-components hidden)
|
|
540 | 338 |
(type (or null module) module)
|
541 | 339 |
(type list or-components)
|
542 | 340 |
(type (or null t) hidden)
|
543 | |
(values or-sort))
|
|
341 |
(optimize (speed 3) (safety 0)))
|
544 | 342 |
(let ((os (or-sort* id hidden)))
|
545 | 343 |
(setf (sort-module os) module
|
546 | 344 |
(or-sort-components os) or-components)
|
547 | 345 |
(set-object-context-module os module)
|
548 | 346 |
os))
|
549 | |
|
550 | |
;;; Predicate ------------------------------------------------------------------
|
551 | |
|
552 | |
;;; (defmacro or-sort-p (_object) `(is-or-sort ,_object))
|
553 | 347 |
|
554 | 348 |
;;; ********
|
555 | 349 |
;;; ERR-SORT_________________
|
|
575 | 369 |
(defun print-err-sort-object (obj stream &rest ignore)
|
576 | 370 |
(print-sort-object obj stream ignore))
|
577 | 371 |
|
578 | |
;;; Primitve accessors ---------------------------------------------------------
|
579 | |
|
580 | |
;;; (defmacro err-sort-components (_err-sort)
|
581 | |
;;; `(%err-sort-components ,_err-sort))
|
582 | |
|
583 | |
;;; (defmacro err-sort-subsorts (_err-sort)
|
584 | |
;;; `(err-sort-lowers ,_err-sort))
|
585 | |
|
586 | 372 |
;;; Primitive Constructor ------------------------------------------------------
|
587 | 373 |
|
588 | 374 |
(defun new-err-sort (id &optional module components lowers hidden)
|
|
590 | 376 |
(type (or null module) module)
|
591 | 377 |
(type list components lowers)
|
592 | 378 |
(type (or null t) hidden)
|
593 | |
(values err-sort))
|
|
379 |
(optimize (speed 3) (safety 0)))
|
594 | 380 |
(let ((es (err-sort* id hidden)))
|
595 | 381 |
(setf (sort-module es) module
|
596 | 382 |
(err-sort-components es) components
|
597 | 383 |
(err-sort-lowers es) lowers)
|
598 | 384 |
(set-object-context-module es module)
|
599 | 385 |
es))
|
600 | |
|
601 | |
;;; Predicates ----------------------------------------------------------------
|
602 | |
|
603 | |
;;; (defmacro err-sort-p (_object) `(is-err-sort ,_object))
|
604 | 386 |
|
605 | 387 |
;;; ********************
|
606 | 388 |
;;; EQUALITY AMONG SORTS______________
|
|
670 | 452 |
|
671 | 453 |
(defun elim-sys-sorts-from-relation (sl)
|
672 | 454 |
(declare (type list sl)
|
673 | |
(values list))
|
|
455 |
(values list)
|
|
456 |
(optimize (speed 3) (safety 0)))
|
674 | 457 |
(macrolet ((pure? (_sl)
|
675 | 458 |
` (dolist (_s ,_sl t)
|
676 | 459 |
(when (sort-is-for-regularity? _s) (return nil))))
|
|
713 | 496 |
|
714 | 497 |
(defun copy-sort-order (sort-order)
|
715 | 498 |
(declare (type sort-order sort-order)
|
|
499 |
(optimize (speed 3) (safety 0))
|
716 | 500 |
(values sort-order))
|
717 | 501 |
(let ((new-order (allocate-sort-order)))
|
718 | 502 |
(maphash #'(lambda (s sl)
|
|
722 | 506 |
|
723 | 507 |
(defun get-all-sorts (sort-order)
|
724 | 508 |
(declare (type sort-order sort-order)
|
725 | |
(values list))
|
|
509 |
(optimize (speed 3) (safety 0)))
|
726 | 510 |
(let ((res nil))
|
727 | 511 |
(maphash #'(lambda (ss sl)
|
728 | 512 |
(declare (ignore sl))
|
|
775 | 559 |
|
776 | 560 |
(defun the-err-sort (sort &optional (sort-order *current-sort-order*))
|
777 | 561 |
(declare (type sort* sort)
|
778 | |
(type sort-order sort-order))
|
|
562 |
(type sort-order sort-order)
|
|
563 |
(optimize (speed 3) (safety 0)))
|
779 | 564 |
(cond ((sort= sort *universal-sort*) sort)
|
780 | 565 |
((sort= sort *huniversal-sort*) sort)
|
781 | 566 |
((sort= sort *cosmos*) sort)
|
|
799 | 584 |
(defun sort< (s1 s2 &optional (sort-order *current-sort-order*))
|
800 | 585 |
(declare (type sort* s1 s2)
|
801 | 586 |
(type sort-order sort-order)
|
|
587 |
(optimize (speed 3) (safety 0))
|
802 | 588 |
(values (or null t)))
|
803 | 589 |
(and (not (sort= s1 s2))
|
804 | 590 |
(or (sort= s2 *cosmos*)
|
|
840 | 626 |
(memq ,s2 (supersorts ,s1 ,sort-order)))))))))))
|
841 | 627 |
|
842 | 628 |
;;; function version
|
|
629 |
(declaim (inline sort<*))
|
843 | 630 |
(defun sort<* (s1 s2 &optional (sort-order *current-sort-order*))
|
844 | 631 |
(declare (type sort* s1 s2)
|
845 | 632 |
(type sort-order sort-order)
|
846 | |
(values (or null t)))
|
|
633 |
(optimize (speed 3) (safety 0)))
|
847 | 634 |
(sort< s1 s2 sort-order))
|
848 | 635 |
|
849 | 636 |
;;; SORT<= sort1 sort2 sort-order
|
|
855 | 642 |
(sort< ,_s1 ,_s2 ,_sort-order))))
|
856 | 643 |
|
857 | 644 |
;;; it's function version.
|
|
645 |
(declaim (inline sort<=*))
|
858 | 646 |
(defun sort<=* (s1 s2 &optional (sort-order *current-sort-order*))
|
859 | 647 |
(declare (type sort* s1 s2)
|
860 | 648 |
(type sort-order sort-order)
|
|
649 |
(optimize (speed 3) (safety 0))
|
861 | 650 |
(values (or null t)))
|
862 | 651 |
(or (sort= s1 s2) (sort< s1 s2 sort-order)))
|
863 | 652 |
|
|
879 | 668 |
;;; returns t iff each elements of sort-list1 is a subsort of
|
880 | 669 |
;;; corresponding sort of sort-list2.
|
881 | 670 |
;;;
|
|
671 |
(declaim (inline sort-list<=))
|
882 | 672 |
(defun sort-list<= (lst1 lst2 &optional (so *current-sort-order*))
|
883 | 673 |
(declare (type list lst1 lst2)
|
884 | 674 |
(type sort-order so)
|
|
675 |
(optimize (speed 3) (safety 0))
|
885 | 676 |
(values (or null t)))
|
886 | 677 |
(loop (when (null lst1)(return (null lst2)))
|
887 | 678 |
(when (null lst2)(return (null lst1)))
|
|
890 | 681 |
(setq lst1 (cdr lst1))
|
891 | 682 |
(setq lst2 (cdr lst2))))
|
892 | 683 |
|
|
684 |
(declaim (inline sort-list<=-any))
|
893 | 685 |
(defun sort-list<=-any (lst1 lst2 &optional (so *current-sort-order*))
|
894 | 686 |
(declare (type list lst1 lst2)
|
895 | 687 |
(type sort-order so)
|
|
688 |
(optimize (speed 3) (safety 0))
|
896 | 689 |
(values (or null t)))
|
897 | 690 |
(loop (when (null lst1)(return (null lst2)))
|
898 | 691 |
(when (null lst2)(return (null lst1)))
|
|
907 | 700 |
;;; returns t iff each elements of sort-list1 is a proper subsort of
|
908 | 701 |
;;; corresponding sort of sort-list2.
|
909 | 702 |
;;;
|
|
703 |
(declaim (inline sort-list<))
|
910 | 704 |
(defun sort-list< (lst1 lst2 &optional (so *current-sort-order*))
|
911 | 705 |
(declare (type list lst1 lst2)
|
912 | 706 |
(type sort-order so)
|
|
707 |
(optimize (speed 3) (safety 0))
|
913 | 708 |
(values (or null t)))
|
914 | 709 |
(loop (when (null lst1)(return (null lst2)))
|
915 | 710 |
(when (null lst2)(return (null lst1)))
|
|
929 | 724 |
(defun add-sort-to-order (sort &optional (sort-order *current-sort-order*))
|
930 | 725 |
(declare (type sort* sort)
|
931 | 726 |
(type sort-order sort-order)
|
932 | |
(values t))
|
|
727 |
(optimize (speed 3) (safety 0)))
|
933 | 728 |
(let ((ent (get-sort-relation sort sort-order)))
|
934 | 729 |
(unless ent
|
935 | 730 |
(add-relation-to-order (make-sort-relation sort nil nil) sort-order))))
|
|
942 | 737 |
(sort-order *current-sort-order*))
|
943 | 738 |
(declare (type list relation)
|
944 | 739 |
(type sort-order sort-order)
|
945 | |
(values list))
|
|
740 |
(optimize (speed 3) (safety 0)))
|
946 | 741 |
(macrolet ((pushnew-relation (__?rel __?res)
|
947 | 742 |
` (pushnew ,__?rel ,__?res :test #'eq)))
|
948 | 743 |
(let ((res nil)
|
|
960 | 755 |
&optional (sort-order *current-sort-order*))
|
961 | 756 |
(declare (type list sort-relation)
|
962 | 757 |
(type sort-order sort-order)
|
|
758 |
(optimize (speed 3) (safety 0))
|
963 | 759 |
(values sort-order))
|
964 | 760 |
(let* ((sort (sort-relation-sort sort-relation))
|
965 | 761 |
(subs (_subsorts sort-relation))
|
|
1012 | 808 |
(defun max-minorants (sort-set order)
|
1013 | 809 |
(declare (type sort-order order)
|
1014 | 810 |
(type list sort-set)
|
|
811 |
(optimize (speed 3) (safety 0))
|
1015 | 812 |
(values list))
|
1016 | 813 |
(labels ((inter-lower (set)
|
1017 | 814 |
(declare (type list set)
|
|
1039 | 836 |
(defun maximal-sorts (sorts order)
|
1040 | 837 |
(declare (type list sorts)
|
1041 | 838 |
(type sort-order order)
|
|
839 |
(optimize (speed 3) (safety 0))
|
1042 | 840 |
(values list))
|
1043 | 841 |
(let ((maximal nil))
|
1044 | 842 |
(dolist (s sorts maximal)
|
|
1048 | 846 |
(defun maximal-sorts-no-error (sorts order) ; version avoiding error sorts.
|
1049 | 847 |
(declare (type list sorts)
|
1050 | 848 |
(type sort-order order)
|
|
849 |
(optimize (speed 3) (safety 0))
|
1051 | 850 |
(values list))
|
1052 | 851 |
(let ((maximal nil))
|
1053 | 852 |
(dolist (s sorts maximal)
|
|
1061 | 860 |
(defun minimal-sorts (sorts order)
|
1062 | 861 |
(declare (type list sorts)
|
1063 | 862 |
(type sort-order order)
|
|
863 |
(optimize (speed 3) (safety 0))
|
1064 | 864 |
(values list))
|
1065 | 865 |
(let ((minimal nil))
|
1066 | 866 |
(declare (type list minimal))
|
|
1076 | 876 |
;;;
|
1077 | 877 |
(defun meet-of-sorts (sort1 sort2 &optional (sort-order *current-sort-order*))
|
1078 | 878 |
(declare (type sort* sort1 sort2)
|
1079 | |
(type sort-order sort-order))
|
|
879 |
(type sort-order sort-order)
|
|
880 |
(optimize (speed 3) (safety 0)))
|
1080 | 881 |
(cond ((sort<= sort1 sort2) (list sort1))
|
1081 | 882 |
((sort< sort2 sort1 sort-order) (list sort2))
|
1082 | 883 |
(t (maximal-sorts (intersection (subsorts sort1) (subsorts sort2))
|
|
1087 | 888 |
;;;
|
1088 | 889 |
(defun merge-sort-relations (sl1 sl2)
|
1089 | 890 |
(declare (type list sl1 sl2)
|
|
891 |
(optimize (speed 3) (safety 0))
|
1090 | 892 |
(values list))
|
1091 | 893 |
(unless sl1 (return-from merge-sort-relations sl2))
|
1092 | 894 |
(dolist (sort-relation sl1)
|
|
1109 | 911 |
(defun merge-sort-order (order1 order2)
|
1110 | 912 |
(declare (type (or null sort-order) order1)
|
1111 | 913 |
(type sort-order order2)
|
|
914 |
(optimize (speed 3) (safety 0))
|
1112 | 915 |
(values sort-order))
|
1113 | 916 |
(unless order1 (return-from merge-sort-order order2))
|
1114 | 917 |
(maphash #'(lambda (sort sort-relation)
|
|
1131 | 934 |
(defun merge-sort-order-no-extra (order1 order2)
|
1132 | 935 |
(declare (type (or null sort-order) order1)
|
1133 | 936 |
(type sort-order order2)
|
|
937 |
(optimize (speed 3) (safety 0))
|
1134 | 938 |
(values sort-order))
|
1135 | 939 |
(unless order1 (return-from merge-sort-order-no-extra order2))
|
1136 | 940 |
(macrolet ((filter-out-ordinal-sorts (___sort-list)
|
|
1160 | 964 |
;;; check if sort1 and sort2 is in same sort hierarchy
|
1161 | 965 |
;;; *NOTE* : assume error sorts are already genrated.
|
1162 | 966 |
;;;
|
|
967 |
(declaim (inline is-in-same-connected-component))
|
1163 | 968 |
(defun is-in-same-connected-component (s1 s2 sort-order)
|
1164 | 969 |
(declare (type sort* s1 s2)
|
1165 | 970 |
(type sort-order sort-order)
|
|
971 |
(optimize (speed 3) (safety 0))
|
1166 | 972 |
(values (or null t)))
|
1167 | 973 |
(or (sort= s1 s2)
|
1168 | 974 |
(if (or (sort= s1 *cosmos*) (sort= s2 *cosmos*))
|
|
1187 | 993 |
;;; COMPONENT-TOP : sort sort-order -> sort
|
1188 | 994 |
;;; returns the greatest sorts of given sort
|
1189 | 995 |
;;;
|
|
996 |
(declaim (inline component-top))
|
1190 | 997 |
(defun component-top (sort sort-order)
|
1191 | 998 |
(declare (type sort* sort)
|
1192 | 999 |
(type sort-order sort-order)
|
|
1000 |
(optimize (speed 3) (safety 0))
|
1193 | 1001 |
(values list))
|
1194 | 1002 |
(maximal-sorts (supersorts-no-err sort sort-order) sort-order))
|
1195 | 1003 |
|
|
1201 | 1009 |
(defun is-in-same-connected-component* (s1 s2 so)
|
1202 | 1010 |
(declare (type sort* s1 s2)
|
1203 | 1011 |
(type sort-order so)
|
|
1012 |
(optimize (speed 3) (safety 0))
|
1204 | 1013 |
(values (or null t)))
|
1205 | 1014 |
(or (sort= s1 s2)
|
1206 | 1015 |
(sort= s1 *cosmos*)
|
|
1231 | 1040 |
|
1232 | 1041 |
;;; HAVE-COMMON-SUBSORT : Sort Sort SortOrder -> Bool
|
1233 | 1042 |
;;;
|
|
1043 |
(declaim (inline have-common-subsort))
|
1234 | 1044 |
(defun have-common-subsort (s1 s2 so)
|
1235 | 1045 |
(declare (type sort* s1 s2)
|
1236 | 1046 |
(type sort-order so)
|
|
1047 |
(optimize (speed 3) (safety 0))
|
1237 | 1048 |
(values (or null t)))
|
1238 | 1049 |
(let ((ss1 (subsorts s1 so))
|
1239 | 1050 |
(ss2 (subsorts s2 so)))
|
|
1243 | 1054 |
|
1244 | 1055 |
;;; ALL-SORTS-IN-ORDER (&optional (sort-order *current-sort-order*))
|
1245 | 1056 |
;;;
|
|
1057 |
(declaim (inline all-sorts-in-order))
|
1246 | 1058 |
(defun all-sorts-in-order (&optional (sort-order *current-sort-order*))
|
1247 | 1059 |
(declare (type sort-order sort-order)
|
|
1060 |
(optimize (speed 3) (safety 0))
|
1248 | 1061 |
(values list))
|
1249 | 1062 |
(let ((res nil))
|
1250 | 1063 |
(maphash #'(lambda (sort relation)
|
|
1255 | 1068 |
|
1256 | 1069 |
;;; TOP-COMPONENTS sort-order
|
1257 | 1070 |
;;;
|
|
1071 |
(declaim (inline top-components))
|
1258 | 1072 |
(defun top-components (&optional (sort-order *current-sort-order*))
|
1259 | 1073 |
(declare (type sort-order sort-order)
|
|
1074 |
(optimize (speed 3) (safety 0))
|
1260 | 1075 |
(values list))
|
1261 | 1076 |
(maximal-sorts (let ((res nil))
|
1262 | 1077 |
(maphash #'(lambda (sort relation)
|
|
1268 | 1083 |
|
1269 | 1084 |
;;; BOTTOM-COMPONENTS sort-order
|
1270 | 1085 |
;;;
|
|
1086 |
(declaim (inline bottom-components))
|
1271 | 1087 |
(defun bottom-components (&optional (sort-order *current-sort-order*))
|
1272 | 1088 |
(declare (type sort-order sort-order)
|
|
1089 |
(optimize (speed 3) (safety 0))
|
1273 | 1090 |
(values list))
|
1274 | 1091 |
(minimal-sorts (let ((res nil))
|
1275 | 1092 |
(maphash #'(lambda (sort relation)
|
|
1282 | 1099 |
;;; DIRECT-SUBSORTS sort sort-order
|
1283 | 1100 |
;;; returns the list of sorts which are direct subsorts
|
1284 | 1101 |
;;;
|
|
1102 |
(declaim (inline direct-subsorts))
|
1285 | 1103 |
(defun direct-subsorts (sort &optional (sort-order *current-sort-order*))
|
1286 | 1104 |
(declare (type sort* sort)
|
1287 | 1105 |
(type sort-order sort-order)
|
|
1106 |
(optimize (speed 3) (safety 0))
|
1288 | 1107 |
(values list))
|
1289 | 1108 |
(maximal-sorts (subsorts sort sort-order) sort-order))
|
1290 | 1109 |
|
1291 | 1110 |
;;; DIRECT-SUPERSORTS sort sort-order
|
1292 | 1111 |
;;;
|
|
1112 |
(declaim (inline direct-supersorts))
|
1293 | 1113 |
(defun direct-supersorts (sort &optional (sort-order *current-sort-order*))
|
1294 | 1114 |
(declare (type sort*)
|
1295 | 1115 |
(type sort-order sort-order)
|
|
1116 |
(optimize (speed 3) (safety 0))
|
1296 | 1117 |
(values list))
|
1297 | 1118 |
(minimal-sorts (supersorts sort sort-order) sort-order))
|
1298 | 1119 |
|
1299 | 1120 |
;;; DIRECT-SUPERSORTS-NO-ERR
|
1300 | 1121 |
;;;
|
|
1122 |
(declaim (inline direct-supersorts-no-err))
|
1301 | 1123 |
(defun direct-supersorts-no-err (sort &optional (sort-order *current-sort-order*))
|
1302 | 1124 |
(declare (type sort* sort)
|
1303 | 1125 |
(type sort-order sort-order)
|
|
1126 |
(optimize (speed 3) (safety 0))
|
1304 | 1127 |
(values list))
|
1305 | 1128 |
(minimal-sorts (supersorts-no-err sort sort-order) sort-order))
|
1306 | |
|
1307 | |
#||
|
1308 | |
;;; DELETE-SORT-FROM-ORDER sort sort-order
|
1309 | |
;;; returns sort-order after eliminating sort.
|
1310 | |
;;;
|
1311 | |
(defun delete-sort-from-order (sort sort-order)
|
1312 | |
(remhash sort sort-order)
|
1313 | |
(maphash #'(lambda (ss sort-rel)
|
1314 | |
(declare (ignore ss))
|
1315 | |
(setf (_subsorts sort-rel)
|
1316 | |
(delete sort (_subsorts sort-rel) :test #'eq))
|
1317 | |
(setf (_supersorts sort-rel)
|
1318 | |
(delete sort (_supersorts sort-rel) :test #'eq)))
|
1319 | |
sort-order)
|
1320 | |
(update-sort-order sort-order)
|
1321 | |
sort-order)
|
1322 | |
||#
|
1323 | 1129 |
|
1324 | 1130 |
;;; SORT-RELATIONS-TRANSITIVE-CLOSURE sort-relations1 sort-relations2
|
1325 | 1131 |
;;; sort-relations2 is destructively modified.
|
1326 | 1132 |
;;;
|
1327 | |
#||
|
1328 | |
(defun sort-order-transitive-closure (previous-order new-order)
|
1329 | |
(flet ((ls-union (order s ls)
|
1330 | |
;; make the union of the sorts lower than "s" with ls.
|
1331 | |
(let ((sl (get-sort-relation s order)))
|
1332 | |
(setf (_subsorts sl)
|
1333 | |
(union (_subsorts sl) ls :test #'eq))))
|
1334 | |
(gs-union (order s gs)
|
1335 | |
;; make the union of the sorts greater than "s" with gs.
|
1336 | |
(let ((sl (get-sort-relation s order)))
|
1337 | |
(setf (_supersorts sl)
|
1338 | |
(union (_supersorts sl) gs :test #'eq)))))
|
1339 | |
(let ((closure (merge-sort-order previous-order new-order)))
|
1340 | |
(declare (type sort-order closure))
|
1341 | |
(maphash #'(lambda (sort sort-rel)
|
1342 | |
(declare (ignore sort))
|
1343 | |
(let ((ls (_subsorts sort-rel))
|
1344 | |
(gs (_supersorts sort-rel)))
|
1345 | |
(dolist (s1 ls)
|
1346 | |
(dolist (s2 gs)
|
1347 | |
(declare (type sort* s2))
|
1348 | |
(ls-union closure s2 (list s1))
|
1349 | |
(gs-union closure s1 (list s2))))))
|
1350 | |
closure)
|
1351 | |
;; generates erro sorts.
|
1352 | |
(generate-err-sorts closure)
|
1353 | |
closure)))
|
1354 | |
|
1355 | |
||#
|
1356 | 1133 |
|
1357 | 1134 |
(defun sort-relations-transitive-closure (sl1 sl2)
|
1358 | 1135 |
(declare (type list sl1 sl2)
|
|
1136 |
(optimize (speed 3) (safety 0))
|
1359 | 1137 |
(values list))
|
1360 | 1138 |
(flet ((ls-union (relations s ls)
|
1361 | 1139 |
(declare (type list relations ls)
|
|
1393 | 1171 |
|
1394 | 1172 |
(defun sort-relations-transitive-closure1 (sl)
|
1395 | 1173 |
(declare (type list sl)
|
|
1174 |
(optimize (speed 3) (safety 0))
|
|
1175 |
(inline sort-relations-transitive-closure)
|
1396 | 1176 |
(values list))
|
1397 | 1177 |
(sort-relations-transitive-closure nil sl))
|
1398 | 1178 |
|
|
1400 | 1180 |
;;;
|
1401 | 1181 |
(defun check-cyclic-sort-order (sort-order)
|
1402 | 1182 |
(declare (type sort-order sort-order)
|
|
1183 |
(optimize (speed 3) (safety 0))
|
1403 | 1184 |
(values t))
|
1404 | 1185 |
(maphash #'(lambda (ss sort-relation)
|
1405 | 1186 |
(when (member ss (_subsorts sort-relation) :test #'eq)
|
|
1415 | 1196 |
;;;
|
1416 | 1197 |
(defun clear-err-sorts (sort-order)
|
1417 | 1198 |
(declare (type sort-order sort-order)
|
|
1199 |
(optimize (speed 3) (safety 0))
|
1418 | 1200 |
(values t))
|
1419 | 1201 |
(maphash #'(lambda (s sl)
|
1420 | 1202 |
(declare (ignore s))
|
|
1426 | 1208 |
;;;
|
1427 | 1209 |
(defun get-kinds (sort-order)
|
1428 | 1210 |
(declare (type sort-order sort-order)
|
|
1211 |
(optimize (speed 3) (safety 0))
|
1429 | 1212 |
(values list))
|
1430 | 1213 |
(let ((res nil))
|
1431 | 1214 |
(maphash #'(lambda (s sl)
|
|
1450 | 1233 |
;;;
|
1451 | 1234 |
(defun get-err-sorts (sort-order)
|
1452 | 1235 |
(declare (type sort-order sort-order)
|
|
1236 |
(optimize (speed 3) (safety 0))
|
1453 | 1237 |
(values list))
|
1454 | 1238 |
(let ((res nil))
|
1455 | 1239 |
(maphash #'(lambda (s sl)
|
|
1464 | 1248 |
(defun get-family (err-sort so)
|
1465 | 1249 |
(declare (type err-sort err-sort)
|
1466 | 1250 |
(type sort-order so)
|
|
1251 |
(optimize (speed 3) (safety 0))
|
1467 | 1252 |
(values list))
|
1468 | 1253 |
(let ((res nil))
|
1469 | 1254 |
(maphash #'(lambda (s sl)
|