mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-10-31 00:42:24 -05:00 
			
		
		
		
	[chore]: Bump github.com/minio/minio-go/v7 from 7.0.48 to 7.0.49 (#1567)
Bumps [github.com/minio/minio-go/v7](https://github.com/minio/minio-go) from 7.0.48 to 7.0.49. - [Release notes](https://github.com/minio/minio-go/releases) - [Commits](https://github.com/minio/minio-go/compare/v7.0.48...v7.0.49) --- updated-dependencies: - dependency-name: github.com/minio/minio-go/v7 dependency-type: direct:production update-type: version-update:semver-patch ... Signed-off-by: dependabot[bot] <support@github.com> Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
This commit is contained in:
		
					parent
					
						
							
								e1b704e06e
							
						
					
				
			
			
				commit
				
					
						752c38b0d5
					
				
			
		
					 38 changed files with 1696 additions and 1023 deletions
				
			
		
							
								
								
									
										23
									
								
								vendor/github.com/klauspost/compress/s2/encodeblock_amd64.go
									
										
									
										generated
									
									
										vendored
									
									
								
							
							
						
						
									
										23
									
								
								vendor/github.com/klauspost/compress/s2/encodeblock_amd64.go
									
										
									
										generated
									
									
										vendored
									
									
								
							|  | @ -1,7 +1,6 @@ | |||
| // Code generated by command: go run gen.go -out ../encodeblock_amd64.s -stubs ../encodeblock_amd64.go -pkg=s2. DO NOT EDIT. | ||||
| 
 | ||||
| //go:build !appengine && !noasm && gc && !noasm | ||||
| // +build !appengine,!noasm,gc,!noasm | ||||
| 
 | ||||
| package s2 | ||||
| 
 | ||||
|  | @ -150,8 +149,9 @@ func encodeSnappyBetterBlockAsm8B(dst []byte, src []byte) int | |||
| // emitLiteral writes a literal chunk and returns the number of bytes written. | ||||
| // | ||||
| // It assumes that: | ||||
| //   dst is long enough to hold the encoded bytes with margin of 0 bytes | ||||
| //   0 <= len(lit) && len(lit) <= math.MaxUint32 | ||||
| // | ||||
| //	dst is long enough to hold the encoded bytes with margin of 0 bytes | ||||
| //	0 <= len(lit) && len(lit) <= math.MaxUint32 | ||||
| // | ||||
| //go:noescape | ||||
| func emitLiteral(dst []byte, lit []byte) int | ||||
|  | @ -165,9 +165,10 @@ func emitRepeat(dst []byte, offset int, length int) int | |||
| // emitCopy writes a copy chunk and returns the number of bytes written. | ||||
| // | ||||
| // It assumes that: | ||||
| //   dst is long enough to hold the encoded bytes | ||||
| //   1 <= offset && offset <= math.MaxUint32 | ||||
| //   4 <= length && length <= 1 << 24 | ||||
| // | ||||
| //	dst is long enough to hold the encoded bytes | ||||
| //	1 <= offset && offset <= math.MaxUint32 | ||||
| //	4 <= length && length <= 1 << 24 | ||||
| // | ||||
| //go:noescape | ||||
| func emitCopy(dst []byte, offset int, length int) int | ||||
|  | @ -175,9 +176,10 @@ func emitCopy(dst []byte, offset int, length int) int | |||
| // emitCopyNoRepeat writes a copy chunk and returns the number of bytes written. | ||||
| // | ||||
| // It assumes that: | ||||
| //   dst is long enough to hold the encoded bytes | ||||
| //   1 <= offset && offset <= math.MaxUint32 | ||||
| //   4 <= length && length <= 1 << 24 | ||||
| // | ||||
| //	dst is long enough to hold the encoded bytes | ||||
| //	1 <= offset && offset <= math.MaxUint32 | ||||
| //	4 <= length && length <= 1 << 24 | ||||
| // | ||||
| //go:noescape | ||||
| func emitCopyNoRepeat(dst []byte, offset int, length int) int | ||||
|  | @ -185,7 +187,8 @@ func emitCopyNoRepeat(dst []byte, offset int, length int) int | |||
| // matchLen returns how many bytes match in a and b | ||||
| // | ||||
| // It assumes that: | ||||
| //   len(a) <= len(b) | ||||
| // | ||||
| //	len(a) <= len(b) | ||||
| // | ||||
| //go:noescape | ||||
| func matchLen(a []byte, b []byte) int | ||||
|  |  | |||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue