- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 76 for linear_1 (0.36 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) -
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) -
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) -
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) -
api/go1.4.txt
pkg unicode, var Duployan *RangeTable pkg unicode, var Elbasan *RangeTable pkg unicode, var Grantha *RangeTable pkg unicode, var Khojki *RangeTable pkg unicode, var Khudawadi *RangeTable pkg unicode, var Linear_A *RangeTable pkg unicode, var Mahajani *RangeTable pkg unicode, var Manichaean *RangeTable pkg unicode, var Mende_Kikakui *RangeTable pkg unicode, var Modi *RangeTable pkg unicode, var Mro *RangeTable
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 12 03:01:01 UTC 2014 - 34K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tlog.go
// "Efficient Data Structures for Tamper-Evident Logging". // https://www.usenix.org/legacy/event/sec09/tech/full_papers/crosby.pdf // StoredHashIndex maps the tree coordinates (level, n) // to a dense linear ordering that can be used for hash storage. // Hash storage implementations that store hashes in sequential // storage can use this function to compute where to read or write // a given hash.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 17.9K bytes - Viewed (0) -
src/runtime/sema.go
// Try to find the g that needs to be notified. // If it hasn't made it to the list yet we won't find it, // but it won't park itself once it sees the new notify number. // // This scan looks linear but essentially always stops quickly. // Because g's queue separately from taking numbers, // there may be minor reorderings in the list, but we // expect the g we're looking for to be near the front.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 19K bytes - Viewed (0)