Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 97 for unambiguous (0.28 sec)

  1. doc/go_spec.html

    func()(x)        // function signature func() x
    (func())(x)      // x is converted to func()
    (func() int)(x)  // x is converted to func() int
    func() int(x)    // x is converted to func() int (unambiguous)
    </pre>
    
    <p>
    A <a href="#Constants">constant</a> value <code>x</code> can be converted to
    type <code>T</code> if <code>x</code> is <a href="#Representability">representable</a>
    by a value of <code>T</code>.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 21:07:21 UTC 2024
    - 281.5K bytes
    - Viewed (1)
  2. src/internal/trace/summary_test.go

    			},
    			goroutines: []trace.GoID{7},
    		},
    	}
    	for id, summary := range summaries {
    		want, ok := wantTasks[id]
    		if !ok {
    			continue
    		}
    		if id != summary.ID {
    			t.Errorf("ambiguous task %d (or %d?): field likely set incorrectly", id, summary.ID)
    		}
    
    		// Check parent.
    		if want.parent != nil {
    			if summary.Parent == nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 13.4K bytes
    - Viewed (0)
  3. src/cmd/go/internal/modfetch/codehost/git.go

    		// Check whether rev is prefix of known ref hash.
    		for k, h := range refs {
    			if strings.HasPrefix(h, prefix) {
    				if hash != "" && hash != h {
    					// Hash is an ambiguous hash prefix.
    					// More information will not change that.
    					return nil, fmt.Errorf("ambiguous revision %s", rev)
    				}
    				if ref == "" || ref > k { // Break ties deterministically when multiple refs point at same hash.
    					ref = k
    				}
    				rev = h
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 11 22:10:38 UTC 2024
    - 27.4K bytes
    - Viewed (0)
  4. pkg/api/pod/warnings.go

    						// If the HostPorts are the same and either HostIP is not specified while the other is not, the behavior is undefined.
    						warnings = append(warnings, fmt.Sprintf("%s: dangerously ambiguous port definition with %s", fldPath.Child("ports").Index(i), other.field))
    					}
    				}
    				allPorts[k] = append(allPorts[k], portBlock{field: fldPath.Child("ports").Index(i), port: port})
    			} else {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Mar 07 17:51:48 UTC 2024
    - 16.6K bytes
    - Viewed (0)
  5. cmd/sts-handlers.go

    		return
    	}
    
    	// We have to establish a TLS connection and the
    	// client must provide exactly one client certificate.
    	// Otherwise, we don't have a certificate to verify or
    	// the policy lookup would ambiguous.
    	if r.TLS == nil {
    		writeSTSErrorResponse(ctx, w, ErrSTSInsecureConnection, errors.New("No TLS connection attempt"))
    		return
    	}
    
    	// A client may send a certificate chain such that we end up
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Tue Jun 11 03:13:30 UTC 2024
    - 33.9K bytes
    - Viewed (0)
  6. src/log/slog/doc.go

    that writes structured records in text form to standard error:
    
    	logger := slog.New(slog.NewTextHandler(os.Stderr, nil))
    
    [TextHandler] output is a sequence of key=value pairs, easily and unambiguously
    parsed by machine. This statement:
    
    	logger.Info("hello", "count", 3)
    
    produces this output:
    
    	time=2022-11-08T15:28:26.000-05:00 level=INFO msg=hello count=3
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 15 14:35:48 UTC 2024
    - 12.3K bytes
    - Viewed (0)
  7. src/cmd/go/internal/modload/import.go

    	return e.importPath
    }
    
    func (e *AmbiguousImportError) Error() string {
    	locType := "modules"
    	if len(e.Modules) == 0 {
    		locType = "directories"
    	}
    
    	var buf strings.Builder
    	fmt.Fprintf(&buf, "ambiguous import: found package %s in multiple %s:", e.importPath, locType)
    
    	for i, dir := range e.Dirs {
    		buf.WriteString("\n\t")
    		if i < len(e.Modules) {
    			m := e.Modules[i]
    			buf.WriteString(m.Path)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 07 15:21:14 UTC 2024
    - 27.7K bytes
    - Viewed (0)
  8. src/cmd/internal/obj/util.go

    	sc := armCondCode[(s&C_SCOND)^C_SCOND_XOR]
    	if s&C_SBIT != 0 {
    		sc += ".S"
    	}
    	if s&C_PBIT != 0 {
    		sc += ".P"
    	}
    	if s&C_WBIT != 0 {
    		sc += ".W"
    	}
    	if s&C_UBIT != 0 { /* ambiguous with FBIT */
    		sc += ".U"
    	}
    	return sc
    }
    
    func (p *Prog) String() string {
    	if p == nil {
    		return "<nil Prog>"
    	}
    	if p.Ctxt == nil {
    		return "<Prog without ctxt>"
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 15:44:14 UTC 2024
    - 17.5K bytes
    - Viewed (0)
  9. okhttp/src/main/kotlin/okhttp3/OkHttpClient.kt

        fun addInterceptor(interceptor: Interceptor) =
          apply {
            interceptors += interceptor
          }
    
        @JvmName("-addInterceptor") // Prefix with '-' to prevent ambiguous overloads from Java.
        inline fun addInterceptor(crossinline block: (chain: Interceptor.Chain) -> Response) =
          addInterceptor(Interceptor { chain -> block(chain) })
    
        /**
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Sat Apr 06 04:21:33 UTC 2024
    - 52K bytes
    - Viewed (0)
  10. src/go/doc/example.go

    	}
    	return
    }
    
    // classifyExamples classifies examples and assigns them to the Examples field
    // of the relevant Func, Type, or Package that the example is associated with.
    //
    // The classification process is ambiguous in some cases:
    //
    //   - ExampleFoo_Bar matches a type named Foo_Bar
    //     or a method named Foo.Bar.
    //   - ExampleFoo_bar matches a type named Foo_bar
    //     or Foo (with a "bar" suffix).
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 21.4K bytes
    - Viewed (0)
Back to top