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
|
# frozen_string_literal: true
# :markup: markdown
module ActionDispatch
module Journey # :nodoc:
module Path # :nodoc:
class Pattern # :nodoc:
attr_reader :ast, :names, :requirements, :anchored, :spec
def initialize(ast, requirements, separators, anchored)
@ast = ast
@spec = ast.root
@requirements = requirements
@separators = separators
@anchored = anchored
@names = ast.names
@optional_names = nil
@required_names = nil
@re = nil
@offsets = nil
end
def build_formatter
Visitors::FormatBuilder.new.accept(spec)
end
def eager_load!
required_names
offsets
to_regexp
@ast = nil
end
def requirements_anchored?
# each required param must not be surrounded by a literal, otherwise it isn't
# simple to chunk-match the url piecemeal
terminals = ast.terminals
terminals.each_with_index { |s, index|
next if index < 1
next if s.type == :DOT || s.type == :SLASH
back = terminals[index - 1]
fwd = terminals[index + 1]
# we also don't support this yet, constraints must be regexps
return false if s.symbol? && s.regexp.is_a?(Array)
return false if back.literal?
return false if !fwd.nil? && fwd.literal?
}
true
end
def required_names
@required_names ||= names - optional_names
end
def optional_names
@optional_names ||= spec.find_all(&:group?).flat_map { |group|
group.find_all(&:symbol?)
}.map(&:name).uniq
end
class AnchoredRegexp < Journey::Visitors::Visitor # :nodoc:
def initialize(separator, matchers)
@separator = separator
@matchers = matchers
@separator_re = "([^#{separator}]+)"
super()
end
def accept(node)
%r{\A#{visit node}\Z}
end
def visit_CAT(node)
"#{visit(node.left)}#{visit(node.right)}"
end
def visit_SYMBOL(node)
node = node.to_sym
return @separator_re unless @matchers.key?(node)
re = @matchers[node]
"(#{Regexp.union(re)})"
end
def visit_GROUP(node)
"(?:#{visit node.left})?"
end
def visit_LITERAL(node)
Regexp.escape(node.left)
end
alias :visit_DOT :visit_LITERAL
def visit_SLASH(node)
node.left
end
def visit_STAR(node)
re = @matchers[node.left.to_sym]
re ? "(#{re})" : "(.+)"
end
def visit_OR(node)
children = node.children.map { |n| visit n }
"(?:#{children.join(?|)})"
end
end
class UnanchoredRegexp < AnchoredRegexp # :nodoc:
def accept(node)
path = visit node
path == "/" ? %r{\A/} : %r{\A#{path}(?:\b|\Z|/)}
end
end
class MatchData # :nodoc:
attr_reader :names
def initialize(names, offsets, match)
@names = names
@offsets = offsets
@match = match
end
def captures
Array.new(length - 1) { |i| self[i + 1] }
end
def named_captures
@names.zip(captures).to_h
end
def [](x)
idx = @offsets[x - 1] + x
@match[idx]
end
def length
@offsets.length
end
def post_match
@match.post_match
end
def to_s
@match.to_s
end
end
def match(other)
return unless match = to_regexp.match(other)
MatchData.new(names, offsets, match)
end
alias :=~ :match
def match?(other)
to_regexp.match?(other)
end
def source
to_regexp.source
end
def to_regexp
@re ||= regexp_visitor.new(@separators, @requirements).accept spec
end
def requirements_for_missing_keys_check
@requirements_for_missing_keys_check ||= requirements.transform_values do |regex|
/\A#{regex}\Z/
end
end
private
def regexp_visitor
@anchored ? AnchoredRegexp : UnanchoredRegexp
end
def offsets
@offsets ||= begin
offsets = [0]
spec.find_all(&:symbol?).each do |node|
node = node.to_sym
if @requirements.key?(node)
re = /#{Regexp.union(@requirements[node])}|/
offsets.push((re.match("").length - 1) + offsets.last)
else
offsets << offsets.last
end
end
offsets
end
end
end
end
end
end
|
