Documentation
¶
Index ¶
- Variables
- func AccessField[valueType any](obj any, fieldName string) *valueType
- func CheckRoutes() (bool, bool)
- func ChromeVersion() int
- func CurlVersion() string
- func FirefoxVersion() int
- func GetRandomizer() *rand.Rand
- func H2Base62Pad[T int32 | int64 | int](expectedLen T) string
- func ResolveSocketPath(path string) string
- func SafariVersion() string
- func SplitHTTPUnixURL(raw string) (httpURL, socketPath string)
- func TryDefaultHeadersWith(header http.Header, variant string)
- type TypedSyncMap
- func (m *TypedSyncMap[K, V]) Clear()
- func (m *TypedSyncMap[K, V]) CompareAndDelete(key K, old V) (deleted bool)
- func (m *TypedSyncMap[K, V]) CompareAndSwap(key K, old V, new V) (swapped bool)
- func (m *TypedSyncMap[K, V]) Delete(key K)
- func (m *TypedSyncMap[K, V]) Load(key K) (value V, ok bool)
- func (m *TypedSyncMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)
- func (m *TypedSyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)
- func (m *TypedSyncMap[K, V]) Range(f func(key K, value V) bool)
- func (m *TypedSyncMap[K, V]) Store(key K, value V)
- func (m *TypedSyncMap[K, V]) Swap(key K, value V) (previous V, loaded bool)
- type WeakCacheMap
Constants ¶
This section is empty.
Variables ¶
var ( CurlUA = "curl/" + CurlVersion() AnchoredFirefoxVersion = strconv.Itoa(FirefoxVersion()) FirefoxUA = "Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:" + AnchoredFirefoxVersion + ".0) Gecko/20100101 Firefox/" + AnchoredFirefoxVersion + ".0" SafariUA = "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/" + SafariVersion() + " Safari/605.1.15" // Chromium browsers. AnchoredChromeVersion = ChromeVersion() ChromeUA = "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/" + strconv.Itoa(AnchoredChromeVersion) + ".0.0.0 Safari/537.36" ChromeUACH = getGreasedChUa(AnchoredChromeVersion, "chrome") MSEdgeUA = ChromeUA + "Edg/" + strconv.Itoa(AnchoredChromeVersion) + ".0.0.0" MSEdgeUACH = getGreasedChUa(AnchoredChromeVersion, "edge") )
The code below provides a coherent default browser user agent string based on a CPU-seeded PRNG.
Functions ¶
func AccessField ¶
AccessField can used to access unexported field of a struct valueType must be the exact type of the field or it will panic
func CheckRoutes ¶
func ChromeVersion ¶
func ChromeVersion() int
The Chrome version generator will suffer from deviation of a normal distribution.
func CurlVersion ¶
func CurlVersion() string
The following version generators use deterministic generators, but with the distribution scaled by a curve.
func FirefoxVersion ¶
func FirefoxVersion() int
func GetRandomizer ¶
func H2Base62Pad ¶
H2Base62Pad generates a base62 padding string for HTTP/2 header The total len will be slightly longer than the input to match the length after h2(h3 also) header huffman encoding
func ResolveSocketPath ¶
ResolveSocketPath applies platform-specific transformations to a Unix socket path, matching the listen-side behaviour in transport/internet/system_listener.go.
For abstract sockets (prefix @) on Linux/Android:
- single @ — used as-is (lock-free abstract socket)
- double @@ — stripped to single @ and padded to syscall.RawSockaddrUnix{}.Path length (HAProxy compat)
Filesystem paths and abstract sockets on other platforms are returned unchanged.
func SafariVersion ¶
func SafariVersion() string
func SplitHTTPUnixURL ¶
SplitHTTPUnixURL splits a target into an HTTP URL and an optional Unix socket path. For regular http(s) URLs the input is returned unchanged with an empty socketPath. For Unix sockets the format is:
/path/to/socket.sock[:/http/path] @abstract[:/http/path] @@padded[:/http/path]
The :/ separator delimits the socket path from the HTTP request path. If omitted, "/" is used.
func TryDefaultHeadersWith ¶
Types ¶
type TypedSyncMap ¶
type TypedSyncMap[K, V any] struct { // contains filtered or unexported fields }
TypedSyncMap is a wrapper of sync.Map that provides type-safe for keys and values. No need to use type assertions every time, so you can have more time to enjoy other things like GochiUsa If sync.Map methods returned nil, it will return the zero value of the type V.
func NewTypedSyncMap ¶
func NewTypedSyncMap[K any, V any]() *TypedSyncMap[K, V]
NewTypedSyncMap creates a new TypedSyncMap K is key type, V is value type It is recommended to use pointer types for V because sync.Map might return nil If sync.Map methods really returned nil, it will return the zero value of the type V
func (*TypedSyncMap[K, V]) Clear ¶
func (m *TypedSyncMap[K, V]) Clear()
Clear deletes all the entries, resulting in an empty Map.
func (*TypedSyncMap[K, V]) CompareAndDelete ¶
func (m *TypedSyncMap[K, V]) CompareAndDelete(key K, old V) (deleted bool)
CompareAndDelete deletes the entry for key if its value is equal to old. The old value must be of a comparable type.
If there is no current value for key in the map, CompareAndDelete returns false (even if the old value is the nil interface value).
func (*TypedSyncMap[K, V]) CompareAndSwap ¶
func (m *TypedSyncMap[K, V]) CompareAndSwap(key K, old V, new V) (swapped bool)
CompareAndSwap swaps the old and new values for key if the value stored in the map is equal to old. The old value must be of a comparable type.
func (*TypedSyncMap[K, V]) Delete ¶
func (m *TypedSyncMap[K, V]) Delete(key K)
Delete deletes the value for a key.
func (*TypedSyncMap[K, V]) Load ¶
func (m *TypedSyncMap[K, V]) Load(key K) (value V, ok bool)
Load returns the value stored in the map for a key, or nil if no value is present. The ok result indicates whether value was found in the map.
func (*TypedSyncMap[K, V]) LoadAndDelete ¶
func (m *TypedSyncMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)
LoadAndDelete deletes the value for a key, returning the previous value if any. The loaded result reports whether the key was present.
func (*TypedSyncMap[K, V]) LoadOrStore ¶
func (m *TypedSyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)
LoadOrStore returns the existing value for the key if present. Otherwise, it stores and returns the given value. The loaded result is true if the value was loaded, false if stored.
func (*TypedSyncMap[K, V]) Range ¶
func (m *TypedSyncMap[K, V]) Range(f func(key K, value V) bool)
Range calls f sequentially for each key and value present in the map. If f returns false, range stops the iteration.
Range does not necessarily correspond to any consistent snapshot of the Map's contents: no key will be visited more than once, but if the value for any key is stored or deleted concurrently (including by f), Range may reflect any mapping for that key from any point during the Range call. Range does not block other methods on the receiver; even f itself may call any method on m.
Range may be O(N) with the number of elements in the map even if f returns false after a constant number of calls.
func (*TypedSyncMap[K, V]) Store ¶
func (m *TypedSyncMap[K, V]) Store(key K, value V)
Store sets the value for a key.
func (*TypedSyncMap[K, V]) Swap ¶
func (m *TypedSyncMap[K, V]) Swap(key K, value V) (previous V, loaded bool)
Swap swaps the value for a key and returns the previous value if any. The loaded result reports whether the key was present.
type WeakCacheMap ¶
type WeakCacheMap[K comparable, V any] struct { // contains filtered or unexported fields }
WeakCacheMap is a map that holds weak references to values. Use for shared expensive objects and automatic cleanup when no longer used. This object can be GC and no goroutine is used for cleanup.
func NewWeakCacheMap ¶
func NewWeakCacheMap[K comparable, V any]() *WeakCacheMap[K, V]
func (*WeakCacheMap[K, V]) Load ¶
func (c *WeakCacheMap[K, V]) Load(key K) (value *V, ok bool)
func (*WeakCacheMap[K, V]) Range ¶
func (c *WeakCacheMap[K, V]) Range(f func(K, *V) bool)
func (*WeakCacheMap[K, V]) Store ¶
func (c *WeakCacheMap[K, V]) Store(key K, value *V)
Source Files