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
|
-- Copyright (c) 1991-2002, The Numerical ALgorithms Group Ltd.
-- All rights reserved.
-- Copyright (C) 2007-2010, Gabriel Dos Reis.
-- 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 Numerical ALgorithms Group Ltd. 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 OWNER
-- 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.
import sys_-macros
namespace BOOT
$wildCard := char "*"
maskMatch?(mask,subject) ==
null mask => true
if not string? subject then subject := PNAME subject
or/[match?(pattern,subject) for pattern in mask]
substring?(part, whole, startpos) ==
--This function should be replaced by STRING<
np := # part
nw := # whole
np > nw - startpos => false
and/[CHAR_-EQUAL(part.ip, whole.iw)
for ip in 0..np-1 for iw in startpos.. ]
anySubstring?(part,whole,startpos) ==
np := # part
nw := # whole
or/[((k := i) and "and"/[CHAR_-EQUAL(part.ip,whole.iw)
for ip in 0..np - 1 for iw in i..]) for i in startpos..nw - np] => k
charPosition(c,t,startpos) ==
n := # t
startpos < 0 or startpos > n => n
k:= startpos
for i in startpos .. n-1 repeat
c = t.i => return nil
k := k+1
k
rightCharPosition(c,t,startpos) == --startpos often equals maxIndex t (rightmost)
k := startpos
for i in startpos..0 by -1 while c ~= stringChar(t,i) repeat (k := k - 1)
k
stringPosition(s,t,startpos) ==
n := # t
if startpos < 0 or startpos > n then error '"index out of range"
if # s = 0 then return startpos -- bug in STRPOS
r := STRPOS(s,t,startpos,NIL)
if r = nil then n else r
superMatch?(opattern,subject) == --subject assumed to be DOWNCASEd
$wildCard : local := char "*"
pattern := patternCheck opattern
logicalMatch?(pattern,subject)
logicalMatch?(pattern,subject) == --subject assumed to be DOWNCASEd
pattern is [op,:argl] =>
op = "and" => and/[superMatch?(p,subject) for p in argl]
op = "or" => or/[superMatch?(p,subject) for p in argl]
op = "not" => not superMatch?(first argl,subject)
systemError '"unknown pattern form"
basicMatch?(pattern,subject)
patternCheck pattern == main where
--checks for escape characters, maybe new $wildCard
main() ==
-- pattern := pmTransFilter pattern --should no longer need this (rdj:10/1/91)
u := pos(char "__",pattern)
null u => pattern
not(and/[equal(pattern,i + 1,$wildCard) for i in u]) =>
sayBrightly ['"Invalid use of underscores in pattern: ",pattern]
'"!!!!!!!!!!!!!!"
c := wild(pattern,'(_$ _# _% _& _@))
-- sayBrightlyNT ['"Choosing new wild card"]
-- pp c
$oldWild :local := $wildCard
$wildCard := c
pattern := mknew(pattern,first u,rest u,subString(pattern,0,first u))
-- sayBrightlyNT ['"Replacing pattern by"]
-- pp pattern
pattern
mknew(old,i,r,new) ==
new := strconc(new,old.(i + 1)) --add underscored character to string
null r => strconc(new,subWild(subString(old,i + 2),0))
mknew(old,first r,rest r,
strconc(new,subWild(subString(old,i + 2,(first r) - i - 1),i + 1)))
subWild(s,i) ==
(k := charPosition($oldWild,s,i)) < #s =>
strconc(subString(s,i,k - i),$wildCard,subWild(s,k + 1))
subString(s,i)
pos(c,s) ==
i := 0
n := maxIndex s
acc := nil
repeat
k := charPosition(c,s,i)
k > n => return reverse! acc
acc := [k,:acc]
i := k + 1
equal(p,n,c) ==
n > maxIndex p => false
p.n = c
wild(p,u) ==
for id in u repeat
c := char id
not(or/[p.i = c for i in 0..maxIndex(p)]) => return c
match?(pattern,subject) == --returns index of first character that matches
basicMatch?(pattern,DOWNCASE subject)
stringMatch(pattern,subject,wildcard) ==
not CHARP wildcard =>
systemError '"Wildcard must be a character"
$wildCard : local := wildcard
subject := DOWNCASE subject
k := basicMatch?(pattern,DOWNCASE subject) => k + 1
0
basicMatch?(pattern,target) ==
n := #pattern
p := charPosition($wildCard,pattern,0)
p = n => (pattern = target) and 0
if p ~= 0 then
-- pattern does not begin with a wild card
ans := 0
s := subString(pattern,0,p) --[pattern.i for i in 0..p-1]
not substring?(s,target,0) => return false
else if n = 1 then return 0
i := p -- starting position for searching the target
q := charPosition($wildCard,pattern,p+1)
ltarget := #target
while q ~= n repeat
s := subString(pattern,p+1,q-p-1) --[pattern.i for i in (p+1..q-1)]
i := stringPosition(s,target,i)
if null ans then ans := stringPosition(s,target,p)
-- for patterns beginning with wildcard, ans gives position of first match
if i = ltarget then return (returnFlag := true)
i := i + #s
p := q
q := charPosition($wildCard,pattern,q+1)
returnFlag => false
if p ~= q-1 then
-- pattern does not end with a wildcard
s := subString(pattern,p+1,q-p-1) --[pattern.i for i in (p+1..q-1)]
if not suffix?(s,target) then return false
if null ans then ans := 1 --pattern is a word preceded by a *
ans
matchSegment?(pattern,subject,k) ==
matchAnySegment?(pattern,DOWNCASE subject,k,nil)
matchAnySegment?(pattern,target,k,nc) == --k = start position; nc=#chars or NIL
n := #pattern
p := charPosition($wildCard,pattern,0)
p = n =>
m := stringPosition(pattern,target,k)
m = #target => nil
null nc => true
m <= k + nc - n
if k ~= 0 and nc then
target := subString(target,k,nc)
k := 0
if p ~= 0 then
-- pattern does not begin with a wild card
ans := 0
s := subString(pattern,0,p) --[pattern.i for i in 0..p-1]
not substring?(s,target,k) => return false
else if n = 1 then return true
i := p + k -- starting position for searching the target
q := charPosition($wildCard,pattern,p+1)
ltarget := #target
while q ~= n repeat
s := subString(pattern,p+1,q-p-1) --[pattern.i for i in (p+1..q-1)]
i := stringPosition(s,target,i)
if i = ltarget then return (returnFlag := true)
i := i + #s
p := q
q := charPosition($wildCard,pattern,q+1)
returnFlag => false
if p ~= q-1 then
-- pattern does not end with a '&
s := subString(pattern,p+1,q-p-1) --[pattern.i for i in (p+1..q-1)]
if not suffix?(s,target) then return false
if null ans then ans := 1 --pattern is a word preceded by a *
true
infix?(s,t,x) == #s + #t >= #x and prefix?(s,x) and suffix?(t,x)
prefix?(s,t) == substring?(s,t,0)
suffix?(s,t) ==
m := #s; n := #t
if m > n then return false
substring?(s,t,(n-m))
|
