- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for tPos (0.06 sec)
-
src/compress/bzip2/bzip2.go
if bz2.repeats > 0 { buf[n] = byte(bz2.lastByte) n++ bz2.repeats-- if bz2.repeats == 0 { bz2.lastByte = -1 } continue } bz2.tPos = bz2.preRLE[bz2.tPos] b := byte(bz2.tPos) bz2.tPos >>= 8 bz2.preRLEUsed++ if bz2.byteRepeats == 3 { bz2.repeats = uint(b) bz2.byteRepeats = 0 continue } if bz2.lastByte == int(b) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
src/cmd/cover/cover.go
fmt.Fprintf(w, "\tCount [%d]uint32\n", len(f.blocks)) fmt.Fprintf(w, "\tPos [3 * %d]uint32\n", len(f.blocks)) fmt.Fprintf(w, "\tNumStmt [%d]uint16\n", len(f.blocks)) fmt.Fprintf(w, "} {\n") // Initialize the position array field. fmt.Fprintf(w, "\tPos: [3 * %d]uint32{\n", len(f.blocks)) // A nice long list of positions. Each position is encoded as follows to reduce size:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K bytes - Viewed (0) -
test/chan/powser1.go
print("Ones: ") printn(Ones, 10) print("Twos: ") printn(Twos, 10) print("Add: ") printn(Add(Ones, Twos), 10) print("Diff: ") printn(Diff(Ones), 10) print("Integ: ") printn(Integ(zero, Ones), 10) print("CMul: ") printn(Cmul(neg(one), Ones), 10) print("Sub: ") printn(Sub(Ones, Twos), 10) print("Mul: ") printn(Mul(Ones, Ones), 10) print("Exp: ")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 25 22:22:20 UTC 2020 - 12.7K bytes - Viewed (0) -
test/chan/powser2.go
print("Ones: ") Printn(Ones, 10) print("Twos: ") Printn(Twos, 10) print("Add: ") Printn(Add(Ones, Twos), 10) print("Diff: ") Printn(Diff(Ones), 10) print("Integ: ") Printn(Integ(zero, Ones), 10) print("CMul: ") Printn(Cmul(neg(one), Ones), 10) print("Sub: ") Printn(Sub(Ones, Twos), 10) print("Mul: ") Printn(Mul(Ones, Ones), 10) print("Exp: ")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 25 22:22:20 UTC 2020 - 13.3K bytes - Viewed (0) -
src/debug/gosym/symtab.go
tos = tos.prev default: // Push tos = &stackEnt{s.Name, val, 0, tos} } } if tos == noPath { return "", 0 } return tos.path, aline - tos.start - tos.offset + 1 } func (o *Obj) alineFromLine(path string, line int) (int, error) { if line < 1 { return 0, &UnknownLineError{path, line} } for i, s := range o.Paths { // Find this path
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 17.9K bytes - Viewed (0) -
src/runtime/gc_test.go
var stack [depth]*node tos := -1 // There are two write barriers per iteration, so i+=2. for i := 0; i < b.N; i += 2 { if tos == -1 { stack[0] = root tos = 0 } // Perform one step of reversing the tree. n := stack[tos] if n.l == nil { tos-- } else { n.l, n.r = n.r, n.l stack[tos] = n.l stack[tos+1] = n.r tos++ }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 05 22:33:52 UTC 2024 - 17.6K bytes - Viewed (0) -
pkg/wasm/cache_test.go
reg := registry.New() // Set up a fake registry for OCI images. tos := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) { atomic.AddInt32(&tsNumRequest, 1) reg.ServeHTTP(w, r) })) defer tos.Close() ou, err := url.Parse(tos.URL) if err != nil { t.Fatal(err) } dockerImageDigest, invalidOCIImageDigest := setupOCIRegistry(t, ou.Host)
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Apr 17 20:06:41 UTC 2024 - 33.9K bytes - Viewed (0) -
src/runtime/asm_wasm.s
// // gcWriteBarrier does NOT follow the Go ABI. It accepts the // number of bytes of buffer needed as a wasm argument // (put on the TOS by the caller, lives in local R0 in this body) // and returns a pointer to the buffer space as a wasm result // (left on the TOS in this body, appears on the wasm stack // in the caller). TEXT gcWriteBarrier<>(SB), NOSPLIT, $0 Loop // R3 = g.m MOVD g_m(g), R3 // R4 = p
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 21:26:51 UTC 2023 - 11.8K bytes - Viewed (0) -
cmd/import-boss/main.go
type edge struct { from string to string } adj := make(map[edge]bool) imports := make(map[string]struct{}) for from, tos := range in { for _, to := range tos { adj[edge{from, to}] = true imports[to] = struct{}{} } } // Warshal's algorithm for k := range in { for i := range in { if !adj[edge{i, k}] { continue
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 12:36:49 UTC 2024 - 14.7K bytes - Viewed (0) -
src/syscall/ztypes_linux_arm64.go
type IfAddrmsg struct { Family uint8 Prefixlen uint8 Flags uint8 Scope uint8 Index uint32 } type RtMsg struct { Family uint8 Dst_len uint8 Src_len uint8 Tos uint8 Table uint8 Protocol uint8 Scope uint8 Type uint8 Flags uint32 } type RtNexthop struct { Len uint16 Flags uint8 Hops uint8 Ifindex int32 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 17:55:49 UTC 2023 - 10.2K bytes - Viewed (0)