- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 166 for lineFor (0.23 sec)
-
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) -
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/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) -
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) -
CONTRIBUTING.md
quality requirements. For example, we check if the CLA is signed, PR has sufficient description, if applicable unit tests are added, if it is a reasonable contribution (meaning it is not a single liner cosmetic PR). **2. Valid?** - If the PR passes all the quality checks then we go ahead and assign a reviewer. - If the PR didn't meet the validation criteria, we request for additional
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 21 11:45:51 UTC 2024 - 15.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/cluster_ops_by_policy.cc
} LogicalResult ClusteringState::VerifyDominanceProperty( unsigned src_root, unsigned dst_root, Operation *insertion_point) { // TODO(ezhulenev): Optimize this linear scan with a map lookup. for (auto &member : members) { unsigned root = FindRoot(member.root); if (root != src_root) continue; // Block arguments do not really participate in clustering, they are only
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 27.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
}]; let description = [{ That is for rows we have grad for, we update var, accum and linear as follows: accum_new = accum + grad * grad linear += grad - (accum_new^(-lr_power) - accum^(-lr_power)) / lr * var quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0 accum = accum_new }]; let arguments = (ins
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0)