- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for items (0.16 sec)
-
src/cmd/asm/internal/asm/parse.go
colon := -1 for tok != '\n' && tok != ';' { // Process one operand. var items []lex.Token if cap(operands) > len(operands) { // Reuse scratch items slice. items = operands[:cap(operands)][len(operands)][:0] } else { items = make([]lex.Token, 0, 3) } for { tok = p.nextToken() if len(operands) == 0 && len(items) == 0 {
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/go1.17_spec.html
must either all be present or all be absent. If present, each name stands for one item (parameter or result) of the specified type and all non-<a href="#Blank_identifier">blank</a> names in the signature must be <a href="#Uniqueness_of_identifiers">unique</a>. If absent, each type stands for one item of that type. Parameter and result lists are always parenthesized except that if there is exactly
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/builtin/builtin.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. /* Package builtin provides documentation for Go's predeclared identifiers. The items documented here are not actually in package builtin but their descriptions here allow godoc to present documentation for the language's special identifiers. */ package builtin import "cmp"
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 12.7K bytes - Viewed (0) -
doc/go_spec.html
must either all be present or all be absent. If present, each name stands for one item (parameter or result) of the specified type and all non-<a href="#Blank_identifier">blank</a> names in the signature must be <a href="#Uniqueness_of_identifiers">unique</a>. If absent, each type stands for one item of that type. Parameter and result lists are always parenthesized except that if there is exactly
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/api/main_test.go
scope := pkg.Scope() for _, name := range scope.Names() { if token.IsExported(name) { w.emitObj(scope.Lookup(name)) } } pop() } func set(items []string) map[string]bool { s := make(map[string]bool) for _, v := range items { s[v] = true } return s } var spaceParensRx = regexp.MustCompile(` \(\S+?\)`) func featureWithoutContext(f string) string {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Apr 09 20:48:51 GMT 2024 - 31.4K bytes - Viewed (0) -
doc/go_mem.html
It allows a counting semaphore to be modeled by a buffered channel: the number of items in the channel corresponds to the number of active uses, the capacity of the channel corresponds to the maximum number of simultaneous uses, sending an item acquires the semaphore, and receiving an item releases the semaphore. This is a common idiom for limiting concurrency. </p> <p>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0)