- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,365 for blockn (0.11 sec)
-
src/cmd/compile/internal/ssa/looprotate.go
for i, b := range f.Blocks { idToIdx[b.ID] = i } // Set of blocks we're moving, by ID. move := map[ID]struct{}{} // Map from block ID to the moving blocks that should // come right after it. after := map[ID][]*Block{} // Check each loop header and decide if we want to move it. for _, loop := range loopnest.loops { b := loop.header var p *Block // b's in-loop predecessor
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 3K bytes - Viewed (0) -
platforms/core-runtime/time/src/main/java/org/gradle/internal/time/Clock.java
import org.gradle.internal.service.scopes.Scope; import org.gradle.internal.service.scopes.ServiceScope; /** * A device for obtaining the current time. * * @see Time#clock() */ @ServiceScope(Scope.Global.class) public interface Clock { /** * The current time in millis. */ long getCurrentTime();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Apr 17 00:47:05 UTC 2024 - 974 bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/build/relnote/relnote.go
slices.Sort(filenames) return filenames, nil } // lastBlock returns the last block in the document. // It panics if the document has no blocks. func lastBlock(doc *md.Document) md.Block { return doc.Blocks[len(doc.Blocks)-1] } // addLines adds n lines to the position of b. // n can be negative. func addLines(b md.Block, n int) { pos := position(b) pos.StartLine += n pos.EndLine += n }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 12.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/cfg.go
// // The entry point is Blocks[0]; there may be multiple return blocks. type CFG struct { fset *token.FileSet Blocks []*Block // block[0] is entry; order otherwise undefined } // A Block represents a basic block: a list of statements and // expressions that are always evaluated sequentially. // // A block may have 0-2 successors: zero for a return block or a block
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 7.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/check.go
bb := s.Block() if ln.b2l[b.ID] == nil && ln.b2l[bb.ID] != nil && bb != ln.b2l[bb.ID].header { f.Fatalf("block %s not in loop branches to non-header block %s in loop", b.String(), bb.String()) } if ln.b2l[b.ID] != nil && ln.b2l[bb.ID] != nil && bb != ln.b2l[bb.ID].header && !ln.b2l[b.ID].isWithinOrEq(ln.b2l[bb.ID]) { f.Fatalf("block %s in loop branches to non-header block %s in non-containing loop", b.String(), bb.String())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/list.go
item *itemBuilder todo func() line } func (b *listBuilder) build(p buildState) Block { blocks := p.blocks() pos := p.pos() // list can have wrong pos b/c extend dance. pos.EndLine = blocks[len(blocks)-1].Pos().EndLine Loose: for i, c := range blocks { c := c.(*Item) if i+1 < len(blocks) { if blocks[i+1].Pos().StartLine-c.EndLine > 1 { b.loose = true break Loose } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 7.2K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/parse.go
"strings" ) /* list block itself does not appear on stack? item does end of item returns block, new item continues previous block if possible? if close leaves lines or blocks behind, panic close(b a list item, parent) if b's parent's last block is list && item can be added to it, do so else return new list or maybe not parent but just current list of blocks preserve LinkRefDefs? */
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 13.8K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/quote.go
import ( "bytes" ) type Quote struct { Position Blocks []Block } func (b *Quote) PrintHTML(buf *bytes.Buffer) { buf.WriteString("<blockquote>\n") for _, c := range b.Blocks { c.PrintHTML(buf) } buf.WriteString("</blockquote>\n") } func (b *Quote) printMarkdown(buf *bytes.Buffer, s mdState) { s.prefix += "> " printMarkdownBlocks(b.Blocks, buf, s) } func trimQuote(s line) (line, bool) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 1K bytes - Viewed (0) -
testing/internal-integ-testing/src/main/groovy/org/gradle/integtests/fixtures/executer/GradleHandle.java
/** * Blocks until the build is complete and assert that the build completed successfully. */ ExecutionResult waitForFinish(); /** * Blocks until the build is complete and assert that the build completed with a failure. */ ExecutionFailure waitForFailure(); /** * Blocks until the build is complete and exits, disregarding the result. */
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 2.1K bytes - Viewed (0) -
src/image/jpeg/scan.go
d.progCoeffs[compIndex] = make([]block, mxx*myy*d.comp[compIndex].h*d.comp[compIndex].v) } } } d.bits = bits{} mcu, expectedRST := 0, uint8(rst0Marker) var ( // b is the decoded coefficients, in natural (not zig-zag) order. b block dc [maxComponents]int32 // bx and by are the location of the current block, in units of 8x8 // blocks: the third block in the first row has (bx, by) = (2, 0).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0)