Search Options

Results per page
Sort
Preferred Languages
Advance

Results 471 - 480 of 1,596 for var0 (0.04 sec)

  1. src/main/webapp/WEB-INF/view/admin/accesstoken/admin_accesstoken.jsp

                                                </tr>
                                                </thead>
                                                <tbody>
                                                <c:forEach var="data" varStatus="s"
                                                           items="${accessTokenItems}">
                                                    <tr
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Wed Feb 12 20:25:27 UTC 2020
    - 4.7K bytes
    - Viewed (0)
  2. cmd/data-usage-cache_test.go

    				"BETWEEN_64_KB_AND_256_KB": 1,
    				"BETWEEN_1024B_AND_1_MB":   2,
    				"BETWEEN_10_MB_AND_64_MB":  1,
    			},
    		},
    	}
    	for i, test := range tests {
    		t.Run(fmt.Sprintf("Test-%d", i), func(t *testing.T) {
    			var h sizeHistogram
    			for _, sz := range test.sizes {
    				h.add(sz)
    			}
    			got := h.toMap()
    			exp := test.want
    			// what is in exp is in got
    			for k := range exp {
    				if exp[k] != got[k] {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Jan 13 07:51:08 UTC 2024
    - 2.6K bytes
    - Viewed (0)
  3. internal/grid/handlers_string.go

    package grid
    
    import "strconv"
    
    func _() {
    	// An "invalid array index" compiler error signifies that the constant values have changed.
    	// Re-run the stringer command to generate them again.
    	var x [1]struct{}
    	_ = x[handlerInvalid-0]
    	_ = x[HandlerLockLock-1]
    	_ = x[HandlerLockRLock-2]
    	_ = x[HandlerLockUnlock-3]
    	_ = x[HandlerLockRUnlock-4]
    	_ = x[HandlerLockRefresh-5]
    	_ = x[HandlerLockForceUnlock-6]
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 09 16:58:30 UTC 2024
    - 4.4K bytes
    - Viewed (0)
  4. cmd/iam-object-store.go

    			if err == errConfigNotFound {
    				return errNoSuchPolicy
    			}
    			retries--
    			if retries <= 0 {
    				return err
    			}
    			time.Sleep(500 * time.Millisecond)
    			goto retry
    		}
    
    		var p PolicyDoc
    		err = p.parseJSON(data)
    		if err != nil {
    			return err
    		}
    
    		if p.Version == 0 {
    			// This means that policy was in the old version (without any
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Oct 10 23:40:37 UTC 2024
    - 26.6K bytes
    - Viewed (0)
  5. istioctl/pkg/describe/describe.go

    )
    
    func printSpaces(numSpaces int) string {
    	return strings.Repeat(" ", numSpaces)
    }
    
    var (
    	// Ignore unmeshed pods.  This makes it easy to suppress warnings about kube-system etc
    	ignoreUnmeshed = false
    
    	describeNamespace string
    )
    
    func podDescribeCmd(ctx cli.Context) *cobra.Command {
    	var opts clioptions.ControlPlaneOptions
    	cmd := &cobra.Command{
    		Use:     "pod <pod>",
    		Aliases: []string{"po"},
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Oct 24 17:36:49 UTC 2024
    - 50.6K bytes
    - Viewed (0)
  6. doc/go_spec.html

    </p>
    
    <pre class="ebnf">
    VarDecl     = "var" ( VarSpec | "(" { VarSpec ";" } ")" ) .
    VarSpec     = IdentifierList ( Type [ "=" ExpressionList ] | "=" ExpressionList ) .
    </pre>
    
    <pre>
    var i int
    var U, V, W float64
    var k = 0
    var x, y float32 = -1, -2
    var (
    	i       int
    	u, v, s = 2.0, 3.0, "bar"
    )
    var re, im = complexSqrt(-1)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Oct 02 00:58:01 UTC 2024
    - 282.5K bytes
    - Viewed (0)
  7. cmd/iam.go

    	// the LDAP server.
    	var dnValidator func(*libldap.Conn, string) (*ldap.DNSearchResult, bool, error) = sys.LDAPConfig.GetValidatedUserDN
    	if isGroup {
    		dnValidator = sys.LDAPConfig.GetValidatedGroupDN
    	}
    
    	// map of normalized DN keys to original keys.
    	normalizedDNKeysMap := make(map[string][]string)
    	var collectedErrors []error
    	var skipped []string
    	for k := range policyMap {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 29 16:01:48 UTC 2024
    - 74.6K bytes
    - Viewed (0)
  8. docs/debugging/pprofgoparser/main.go

    package main
    
    import (
    	"bufio"
    	"bytes"
    	"flag"
    	"fmt"
    	"log"
    	"math"
    	"os"
    	"path"
    	"regexp"
    	"strconv"
    	"strings"
    	"time"
    )
    
    var (
    	goroutinesRE, searchRE *regexp.Regexp
    
    	// User input flags
    	searchText           string
    	goTime, less, margin time.Duration
    )
    
    func init() {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Mar 06 11:43:16 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  9. internal/s3select/jstream/scanner_test.go

    import (
    	"bufio"
    	"bytes"
    	"fmt"
    	"io"
    	"sync/atomic"
    	"testing"
    )
    
    var (
    	smallInput  = make([]byte, 1024*12)       // 12K
    	mediumInput = make([]byte, 1024*1024*12)  // 12MB
    	largeInput  = make([]byte, 1024*1024*128) // 128MB
    )
    
    func TestScanner(t *testing.T) {
    	data := []byte("abcdefghijklmnopqrstuvwxyz0123456789")
    
    	var i int
    	r := bytes.NewReader(data)
    	scanner := newScanner(r)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 23 19:35:41 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  10. tests/joins_table_test.go

    		t.Fatalf("Should found one address")
    	}
    
    	var addresses2 []Address
    	if err := DB.Model(&person).Association("Addresses").Find(&addresses2); err != nil || len(addresses2) != 1 {
    		t.Fatalf("Failed to find address, got error %v, length: %v", err, len(addresses2))
    	}
    
    	if DB.Model(&person).Association("Addresses").Count() != 1 {
    		t.Fatalf("Should found one address")
    	}
    
    	var addresses3 []Address
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Sep 10 13:46:18 UTC 2020
    - 3.5K bytes
    - Viewed (1)
Back to top