Dmitry VerkhoturovandUmputun
09110c792f
Updates every backend dependency with a newer release available, and tidies the example module alongside as any change to backend/go.mod requires.
64 lines
1.5 KiB
Go
64 lines
1.5 KiB
Go
package regexp2
|
|
|
|
import (
|
|
"errors"
|
|
"math"
|
|
)
|
|
|
|
// Split splits the given input string using the pattern and returns
|
|
// a slice of the parts. Count limits the number of matches to process.
|
|
// If Count is -1, then it will process the input fully.
|
|
// If Count is 0, returns nil. If Count is 1, returns the original input.
|
|
// The only expected error is a Timeout, if it's set.
|
|
//
|
|
// If capturing parentheses are used in the Regex expression, any captured
|
|
// text is included in the resulting string array
|
|
// For example, a pattern of "-" Split("a-b") will return ["a", "b"]
|
|
// but a pattern with "(-)" Split ("a-b") will return ["a", "-", "b"]
|
|
func (re *Regexp) Split(input string, count int) ([]string, error) {
|
|
if count < -1 {
|
|
return nil, errors.New("count too small")
|
|
}
|
|
if count == 0 {
|
|
return nil, nil
|
|
}
|
|
if count == 1 {
|
|
return []string{input}, nil
|
|
}
|
|
if count == -1 {
|
|
// no limit
|
|
count = math.MaxInt
|
|
}
|
|
|
|
// iterate through the matches
|
|
priorIndex := 0
|
|
var retVal []string
|
|
matched := false
|
|
|
|
m, err := re.FindStringMatch(input)
|
|
|
|
for ; m != nil && count > 0; m, err = re.FindNextMatch(m) {
|
|
matched = true
|
|
start, end := matchInputSpan(m)
|
|
retVal = append(retVal, input[priorIndex:start])
|
|
// append any capture groups, skipping group 0
|
|
gs := m.Groups()
|
|
for i := 1; i < len(gs); i++ {
|
|
retVal = append(retVal, gs[i].String())
|
|
}
|
|
priorIndex = end
|
|
count--
|
|
}
|
|
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
if !matched {
|
|
return []string{input}, nil
|
|
}
|
|
|
|
retVal = append(retVal, input[priorIndex:])
|
|
return retVal, nil
|
|
}
|