290 lines
12 KiB
Scheme
290 lines
12 KiB
Scheme
(module string "pre-base.ss"
|
|
|
|
(provide real->decimal-string
|
|
regexp-quote
|
|
regexp-replace-quote
|
|
regexp-match*
|
|
regexp-match-positions*
|
|
regexp-match-peek-positions*
|
|
regexp-split
|
|
regexp-match-exact?
|
|
regexp-try-match)
|
|
(require (for-syntax "stxcase-scheme.ss"))
|
|
|
|
;; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
|
|
(define (real->decimal-string n [digits 2])
|
|
(let* ([e (expt 10 digits)]
|
|
[num (round (abs (* e (inexact->exact n))))])
|
|
(format "~a~a.~a"
|
|
(if (negative? n) "-" "")
|
|
(quotient num e)
|
|
(let ([s (number->string (remainder num e))])
|
|
(if (= (string-length s) digits)
|
|
s
|
|
(string-append (make-string (- digits (string-length s)) #\0)
|
|
s))))))
|
|
;; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
;; Regexp helpers
|
|
|
|
(define (bstring-length s)
|
|
(if (bytes? s) (bytes-length s) (string-length s)))
|
|
|
|
(define (bstring->regexp name pattern)
|
|
(cond [(regexp? pattern) pattern]
|
|
[(byte-regexp? pattern) pattern]
|
|
[(string? pattern) (regexp pattern)]
|
|
[(bytes? pattern) (byte-regexp pattern)]
|
|
[else (raise-type-error
|
|
name "regexp, byte regexp, string, or byte string" pattern)]))
|
|
|
|
;; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
;; Regexp helpers
|
|
|
|
(define regexp-quote-chars:s #rx"[][.*?+|(){}\\$^]")
|
|
(define regexp-quote-chars:b #rx#"[][.*?+|(){}\\$^]")
|
|
|
|
(define (regexp-quote s [case-sens? #t])
|
|
(let* ([b? (cond [(bytes? s) #t]
|
|
[(string? s) #f]
|
|
[else (raise-type-error 'regexp-quote
|
|
"string or byte string" s)])]
|
|
[s (if b?
|
|
(regexp-replace* regexp-quote-chars:b s #"\\\\&")
|
|
(regexp-replace* regexp-quote-chars:s s "\\\\&"))])
|
|
(cond [case-sens? s]
|
|
[b? (bytes-append #"(?i:" s #")")]
|
|
[else (string-append "(?i:" s ")")])))
|
|
|
|
(define (regexp-replace-quote s)
|
|
(cond [(bytes? s) (regexp-replace* #rx#"[&\\]" s #"\\\\&")]
|
|
[(string? s) (regexp-replace* #rx"[&\\]" s "\\\\&")]
|
|
[else (raise-type-error 'regexp-replace-quote
|
|
"string or byte string" s)]))
|
|
|
|
(define (regexp-try-match pattern input-port [start-k 0] [end-k #f] [out #f])
|
|
(unless (input-port? input-port)
|
|
(raise-type-error 'regexp-try-match
|
|
"input port" input-port))
|
|
(unless (or (not out) (output-port? out))
|
|
(raise-type-error 'regexp-try-match
|
|
"output port or #f" out))
|
|
(let ([m (regexp-match-peek-positions pattern input-port start-k end-k)])
|
|
(and m
|
|
;; What happens if someone swipes our bytes before we can get them?
|
|
(let ([drop (caar m)])
|
|
;; drop prefix before match:
|
|
(let ([s (read-bytes drop input-port)])
|
|
(when out
|
|
(display s out)))
|
|
;; Get the matching part, and shift matching indicies
|
|
(let ([s (read-bytes (- (cdar m) drop) input-port)])
|
|
(cons s
|
|
(map (lambda (p)
|
|
(and p (subbytes s (- (car p) drop) (- (cdr p) drop))))
|
|
(cdr m))))))))
|
|
|
|
;; Helper macro for the regexp functions below.
|
|
(define-syntax regexp-loop
|
|
(syntax-rules ()
|
|
[(regexp-loop name loop start end rx string
|
|
success-choose failure-k
|
|
port-success-k port-success-choose port-failure-k
|
|
need-leftover? peek?)
|
|
(let ([len (cond [(string? string) (string-length string)]
|
|
[(bytes? string) (bytes-length string)]
|
|
[else #f])])
|
|
(if peek?
|
|
(unless (input-port? string)
|
|
(raise-type-error 'name "input port" string))
|
|
(unless (or len (input-port? string))
|
|
(raise-type-error
|
|
'name "string, byte string or input port" string)))
|
|
(unless (and (number? start) (exact? start) (integer? start)
|
|
(start . >= . 0))
|
|
(raise-type-error 'name "non-negative exact integer" start))
|
|
(unless (or (not end)
|
|
(and (number? end) (exact? end) (integer? end)
|
|
(end . >= . 0)))
|
|
(raise-type-error 'name "non-negative exact integer or false" end))
|
|
(unless (or (input-port? string) (and len (start . <= . len)))
|
|
(raise-mismatch-error
|
|
'name
|
|
(format "starting offset index out of range [0,~a]: " len)
|
|
start))
|
|
(unless (or (not end)
|
|
(and (start . <= . end)
|
|
(or (input-port? string)
|
|
(and len (end . <= . len)))))
|
|
(raise-mismatch-error
|
|
'name
|
|
(format "ending offset index out of range [~a,~a]: " start len)
|
|
end))
|
|
(reverse
|
|
(let loop ([acc '()] [start start] [end end] [skipped? #f])
|
|
(when (and need-leftover? (positive? start) (input-port? string))
|
|
;; Skip start chars:
|
|
(let ([s (make-bytes 4096)])
|
|
(let loop ([n 0])
|
|
(unless (= n start)
|
|
(let ([m (read-bytes-avail!
|
|
s string 0 (min (- start n) 4096))])
|
|
(unless (eof-object? m) (loop (+ n m))))))))
|
|
|
|
(if (and port-success-choose (input-port? string))
|
|
;; Input port match, get string
|
|
(let* ([discarded 0]
|
|
[leftover-port (and need-leftover? (open-output-bytes))]
|
|
[match
|
|
(regexp-match
|
|
rx string
|
|
(if need-leftover? (if skipped? 1 0) start)
|
|
(and end (if need-leftover?
|
|
(if skipped? (- end start -1) (- end start))
|
|
end))
|
|
(if need-leftover?
|
|
leftover-port
|
|
(make-output-port
|
|
'counter
|
|
always-evt
|
|
(lambda (s start end flush? breakable?)
|
|
(let ([c (- end start)])
|
|
(set! discarded (+ c discarded))
|
|
c))
|
|
void)))]
|
|
[leftovers
|
|
(and need-leftover?
|
|
(if (and (regexp? rx) (string? string))
|
|
(get-output-string leftover-port)
|
|
(get-output-bytes leftover-port)))])
|
|
(if match
|
|
(let* ([mlen (bstring-length (car match))]
|
|
[skip? (zero? mlen)])
|
|
(loop (cons (port-success-choose (car match) leftovers) acc)
|
|
(if skip? 1 0)
|
|
(and end (- end (if need-leftover?
|
|
(+ (bstring-length leftovers) start
|
|
(if skipped? 1 0))
|
|
discarded)
|
|
mlen))
|
|
skip?))
|
|
(port-failure-k acc leftovers)))
|
|
;; String/port match, get positions
|
|
(let ([match ((if peek?
|
|
regexp-match-peek-positions
|
|
regexp-match-positions)
|
|
rx string start end)]
|
|
[start (if skipped? (sub1 start) start)])
|
|
(if match
|
|
(let* ([mstart (caar match)]
|
|
[mend (cdar match)]
|
|
[skip? (= mstart mend)])
|
|
;; The following two pieces are similar, but not
|
|
;; simple to combine and preserve efficiency
|
|
(define (cont acc end* new-start new-end)
|
|
(if skip?
|
|
(if (and end* (new-start . >= . end*))
|
|
(if failure-k (failure-k acc end* end) acc)
|
|
(loop acc (add1 new-start) new-end #t))
|
|
(loop acc new-start new-end #f)))
|
|
(if port-success-k
|
|
(port-success-k
|
|
(lambda (acc new-start new-end)
|
|
(cont acc (or new-end end len) new-start new-end))
|
|
acc start end mstart mend)
|
|
(cont (cons (success-choose start mstart mend) acc)
|
|
(or end len) mend end)))
|
|
(failure-k acc start end)))))))]))
|
|
|
|
;; Returns all the positions at which the pattern matched.
|
|
(define (regexp-match-positions* pattern string [start 0] [end #f])
|
|
(define rx (bstring->regexp 'regexp-match-positions* pattern))
|
|
(regexp-loop regexp-match-positions* loop start end rx string
|
|
;; success-choose:
|
|
(lambda (start mstart mend) (cons mstart mend))
|
|
;; failure-k:
|
|
(lambda (acc start end) acc)
|
|
;; port-success-k: need to shift index of rest as reading; cannot
|
|
;; do a tail call without adding another state variable to the
|
|
;; regexp loop, so this remains inefficient
|
|
(and (input-port? string)
|
|
(lambda (loop acc start end mstart mend)
|
|
(append (map (lambda (p)
|
|
(cons (+ mend (car p)) (+ mend (cdr p))))
|
|
(loop '() 0 (and end (- end mend))))
|
|
(cons (cons mstart mend) acc))))
|
|
;; other port functions: use string case
|
|
#f
|
|
#f
|
|
#f
|
|
#f))
|
|
|
|
;; Returns all the positions at which the pattern matched.
|
|
(define (regexp-match-peek-positions* pattern string [start 0] [end #f])
|
|
(define rx (bstring->regexp 'regexp-match-peek-positions* pattern))
|
|
(regexp-loop regexp-match-peek-positions* loop start end rx string
|
|
;; success-choose:
|
|
(lambda (start mstart mend) (cons mstart mend))
|
|
;; failure-k:
|
|
(lambda (acc start end) acc)
|
|
;; port functions: use string case
|
|
#f
|
|
#f
|
|
#f
|
|
#f
|
|
#t))
|
|
|
|
;; Splits a string into a list by removing any piece which matches
|
|
;; the pattern.
|
|
(define (regexp-split pattern string [start 0] [end #f])
|
|
(define rx (bstring->regexp 'regexp-split pattern))
|
|
(define buf (if (and (string? string) (byte-regexp? rx))
|
|
(string->bytes/utf-8 string (char->integer #\?))
|
|
string))
|
|
(define sub (if (bytes? buf) subbytes substring))
|
|
(regexp-loop regexp-split loop start end rx buf
|
|
;; success-choose:
|
|
(lambda (start mstart mend) (sub buf start mstart))
|
|
;; failure-k:
|
|
(lambda (acc start end)
|
|
(cons (if end (sub buf start end) (sub buf start)) acc))
|
|
;; port-success-k:
|
|
#f
|
|
;; port-success-choose:
|
|
(lambda (match-string leftovers) leftovers)
|
|
;; port-failure-k:
|
|
(lambda (acc leftover) (cons leftover acc))
|
|
#t
|
|
#f))
|
|
|
|
;; Returns all the matches for the pattern in the string.
|
|
(define (regexp-match* pattern string [start 0] [end #f])
|
|
(define rx (bstring->regexp 'regexp-match* pattern))
|
|
(define buf (if (and (string? string) (byte-regexp? rx))
|
|
(string->bytes/utf-8 string (char->integer #\?))
|
|
string))
|
|
(define sub (if (bytes? buf) subbytes substring))
|
|
(regexp-loop regexp-match* loop start end rx buf
|
|
;; success-choose:
|
|
(lambda (start mstart mend) (sub buf mstart mend))
|
|
;; failure-k:
|
|
(lambda (acc start end) acc)
|
|
;; port-success-k:
|
|
#f
|
|
;; port-success-choose:
|
|
(lambda (match-string leftovers) match-string)
|
|
;; port-failure-k:
|
|
(lambda (acc leftover) acc)
|
|
#f
|
|
#f))
|
|
|
|
(define (regexp-match-exact? p s)
|
|
(let ([m (regexp-match-positions p s)])
|
|
(and m (zero? (caar m))
|
|
(= (cdar m)
|
|
(cond [(bytes? s) (bytes-length s)]
|
|
[(or (byte-regexp? p) (bytes? p)) (string-utf-8-length s)]
|
|
[else (string-length s)])))))
|
|
|
|
)
|