• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • 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

    Upcase-char-str

    Convert a character into an upper-case one-element string.

    Signature
    (upcase-char-str c) → str
    Arguments
    c — Guard (characterp c).
    Returns
    str — Type (stringp str).

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

    (implode (list (upcase-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 upcase-first.

    Definitions and Theorems

    Function: make-upcase-first-strtbl

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

    Function: upcase-char-str$inline

    (defun
         upcase-char-str$inline (c)
         (declare (xargs :guard (characterp c)))
         (let ((acl2::__function__ 'upcase-char-str))
              (declare (ignorable acl2::__function__))
              (mbe :logic (implode (list (upcase-char c)))
                   :exec (aref1 '*upcase-first-strtbl*
                                *upcase-first-strtbl* (char-code c)))))

    Theorem: stringp-of-upcase-char-str

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