Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 484 for slices (0.06 sec)

  1. src/cmd/asm/internal/lex/input.go

    // Copyright 2015 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package lex
    
    import (
    	"fmt"
    	"os"
    	"path/filepath"
    	"slices"
    	"strconv"
    	"strings"
    	"text/scanner"
    
    	"cmd/asm/internal/flags"
    	"cmd/internal/objabi"
    	"cmd/internal/src"
    )
    
    // Input is the main input: a stack of readers and some macro definitions.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 06 13:17:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  2. src/builtin/builtin.go

    // it has sufficient capacity, the destination is resliced to accommodate the
    // new elements. If it does not, a new underlying array will be allocated.
    // Append returns the updated slice. It is therefore necessary to store the
    // result of append, often in the variable holding the slice itself:
    //
    //	slice = append(slice, elem1, elem2)
    //	slice = append(slice, anotherSlice...)
    //
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Apr 11 20:22:45 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  3. src/archive/tar/tar_test.go

    			continue
    		}
    		gotAligned := alignSparseEntries(append([]sparseEntry{}, v.in...), v.size)
    		if !slices.Equal(gotAligned, v.wantAligned) {
    			t.Errorf("test %d, alignSparseEntries():\ngot  %v\nwant %v", i, gotAligned, v.wantAligned)
    		}
    		gotInverted := invertSparseEntries(append([]sparseEntry{}, v.in...), v.size)
    		if !slices.Equal(gotInverted, v.wantInverted) {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Jul 25 00:25:45 UTC 2024
    - 23.9K bytes
    - Viewed (0)
  4. istioctl/pkg/describe/describe.go

    		if extendFQDN(fqdn) == svcHost {
    			if dest.Destination.Subset != "" {
    				if slices.Contains(nonmatchingSubsets, dest.Destination.Subset) {
    					mismatchNotes = append(mismatchNotes, fmt.Sprintf("Route to non-matching subset %s for (%s)",
    						dest.Destination.Subset,
    						renderMatches(route.Match)))
    					continue
    				}
    				if !slices.Contains(matchingSubsets, dest.Destination.Subset) {
    					if dr == nil {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Oct 24 17:36:49 UTC 2024
    - 50.6K bytes
    - Viewed (0)
  5. istioctl/pkg/validate/validate.go

    	"istio.io/istio/pkg/config/schema/gvk"
    	"istio.io/istio/pkg/config/schema/resource"
    	"istio.io/istio/pkg/config/validation"
    	"istio.io/istio/pkg/kube/labels"
    	"istio.io/istio/pkg/log"
    	"istio.io/istio/pkg/slices"
    	"istio.io/istio/pkg/url"
    )
    
    var (
    	errMissingFilename = errors.New(`error: you must specify resources by --filename.
    Example resource specifications include:
       '-f rsrc.yaml'
       '--filename=rsrc.json'`)
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Aug 15 22:27:47 UTC 2024
    - 14.3K bytes
    - Viewed (0)
  6. src/bytes/compare_test.go

    			if cmp != -1 {
    				t.Errorf(`CompareBbigger(%d,%d) = %d`, len, k, cmp)
    			}
    			b[k] = a[k]
    		}
    	}
    }
    
    func TestEndianBaseCompare(t *testing.T) {
    	// This test compares byte slices that are almost identical, except one
    	// difference that for some j, a[j]>b[j] and a[j+1]<b[j+1]. If the implementation
    	// compares large chunks with wrong endianness, it gets wrong result.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Jul 13 23:11:42 UTC 2023
    - 6.8K bytes
    - Viewed (0)
  7. src/bytes/example_test.go

    		// a equal b
    	}
    	if !bytes.Equal(a, b) {
    		// a not equal b
    	}
    }
    
    func ExampleCompare_search() {
    	// Binary search to find a matching byte slice.
    	var needle []byte
    	var haystack [][]byte // Assume sorted
    	_, found := slices.BinarySearchFunc(haystack, needle, bytes.Compare)
    	if found {
    		// Found it!
    	}
    }
    
    func ExampleContains() {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Aug 07 17:22:36 UTC 2024
    - 14.9K bytes
    - Viewed (0)
  8. cmd/metrics-v3-types.go

    	"fmt"
    	"strings"
    	"sync"
    
    	"github.com/minio/minio-go/v7/pkg/set"
    	"github.com/minio/minio/internal/logger"
    	"github.com/pkg/errors"
    	"github.com/prometheus/client_golang/prometheus"
    	"golang.org/x/exp/slices"
    )
    
    type collectorPath string
    
    // metricPrefix converts a collector path to a metric name prefix. The path is
    // converted to snake-case (by replaced '/' and '-' with '_') and prefixed with
    // `minio_`.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jul 30 22:28:46 UTC 2024
    - 15.6K bytes
    - Viewed (0)
  9. istioctl/pkg/tag/tag.go

    	"istio.io/istio/pkg/config/analysis/diag"
    	"istio.io/istio/pkg/config/analysis/local"
    	"istio.io/istio/pkg/config/resource"
    	"istio.io/istio/pkg/kube"
    	"istio.io/istio/pkg/maps"
    	"istio.io/istio/pkg/slices"
    )
    
    const (
    
    	// help strings and long formatted user outputs
    	skipConfirmationFlagHelpStr = `The skipConfirmation determines whether the user is prompted for confirmation.
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Jul 22 15:40:30 UTC 2024
    - 16.5K bytes
    - Viewed (0)
  10. cmd/endpoint.go

    					Host:   ep.Host,
    				}
    				node.GridHost = ep.GridHost()
    			}
    			if !slices.Contains(node.Pools, ep.PoolIdx) {
    				node.Pools = append(node.Pools, ep.PoolIdx)
    			}
    			nodesMap[ep.Host] = node
    		}
    	}
    	nodes = make([]Node, 0, len(nodesMap))
    	for _, v := range nodesMap {
    		nodes = append(nodes, v)
    	}
    	sort.Slice(nodes, func(i, j int) bool {
    		return nodes[i].Host < nodes[j].Host
    	})
    	return
    }
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jun 21 22:22:24 UTC 2024
    - 34.2K bytes
    - Viewed (0)
Back to top