Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 65 for stks (0.73 sec)

  1. src/runtime/metrics_test.go

    					}
    				}
    				stks = append(stks, have)
    				for i, stk := range acceptStacks {
    					if slices.Equal(have, stk) {
    						values[i][0] += s.Value[0]
    						values[i][1] += s.Value[1]
    					}
    				}
    			}
    			for i, stk := range acceptStacks {
    				n += values[i][0]
    				value += values[i][1]
    				t.Logf("stack %v has samples totaling n=%d value=%d", stk, values[i][0], values[i][1])
    			}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:52:17 UTC 2024
    - 45K bytes
    - Viewed (0)
  2. cmd/sts-handlers.go

    	return nil
    }
    
    // stsAPIHandlers implements and provides http handlers for AWS STS API.
    type stsAPIHandlers struct{}
    
    // registerSTSRouter - registers AWS STS compatible APIs.
    func registerSTSRouter(router *mux.Router) {
    	// Initialize STS.
    	sts := &stsAPIHandlers{}
    
    	// STS Router
    	stsRouter := router.NewRoute().PathPrefix(SlashSeparator).Subrouter()
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Tue Jun 11 03:13:30 UTC 2024
    - 33.9K bytes
    - Viewed (0)
  3. src/encoding/xml/xml.go

    	ok   bool
    }
    
    const (
    	stkStart = iota
    	stkNs
    	stkEOF
    )
    
    func (d *Decoder) push(kind int) *stack {
    	s := d.free
    	if s != nil {
    		d.free = s.next
    	} else {
    		s = new(stack)
    	}
    	s.next = d.stk
    	s.kind = kind
    	d.stk = s
    	return s
    }
    
    func (d *Decoder) pop() *stack {
    	s := d.stk
    	if s != nil {
    		d.stk = s.next
    		s.next = d.free
    		d.free = s
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Mar 08 18:46:41 UTC 2024
    - 47.3K bytes
    - Viewed (0)
  4. src/cmd/go/internal/list/list.go

    		} else if len(stkj) == 0 {
    			return false
    		}
    		pathi, pathj := stki[len(stki)-1], stkj[len(stkj)-1]
    		return pathi < pathj
    	})
    }
    
    // TrackingWriter tracks the last byte written on every write so
    // we can avoid printing a newline if one was already written or
    // if there is no output at all.
    type TrackingWriter struct {
    	w    *bufio.Writer
    	last byte
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 16 16:56:39 UTC 2024
    - 33.3K bytes
    - Viewed (0)
  5. src/runtime/profbuf.go

    		// Only racing against reader, not other writers.
    		count, time := b.takeOverflow()
    		if count > 0 {
    			var stk [1]uintptr
    			stk[0] = uintptr(count)
    			b.write(nil, int64(time), nil, stk[:])
    		}
    	} else if hasOverflow || !b.canWriteRecord(len(stk)) {
    		// Pending overflow without room to write overflow and new records
    		// or no overflow but also no room for new record.
    		b.incrementOverflow(now)
    		b.wakeupExtra()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 19:53:03 UTC 2024
    - 18.2K bytes
    - Viewed (0)
  6. src/runtime/pprof/pprof.go

    	}
    	if p.write != nil {
    		panic("pprof: Add called on built-in Profile " + p.name)
    	}
    
    	stk := make([]uintptr, 32)
    	n := runtime.Callers(skip+1, stk[:])
    	stk = stk[:n]
    	if len(stk) == 0 {
    		// The value for skip is too large, and there's no stack trace to record.
    		stk = []uintptr{abi.FuncPCABIInternal(lostProfileEvent)}
    	}
    
    	p.mu.Lock()
    	defer p.mu.Unlock()
    	if p.m[value] != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:52:17 UTC 2024
    - 30.6K bytes
    - Viewed (0)
  7. src/cmd/go/internal/load/test.go

    			// the cycle as (for example) package p imports package q imports package r
    			// imports package p.
    			stk = append(stk, ptest.ImportPath)
    			slices.Reverse(stk)
    
    			return &PackageError{
    				ImportStack:   stk,
    				Err:           errors.New("import cycle not allowed in test"),
    				IsImportCycle: true,
    			}
    		}
    		for _, dep := range p.Internal.Imports {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 14:01:23 UTC 2024
    - 28.2K bytes
    - Viewed (0)
  8. src/cmd/vendor/rsc.io/markdown/inline.go

    	stackOf := func(c byte) int {
    		return strings.IndexByte(chars, c)
    	}
    
    	trimStack := func() {
    		for i := range stack {
    			stk := &stack[i]
    			for len(*stk) > 0 && (*stk)[len(*stk)-1].i >= len(dst) {
    				*stk = (*stk)[:len(*stk)-1]
    			}
    		}
    	}
    
    Src:
    	for i := 0; i < len(src); i++ {
    		if open, ok := src[i].(*openPlain); ok {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 16:19:04 UTC 2024
    - 21.9K bytes
    - Viewed (0)
  9. src/net/textproto/reader.go

    		if maxMemory < 0 {
    			return m, errMessageTooLarge
    		}
    		if vv == nil && len(strs) > 0 {
    			// More than likely this will be a single-element key.
    			// Most headers aren't multi-valued.
    			// Set the capacity on strs[0] to 1, so any future append
    			// won't extend the slice into the other strings.
    			vv, strs = strs[:1:1], strs[1:]
    			vv[0] = value
    			m[key] = vv
    		} else {
    			m[key] = append(vv, value)
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 19:57:43 UTC 2024
    - 22.1K bytes
    - Viewed (0)
  10. docs/sts/ldap.md

    ### Response Elements
    
    XML response for this API is similar to [AWS STS AssumeRoleWithWebIdentity](https://docs.aws.amazon.com/STS/latest/APIReference/API_AssumeRoleWithWebIdentity.html#API_AssumeRoleWithWebIdentity_ResponseElements)
    
    ### Errors
    
    XML error response for this API is similar to [AWS STS AssumeRoleWithWebIdentity](https://docs.aws.amazon.com/STS/latest/APIReference/API_AssumeRoleWithWebIdentity.html#API_AssumeRoleWithWebIdentity_Errors)
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 18.9K bytes
    - Viewed (0)
Back to top