- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 190 for Indexes (0.12 sec)
-
test/fixedbugs/issue4620.go
// run // Copyright 2013 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Issue 4620: map indexes are not evaluated before assignment of other elements package main import "fmt" func main() { m := map[int]int{0:1} i := 0 i, m[i] = 1, 2 if m[0] != 2 { fmt.Println(m) panic("m[i] != 2") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 398 bytes - Viewed (0) -
platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/ModuleSelectorsTest.groovy
when: indexes.each { selectors.add(candidateSelectors[it], false) } indexes.each { selectors.remove(candidateSelectors[it]) } then: verifyEmpty(selectors) where: indexes << [0, 1, 2, 3].permutations() }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 7.5K bytes - Viewed (0) -
src/runtime/wincallback.go
// The MOV instruction loads R12 with the callback index, and the // B instruction branches to callbackasm1. // callbackasm1 takes the callback index from R12 and // indexes into an array that stores information about each callback. // It then calls the Go implementation for that callback. #include "textflag.h" TEXT runtime·callbackasm(SB),NOSPLIT|NOFRAME,$0 `)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 24 19:29:51 UTC 2023 - 3.5K bytes - Viewed (0) -
test/fixedbugs/issue4348.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Issue 4348. After switch to 64-bit ints the compiler generates // illegal instructions when using large array bounds or indexes. // Skip. We reject symbols larger that 2GB (Issue #9862). package main // 1<<32 on a 64-bit machine, 1 otherwise. const LARGE = ^uint(0)>>32 + 1 func A() int { var a []int return a[LARGE] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 20 18:51:03 UTC 2020 - 584 bytes - Viewed (0) -
test/fixedbugs/issue28079a.go
// compile // Copyright 2018 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Non-Go-constant but constant indexes are ok at compile time. package p import "unsafe" func f() { var x [0]int x[uintptr(unsafe.Pointer(nil))] = 0 } func g() { var x [10]int _ = x[3:uintptr(unsafe.Pointer(nil))]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 27 01:21:41 UTC 2018 - 396 bytes - Viewed (0) -
src/slices/iter.go
// The indexes range in the usual order, from 0 through len(s)-1. func All[Slice ~[]E, E any](s Slice) iter.Seq2[int, E] { return func(yield func(int, E) bool) { for i, v := range s { if !yield(i, v) { return } } } } // Backward returns an iterator over index-value pairs in the slice, // traversing it backward. The indexes range from len(s)-1 down to 0.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:40:32 UTC 2024 - 2.9K bytes - Viewed (0) -
guava/src/com/google/common/escape/CharEscaperBuilder.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * Simple helper class to build a "sparse" array of objects based on the indexes that were added to * it. The array will be from 0 to the maximum index given. All non-set indexes will contain null * (so it's not really a sparse array, just a pseudo sparse array). The builder can also return a * CharEscaper based on the generated array. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 4K bytes - Viewed (0) -
test/fixedbugs/issue15252.go
// license that can be found in the LICENSE file. // This test makes sure that we use all 64 bits of an // index, even on 32 bit machines. It also tests that nacl // can compile 64 bit indexes loaded from ODOTPTR properly. package main type T struct { i int64 } func f(t *T) byte { b := [2]byte{3, 4} return b[t.i] } func main() { t := &T{0x100000001} defer func() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 14 21:19:12 UTC 2016 - 612 bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/test.go
records [][]byte lookup map[string]int64 } // testHashes implements tlog.HashReader, reading from a slice. type testHashes []tlog.Hash func (h testHashes) ReadHashes(indexes []int64) ([]tlog.Hash, error) { var list []tlog.Hash for _, id := range indexes { list = append(list, h[id]) } return list, nil } func (s *TestServer) Signed(ctx context.Context) ([]byte, error) { s.mu.Lock() defer s.mu.Unlock()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 2.8K bytes - Viewed (0) -
src/sync/export_test.go
PopHead() (any, bool) PopTail() (any, bool) } func NewPoolDequeue(n int) PoolDequeue { d := &poolDequeue{ vals: make([]eface, n), } // For testing purposes, set the head and tail indexes close // to wrapping around. d.headTail.Store(d.pack(1<<dequeueBits-500, 1<<dequeueBits-500)) return d } func (d *poolDequeue) PushHead(val any) bool { return d.pushHead(val) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 17 16:39:52 UTC 2023 - 1.2K bytes - Viewed (0)