type github.com/google/licensecheck/internal/match.reSyntax
27 uses
github.com/google/licensecheck/internal/match (current package)
regexp.go#L53: syntax *reSyntax
rematch.go#L274: func (re *reSyntax) compile(init reProg, m int32) (reProg, error) {
rematch.go#L282: func (c *reCompile) compile(re *reSyntax) {
rematch.go#L436: func canMatchEmpty(re *reSyntax) bool {
resyntax.go#L63: type reSyntax struct {
resyntax.go#L65: sub []*reSyntax // subexpressions (opConcat, opAlternate, opWild, opQuest)
resyntax.go#L90: func (re *reSyntax) string(d *Dict) string {
resyntax.go#L114: func rePrint(b *bytes.Buffer, re *reSyntax, d *Dict) {
resyntax.go#L177: stack []*reSyntax
resyntax.go#L187: func reParse(d *Dict, s string, strict bool) (*reSyntax, error) {
resyntax.go#L201: p.push(&reSyntax{op: opLeftParen})
resyntax.go#L277: p.push(&reSyntax{op: opWild, n: int32(n)})
resyntax.go#L327: func (p *reParser) push(re *reSyntax) *reSyntax {
resyntax.go#L350: var re *reSyntax
resyntax.go#L354: re = p.push(&reSyntax{op: opWords})
resyntax.go#L363: p.stack = append(p.stack, &reSyntax{op: opWords, w: []WordID{last.ID}})
resyntax.go#L376: p.push(&reSyntax{op: opVerticalBar})
resyntax.go#L438: p.stack[n-1] = &reSyntax{op: opQuest, sub: []*reSyntax{sub}}
resyntax.go#L443: func (p *reParser) concat() *reSyntax {
resyntax.go#L454: return p.push(&reSyntax{op: opEmpty})
resyntax.go#L461: func (p *reParser) alternate() *reSyntax {
resyntax.go#L478: func (p *reParser) collapse(op reOp, subs []*reSyntax) *reSyntax {
resyntax.go#L482: re := &reSyntax{op: op}
resyntax.go#L495: func (re *reSyntax) leadingPhrases() []phrase {
 |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |