- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 289 for original (0.15 sec)
-
src/text/template/parse/node.go
// tree returns the containing *Tree. // It is unexported so all implementations of Node are in this package. tree() *Tree // writeTo writes the String output to the builder. writeTo(*strings.Builder) } // NodeType identifies the type of a parse tree node. type NodeType int // Pos represents a byte position in the original input text from which
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:57:51 UTC 2024 - 24.2K bytes - Viewed (0) -
doc/go_mem.html
</p> <pre> f() i := *p *q = 1 </pre> <p> If the call never returned, then once again the original program would never access <code>*p</code> or <code>*q</code>, but the rewritten program would. And if the call contained synchronizing operations, then the original program could establish happens before edges preceding the accesses to <code>*p</code> and <code>*q</code>, but the rewritten program would not.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 15:54:42 UTC 2024 - 26.6K bytes - Viewed (0) -
src/crypto/aes/aes_gcm.go
// slice with the contents of the given slice followed by that many bytes and a // second slice that aliases into it and contains only the extra bytes. If the // original slice has sufficient capacity then no allocation is performed. func sliceForAppend(in []byte, n int) (head, tail []byte) { if total := len(in) + n; cap(in) >= total { head = in[:total] } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 18:23:49 UTC 2024 - 5.4K bytes - Viewed (0) -
src/runtime/time_fake.go
// First, lock to avoid interleaving writes. lock(&faketimeState.lock) // If the current fd doesn't match the fd of the previous write, // ensure that the timestamp is strictly greater. That way, we can // recover the original order even if we read the fds separately. t := faketimeState.lastfaketime if fd != faketimeState.lastfd { t++ faketimeState.lastfd = fd } if faketime > t { t = faketime }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:15:13 UTC 2024 - 2.5K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat_test.go
if err != nil { t.Error(err) } } func testModSubThenAddIdentity(a *Nat, b *Nat) bool { m := maxModulus(uint(len(a.limbs))) original := new(Nat).set(a) a.Sub(b, m) a.Add(b, m) return a.Equal(original) == 1 } func TestModSubThenAddIdentity(t *testing.T) { err := quick.Check(testModSubThenAddIdentity, &quick.Config{}) if err != nil { t.Error(err) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 12 00:56:20 UTC 2024 - 11.6K bytes - Viewed (0) -
src/cmd/compile/internal/types2/instantiate.go
// Methods attached to a *Named type are also instantiated, and associated with // a new *Func that has the same position as the original method, but nil function // scope. // // If ctxt is non-nil, it may be used to de-duplicate the instance against // previous instances with the same identity. As a special case, generic // *Signature origin types are only considered identical if they are pointer // equivalent, so that instantiating distinct (but possibly identical)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 12.7K bytes - Viewed (0) -
src/encoding/json/decode.go
// (to satisfy possible pointer methods) and continues to dereference // subsequent pointers as necessary. // // After the first round-trip, we set v back to the original value to // preserve the original RW flags contained in reflect.Value. v0 := v haveAddr := false // If v is a named type and is addressable, // start with its address, so that if the type has pointer methods,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 35.3K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
// is unique, so the relative ordering of two LMS-suffixes // is determined by just the leading LMS-substring. // That is, the LMS-suffix sort order matches the // (simpler) LMS-substring sort order. // Copy the original LMS-substring order into the // suffix array destination. copy(sa, sa[len(sa)-numLMS:]) } expand_8_64(text, freq, bucket, sa, numLMS) } induceL_8_64(text, sa, freq, bucket)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeparam.go
} // compute type set if necessary if ityp.tset == nil { // pos is used for tracing output; start with the type parameter position. pos := t.obj.pos // use the (original or possibly instantiated) type bound position if we have one if n := asNamed(bound); n != nil { pos = n.obj.pos } computeInterfaceTypeSet(t.check, pos, ityp) } return ityp }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 4.9K bytes - Viewed (0) -
src/internal/types/testdata/check/labels.go
} if x == 20 { continue L1 /* ERROR "invalid continue label L1" */ } if x == 21 { goto L1 } } } // Additional tests not in the original files. func f2() { L1 /* ERROR "label L1 declared and not used" */ : if x == 0 { for { continue L1 /* ERROR "invalid continue label L1" */ } } } func f3() { L1: L2:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 3.2K bytes - Viewed (0)