- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for iter (0.12 sec)
-
src/cmd/asm/internal/asm/parse.go
p.lineNum = p.lex.Line() switch tok { case '\n', ';': continue case scanner.EOF: return "", "", nil, false } break } // First item must be an identifier. if tok != scanner.Ident { p.errorf("expected identifier, found %q", p.lex.Text()) return "", "", nil, false // Might as well stop now. } word, cond = p.lex.Text(), ""
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) -
src/cmd/asm/internal/lex/input.go
// The usual case is caught by Push, below, but be safe. for nesting := 0; nesting < 100; { tok := in.Stack.Next() switch tok { case '#': if !in.beginningOfLine { in.Error("'#' must be first item on line") } in.beginningOfLine = in.hash() in.text = "#" return '#' case scanner.Ident: // Is it a macro name? name := in.Stack.Text() macro := in.macros[name]
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) -
doc/go_mem.html
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> This program starts a goroutine for every entry in the work list, but the
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)