facts-db/cl-lessp/lessp.lisp

• Show log

  Commit

• Hash : 9961ed5e
  Author : Thomas de Grivel
  Date : 2022-11-18T19:40:00
  

  generic order predicate in Common Lisp

Download

• lessp.lisp

• ;; lessp - Generic order predicate
  ;; Copyright 2011-2022 Thomas de Grivel <thodg@kmx.io>
  ;;
  ;; Permission is hereby granted to use this software granted
  ;; the above copyright notice and this permission paragraph
  ;; are included in all copies and substantial portions of this
  ;; software.
  ;;
  ;; THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
  ;; PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
  ;; AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
  ;; THIS SOFTWARE.
  
  (defpackage :lessp
    (:use :cl)
    (:export #:lessp #:lessp-equal #:equal-from-lessp))
  
  (in-package :lessp)
  
  (defvar *types-order*
    (list 'null
          'character
          'number
          'package
          'symbol
          'string
          'vector
          'pathname))
  
  ;;  Order predicate
  
  (defgeneric lessp (a b))
  
  (defun princ-lessp (a b)
    (string< (princ-to-string a) (princ-to-string b)))
  
  (defmethod lessp (a b)
    (dolist (type *types-order*)
      (let ((ta (typep a type))
            (tb (typep b type)))
        (cond ((and ta tb)
               (princ-lessp a b))
              (tb (return-from lessp nil))
              (ta (return-from lessp t)))))
    (princ-lessp a b))
  
  (defmethod lessp ((a number) (b number))
    (< a b))
  
  (defmethod lessp ((a package) (b package))
    (and b
         (or (null a)
             (lessp (package-name a)
                    (package-name b)))))
  
  (defmethod lessp ((a symbol) (b symbol))
    (and b
         (or (and (eq (symbol-package a) (symbol-package b))
                  (string< (symbol-name a)
                           (symbol-name b)))
             (lessp (symbol-package a)
                    (symbol-package b)))))
  
  (defmethod lessp ((a string) (b string))
    (string< a b))
  
  (defmethod lessp ((a cons) (b cons))
    (cond ((lessp (car a) (car b)) t)
          ((lessp (car b) (car a)) nil)
          (t (lessp (cdr a) (cdr b)))))
  
  (defmethod lessp ((a vector) (b vector))
    (let ((la (length a))
          (lb (length b)))
      (dotimes (i (min la lb))
        (let ((ai (elt a i))
              (bi (elt b i)))
          (cond ((lessp ai bi) (return-from lessp t))
                ((lessp bi ai) (return-from lessp nil)))))
      (< la lb)))
  
  (defun pathname-string (p)
    (declare (type pathname p))
    (with-output-to-string (s)
      (print-object p s)))
  
  (defmethod lessp ((a pathname) (b pathname))
    (lessp (pathname-string a) (pathname-string b)))
  
  ;;  Equal
  
  (defgeneric lessp-equal (a b))
  
  (defmethod lessp-equal (a b)
    (not (or (lessp a b)
             (lessp b a))))
  
  ;;  For derived lessp
  
  (defun equal-from-lessp (lessp)
    (lambda (a b)
      (not (or (funcall lessp a b)
               (funcall lessp b a)))))
  
  (define-compiler-macro equal-from-lessp (lessp)
    (typecase lessp
      ((or function symbol) `(lambda (a b)
                               (not (or (,lessp a b)
                                        (,lessp b a)))))
      (t `(equal-from-lessp ,lessp))))
  

Download