- Sort Score
- Result 10 results
- Languages All
Results 151 - 160 of 228 for lineFor (0.36 sec)
-
src/encoding/xml/xml_test.go
?> <elt att = "val"> <![CDATA[ ]]><!-- --></elt> </root>` linePos := [][]int{ {1, 7}, {2, 1}, {3, 4}, {3, 6}, {6, 7}, {7, 1}, {8, 4}, {10, 4}, {10, 10}, {11, 1}, {11, 8}, } dec := NewDecoder(strings.NewReader(testInput)) for _, want := range linePos { if _, err := dec.Token(); err != nil { t.Errorf("Unexpected error: %v", err)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 36.9K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/dotgraph.go
label = label + fmt.Sprintf(`of %s (%s)`, cumValue, strings.TrimSpace(measurement.Percentage(cum, b.config.Total))) } // Scale font sizes from 8 to 24 based on percentage of flat frequency. // Use non linear growth to emphasize the size difference. baseFontSize, maxFontGrowth := 8, 16.0 fontSize := baseFontSize if maxFlat != 0 && flat != 0 && float64(abs64(flat)) <= maxFlat {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 09 20:51:42 UTC 2022 - 14.8K bytes - Viewed (0) -
src/mime/multipart/multipart.go
// consisting entirely of two hyphen characters ("-", // decimal value 45) followed by the boundary parameter // value from the Content-Type header field, optional linear // whitespace, and a terminating CRLF. if !bytes.HasPrefix(line, r.dashBoundary) { return false } rest := line[len(r.dashBoundary):] rest = skipLWSPChar(rest)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 16:12:35 UTC 2024 - 14.1K bytes - Viewed (0) -
pkg/registry/core/service/storage/alloc.go
// This is O(N), but we expect haystack to be small; // so small that we expect a linear search to be faster func containsNumber(haystack []int, needle int) bool { for _, v := range haystack { if v == needle { return true } } return false } // This is O(N), but we expect serviceNodePorts to be small; // so small that we expect a linear search to be faster
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:05 UTC 2023 - 37.3K bytes - Viewed (0) -
pkg/registry/core/service/ipallocator/ipallocator.go
return value } } // allocateFromRange allocates an empty IP address from the range of // IPs between the first and last address (both included), starting // from the start address. // TODO: this is a linear search, it can be optimized. func (a *Allocator) allocateFromRange(iterator func() netip.Addr, svc *api.Service) (net.IP, error) { for { ip := iterator() if !ip.IsValid() { break }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17K bytes - Viewed (0) -
pkg/proxy/iptables/proxier_test.go
if err != nil { t.Fatalf("%s", err) } lineStr := "" if line != 0 { lineStr = fmt.Sprintf(" (from line %d)", line) } if diff := cmp.Diff(expected, result); diff != "" { t.Errorf("rules do not match%s:\ndiff:\n%s\nfull result:\n```\n%s```", lineStr, diff, result) } if checkConsistency { err = checkIPTablesRuleJumps(expected)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 14:39:54 UTC 2024 - 249.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/phi.go
// For small functions, we use Braun, Buchwald, Hack, Leißa, Mallon, and Zwinkau. // https://pp.info.uni-karlsruhe.de/uploads/publikationen/braun13cc.pdf // For large functions, we use Sreedhar & Gao: A Linear Time Algorithm for Placing Φ-Nodes. // http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.8.1979&rep=rep1&type=pdf const smallBlocks = 500 const debugPhi = false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
* equivalently, if this inverse view contains a key that is equal to {@code value}). * * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
private static final int CUTOFF = (int) (MAX_TABLE_SIZE * DESIRED_LOAD_FACTOR); /** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. Always returns at least setSize + 2. */ @VisibleForTesting
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.5K bytes - Viewed (0) -
src/cmd/internal/obj/util.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 17.5K bytes - Viewed (0)