- Sort Score
- Result 10 results
- Languages All
Results 151 - 160 of 4,111 for Tables (0.86 sec)
-
cluster/addons/calico-policy-controller/felixconfigurations-crd.yaml
type: string routeTableRange: description: Calico programs additional Linux route tables for various purposes. RouteTableRange specifies the indices of the route tables that Calico should use. properties: max: type: integer min:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 07 20:48:43 UTC 2021 - 29.1K bytes - Viewed (0) -
cni/pkg/iptables/iptables.go
// // Extreme corner case: // If for some reason your host had both binaries, and you were injecting out-of-band // iptables rules within a pod context into `legacy` tables, but your host context preferred // `nft`, we would still inject our rules in-pod into nft tables, which is a bit wonky. // // But that's stunningly unlikely (and would still work either way) iptVer, err := ext.DetectIptablesVersion(false) if err != nil {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri May 31 21:45:18 UTC 2024 - 19.9K bytes - Viewed (0) -
src/strconv/quote.go
// TODO: IsPrint is a local implementation of unicode.IsPrint, verified by the tests // to give the same answer. It allows this package not to depend on unicode, // and therefore not pull in all the Unicode tables. If the linker were better // at tossing unused tables, we could get rid of this implementation. // That would be nice. // IsPrint reports whether the rune is defined as printable by Go, with
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 16.5K bytes - Viewed (0) -
src/hash/crc32/crc32.go
} else { // Initialize the slicing-by-8 table. ieeeTable8 = slicingMakeTable(IEEE) updateIEEE = func(crc uint32, p []byte) uint32 { return slicingUpdate(crc, ieeeTable8, p) } } } // MakeTable returns a [Table] constructed from the specified polynomial. // The contents of this [Table] must not be modified. func MakeTable(poly uint32) *Table { switch poly { case IEEE: ieeeOnce.Do(ieeeInit)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 7.5K bytes - Viewed (0) -
src/strconv/testdata/testfp.txt
# Powers of 2. # %.20g versions. # random sources # random targets # random targets ± half a ULP # Difficult boundary cases, derived from tables given in # Vern Paxson, A Program for Testing IEEE Decimal-Binary Conversion # ftp://ftp.ee.lbl.gov/testbase-report.ps.Z # Table 1: Stress Inputs for Conversion to 53-bit Binary, < 1/2 ULP float64 %b 5e+125 6653062250012735p+365 float64 %b 69e+267 4705683757438170p+841
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 08 04:08:51 UTC 2014 - 7.9K bytes - Viewed (0) -
src/cmd/internal/dwarf/dwarf_defs.go
) // Table 28 const ( DW_ACCESS_public = 0x01 DW_ACCESS_protected = 0x02 DW_ACCESS_private = 0x03 ) // Table 29 const ( DW_VIS_local = 0x01 DW_VIS_exported = 0x02 DW_VIS_qualified = 0x03 ) // Table 30 const ( DW_VIRTUALITY_none = 0x00 DW_VIRTUALITY_virtual = 0x01 DW_VIRTUALITY_pure_virtual = 0x02 ) // Table 31 const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 15:55:36 UTC 2019 - 16.1K bytes - Viewed (0) -
src/internal/reflectlite/type.go
rV := toRType(V) // The same algorithm applies in both cases, but the // method tables for an interface type and a concrete type // are different, so the code is duplicated. // In both cases the algorithm is a linear scan over the two // lists - T's methods and V's methods - simultaneously. // Since method tables are stored in a unique sorted order // (alphabetical, with no duplicate method names), the scan
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:01:54 UTC 2024 - 16.2K bytes - Viewed (0) -
src/strconv/ftoaryu.go
d.dp = d.nd + trimmed } // mult64bitPow10 takes a floating-point input with a 25-bit // mantissa and multiplies it with 10^q. The resulting mantissa // is m*P >> 57 where P is a 64-bit element of the detailedPowersOfTen tables. // It is typically 31 or 32-bit wide. // The returned boolean is true if all trimmed bits were zero. // // That is: // // m*2^e2 * round(10^q) = resM * 2^resE + ε // exact = ε == 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
src/debug/gosym/pclntab.go
// // Deprecated: Use Table's PCToLine method instead. func (t *LineTable) PCToLine(pc uint64) int { if t.isGo12() { return t.go12PCToLine(pc) } _, _, line := t.parse(pc, -1) return line } // LineToPC returns the program counter for the given line number, // considering only program counters before maxpc. // // Deprecated: Use Table's LineToPC method instead.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 25 19:43:24 UTC 2024 - 18.8K bytes - Viewed (0) -
pkg/proxy/iptables/proxier_test.go
nTables := len(rawTables) - 1 if nTables < 2 || rawTables[nTables] != "" { return nil, fmt.Errorf("bad ruleData (%d tables)\n%s", nTables, ruleData) } tables := make(map[string][]string, nTables) for i, table := range rawTables[:nTables] { lines := strings.Split(strings.Trim(table, "\n"), "\n") // The first line should be, eg, "*nat" or "*filter" if lines[0][0] != '*' {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 14:39:54 UTC 2024 - 249.9K bytes - Viewed (1)