Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 570 for index (2.25 sec)

  1. src/net/sockoptip_posix.go

    	runtime.KeepAlive(fd)
    	return wrapSyscallError("setsockopt", err)
    }
    
    func setIPv6MulticastInterface(fd *netFD, ifi *Interface) error {
    	var v int
    	if ifi != nil {
    		v = ifi.Index
    	}
    	err := fd.pfd.SetsockoptInt(syscall.IPPROTO_IPV6, syscall.IPV6_MULTICAST_IF, v)
    	runtime.KeepAlive(fd)
    	return wrapSyscallError("setsockopt", err)
    }
    
    func setIPv6MulticastLoopback(fd *netFD, v bool) error {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 29 16:24:51 UTC 2022
    - 1.4K bytes
    - Viewed (0)
  2. src/syscall/ztypes_solaris_amd64.go

    }
    
    type IfaMsghdr struct {
    	Msglen    uint16
    	Version   uint8
    	Type      uint8
    	Addrs     int32
    	Flags     int32
    	Index     uint16
    	Pad_cgo_0 [2]byte
    	Metric    int32
    }
    
    type RtMsghdr struct {
    	Msglen    uint16
    	Version   uint8
    	Type      uint8
    	Index     uint16
    	Pad_cgo_0 [2]byte
    	Flags     int32
    	Addrs     int32
    	Pid       int32
    	Seq       int32
    	Errno     int32
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 28 18:17:57 UTC 2021
    - 5.6K bytes
    - Viewed (0)
  3. src/vendor/golang.org/x/crypto/internal/alias/alias_purego.go

    // because the unsafe package and cgo are disallowed.
    
    import "reflect"
    
    // AnyOverlap reports whether x and y share memory at any (not necessarily
    // corresponding) index. The memory beyond the slice length is ignored.
    func AnyOverlap(x, y []byte) bool {
    	return len(x) > 0 && len(y) > 0 &&
    		reflect.ValueOf(&x[0]).Pointer() <= reflect.ValueOf(&y[len(y)-1]).Pointer() &&
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:33 UTC 2023
    - 1.2K bytes
    - Viewed (0)
  4. pkg/apis/core/pods/helpers.go

    	fldPath := specPath.Child("initContainers")
    	for i := range podSpec.InitContainers {
    		if !visitor(&podSpec.InitContainers[i], fldPath.Index(i)) {
    			return false
    		}
    	}
    	fldPath = specPath.Child("containers")
    	for i := range podSpec.Containers {
    		if !visitor(&podSpec.Containers[i], fldPath.Index(i)) {
    			return false
    		}
    	}
    	fldPath = specPath.Child("ephemeralContainers")
    	for i := range podSpec.EphemeralContainers {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jul 14 01:35:30 UTC 2023
    - 3.2K bytes
    - Viewed (0)
  5. src/net/http/pprof/pprof_test.go

    		{"/debug/pprof/mutex", Index, http.StatusOK, "application/octet-stream", `attachment; filename="mutex"`, nil},
    		{"/debug/pprof/block?seconds=1", Index, http.StatusOK, "application/octet-stream", `attachment; filename="block-delta"`, nil},
    		{"/debug/pprof/goroutine?seconds=1", Index, http.StatusOK, "application/octet-stream", `attachment; filename="goroutine-delta"`, nil},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Dec 07 19:52:28 UTC 2023
    - 9.7K bytes
    - Viewed (0)
  6. src/vendor/golang.org/x/net/http2/hpack/tables.go

    }
    
    // search finds f in the table. If there is no match, i is 0.
    // If both name and value match, i is the matched index and nameValueMatch
    // becomes true. If only name matches, i points to that index and
    // nameValueMatch becomes false.
    //
    // The returned index is a 1-based HPACK index. For dynamic tables, HPACK says
    // that index 1 should be the newest entry, but t.ents[0] is the oldest entry,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Nov 18 22:32:44 UTC 2022
    - 7.5K bytes
    - Viewed (0)
  7. cmd/xl-storage-format-v1.go

    	// ParityBlocks is the number of parity blocks for erasure-coding
    	ParityBlocks int `json:"parity"`
    	// BlockSize is the size of one erasure-coded block
    	BlockSize int64 `json:"blockSize"`
    	// Index is the index of the current disk
    	Index int `json:"index"`
    	// Distribution is the distribution of the data and parity blocks
    	Distribution []int `json:"distribution"`
    	// Checksums holds all bitrot checksums of all erasure encoded blocks
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu Apr 04 12:04:40 UTC 2024
    - 8.2K bytes
    - Viewed (0)
  8. src/debug/macho/reloctype_string.go

    // Code generated by "stringer -type=RelocTypeGeneric,RelocTypeX86_64,RelocTypeARM,RelocTypeARM64 -output reloctype_string.go"; DO NOT EDIT.
    
    package macho
    
    import "strconv"
    
    func _() {
    	// An "invalid array index" compiler error signifies that the constant values have changed.
    	// Re-run the stringer command to generate them again.
    	var x [1]struct{}
    	_ = x[GENERIC_RELOC_VANILLA-0]
    	_ = x[GENERIC_RELOC_PAIR-1]
    	_ = x[GENERIC_RELOC_SECTDIFF-2]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 11 20:24:07 UTC 2023
    - 4.3K bytes
    - Viewed (0)
  9. src/math/pow10.go

    	1e30, 1e31,
    }
    
    // pow10postab32 stores the pre-computed value for 10**(i*32) at index i.
    var pow10postab32 = [...]float64{
    	1e00, 1e32, 1e64, 1e96, 1e128, 1e160, 1e192, 1e224, 1e256, 1e288,
    }
    
    // pow10negtab32 stores the pre-computed value for 10**(-i*32) at index i.
    var pow10negtab32 = [...]float64{
    	1e-00, 1e-32, 1e-64, 1e-96, 1e-128, 1e-160, 1e-192, 1e-224, 1e-256, 1e-288, 1e-320,
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 11 16:34:30 UTC 2022
    - 1.2K bytes
    - Viewed (0)
  10. pkg/util/iptables/save_restore.go

    // chain defined in that table.
    func GetChainsFromTable(save []byte) sets.Set[Chain] {
    	chainsSet := sets.New[Chain]()
    
    	for {
    		i := bytes.Index(save, []byte("\n:"))
    		if i == -1 {
    			break
    		}
    		start := i + 2
    		save = save[start:]
    		end := bytes.Index(save, []byte(" "))
    		if end == -1 {
    			// shouldn't happen, but...
    			break
    		}
    		chain := Chain(save[:end])
    		chainsSet.Insert(chain)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Dec 19 01:20:51 UTC 2023
    - 1.4K bytes
    - Viewed (0)
Back to top