- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,425 for Blocks (0.11 sec)
-
platforms/core-execution/persistent-cache/src/test/groovy/org/gradle/cache/internal/streams/DefaultValueStoreTest.groovy
} def "can write and then read a block multiple times"() { expect: def block = write("test") read(block) == "test" read(block) == "test" read(block) == "test" } def "can write multiple blocks and read in any order"() { expect: def block1 = write("test 1") def block2 = write("test 2") def block3 = write("test 3")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:08:47 UTC 2023 - 4.9K bytes - Viewed (0) -
build-logic/documentation/src/test/groovy/gradlebuild/docs/dsl/docbook/ClassDocRendererTest.groovy
''') ClassDoc classDoc = classDoc('Class', content: content) BlockDoc block1 = blockDoc('block1', id: 'block1', description: 'block1 description', comment: 'block1 comment', type: 'org.gradle.Type') BlockDoc block2 = blockDoc('block2', id: 'block2', description: 'block2 description', comment: 'block2 comment', type: 'org.gradle.Type', multivalued: true) _ * classDoc.classProperties >> []
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 40.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_test.go
fuseLate(fun.f) z0, ok := fun.blocks["z0"] if !ok || z0.Kind == BlockInvalid { t.Errorf("case2 z0 is eliminated, but should not") } } func BenchmarkFuse(b *testing.B) { for _, n := range [...]int{1, 10, 100, 1000, 10000} { b.Run(strconv.Itoa(n), func(b *testing.B) { c := testConfig(b) blocks := make([]bloc, 0, 2*n+3) blocks = append(blocks, Bloc("entry",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 7.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/lca.go
bid := q[n].bid cid := q[n].cid q = q[:n] // Add block to tour. blocks[bid].pos = int32(len(tour)) tour = append(tour, bid) // Proceed down next child edge (if any). if cid == 0 { // This is our first visit to b. Set its depth. blocks[bid].depth = blocks[blocks[bid].parent].depth + 1 // Then explore its first child. cid = blocks[bid].firstChild } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode_test.go
b.Run(strconv.Itoa(n), func(b *testing.B) { c := testConfig(b) blocks := make([]bloc, 0, n+2) blocks = append(blocks, Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Goto("exit"))) blocks = append(blocks, Bloc("exit", Exit("mem"))) for i := 0; i < n; i++ { blocks = append(blocks, Bloc(fmt.Sprintf("dead%d", i), Goto("exit"))) } b.ResetTimer()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 09 23:01:51 UTC 2017 - 3.5K bytes - Viewed (0) -
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) -
src/cmd/compile/internal/ssa/layout.go
exit := f.newSparseSet(f.NumBlocks()) // exit blocks defer f.retSparseSet(exit) // Populate idToBlock and find exit blocks. for _, b := range f.Blocks { idToBlock[b.ID] = b if b.Kind == BlockExit { exit.add(b.ID) } } // Expand exit to include blocks post-dominated by exit blocks. for { changed := false for _, id := range exit.contents() { b := idToBlock[id] NextPred:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 5K bytes - Viewed (0) -
src/cmd/compile/internal/test/testdata/flowgraph_generator1.go
"fmt" "strings" ) // make fake flow graph. // The blocks of the flow graph are designated with letters A // through Z, always including A (start block) and Z (exit // block) The specification of a flow graph is a comma- // separated list of block successor words, for blocks ordered // A, B, C etc, where each block except Z has one or two // successors, and any block except A can be a target. Within
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 23 06:40:04 UTC 2020 - 6.7K bytes - Viewed (0) -
platforms/extensibility/plugin-use/src/integTest/groovy/org/gradle/plugin/use/PluginUseDslIntegrationSpec.groovy
failure.assertThatCause(containsString("only buildscript {}, pluginManagement {} and other plugins {} script blocks are allowed before plugins {} blocks, no other statements are allowed")) includesLinkToUserguide() } def "settings scripts can have plugin blocks"() { when: settingsFile.text = """ plugins { id "noop" version "1.0" }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 22:36:52 UTC 2023 - 11.7K 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)