- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 24 for L2 (0.07 sec)
-
test/typeparam/list2.go
// Bigger list l2 := _New[int]() e2 := l2.PushFront(2) e1 := l2.PushFront(1) e3 := l2.PushBack(3) e4 := l2.PushBack(600) checkListPointers(l2, []*(_Element[int]){e1, e2, e3, e4}) l2.Remove(e2) checkListPointers(l2, []*(_Element[int]){e1, e3, e4}) l2.MoveToFront(e3) // move from middle checkListPointers(l2, []*(_Element[int]){e3, e1, e4}) l2.MoveToFront(e1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 15.3K bytes - Viewed (0) -
src/cmd/compile/internal/walk/assign.go
l2 := typecheck.Conv(n.Args[1].(*ir.MakeExpr).Len, types.Types[types.TINT]) l2 = typecheck.Expr(l2) n.Args[1] = l2 // walkAppendArgs expects l2 in n.List.Second(). walkAppendArgs(n, init) l1 := n.Args[0] l2 = n.Args[1] // re-read l2, as it may have been updated by walkAppendArgs var nodes []ir.Node // if l2 >= 0 (likely happens), do nothing
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
c = (v.l1 + c) >> 51 c = (v.l2 + c) >> 51 c = (v.l3 + c) >> 51 c = (v.l4 + c) >> 51 // If v < 2^255 - 19 and c = 0, this will be a no-op. Otherwise, it's // effectively applying the reduction identity to the carry. v.l0 += 19 * c v.l1 += v.l0 >> 51 v.l0 = v.l0 & maskLow51Bits v.l2 += v.l1 >> 51 v.l1 = v.l1 & maskLow51Bits v.l3 += v.l2 >> 51 v.l2 = v.l2 & maskLow51Bits v.l4 += v.l3 >> 51
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
src/runtime/mranges.go
// two offAddrs. func (l1 offAddr) diff(l2 offAddr) uintptr { return l1.a - l2.a } // lessThan returns true if l1 is less than l2 in the offset // address space. func (l1 offAddr) lessThan(l2 offAddr) bool { return (l1.a - arenaBaseOffset) < (l2.a - arenaBaseOffset) } // lessEqual returns true if l1 is less than or equal to l2 in // the offset address space.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/decompose_resource_ops.td
// TODO(kramm): Move this pattern to canonicalize.td? def DecomposeResourceApplyFtrl : Pat< (TF_ResourceApplyFtrlOp $var, $accum, $linear, $grad, $lr, $l1, $l2, $lr_power, $use_locking, $multiply_linear_by_lr), (TF_ResourceApplyFtrlV2Op $var, $accum, $linear, $grad, $lr, $l1, $l2, (TF_ConstOp (GetScalarOfType<0> $lr_power)), $lr_power, $use_locking, $multiply_linear_by_lr)>;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 22 19:47:48 UTC 2024 - 20.7K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/DynamicObjectIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 17 13:27:33 UTC 2024 - 32.7K bytes - Viewed (0) -
src/runtime/mpagealloc.go
func (p *pageAlloc) tryChunkOf(ci chunkIdx) *pallocData { l2 := p.chunks[ci.l1()] if l2 == nil { return nil } return &l2[ci.l2()] } // chunkOf returns the chunk at the given chunk index. // // The chunk index must be valid or this method may throw. func (p *pageAlloc) chunkOf(ci chunkIdx) *pallocData { return &p.chunks[ci.l1()][ci.l2()] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
src/go/token/position_test.go
checkPos(t, "1. PositionFor adjusted", got2, want) checkPos(t, "1. Position", got3, want) } // manually add //line info on lines l1, l2 const l1, l2 = 5, 7 f.AddLineInfo(f.lines[l1-1], "", 100) f.AddLineInfo(f.lines[l2-1], "bar", 3) // unadjusted position info must remain unchanged for i, offs := range f.lines { got1 := f.PositionFor(f.Pos(offs), false)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 31 20:26:14 UTC 2024 - 14.3K bytes - Viewed (0) -
src/internal/reflectlite/type.go
} i, l := n.readVarint(1) i2, l2 := n.readVarint(1 + i + l) return unsafe.String(n.data(1+i+l+i2, "non-empty string"), l2) } func pkgPath(n abi.Name) string { if n.Bytes == nil || *n.DataChecked(0, "name flag field")&(1<<2) == 0 { return "" } i, l := n.ReadVarint(1) off := 1 + i + l if n.HasTag() { i2, l2 := n.ReadVarint(off) off += i2 + l2 } var nameOff int32
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:01:54 UTC 2024 - 16.2K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
// makes sure there is nothing too deep being copied. l1 := o.safeExpr(n.X) l2 := ir.DeepCopy(src.NoXPos, l1) if l2.Op() == ir.OINDEXMAP { l2 := l2.(*ir.IndexExpr) l2.Assigned = false } l2 = o.copyExpr(l2) r := o.expr(typecheck.Expr(ir.NewBinaryExpr(n.Pos(), n.AsOp, l2, n.Y)), nil) as := typecheck.Stmt(ir.NewAssignStmt(n.Pos(), l1, r)) o.mapAssign(as) o.popTemp(t)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0)