package topdown // Copyright 2012 The Gorilla Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license as follows: // Copyright (c) 2012 Rodrigo Moraes. 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 Google Inc. 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. // This file was forked from https://github.com/gorilla/mux/commit/eac83ba2c004bb75 import ( "bytes" "fmt" "regexp" ) // delimiterIndices returns the first level delimiter indices from a string. // It returns an error in case of unbalanced delimiters. func delimiterIndices(s string, delimiterStart, delimiterEnd byte) ([]int, error) { var level, idx int idxs := make([]int, 0) for i := 0; i < len(s); i++ { switch s[i] { case delimiterStart: if level++; level == 1 { idx = i } case delimiterEnd: if level--; level == 0 { idxs = append(idxs, idx, i+1) } else if level < 0 { return nil, fmt.Errorf(`unbalanced braces in %q`, s) } } } if level != 0 { return nil, fmt.Errorf(`unbalanced braces in %q`, s) } return idxs, nil } // compileRegexTemplate parses a template and returns a Regexp. // // You can define your own delimiters. It is e.g. common to use curly braces {} but I recommend using characters // which have no special meaning in Regex, e.g.: <, > // // reg, err := compiler.CompileRegex("foo:bar.baz:<[0-9]{2,10}>", '<', '>') // // if err != nil ... // reg.MatchString("foo:bar.baz:123") func compileRegexTemplate(tpl string, delimiterStart, delimiterEnd byte) (*regexp.Regexp, error) { // Check if it is well-formed. idxs, errBraces := delimiterIndices(tpl, delimiterStart, delimiterEnd) if errBraces != nil { return nil, errBraces } varsR := make([]*regexp.Regexp, len(idxs)/2) pattern := bytes.NewBufferString("") // WriteByte's error value is always nil for bytes.Buffer, no need to check it. pattern.WriteByte('^') var end int var err error for i := 0; i < len(idxs); i += 2 { // Set all values we are interested in. raw := tpl[end:idxs[i]] end = idxs[i+1] patt := tpl[idxs[i]+1 : end-1] // Build the regexp pattern. varIdx := i / 2 fmt.Fprintf(pattern, "%s(%s)", regexp.QuoteMeta(raw), patt) varsR[varIdx], err = regexp.Compile(fmt.Sprintf("^%s$", patt)) if err != nil { return nil, err } } // Add the remaining. raw := tpl[end:] // WriteString's error value is always nil for bytes.Buffer, no need to check it. pattern.WriteString(regexp.QuoteMeta(raw)) // WriteByte's error value is always nil for bytes.Buffer, no need to check it. pattern.WriteByte('$') // Compile full regexp. reg, errCompile := regexp.Compile(pattern.String()) if errCompile != nil { return nil, errCompile } return reg, nil }