• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
    • Std/lists
    • Std/alists
    • Obags
    • Std/util
    • Std/strings
      • Pretty-printing
      • Printtree
      • Base64
      • Charset-p
      • Strtok!
      • Cases
        • Icharlisteqv
        • Upcase-charlist
        • Upcase-string
        • Downcase-charlist
        • Istreqv
        • Ichareqv
        • Downcase-char
        • Downcase-string
        • Upcase-char
        • Upcase-first-charlist
        • Downcase-first-charlist
        • Downcase-first
        • Upcase-first
        • Upcase-char-str
        • Downcase-char-str
        • Down-alpha-p
        • Downcase-string-list
        • Upcase-string-list
        • Up-alpha-p
      • Concatenation
      • Html-encoding
      • Character-kinds
      • Substrings
      • Strtok
      • Equivalences
      • Url-encoding
      • Lines
      • Ordering
      • Numbers
      • Pad-trim
      • Coercion
      • Std/strings-extensions
      • Std/strings/digit-to-char
      • Substitution
      • Symbols
    • Std/io
    • Std/osets
    • Std/system
    • Std/basic
    • Std/typed-lists
    • Std/bitsets
    • Std/testing
    • Std/typed-alists
    • Std/stobjs
    • Std-extensions
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Testing-utilities
  • Math

• Cases

Downcase-char-str

Convert a character into a lower-case one-element string.

Signature

(downcase-char-str c) → str

Returns

str — Type (stringp str).

(downcase-char-str c) is logically equal to:

(implode (downcase-char c))

But we store these strings in a table so that they don't have to be recomputed. This is mainly useful to reduce the creation of temporary strings during downcase-first.

Definitions and Theorems

Function: make-downcase-first-strtbl

(defun make-downcase-first-strtbl (n)
       (declare (xargs :guard (and (natp n) (<= n 255))))
       (cons (cons n
                   (implode (list (downcase-char (code-char n)))))
             (if (zp n)
                 nil
                 (make-downcase-first-strtbl (- n 1)))))

Function: downcase-char-str$inline

(defun downcase-char-str$inline (c)
       (declare (type character c))
       (let ((acl2::__function__ 'downcase-char-str))
            (declare (ignorable acl2::__function__))
            (mbe :logic (implode (list (downcase-char c)))
                 :exec (aref1 '*downcase-first-strtbl*
                              *downcase-first-strtbl*
                              (char-code c)))))

Theorem: stringp-of-downcase-char-str

(defthm stringp-of-downcase-char-str
        (b* ((str (downcase-char-str$inline c)))
            (stringp str))
        :rule-classes :type-prescription)