Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 17 of 17 for cmptype (0.16 sec)

  1. src/go/printer/nodes.go

    // The result is false if x could be a type element OR an ordinary (value) expression.
    func isTypeElem(x ast.Expr) bool {
    	switch x := x.(type) {
    	case *ast.ArrayType, *ast.StructType, *ast.FuncType, *ast.InterfaceType, *ast.MapType, *ast.ChanType:
    		return true
    	case *ast.UnaryExpr:
    		return x.Op == token.TILDE
    	case *ast.BinaryExpr:
    		return isTypeElem(x.X) || isTypeElem(x.Y)
    	case *ast.ParenExpr:
    		return isTypeElem(x.X)
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Oct 17 18:53:17 UTC 2023
    - 52.6K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/syntax/parser.go

    			// the decision towards a type parameter list.
    			if pname, ptype := extractName(x, p.tok == _Comma); pname != nil && (ptype != nil || p.tok != _Rbrack) {
    				// d.Name "[" pname ...
    				// d.Name "[" pname ptype ...
    				// d.Name "[" pname ptype "," ...
    				d.TParamList = p.paramList(pname, ptype, _Rbrack, true) // ptype may be nil
    				d.Alias = p.gotAssign()
    				d.Type = p.typeOrNil()
    			} else {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 62.9K bytes
    - Viewed (0)
  3. src/cmd/cgo/gcc.go

    		// constants to the parameter type, to avoid a type mismatch.
    		ptype := p.rewriteUnsafe(param.Go)
    
    		if !p.needsPointerCheck(f, param.Go, args[i]) || param.BadPointer || p.checkUnsafeStringData(args[i]) {
    			if ptype != param.Go {
    				needsUnsafe = true
    			}
    			fmt.Fprintf(&sb, "var _cgo%d %s = %s; ", i,
    				gofmt(ptype), gofmtPos(arg, origArg.Pos()))
    			continue
    		}
    
    		// Check for &a[i].
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 15:50:06 UTC 2024
    - 97K bytes
    - Viewed (0)
  4. staging/src/k8s.io/api/extensions/v1beta1/types.go

    	// selector is a label query over pods that should match the replicas count. More info: https://kubernetes.io/docs/concepts/overview/working-with-objects/labels/
    	// +optional
    	// +mapType=atomic
    	Selector map[string]string `json:"selector,omitempty" protobuf:"bytes,2,rep,name=selector"`
    
    	// label selector for pods that should match the replicas count. This is a serializated
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Nov 27 20:06:29 UTC 2023
    - 61.3K bytes
    - Viewed (0)
  5. src/cmd/link/internal/ld/dwarf.go

    	for _, typ := range []string{
    		"type:internal/abi.Type",
    		"type:internal/abi.ArrayType",
    		"type:internal/abi.ChanType",
    		"type:internal/abi.FuncType",
    		"type:internal/abi.MapType",
    		"type:internal/abi.PtrType",
    		"type:internal/abi.SliceType",
    		"type:internal/abi.StructType",
    		"type:internal/abi.InterfaceType",
    		"type:internal/abi.ITab",
    		"type:internal/abi.Imethod"} {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 16:25:18 UTC 2024
    - 72.4K bytes
    - Viewed (0)
  6. src/main/webapp/js/jquery-3.6.3.min.js

    ueueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){E.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?E.queue(this[0],t):void 0===n?this:this.each(function(){var e=E.queue(...
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Fri Feb 17 12:13:41 UTC 2023
    - 87.8K bytes
    - Viewed (0)
  7. src/main/webapp/js/admin/jquery-3.6.3.min.js

    ueueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){E.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?E.queue(this[0],t):void 0===n?this:this.each(function(){var e=E.queue(...
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Fri Feb 17 12:13:41 UTC 2023
    - 87.8K bytes
    - Viewed (0)
Back to top