- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 61 for habe (0.16 sec)
-
doc/asm.html
Care should be taken when using vector instructions to ensure that they are available at runtime. To use vector instructions a machine must have both the vector facility (bit 129 in the facility list) and kernel support. Without kernel support a vector instruction will have no effect (it will be equivalent to a <code>NOP</code> instruction). </p> <p> Addressing modes: </p> <ul> <li>
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/bytes/bytes_test.go
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Jan 24 16:07:25 GMT 2024 - 56.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/line_test.go
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 1.9K bytes - Viewed (0) -
doc/README.md
Files in this repo's `api/next` directory must have corresponding files in `doc/next/*stdlib/*minor`. The files should be in the subdirectory for the package with the new API, and should be named after the issue number of the API proposal. For example, if the directory `6-stdlib/99-minor` is present, then an `api/next` file with the line pkg net/http, function F #12345
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Fri Apr 26 21:24:36 GMT 2024 - 1.9K bytes - Viewed (0) -
PATENTS
Google as part of the Go project. Google hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, transfer and otherwise run, modify and propagate the contents of this implementation of Go, where such license applies only to those patent
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Dec 06 21:31:59 GMT 2010 - 1.3K bytes - Viewed (0) -
doc/go_spec.html
structurally equivalent; that is, they have the same literal structure and corresponding components have identical types. In detail: </p> <ul> <li>Two array types are identical if they have identical element types and the same array length.</li> <li>Two slice types are identical if they have identical element types.</li>
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/cmd/asm/internal/asm/parse.go
} } if haveConstant { p.back() if p.have(scanner.Float) { if prefix != '$' { p.errorf("floating-point constant must be an immediate") } a.Type = obj.TYPE_FCONST a.Val = p.floatExpr() // fmt.Printf("FCONST %s\n", obj.Dconv(&emptyProg, 0, a)) p.expectOperandEnd() return } if p.have(scanner.String) { if prefix != '$' {
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/next/6-stdlib/1-time.md
[time.Timer] and [time.Ticker]. First, `Timer`s and `Ticker`s that are no longer referred to by the program become eligible for garbage collection immediately, even if their `Stop` methods have not been called. Earlier versions of Go did not collect unstopped `Timer`s until after they had fired and never collected unstopped `Ticker`s. Second, the timer channel associated with a `Timer` or `Ticker` is
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Fri Apr 12 20:57:18 GMT 2024 - 1.5K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
if macro != nil { nesting++ in.invokeMacro(macro) continue } fallthrough default: if tok == scanner.EOF && len(in.ifdefStack) > 0 { // We're skipping text but have run out of input with no #endif. in.Error("unclosed #ifdef or #ifndef") } in.beginningOfLine = tok == '\n' if in.enabled() { in.text = in.Stack.Text() return tok } } }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/bytes/bytes.go
// limit (8KB), we stop growing the source string once the limit // is reached and keep reusing the same source string - that // should therefore be always resident in the L1 cache - until we // have completed the construction of the result. // This yields significant speedups (up to +100%) in cases where // the result length is large (roughly, over L2 cache size). const chunkLimit = 8 * 1024 chunkMax := n
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Feb 19 19:51:15 GMT 2024 - 33.8K bytes - Viewed (0)