go mod and vendor/ update
This commit is contained in:
parent
9d332bbda4
commit
14e0611f06
704 changed files with 157354 additions and 39113 deletions
28
vendor/github.com/blevesearch/segment/segment_words.go
generated
vendored
28
vendor/github.com/blevesearch/segment/segment_words.go
generated
vendored
|
|
@ -1,5 +1,4 @@
|
|||
//line segment_words.rl:1
|
||||
|
||||
// Copyright (c) 2015 Couchbase, Inc.
|
||||
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file
|
||||
// except in compliance with the License. You may obtain a copy of the License at
|
||||
|
|
@ -18539,6 +18538,7 @@ const s_error int = -1
|
|||
const s_en_main int = 4862
|
||||
|
||||
//line segment_words.rl:35
|
||||
|
||||
func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []int) ([][]byte, []int, int, error) {
|
||||
cs, p, pe := 0, 0, len(data)
|
||||
cap := maxTokens
|
||||
|
|
@ -18656,6 +18656,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
switch _s_trans_actions[_trans] {
|
||||
case 10:
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
case 34:
|
||||
|
|
@ -19218,13 +19219,16 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
|
||||
case 28:
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
case 33:
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19254,6 +19258,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
|
||||
case 13:
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19286,13 +19291,16 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
case 26:
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19322,9 +19330,11 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
|
||||
case 27:
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19357,6 +19367,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:76
|
||||
|
|
@ -19367,6 +19378,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:89
|
||||
|
|
@ -19377,6 +19389,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:104
|
||||
|
|
@ -19387,6 +19400,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:119
|
||||
|
|
@ -19397,6 +19411,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:131
|
||||
|
|
@ -19407,6 +19422,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19417,6 +19433,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19427,6 +19444,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19437,9 +19455,11 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:76
|
||||
|
|
@ -19450,9 +19470,11 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:119
|
||||
|
|
@ -19463,9 +19485,11 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
te = p + 1
|
||||
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.rl:72
|
||||
|
||||
endPos = p
|
||||
|
||||
//line segment_words.rl:161
|
||||
|
|
@ -19497,6 +19521,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
switch _s_eof_actions[cs] {
|
||||
case 24:
|
||||
//line segment_words.rl:68
|
||||
|
||||
startPos = p
|
||||
|
||||
//line segment_words.go:19529
|
||||
|
|
@ -19506,6 +19531,7 @@ func segmentWords(data []byte, maxTokens int, atEOF bool, val [][]byte, types []
|
|||
}
|
||||
|
||||
//line segment_words.rl:278
|
||||
|
||||
if cs < s_first_final {
|
||||
return val, types, totalConsumed, ParseError
|
||||
}
|
||||
|
|
|
|||
543
vendor/github.com/blevesearch/segment/segment_words_prod.go
generated
vendored
543
vendor/github.com/blevesearch/segment/segment_words_prod.go
generated
vendored
File diff suppressed because it is too large
Load diff
Loading…
Add table
Add a link
Reference in a new issue