Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:subpattern (Results 1 - 9 of 9) sorted by null

/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/
btm_utils.py	254 for subpattern in subpatterns: 255 if any(rec_test(subpattern, lambda x: type(x) is str)): 256 if any(rec_test(subpattern, 258 subpatterns_with_common_chars.append(subpattern) 259 elif any(rec_test(subpattern, 261 subpatterns_with_common_names.append(subpattern) 264 subpatterns_with_names.append(subpattern)
pytree.py	633 for subpattern, child in zip(self.content, node.children): 634 if not subpattern.match(child, results): 690 subpattern = None 693 subpattern = self.content[0][0] 697 if subpattern is not None and self.name == subpattern.name: 698 return subpattern.optimize() 699 if (self.min <= 1 and isinstance(subpattern, WildcardPattern) and 700 subpattern.min <= 1 and self.name == subpattern.name)     [all...]
patcomp.py	170 subpattern = self.compile_node(nodes[1]) 171 return pytree.WildcardPattern([[subpattern]], min=0, max=1)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/
btm_utils.py	254 for subpattern in subpatterns: 255 if any(rec_test(subpattern, lambda x: type(x) is str)): 256 if any(rec_test(subpattern, 258 subpatterns_with_common_chars.append(subpattern) 259 elif any(rec_test(subpattern, 261 subpatterns_with_common_names.append(subpattern) 264 subpatterns_with_names.append(subpattern)
pytree.py	633 for subpattern, child in zip(self.content, node.children): 634 if not subpattern.match(child, results): 690 subpattern = None 693 subpattern = self.content[0][0] 697 if subpattern is not None and self.name == subpattern.name: 698 return subpattern.optimize() 699 if (self.min <= 1 and isinstance(subpattern, WildcardPattern) and 700 subpattern.min <= 1 and self.name == subpattern.name)     [all...]
patcomp.py	170 subpattern = self.compile_node(nodes[1]) 171 return pytree.WildcardPattern([[subpattern]], min=0, max=1)
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
sre_parse.py	89 class SubPattern: 90 # a subpattern, in intermediate form 117 if isinstance(a, SubPattern): 133 return SubPattern(self.pattern, self.data[index]) 142 # determine the width (min, max) for this subpattern 162 elif op is SUBPATTERN: 322 subpattern = SubPattern(state) 323 subpatternappend = subpattern.append 356 return subpattern     [all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
sre_parse.py	89 class SubPattern: 90 # a subpattern, in intermediate form 117 if isinstance(a, SubPattern): 133 return SubPattern(self.pattern, self.data[index]) 142 # determine the width (min, max) for this subpattern 162 elif op is SUBPATTERN: 322 subpattern = SubPattern(state) 323 subpatternappend = subpattern.append 356 return subpattern     [all...]
/external/chromium_org/v8/test/webkit/fast/regex/
parentheses.js	266 // Test evaluation order of empty subpattern alternatives. 272 // Tests that non-greedy repeat quantified parentheses will backtrack through multiple frames of subpattern matches.

Completed in 582 milliseconds