- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 299 for fecero (0.14 sec)
-
src/cmd/go/testdata/script/mod_tidy_compat.txt
[exec:patch] cmp go.sum go.sum.tidyResult go list -m all cmp stdout m_all.txt go mod edit -go=1.16 go list -m all cmp stdout m_all.txt # If we explicitly drop compatibility with 1.16, we retain fewer checksums, # which gives a cleaner go.sum file but causes 1.16 to fail in readonly mode. cp go.mod.orig go.mod go mod tidy -compat=1.17 cmp go.mod go.mod.orig # Make sure that -diff behaves the same as tidy.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 3.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
* Returns {@code true} if each element in {@code iterable} after the first is greater than or * equal to the element that preceded it, according to the specified comparator. Note that this is * always true when the iterable has fewer than two elements. */ public static <T extends @Nullable Object> boolean isInOrder( Iterable<? extends T> iterable, Comparator<T> comparator) { checkNotNull(comparator);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Apr 11 08:42:51 UTC 2024 - 10.7K bytes - Viewed (0) -
src/regexp/syntax/simplify_test.go
{`a{5}`, `aaaaa`}, {`a{0,1}`, `a?`}, // The next three are illegible because Simplify inserts (?:) // parens instead of () parens to avoid creating extra // captured subexpressions. The comments show a version with fewer parens. {`(a){0,2}`, `(?:(a)(a)?)?`}, // (aa?)? {`(a){0,4}`, `(?:(a)(?:(a)(?:(a)(a)?)?)?)?`}, // (a(a(aa?)?)?)? {`(a){2,6}`, `(a)(a)(?:(a)(?:(a)(?:(a)(a)?)?)?)?`}, // aa(a(a(aa?)?)?)?
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 16 16:02:30 UTC 2023 - 4K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/runtime/schema/group_version.go
// TODO: Move GroupVersion to a package under pkg/runtime, since it's used by scheme. // TODO: Introduce an adapter type between GroupVersion and runtime.GroupVersioner, and use LegacyCodec(GroupVersion) // in fewer places. func (gv GroupVersion) KindForGroupVersionKinds(kinds []GroupVersionKind) (target GroupVersionKind, ok bool) { for _, gvk := range kinds { if gvk.Group == gv.Group && gvk.Version == gv.Version { return gvk, true
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 30 09:08:59 UTC 2023 - 10.2K bytes - Viewed (0) -
pilot/pkg/features/tuning.go
"PILOT_ENABLE_EDS_DEBOUNCE", true, "If enabled, Pilot will include EDS pushes in the push debouncing, configured by PILOT_DEBOUNCE_AFTER and PILOT_DEBOUNCE_MAX."+ " EDS pushes may be delayed, but there will be fewer pushes. By default this is enabled", ).Get() ConvertSidecarScopeConcurrency = env.Register( "PILOT_CONVERT_SIDECAR_SCOPE_CONCURRENCY", 1, "Used to adjust the concurrency of SidecarScope conversions. "+
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Mar 06 04:22:19 UTC 2024 - 4.8K bytes - Viewed (1) -
src/cmd/go/testdata/script/mod_tidy_compat_irrelevant.txt
go list -deps -test -f $MODFMT all cp stdout out-117.txt go mod edit -go=1.16 go list -deps -test -f $MODFMT all cmp stdout out-117.txt # If we explicitly drop compatibility with 1.16, we retain fewer checksums, # which gives a cleaner go.sum file but causes 1.16 to fail in readonly mode. cp go.mod.orig go.mod go mod tidy -compat=1.17 cmp go.mod go.mod.orig # Make sure that -diff behaves the same as tidy.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 3.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Ordering.java
} return maxSoFar; } /** * Returns the {@code k} least elements of the given iterable according to this ordering, in order * from least to greatest. If there are fewer than {@code k} elements present, all will be * included. * * <p>The implementation does not necessarily use a <i>stable</i> sorting algorithm; when multiple
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
} return maxSoFar; } /** * Returns the {@code k} least elements of the given iterable according to this ordering, in order * from least to greatest. If there are fewer than {@code k} elements present, all will be * included. * * <p>The implementation does not necessarily use a <i>stable</i> sorting algorithm; when multiple
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
src/index/suffixarray/suffixarray.go
// Lookup returns indices that may belong to overlapping matches. // After eliminating them, we may end up with fewer than n matches. // If we don't have enough at the end, redo the search with an // increased value n1, but only if Lookup returned all the requested // indices in the first place (if it returned fewer than that then // there cannot be more). for n1 := n; ; n1 += 2 * (n - len(result)) /* overflow ok */ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.5K bytes - Viewed (0) -
src/image/internal/imageutil/gen.go
// // r := (yy1 + 91881*cr1) >> 16 // if r < 0 { // r = 0 // } else if r > 0xff { // r = ^int32(0) // } // // but uses fewer branches and is faster. // Note that the uint8 type conversion in the return // statement will convert ^int32(0) to 0xff. // The code below to compute g and b uses a similar pattern. r := yy1 + 91881*cr1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 4.3K bytes - Viewed (0)