• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Debugging
    • Projects
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
      • Std/io
        • Open-channel-lemmas
        • Std/io/read-char$
        • Std/io/read-object
        • Std/io/open-output-channel
        • Unsound-read
        • Read-string
        • Read-bytes$
        • File-measure
        • Read-bytes$-n
        • Std/io/read-byte$
        • Std/io/open-input-channel
        • Print-compressed
        • Read-file-lines-no-newlines
        • Nthcdr-bytes
        • Read-file-lines
        • Std/io/close-output-channel
        • Read-file-characters
          • Read-char$-all
            • Tr-read-char$-all
        • Read-file-bytes
        • Print-legibly
        • Std/io/close-input-channel
        • Read-file-objects
        • Logical-story-of-io
        • Take-bytes
        • Std/io/peek-char$
        • Read-file-characters-rev
        • Read-file-as-string
        • Std/io/write-byte$
        • Std/io/set-serialize-character
        • Std/io/print-object$
        • Std/io/princ$
        • Std/io/read-file-into-string
        • *file-types*
      • 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
  • Read-file-characters

Read-char$-all

(read-char$-all channel state) reads all remaining characters from a file.

Signature
(read-char$-all channel state) → (mv * state)
Arguments
channel — Guard (symbolp channel).

This is the main loop inside read-file-characters. It reads everything in the file, but doesn't handle opening or closing the file.

Definitions and Theorems

Function: read-char$-all

(defun
    read-char$-all (channel state)
    (declare (xargs :stobjs (state)))
    (declare (xargs :guard (symbolp channel)))
    (declare (xargs :guard (open-input-channel-p channel
                                                 :character state)))
    (let ((__function__ 'read-char$-all))
         (declare (ignorable __function__))
         (mbe :logic (b* (((unless (state-p state))
                           (mv nil state))
                          ((mv char state)
                           (read-char$ channel state))
                          ((unless char) (mv nil state))
                          ((mv rest state)
                           (read-char$-all channel state)))
                         (mv (cons (char-fix char) rest) state))
              :exec (b* (((mv contents state)
                          (tr-read-char$-all channel state nil)))
                        (mv (reverse contents) state)))))

Theorem: true-listp-of-read-char$-all

(defthm true-listp-of-read-char$-all
        (true-listp (mv-nth 0 (read-char$-all channel state)))
        :rule-classes :type-prescription)

Theorem: tr-read-char$-all-removal

(defthm tr-read-char$-all-removal
        (equal (tr-read-char$-all channel state nil)
               (mv (rev (mv-nth 0 (read-char$-all channel state)))
                   (mv-nth 1 (read-char$-all channel state)))))

Theorem: state-p1-of-read-char$-all

(defthm
     state-p1-of-read-char$-all
     (implies (and (force (state-p1 state))
                   (force (symbolp channel))
                   (force (open-input-channel-p1 channel
                                                 :character state)))
              (state-p1 (mv-nth 1 (read-char$-all channel state)))))

Theorem: open-input-channel-p1-of-read-char$-all

(defthm
   open-input-channel-p1-of-read-char$-all
   (implies
        (and (force (state-p1 state))
             (force (symbolp channel))
             (force (open-input-channel-p1 channel
                                           :character state)))
        (open-input-channel-p1
             channel
             :character (mv-nth 1 (read-char$-all channel state)))))

Theorem: character-listp-of-read-char$-all

(defthm character-listp-of-read-char$-all
        (character-listp (mv-nth 0 (read-char$-all channel state))))

Subtopics

Tr-read-char$-all