mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-10-31 15:32:24 -05:00 
			
		
		
		
	Update dependencies (#333)
This commit is contained in:
		
					parent
					
						
							
								ce22e03f9d
							
						
					
				
			
			
				commit
				
					
						182b4eea73
					
				
			
		
					 848 changed files with 377869 additions and 107280 deletions
				
			
		
							
								
								
									
										36
									
								
								vendor/golang.org/x/net/idna/punycode.go
									
										
									
										generated
									
									
										vendored
									
									
								
							
							
						
						
									
										36
									
								
								vendor/golang.org/x/net/idna/punycode.go
									
										
									
										generated
									
									
										vendored
									
									
								
							|  | @ -49,6 +49,7 @@ func decode(encoded string) (string, error) { | |||
| 		} | ||||
| 	} | ||||
| 	i, n, bias := int32(0), initialN, initialBias | ||||
| 	overflow := false | ||||
| 	for pos < len(encoded) { | ||||
| 		oldI, w := i, int32(1) | ||||
| 		for k := base; ; k += base { | ||||
|  | @ -60,29 +61,32 @@ func decode(encoded string) (string, error) { | |||
| 				return "", punyError(encoded) | ||||
| 			} | ||||
| 			pos++ | ||||
| 			i += digit * w | ||||
| 			if i < 0 { | ||||
| 			i, overflow = madd(i, digit, w) | ||||
| 			if overflow { | ||||
| 				return "", punyError(encoded) | ||||
| 			} | ||||
| 			t := k - bias | ||||
| 			if t < tmin { | ||||
| 			if k <= bias { | ||||
| 				t = tmin | ||||
| 			} else if t > tmax { | ||||
| 			} else if k >= bias+tmax { | ||||
| 				t = tmax | ||||
| 			} | ||||
| 			if digit < t { | ||||
| 				break | ||||
| 			} | ||||
| 			w *= base - t | ||||
| 			if w >= math.MaxInt32/base { | ||||
| 			w, overflow = madd(0, w, base-t) | ||||
| 			if overflow { | ||||
| 				return "", punyError(encoded) | ||||
| 			} | ||||
| 		} | ||||
| 		if len(output) >= 1024 { | ||||
| 			return "", punyError(encoded) | ||||
| 		} | ||||
| 		x := int32(len(output) + 1) | ||||
| 		bias = adapt(i-oldI, x, oldI == 0) | ||||
| 		n += i / x | ||||
| 		i %= x | ||||
| 		if n > utf8.MaxRune || len(output) >= 1024 { | ||||
| 		if n < 0 || n > utf8.MaxRune { | ||||
| 			return "", punyError(encoded) | ||||
| 		} | ||||
| 		output = append(output, 0) | ||||
|  | @ -115,6 +119,7 @@ func encode(prefix, s string) (string, error) { | |||
| 	if b > 0 { | ||||
| 		output = append(output, '-') | ||||
| 	} | ||||
| 	overflow := false | ||||
| 	for remaining != 0 { | ||||
| 		m := int32(0x7fffffff) | ||||
| 		for _, r := range s { | ||||
|  | @ -122,8 +127,8 @@ func encode(prefix, s string) (string, error) { | |||
| 				m = r | ||||
| 			} | ||||
| 		} | ||||
| 		delta += (m - n) * (h + 1) | ||||
| 		if delta < 0 { | ||||
| 		delta, overflow = madd(delta, m-n, h+1) | ||||
| 		if overflow { | ||||
| 			return "", punyError(s) | ||||
| 		} | ||||
| 		n = m | ||||
|  | @ -141,9 +146,9 @@ func encode(prefix, s string) (string, error) { | |||
| 			q := delta | ||||
| 			for k := base; ; k += base { | ||||
| 				t := k - bias | ||||
| 				if t < tmin { | ||||
| 				if k <= bias { | ||||
| 					t = tmin | ||||
| 				} else if t > tmax { | ||||
| 				} else if k >= bias+tmax { | ||||
| 					t = tmax | ||||
| 				} | ||||
| 				if q < t { | ||||
|  | @ -164,6 +169,15 @@ func encode(prefix, s string) (string, error) { | |||
| 	return string(output), nil | ||||
| } | ||||
| 
 | ||||
| // madd computes a + (b * c), detecting overflow. | ||||
| func madd(a, b, c int32) (next int32, overflow bool) { | ||||
| 	p := int64(b) * int64(c) | ||||
| 	if p > math.MaxInt32-int64(a) { | ||||
| 		return 0, true | ||||
| 	} | ||||
| 	return a + int32(p), false | ||||
| } | ||||
| 
 | ||||
| func decodeDigit(x byte) (digit int32, ok bool) { | ||||
| 	switch { | ||||
| 	case '0' <= x && x <= '9': | ||||
|  |  | |||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue