mirror of
				https://github.com/go-gitea/gitea.git
				synced 2025-10-29 10:57:44 +09:00 
			
		
		
		
	Vendor Update (#16121)
* update github.com/PuerkitoBio/goquery * update github.com/alecthomas/chroma * update github.com/blevesearch/bleve/v2 * update github.com/caddyserver/certmagic * update github.com/go-enry/go-enry/v2 * update github.com/go-git/go-billy/v5 * update github.com/go-git/go-git/v5 * update github.com/go-redis/redis/v8 * update github.com/go-testfixtures/testfixtures/v3 * update github.com/jaytaylor/html2text * update github.com/json-iterator/go * update github.com/klauspost/compress * update github.com/markbates/goth * update github.com/mattn/go-isatty * update github.com/mholt/archiver/v3 * update github.com/microcosm-cc/bluemonday * update github.com/minio/minio-go/v7 * update github.com/prometheus/client_golang * update github.com/unrolled/render * update github.com/xanzy/go-gitlab * update github.com/yuin/goldmark * update github.com/yuin/goldmark-highlighting Co-authored-by: techknowlogick <techknowlogick@gitea.io>
This commit is contained in:
		
							
								
								
									
										17
									
								
								vendor/github.com/klauspost/compress/flate/level5.go
									
									
									
										generated
									
									
										vendored
									
									
								
							
							
						
						
									
										17
									
								
								vendor/github.com/klauspost/compress/flate/level5.go
									
									
									
										generated
									
									
										vendored
									
									
								
							| @@ -182,12 +182,27 @@ func (e *fastEncL5) Encode(dst *tokens, src []byte) { | ||||
| 		// match. But, prior to the match, src[nextEmit:s] are unmatched. Emit | ||||
| 		// them as literal bytes. | ||||
|  | ||||
| 		// Extend the 4-byte match as long as possible. | ||||
| 		if l == 0 { | ||||
| 			// Extend the 4-byte match as long as possible. | ||||
| 			l = e.matchlenLong(s+4, t+4, src) + 4 | ||||
| 		} else if l == maxMatchLength { | ||||
| 			l += e.matchlenLong(s+l, t+l, src) | ||||
| 		} | ||||
|  | ||||
| 		// Try to locate a better match by checking the end of best match... | ||||
| 		if sAt := s + l; l < 30 && sAt < sLimit { | ||||
| 			eLong := e.bTable[hash7(load6432(src, sAt), tableBits)].Cur.offset | ||||
| 			// Test current | ||||
| 			t2 := eLong - e.cur - l | ||||
| 			off := s - t2 | ||||
| 			if t2 >= 0 && off < maxMatchOffset && off > 0 { | ||||
| 				if l2 := e.matchlenLong(s, t2, src); l2 > l { | ||||
| 					t = t2 | ||||
| 					l = l2 | ||||
| 				} | ||||
| 			} | ||||
| 		} | ||||
|  | ||||
| 		// Extend backwards | ||||
| 		for t > 0 && s > nextEmit && src[t-1] == src[s-1] { | ||||
| 			s-- | ||||
|   | ||||
		Reference in New Issue
	
	Block a user