func math.IsInf
79 uses
math (current package)
asinh.go#L48: if IsNaN(x) || IsInf(x, 0) {
atan2.go#L43: case IsInf(x, 0):
atan2.go#L44: if IsInf(x, 1) {
atan2.go#L46: case IsInf(y, 0):
atan2.go#L53: case IsInf(y, 0):
atan2.go#L58: case IsInf(y, 0):
bits.go#L46: func IsInf(f float64, sign int) bool {
cbrt.go#L40: case x == 0 || IsNaN(x) || IsInf(x, 0):
dim.go#L40: case IsInf(x, 1) || IsInf(y, 1):
dim.go#L67: case IsInf(x, -1) || IsInf(y, -1):
erf.go#L199: case IsInf(x, 1):
erf.go#L201: case IsInf(x, -1):
erf.go#L275: case IsInf(x, 1):
erf.go#L277: case IsInf(x, -1):
exp.go#L105: case IsNaN(x) || IsInf(x, 1):
exp.go#L107: case IsInf(x, -1):
exp.go#L148: case IsNaN(x) || IsInf(x, 1):
exp.go#L150: case IsInf(x, -1):
expm1.go#L146: case IsInf(x, 1) || IsNaN(x):
expm1.go#L148: case IsInf(x, -1):
floor.go#L16: if x == 0 || IsNaN(x) || IsInf(x, 0) {
floor.go#L51: if x == 0 || IsNaN(x) || IsInf(x, 0) {
frexp.go#L23: case IsInf(f, 0) || IsNaN(f):
gamma.go#L134: case isNegInt(x) || IsInf(x, -1) || IsNaN(x):
gamma.go#L136: case IsInf(x, 1):
gamma.go#L170: if IsInf(d, 0) {
hypot.go#L24: case IsInf(p, 0) || IsInf(q, 0):
j0.go#L96: case IsInf(x, 0):
j0.go#L174: case IsInf(x, 1):
j1.go#L93: case IsInf(x, 0) || x == 0:
j1.go#L173: case IsInf(x, 1):
jn.go#L62: case IsInf(x, 0):
jn.go#L239: case IsInf(x, 1):
jn.go#L296: for i := 1; i < n && !IsInf(b, -1); i++ {
ldexp.go#L21: case IsInf(frac, 0) || IsNaN(frac):
lgamma.go#L192: case IsInf(x, 0):
log.go#L97: case IsNaN(x) || IsInf(x, 1):
log1p.go#L121: case IsInf(x, 1):
logb.go#L18: case IsInf(x, 0):
logb.go#L39: case IsInf(x, 0):
mod.go#L24: if y == 0 || IsInf(x, 0) || IsNaN(x) || IsNaN(y) {
pow.go#L61: case IsInf(y, 0):
pow.go#L65: case (Abs(x) < 1) == IsInf(y, 1):
pow.go#L70: case IsInf(x, 0):
pow.go#L71: if IsInf(x, -1) {
remainder.go#L46: case IsNaN(x) || IsNaN(y) || IsInf(x, 0) || y == 0:
remainder.go#L48: case IsInf(y, 0):
sin.go#L127: case IsNaN(x) || IsInf(x, 0):
sin.go#L190: case IsInf(x, 0):
sincos.go#L25: case IsNaN(x) || IsInf(x, 0):
sqrt.go#L102: case x == 0 || IsNaN(x) || IsInf(x, 1):
tan.go#L94: case IsInf(x, 0):
math/big
float.go#L557: if math.IsInf(x, 0) {
rat.go#L165: if math.IsInf(float64(f), 0) {
rat.go#L263: if math.IsInf(f, 0) {
encoding/json
encode.go#L577: if math.IsInf(f, 0) || math.IsNaN(f) {
github.com/aws/aws-sdk-go/private/protocol/json/jsonutil
build.go#L212: if math.IsInf(f, 0) || math.IsNaN(f) {
github.com/evanw/esbuild/internal/js_parser
js_parser.go#L9761: return math.IsInf(e.Value, 1) || math.IsNaN(e.Value)
github.com/golang/protobuf/proto
text_encode.go#L358: case math.IsInf(vf, +1):
text_encode.go#L360: case math.IsInf(vf, -1):
github.com/google/go-cmp/cmp/cmpopts
equate.go#L62: return !math.IsNaN(x) && !math.IsNaN(y) && !math.IsInf(x, 0) && !math.IsInf(y, 0)
github.com/prometheus/client_golang/prometheus
histogram.go#L201: if math.IsInf(upperBound, +1) {
github.com/prometheus/common/expfmt
decode.go#L375: if math.IsInf(q.GetUpperBound(), +1) {
text_create.go#L232: if math.IsInf(b.GetUpperBound(), +1) {
text_create.go#L444: case math.IsInf(f, +1):
text_create.go#L446: case math.IsInf(f, -1):
go.opencensus.io/zpages
rpcz.go#L219: if math.IsInf(ms, 0) || math.IsNaN(ms) {
google.golang.org/protobuf/internal/encoding/defval
default.go#L150: case math.IsInf(f, -1):
default.go#L152: case math.IsInf(f, +1):
google.golang.org/protobuf/internal/encoding/json
encode.go#L150: case math.IsInf(n, +1):
encode.go#L152: case math.IsInf(n, -1):
google.golang.org/protobuf/internal/encoding/text
encode.go#L188: case math.IsInf(n, +1):
encode.go#L190: case math.IsInf(n, -1):
google.golang.org/protobuf/types/known/structpb
struct.pb.go#L407: case math.IsInf(v.NumberValue, +1):
struct.pb.go#L409: case math.IsInf(v.NumberValue, -1):
 |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |