- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 2,856 for block1 (0.16 sec)
-
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) -
src/cmd/vendor/golang.org/x/tools/cover/profile.go
FileName: fn, Mode: mode, } files[fn] = p } p.Blocks = append(p.Blocks, b) } if err := s.Err(); err != nil { return nil, err } for _, p := range files { sort.Sort(blocksByStart(p.Blocks)) // Merge samples from the same location. j := 1 for i := 1; i < len(p.Blocks); i++ { b := p.Blocks[i] last := p.Blocks[j-1] if b.StartLine == last.StartLine && b.StartCol == last.StartCol &&
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 11 17:02:03 UTC 2021 - 7.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cache.go
xv := c.values[:nv] for i := range xv { xv[i] = Value{} } nb := sort.Search(len(c.blocks), func(i int) bool { return c.blocks[i].ID == 0 }) xb := c.blocks[:nb] for i := range xb { xb[i] = Block{} } nl := sort.Search(len(c.locs), func(i int) bool { return c.locs[i] == nil }) xl := c.locs[:nl] for i := range xl { xl[i] = nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 15 23:00:54 UTC 2023 - 1.6K bytes - Viewed (0) -
platforms/extensibility/plugin-use/src/integTest/groovy/org/gradle/plugin/repository/PluginManagementDslSpec.groovy
succeeds 'help' } def "other blocks can follow the pluginManagement block"() { given: settingsFile << """ pluginManagement {} rootProject.name = 'rumpelstiltskin' """ expect: succeeds 'help' } def "pluginManagement block is not supported in ProjectScripts"() { given:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Mar 28 15:16:47 UTC 2024 - 10.2K bytes - Viewed (0) -
pkg/kubelet/cm/memorymanager/state/state_mem.go
func (s *stateMemory) SetMemoryBlocks(podUID string, containerName string, blocks []Block) { s.Lock() defer s.Unlock() if _, ok := s.assignments[podUID]; !ok { s.assignments[podUID] = map[string][]Block{} } s.assignments[podUID][containerName] = append([]Block{}, blocks...) klog.InfoS("Updated memory state", "podUID", podUID, "containerName", containerName) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Mar 15 19:51:19 UTC 2021 - 3.2K bytes - Viewed (0) -
src/internal/chacha8rand/chacha8_generic.go
// produce 1024 bytes of output (16 blocks, with counters 0 to 15). // First, for each block, the values 0x61707865, 0x3320646e, 0x79622d32, // 0x6b206574 are subtracted from the 32-bit little-endian words at // position 0, 1, 2, and 3 respectively, and an increasing counter // starting at zero is subtracted from each word at position 12. Then, // this stream is permuted such that for each sequence of four blocks,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:32:54 UTC 2023 - 6.3K bytes - Viewed (0) -
testing/internal-testing/src/test/groovy/org/gradle/test/fixtures/concurrent/ConcurrentSpecTest.groovy
thread.block() worker.runLater(action2) } then: instant.action2Completed < instant.action1Completed } def "can use instants to test that a method blocks until action is complete"() { Worker worker = new Worker(executor) given: def action = { thread.block() instant.actionCompleted }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 8.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_program_key.cc
return tpu_compile_successor; } // Get all the Blocks underneath `top` that are "in the scope" of `bottom`, // i.e., are ancestors. llvm::DenseSet<Block*> GetAllBlocksBetween(Operation* bottom, Operation* top) { llvm::DenseSet<Block*> blocks; Operation* op = bottom; while (op && op != top) { blocks.insert(op->getBlock()); op = op->getParentOp(); } return blocks; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 17.4K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/test/groovy/org/gradle/internal/work/DefaultWorkerLeaseServiceWorkerLeaseTest.groovy
} def "can use worker lease as resource lock"() { def registry = workerLeaseService(1) when: def workerLease = registry.newWorkerLease() coordinationService.withStateLock(lock(workerLease)) then: noExceptionThrown() } def "acquire lease as resource lock blocks when there are no leases available"() {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 13.2K bytes - Viewed (0)