Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 34 for startCond (0.11 sec)

  1. src/go/printer/gobuild.go

    	var after []byte
    	start := insert
    	for _, end := range toDelete {
    		if end < start {
    			continue
    		}
    		after = appendLines(after, p.output[start:end])
    		start = end + len(p.lineAt(end))
    	}
    	after = appendLines(after, p.output[start:])
    	if n := len(after); n >= 2 && isNL(after[n-1]) && isNL(after[n-2]) {
    		after = after[:n-1]
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  2. src/internal/trace/summary_test.go

    		t.Error("missing GC mark assist time")
    	}
    }
    
    func TestSummarizeGoroutinesRegionsTrace(t *testing.T) {
    	summaries := summarizeTraceTest(t, "testdata/tests/go122-annotations.test").Goroutines
    	type region struct {
    		startKind trace.EventKind
    		endKind   trace.EventKind
    	}
    	wantRegions := map[string]region{
    		// N.B. "pre-existing region" never even makes it into the trace.
    		//
    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/vendor/golang.org/x/text/unicode/norm/composition.go

    		end := start + rb.rune[i].size
    		rb.out = append(rb.out, rb.byte[start:end]...)
    	}
    	return true
    }
    
    // flush appends the normalized segment to out and resets rb.
    func (rb *reorderBuffer) flush(out []byte) []byte {
    	for i := 0; i < rb.nrune; i++ {
    		start := rb.rune[i].pos
    		end := start + rb.rune[i].size
    		out = append(out, rb.byte[start:end]...)
    	}
    	rb.reset()
    	return out
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jan 24 13:01:26 UTC 2024
    - 14.1K bytes
    - Viewed (0)
  4. src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go

    	}
    	t, _, _ := tileForIndex(h, index)
    	return t
    }
    
    // tileForIndex returns the tile of height h ≥ 1
    // storing the given hash index, which can be
    // reconstructed using tileHash(data[start:end]).
    func tileForIndex(h int, index int64) (t Tile, start, end int) {
    	level, n := SplitStoredHashIndex(index)
    	t.H = h
    	t.L = level / h
    	level -= t.L * h // now level within tile
    	t.N = n << uint(level) >> uint(t.H)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 02:38:00 UTC 2024
    - 13K bytes
    - Viewed (0)
  5. src/vendor/golang.org/x/text/unicode/norm/composition.go

    		end := start + rb.rune[i].size
    		rb.out = append(rb.out, rb.byte[start:end]...)
    	}
    	return true
    }
    
    // flush appends the normalized segment to out and resets rb.
    func (rb *reorderBuffer) flush(out []byte) []byte {
    	for i := 0; i < rb.nrune; i++ {
    		start := rb.rune[i].pos
    		end := start + rb.rune[i].size
    		out = append(out, rb.byte[start:end]...)
    	}
    	rb.reset()
    	return out
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 26 19:27:51 UTC 2019
    - 14.1K bytes
    - Viewed (0)
  6. src/html/template/url.go

    	start := left
    	for start < right && isHTMLSpace(s[start]) {
    		start++
    	}
    	end := right
    	for i := start; i < right; i++ {
    		if isHTMLSpace(s[i]) {
    			end = i
    			break
    		}
    	}
    	if url := s[start:end]; isSafeURL(url) {
    		// If image metadata is only spaces or alnums then
    		// we don't need to URL normalize it.
    		metadataOk := true
    		for i := end; i < right; i++ {
    			if !isHTMLSpaceOrASCIIAlnum(s[i]) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Sep 06 15:48:16 UTC 2022
    - 6.6K bytes
    - Viewed (0)
  7. tensorflow/cc/gradients/linalg_grad.cc

    //
    // For a given subscript, returns a tuple (start, end) denoting the start
    // axis index and the (negative) end axis index respectively. For any input
    // Tensor `x` described by the subscript, `x[start:end]` would be the slice
    // represented by the ellipsis. E.g. For `ab...cd` returns `[1, -2]`.
    //
    // If ellipsis is not present in `subscripts`, returns `(0, 0)`.
    //
    // Parameters:
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Mon Mar 07 23:11:54 UTC 2022
    - 20.4K bytes
    - Viewed (0)
  8. src/unicode/utf8/utf8.go

    	lim := end - UTFMax
    	if lim < 0 {
    		lim = 0
    	}
    	for start--; start >= lim; start-- {
    		if RuneStart(p[start]) {
    			break
    		}
    	}
    	if start < 0 {
    		start = 0
    	}
    	r, size = DecodeRune(p[start:end])
    	if start+size != end {
    		return RuneError, 1
    	}
    	return r, size
    }
    
    // DecodeLastRuneInString is like [DecodeLastRune] but its input is a string. If
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Mar 08 02:00:36 UTC 2024
    - 16.4K bytes
    - Viewed (0)
  9. src/cmd/internal/archive/archive.go

    		}
    		name := trimSpace(data[0:16])
    		var err error
    		get := func(start, end, base, bitsize int) int64 {
    			if err != nil {
    				return 0
    			}
    			var v int64
    			v, err = strconv.ParseInt(trimSpace(data[start:end]), base, bitsize)
    			return v
    		}
    		size := get(48, 58, 10, 64)
    		var (
    			mtime    int64
    			uid, gid int
    			mode     os.FileMode
    		)
    		if verbose {
    			mtime = get(16, 28, 10, 64)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Aug 15 15:39:57 UTC 2023
    - 12.1K bytes
    - Viewed (0)
  10. src/debug/pe/file.go

    	if start < 0 || start >= len(section) {
    		return "", false
    	}
    
    	for end := start; end < len(section); end++ {
    		if section[end] == 0 {
    			return string(section[start:end]), true
    		}
    	}
    	return "", false
    }
    
    // Section returns the first section with the given name, or nil if no such
    // section exists.
    func (f *File) Section(name string) *Section {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Oct 18 19:33:30 UTC 2023
    - 17.2K bytes
    - Viewed (0)
Back to top