- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for Left (7.44 sec)
-
src/cmd/cgo/internal/test/issue18146.go
t.Skipf("skipping on %s", runtime.GOARCH) } attempts := 1000 threads := 4 // Restrict the number of attempts based on RLIMIT_NPROC. // Tediously, RLIMIT_NPROC was left out of the syscall package, // probably because it is not in POSIX.1, so we define it here. // It is not defined on Solaris. var nproc int setNproc := true switch runtime.GOOS { default: setNproc = false
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Sep 05 23:35:32 GMT 2023 - 2.8K bytes - Viewed (0) -
doc/go1.17_spec.html
or be an untyped constant <a href="#Representability">representable</a> by a value of type <code>uint</code>. If the left operand of a non-constant shift expression is an untyped constant, it is first implicitly converted to the type it would assume if the shift expression were replaced by its left operand alone. </p> <pre> var a [1024]byte var s uint = 33
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 211.6K bytes - Viewed (0) -
src/cmd/asm/internal/asm/expr_test.go
{"3/0", "division by zero"}, {"(1<<63)/0", "divide of value with high bit set"}, {"3%0", "modulo by zero"}, {"(1<<63)%0", "modulo of value with high bit set"}, {"3<<-4", "negative left shift count"}, {"3<<(1<<63)", "negative left shift count"}, {"3>>-4", "negative right shift count"}, {"3>>(1<<63)", "negative right shift count"}, {"(1<<63)>>2", "right shift of value with high bit set"}, {"(1<<62)>>2", ""},
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 3.2K bytes - Viewed (0) -
lib/time/update.bash
fi cd zoneinfo ../mkzip ../../zoneinfo.zip cd ../.. files="update.bash zoneinfo.zip" modified=true if git diff --quiet $files; then modified=false fi if [ "$1" = "-work" ]; then echo Left workspace behind in work/. shift else rm -rf work fi if ! $modified; then echo No updates needed. exit 0 fi echo Updated for $CODE/$DATA: $files commitmsg="lib/time: update to $CODE/$DATA
Shell Script - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Feb 02 18:20:41 GMT 2024 - 1.8K bytes - Viewed (0) -
src/cmd/cgo/internal/test/callback_windows.go
break; } else { RtlVirtualUnwind(0, ImageBase, ControlPc, FunctionEntry, &context, &HandlerData, &EstablisherFrame, NULL); } ControlPc = context.Rip; // Check if we left the user range. if (ControlPc < 0x10000) { break; } BackTrace[i] = (PVOID)(ControlPc); } return i; #else return 0; #endif } */ import "C" import ( "internal/testenv"
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Wed Nov 29 16:01:37 GMT 2023 - 2.6K bytes - Viewed (0) -
doc/asm.html
specific to each architecture. The sections below list these. </p> <p> One detail evident in the examples from the previous sections is that data in the instructions flows from left to right: <code>MOVQ</code> <code>$0,</code> <code>CX</code> clears <code>CX</code>. This rule applies even on architectures where the conventional notation uses the opposite direction. </p> <p>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
p.get('.') tok := p.next() ext = tok.String() } if p.peek() == lex.LSH { // parses left shift amount applied after extension: <<Amount p.get(lex.LSH) tok := p.get(scanner.Int) amount, err := strconv.ParseInt(tok.String(), 10, 16) if err != nil { p.errorf("parsing left shift amount: %s", err) } num = int16(amount) } else if p.peek() == '[' { // parses an element: [Index]
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
doc/go_spec.html
The non-blank variable names on the left side of <code>:=</code> must be <a href="#Uniqueness_of_identifiers">unique</a>. </p> <pre> field1, offset := nextField(str, 0) field2, offset := nextField(str, offset) // redeclares offset x, y, x := 1, 2, 3 // illegal: x repeated on left side of := </pre> <p>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K bytes - Viewed (0) -
src/bufio/bufio_test.go
t.Fatalf("read %d bytes; wanted %d bytes", read, n) } // The Reader should have buffered all the content from the io.Reader. if n := len(eofR.buf); n != 0 { t.Fatalf("got %d bytes left in bufio.Reader source; want 0 bytes", n) } // To prove the point, check that there are still 5 bytes available to read. if n := r.Buffered(); n != 5 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Feb 10 18:56:01 GMT 2023 - 51.5K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex.go
type ScanToken rune const ( // Asm defines some two-character lexemes. We make up // a rune/ScanToken value for them - ugly but simple. LSH ScanToken = -1000 - iota // << Left shift. RSH // >> Logical right shift. ARR // -> Used on ARM for shift type 3, arithmetic right shift.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 18:31:05 GMT 2023 - 4.1K bytes - Viewed (0)