- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 86 for Cortez (0.2 sec)
-
android/guava/src/com/google/common/collect/Ordering.java
checkNonnegative(k, "k"); if (k == 0 || !iterator.hasNext()) { return Collections.emptyList(); } else if (k >= Integer.MAX_VALUE / 2) { // k is really large; just do a straightforward sorted-copy-and-sublist ArrayList<E> list = Lists.newArrayList(iterator); Collections.sort(list, this); if (list.size() > k) { list.subList(k, list.size()).clear(); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
istioctl/pkg/writer/pilot/status.go
} return nil } func (s *XdsStatusWriter) setupStatusPrint(drs map[string]*discovery.DiscoveryResponse) (*tabwriter.Writer, []*xdsWriterStatus, error) { // Gather the statuses before printing so they may be sorted var fullStatus []*xdsWriterStatus mappedResp := map[string]string{} w := new(tabwriter.Writer).Init(s.Writer, 0, 8, 5, ' ', 0) _, _ = fmt.Fprintln(w, "NAME\tCLUSTER\tCDS\tLDS\tEDS\tRDS\tECDS\tISTIOD\tVERSION")
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Fri Mar 15 04:16:55 GMT 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
* // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. * * @throws IllegalArgumentException if {@code k < 0} * @since 33.2.0 (available since 22.0 in guava-jre) */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
docs/de/docs/python-types.md
``` Dieses Programm gibt aus: ``` John Doe ``` Die Funktion macht Folgendes: * Nimmt einen `first_name` und `last_name`. * Schreibt den ersten Buchstaben eines jeden Wortes groß, mithilfe von `title()`. * <abbr title="Füge zu einer Einheit zusammen, eins nach dem anderen.">Verkettet</abbr> sie mit einem Leerzeichen in der Mitte. ```Python hl_lines="2"
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Sat Mar 30 20:29:25 GMT 2024 - 19.3K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
return (count >= setSizes[0] && count <= setSizes[len(setSizes)-1]) } func commonSetDriveCount(divisibleSize uint64, setCounts []uint64) (setSize uint64) { // prefers setCounts to be sorted for optimal behavior. if divisibleSize < setCounts[len(setCounts)-1] { return divisibleSize } // Figure out largest value of total_drives_in_erasure_set which results
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedMultiset.java
import com.google.common.annotations.VisibleForTesting; import com.google.common.primitives.Ints; import java.util.Comparator; import javax.annotation.CheckForNull; /** * An immutable sorted multiset with one or more distinct elements. * * @author Louis Wasserman */ @SuppressWarnings("serial") // uses writeReplace, not default serialization @GwtIncompatible @ElementTypesAreNonnullByDefault
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 4.3K bytes - Viewed (0) -
cmd/metacache-walk.go
DiskID string } // supported FS for Nlink optimization in readdir. const ( xfs = "XFS" ext4 = "EXT4" ) // WalkDir will traverse a directory and return all entries found. // On success a sorted meta cache stream will be returned. // Metadata has data stripped, if any. func (s *xlStorage) WalkDir(ctx context.Context, opts WalkDirOptions, wr io.Writer) (err error) { legacyFS := !(s.fsType == xfs || s.fsType == ext4)
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 15 08:25:46 GMT 2024 - 12.4K bytes - Viewed (0) -
internal/logger/logger.go
errorFmtFunc = f } // uniq swaps away duplicate elements in data, returning the size of the // unique set. data is expected to be pre-sorted, and the resulting set in // the range [0:size] will remain in sorted order. Uniq, following a // sort.Sort call, can be used to prepare arbitrary inputs for use as sets. func uniq(data sort.Interface) (size int) { p, l := 0, data.Len() if l <= 1 {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat May 04 00:17:57 GMT 2024 - 12.4K bytes - Viewed (0) -
istioctl/pkg/internaldebug/internal-debug.go
Namespace string InternalDebugAllIstiod bool } func (s *DebugWriter) PrintAll(drs map[string]*discovery.DiscoveryResponse) error { // Gather the statuses before printing so they may be sorted mappedResp := map[string]string{} for id, dr := range drs { for _, resource := range dr.Resources { if s.InternalDebugAllIstiod { mappedResp[id] = string(resource.Value) + "\n" } else {
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Fri Mar 15 04:16:55 GMT 2024 - 6.9K bytes - Viewed (0) -
operator/cmd/mesh/manifest-generate.go
} if err := RenderToDir(manifests, mgArgs.OutFilename, args.DryRun, l); err != nil { return err } } return nil } // orderedManifests generates a list of manifests from the given map sorted by the default object order // This allows func orderedManifests(mm name.ManifestMap) ([]string, error) { var rawOutput []string var output []string for _, mfs := range mm {
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Fri Mar 15 01:18:49 GMT 2024 - 8.5K bytes - Viewed (0)