1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
;;;; regex-common.scm - Common code to pregexp/pcre/regex
;
; Copyright (c) 2000-2005, Felix L. Winkelmann
; All rights reserved.
;
; Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following
; conditions are met:
;
; Redistributions of source code must retain the above copyright notice, this list of conditions and the following
; disclaimer.
; Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following
; disclaimer in the documentation and/or other materials provided with the distribution.
; Neither the name of the author nor the names of its contributors may be used to endorse or promote
; products derived from this software without specific prior written permission.
;
; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
; OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
; AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
; CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
; CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
; SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
; OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
; POSSIBILITY OF SUCH DAMAGE.
;
; Send bugs, suggestions and ideas to:
;
; felix@call-with-current-continuation.org
;
; Felix L. Winkelmann
; Unter den Gleichen 1
; 37130 Gleichen
; Germany
;;; Split string into fields:
(define string-split-fields
(let ([reverse reverse]
[substring substring]
[string-search-positions string-search-positions] )
(lambda (regexp str . mode-and-start)
(##sys#check-string str 'string-split-fields)
(let* ([argc (length mode-and-start)]
[len (##sys#size str)]
[mode (if (fx> argc 0) (car mode-and-start) #t)]
[start (if (fx> argc 1) (cadr mode-and-start) 0)]
[fini (case mode
[(#:suffix)
(lambda (ms start)
(if (fx< start len)
(##sys#error 'string-split-fields "record does not end with suffix" str regexp)
(reverse ms) ) ) ]
[(#:infix)
(lambda (ms start)
(if (fx>= start len)
(reverse ms)
(reverse (cons (substring str start len) ms)) ) ) ]
[else (lambda (ms start) (reverse ms)) ] ) ]
[fetch (case mode
[(#:infix #:suffix) (lambda (start from to) (substring str start from))]
[else (lambda (start from to) (substring str from to))] ) ] )
(let loop ([ms '()] [start start])
(let ([m (string-search-positions regexp str start)])
(if m
(let* ([mp (##sys#slot m 0)]
[from (##sys#slot mp 0)]
[to (cadr mp)] )
(if (fx= from to)
(if (fx= to len)
(fini ms start)
(loop (cons (fetch start (fx+ from 1) (fx+ to 2)) ms) (fx+ to 1)) )
(loop (cons (fetch start from to) ms) to) ) )
(fini ms start) ) ) ) ) ) ) )
;;; Substitute matching strings:
(define string-substitute
(let ([substring substring]
[reverse reverse]
[make-string make-string]
[string-search-positions string-search-positions] )
(lambda (regex subst string . flag)
(##sys#check-string subst 'string-substitute)
(let* ([which (if (pair? flag) (car flag) 1)]
[substlen (##sys#size subst)]
[substlen-1 (fx- substlen 1)]
[result '()]
[total 0] )
(define (push x)
(set! result (cons x result))
(set! total (fx+ total (##sys#size x))) )
(define (substitute matches)
(let loop ([start 0] [index 0])
(if (fx>= index substlen-1)
(push (if (fx= start 0) subst (substring subst start substlen)))
(let ([c (##core#inline "C_subchar" subst index)]
[index+1 (fx+ index 1)] )
(if (char=? c #\\)
(let ([c2 (##core#inline "C_subchar" subst index+1)])
(if (and (not (char=? #\\ c2)) (char-numeric? c2))
(let ([mi (list-ref matches (fx- (char->integer c2) 48))])
(push (substring subst start index))
(push (substring string (car mi) (cadr mi)))
(loop (fx+ index 2) index+1) )
(loop start (fx+ index+1 1)) ) )
(loop start index+1) ) ) ) ) )
(define (concatenate strs)
(let ([str (make-string total)])
(let loop ([ss strs] [index 0])
(if (null? ss)
str
(let* ([si (car ss)]
[len (##sys#size si)] )
(##core#inline "C_substring_copy" si str 0 len index)
(loop (cdr ss) (fx+ index len)) ) ) ) ) )
(let loop ([index 0] [count 1])
(let ([matches (string-search-positions regex string index)])
(cond [matches
(let* ([range (car matches)]
[upto (cadr range)] )
(cond [(or (not (fixnum? which)) (fx= count which))
(push (substring string index (car range)))
(substitute matches)
(loop upto #f) ]
[else
(push (substring string index upto))
(loop upto (fx+ count 1)) ] ) ) ]
[else
(push (substring string index (##sys#size string)))
(concatenate (reverse result)) ] ) ) ) ) ) ) )
(define string-substitute*
(let ([string-search-positions string-search-positions])
(lambda (str smap)
(##sys#check-string str 'string-substitute*)
(##sys#check-list smap 'string-substitute*)
(let ([len (##sys#size str)])
(define (collect i from total fs)
(if (fx>= i len)
(##sys#fragments->string
total
(reverse
(if (fx> i from)
(cons (##sys#substring str from i) fs)
fs) ) )
(let loop ([smap smap] [pos len])
(if (null? smap)
(collect pos from (fx+ total (fx- pos i)) fs)
(let* ([p (car smap)]
[sm (car p)]
[st (cdr p)]
[m (string-search-positions sm str i)]
[ma (and m (##sys#slot m 0))] )
(if (and ma (fx= i (##sys#slot ma 0)))
(let ([i2 (##sys#slot (##sys#slot ma 1) 0)])
(when (fx> i from)
(set! fs
(cons (##sys#substring str from i) fs)) )
(collect
i2 i2
(fx+ total (string-length st))
(cons st fs) ) )
(loop (cdr smap)
(if ma
(fxmin pos (##sys#slot ma 0))
pos) ) ) ) ) ) ) )
(collect 0 0 0 '()) ) ) ) )
;;; Some useful things:
(define glob->regexp
(let ([list->string list->string]
[string->list string->list] )
(lambda (s)
(##sys#check-string s 'glob->regexp)
(list->string
(let loop ([cs (string->list s)])
(if (null? cs)
'()
(let ([c (car cs)]
[rest (cdr cs)] )
(cond [(char=? c #\*) `(#\. #\* ,@(loop rest))]
[(char=? c #\?) (cons '#\. (loop rest))]
[(or (char-alphabetic? c) (char-numeric? c)) (cons c (loop rest))]
[else `(#\\ ,c ,@(loop rest))] ) ) ) ) ) ) ) )
(define grep
(let ([string-search string-search])
(lambda (rx lst)
(##sys#check-list lst 'grep)
(let loop ([lst lst])
(if (null? lst)
'()
(let ([x (car lst)]
[r (cdr lst)] )
(if (string-search rx x)
(cons x (loop r))
(loop r) ) ) ) ) ) ) )
;;;; Escape regular expression (suggested by Peter Bex):
(define regexp-escape
(let ([open-output-string open-output-string]
[get-output-string get-output-string] )
(lambda (str)
(##sys#check-string str 'regexp-escape)
(let ([out (open-output-string)]
[len (##sys#size str)] )
(let loop ([i 0])
(cond [(fx>= i len) (get-output-string out)]
[(memq (##core#inline "C_subchar" str i) '(#\\ #\? #\* #\+ #\^ #\$ #\( #\) #\[ #\] #\| #\{ #\}))
(##sys#write-char-0 #\\ out)
(##sys#write-char-0 (##core#inline "C_subchar" str i) out)
(loop (fx+ i 1)) ]
[else
(##sys#write-char-0 (##core#inline "C_subchar" str i) out)
(loop (fx+ i 1)) ] ) ) ) ) ) )
|
