- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 154 for growing (0.19 sec)
-
src/runtime/export_test.go
// remains true, since otherwise the second readMetricsLocked below could // allocate before it returns. readMetricsLocked(samplesp, len, cap) // Read memstats first. It's going to flush // the mcaches which readMetrics does not do, so // going the other way around may result in // inconsistent statistics. readmemstats_m(memStats) // Read metrics again. We need to be sure we're on the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/runtime/mgcmark.go
// mark the object. // // Note that it's possible for findObject to // fail if obj points to a just-allocated heap // object because of a race with growing the // heap. In this case, we know the object was // just allocated and hence will be marked by // allocation itself. if obj, span, objIndex := findObject(obj, b, addr-b); obj != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/strings/strings_test.go
// 1. Grow. This triggers two reallocations in Map. maxRune := func(rune) rune { return unicode.MaxRune } m := Map(maxRune, a) expect := tenRunes(unicode.MaxRune) if m != expect { t.Errorf("growing: expected %q got %q", expect, m) } // 2. Shrink minRune := func(rune) rune { return 'a' } m = Map(minRune, tenRunes(unicode.MaxRune)) expect = a if m != expect {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 12:58:37 UTC 2024 - 53K bytes - Viewed (0) -
pkg/proxy/iptables/proxier.go
"-m", "conntrack", "!", "--ctstate", "RELATED,ESTABLISHED,DNAT", "-j", "DROP", ) } // Accumulate NAT chains to keep. activeNATChains := sets.New[utiliptables.Chain]() // To avoid growing this slice, we arbitrarily set its size to 64, // there is never more than that many arguments for a single line. // Note that even if we go over 64, it will still be correct - it // is just for efficiency, not correctness.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 14:39:54 UTC 2024 - 65.1K bytes - Viewed (0) -
src/bytes/bytes_test.go
// 1. Grow. This triggers two reallocations in Map. maxRune := func(r rune) rune { return unicode.MaxRune } m := Map(maxRune, []byte(a)) expect := tenRunes(unicode.MaxRune) if string(m) != expect { t.Errorf("growing: expected %q got %q", expect, m) } // 2. Shrink minRune := func(r rune) rune { return 'a' } m = Map(minRune, []byte(tenRunes(unicode.MaxRune))) expect = a if string(m) != expect {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 12:58:37 UTC 2024 - 56.5K bytes - Viewed (0) -
pkg/proxy/ipvs/proxier.go
// slice = <some new slice> // you should always do one of the below: // slice = slice[:0] // and then append to it // slice = append(slice[:0], ...) // To avoid growing this slice, we arbitrarily set its size to 64, // there is never more than that many arguments for a single line. // Note that even if we go over 64, it will still be correct - it // is just for efficiency, not correctness.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Apr 28 15:51:23 UTC 2024 - 77.7K bytes - Viewed (0) -
pilot/pkg/config/kube/gateway/conversion.go
// So far, this mirrors how out of clusters work (address set means to use existing IP, unset means to provision one), // and there has been growing consensus on this model for in cluster deployments. // // Currently, the supported options are:
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Jun 14 04:34:37 UTC 2024 - 84.7K bytes - Viewed (0) -
src/runtime/mheap.go
// this slice nor its contents will change during the mark, so // it can be read safely. markArenas []arenaIdx // curArena is the arena that the heap is currently growing // into. This should always be physPageSize-aligned. curArena struct { base, end uintptr } // central free lists for small size classes. // the padding makes sure that the mcentrals are
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
import com.google.common.base.CharMatcher.NamedFastMatcher; import java.util.BitSet; /** * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with * linear probing to check for matches. * * @author Christopher Swenson */ @GwtIncompatible // no precomputation is done in GWT @ElementTypesAreNonnullByDefault final class SmallCharMatcher extends NamedFastMatcher {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 4.5K bytes - Viewed (0) -
platforms/core-configuration/declarative-dsl-provider/src/main/kotlin/org/gradle/internal/declarativedsl/evaluationSchema/SchemaComponents.kt
) } /** * Provides grouping capabilities for features used in schema building. */ internal interface AnalysisSchemaComponent { fun typeDiscovery(): List<TypeDiscovery> = listOf() fun propertyExtractors(): List<PropertyExtractor> = listOf() fun functionExtractors(): List<FunctionExtractor> = listOf() } /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 31 13:47:10 UTC 2024 - 7K bytes - Viewed (0)