How to resolve the algorithm Define a primitive data type step by step in the Common Lisp programming language

Published on 12 May 2024 09:40 PM
#Common lisp

How to resolve the algorithm Define a primitive data type step by step in the Common Lisp programming language

Table of Contents

Problem Statement

Demonstrate how to define a type that behaves like an integer but has a lowest valid value of 1 and a highest valid value of 10. Include all bounds checking you need to write, or explain how the compiler or interpreter creates those bounds checks for you.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Define a primitive data type step by step in the Common Lisp programming language

Source code in the common programming language

(deftype one-to-ten ()
  '(integer 1 10))


(defun word (i)
  (check-type i one-to-ten)
  (case i
    (1 "one")
    (2 "two")
    (3 "three")
    (4 "four")
    (5 "five")
    (6 "six")
    (7 "seven")
    (8 "eight")
    (9 "nine")
    (10 "ten")))


(dolist (i numbers)
  (declare (type one-to-ten i))
  ...)

You may also check:How to resolve the algorithm CSV to HTML translation step by step in the Common Lisp programming language
You may also check:How to resolve the algorithm Metallic ratios step by step in the Factor programming language
You may also check:How to resolve the algorithm Password generator step by step in the Racket programming language
You may also check:How to resolve the algorithm Paraffins step by step in the Perl programming language
You may also check:How to resolve the algorithm Cumulative standard deviation step by step in the Objective-C programming language