- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 53 for Ix (0.04 sec)
-
src/math/sqrt.go
return x case x < 0: return NaN() } ix := Float64bits(x) // normalize x exp := int((ix >> shift) & mask) if exp == 0 { // subnormal x for ix&(1<<shift) == 0 { ix <<= 1 exp-- } exp++ } exp -= bias // unbias exponent ix &^= mask << shift ix |= 1 << shift if exp&1 == 1 { // odd exp, double x to make it even ix <<= 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 15 17:07:57 UTC 2022 - 4.8K bytes - Viewed (0) -
src/go/types/typexpr.go
// errors. check.recordInstance(ix.Orig, inst.TypeArgs().list(), inst) if check.validateTArgLen(ix.Pos(), inst.obj.name, inst.TypeParams().Len(), inst.TypeArgs().Len()) { if i, err := check.verify(ix.Pos(), inst.TypeParams().list(), inst.TypeArgs().list(), check.context()); err != nil { // best position for error reporting pos := ix.Pos() if i < len(ix.Indices) { pos = ix.Indices[i].Pos() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 16.3K bytes - Viewed (0) -
pkg/controller/job/indexed_job_utils.go
if isPodFailed(p, jobCtx.job) { if ix := getCompletionIndex(p.Annotations); ix != unknownCompletionIndex && ix < int(*jobCtx.job.Spec.Completions) { if jobCtx.succeededIndexes.has(ix) || jobCtx.failedIndexes.has(ix) || activeIndexes.Has(ix) { return false } if lastPodWithDelayedDeletion, ok := podsWithDelayedDeletionPerIndex[ix]; ok {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jul 21 00:44:53 UTC 2023 - 17.5K bytes - Viewed (0) -
pkg/credentialprovider/plugins.go
keyring := &providersDockerKeyring{ Providers: make([]DockerConfigProvider, 0), } keys := reflect.ValueOf(providers).MapKeys() stringKeys := make([]string, len(keys)) for ix := range keys { stringKeys[ix] = keys[ix].String() } sort.Strings(stringKeys) for _, key := range stringKeys { provider := providers[key] if provider.Enabled() { klog.V(4).Infof("Registering credential provider: %v", key)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 01 22:01:25 UTC 2024 - 2K bytes - Viewed (0) -
src/go/types/call.go
// and x.mode is set to invalid. func (check *Checker) funcInst(T *target, pos token.Pos, x *operand, ix *typeparams.IndexExpr, infer bool) ([]Type, []ast.Expr) { assert(T != nil || ix != nil) var instErrPos positioner if ix != nil { instErrPos = inNode(ix.Orig, ix.Lbrack) x.expr = ix.Orig // if we don't have an index expression, keep the existing expression of x } else { instErrPos = atPos(pos) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 33.5K bytes - Viewed (0) -
src/regexp/onepass_test.go
[]uint32{mergeFailed}, 1, 2, }, } func TestMergeRuneSet(t *testing.T) { for ix, test := range runeMergeTests { merged, next := mergeRuneSets(&test.left, &test.right, test.leftPC, test.rightPC) if !slices.Equal(merged, test.merged) { t.Errorf("mergeRuneSet :%d (%v, %v) merged\n have\n%v\nwant\n%v", ix, test.left, test.right, merged, test.merged) } if !slices.Equal(next, test.next) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:36:03 UTC 2024 - 4.6K bytes - Viewed (0) -
src/cmd/internal/obj/inl.go
// outermost position for those nodes is line 2. func (ctxt *Link) OutermostPos(xpos src.XPos) src.Pos { pos := ctxt.InnermostPos(xpos) outerxpos := xpos for ix := pos.Base().InliningIndex(); ix >= 0; { call := ctxt.InlTree.nodes[ix] ix = call.Parent outerxpos = call.Pos } return ctxt.PosTable.Pos(outerxpos) } // InnermostPos returns the innermost position corresponding to xpos,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 22 22:47:15 UTC 2023 - 4.4K bytes - Viewed (0) -
src/go/types/exprstring.go
case *ast.SelectorExpr: WriteExpr(buf, x.X) buf.WriteByte('.') buf.WriteString(x.Sel.Name) case *ast.IndexExpr, *ast.IndexListExpr: ix := typeparams.UnpackIndexExpr(x) WriteExpr(buf, ix.X) buf.WriteByte('[') writeExprList(buf, ix.Indices) buf.WriteByte(']') case *ast.SliceExpr: WriteExpr(buf, x.X) buf.WriteByte('[') if x.Low != nil { WriteExpr(buf, x.Low) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 08 19:31:44 UTC 2024 - 4.8K bytes - Viewed (0) -
src/regexp/onepass.go
defer func() { if !ok { merged = nil next = nil } }() ix := -1 extend := func(newLow *int, newArray *[]rune, pc uint32) bool { if ix > 0 && (*newArray)[*newLow] <= merged[ix] { return false } merged = append(merged, (*newArray)[*newLow], (*newArray)[*newLow+1]) *newLow += 2 ix += 2 next = append(next, pc) return true } for lx < leftLen || rx < rightLen {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:36:03 UTC 2024 - 13.7K bytes - Viewed (0) -
src/index/suffixarray/suffixarray.go
// [Index] creation time is O(N) for N = len(data). func New(data []byte) *Index { ix := &Index{data: data} if len(data) <= maxData32 { ix.sa.int32 = make([]int32, len(data)) text_32(data, ix.sa.int32) } else { ix.sa.int64 = make([]int64, len(data)) text_64(data, ix.sa.int64) } return ix } // writeInt writes an int x to w using buf to buffer the write.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.5K bytes - Viewed (0)