Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 32 for Dw (0.02 sec)

  1. staging/src/k8s.io/apiserver/pkg/registry/generic/registry/decorated_watcher_test.go

    	}()
    
    	expectErrorEvent(t, dw) // expect error is plumbed and doesn't force close the watcher
    	expectPodEvent(t, dw, watch.Added)
    	expectErrorEvent(t, dw) // expect error is plumbed and doesn't force close the watcher
    	expectPodEvent(t, dw, watch.Modified)
    	expectErrorEvent(t, dw) // expect error is plumbed and doesn't force close the watcher
    	expectPodEvent(t, dw, watch.Deleted)
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 02 19:25:31 UTC 2021
    - 3.4K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/ssa/stmtlines_test.go

    	if err != nil {
    		t.Fatalf("go build: %v\n%s", err, out)
    	}
    
    	lines := map[Line]bool{}
    	dw, err := open(dir + "/test.exe")
    	must(err)
    	rdr := dw.Reader()
    	rdr.Seek(0)
    	for {
    		e, err := rdr.Next()
    		must(err)
    		if e == nil {
    			break
    		}
    		if e.Tag != dwarf.TagCompileUnit {
    			continue
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 03 17:05:14 UTC 2023
    - 3.5K bytes
    - Viewed (0)
  3. src/internal/profile/graph.go

    	seenNode := make(map[*Node]bool)
    	seenEdge := make(map[nodePair]bool)
    	for _, sample := range prof.Sample {
    		var w, dw int64
    		w = o.SampleValue(sample.Value)
    		if o.SampleMeanDivisor != nil {
    			dw = o.SampleMeanDivisor(sample.Value)
    		}
    		if dw == 0 && w == 0 {
    			continue
    		}
    		for k := range seenNode {
    			delete(seenNode, k)
    		}
    		for k := range seenEdge {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 05 20:59:15 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  4. src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go

    	seenNode := make(map[*Node]bool)
    	seenEdge := make(map[nodePair]bool)
    	for _, sample := range prof.Sample {
    		var w, dw int64
    		w = o.SampleValue(sample.Value)
    		if o.SampleMeanDivisor != nil {
    			dw = o.SampleMeanDivisor(sample.Value)
    		}
    		if dw == 0 && w == 0 {
    			continue
    		}
    		for k := range seenNode {
    			delete(seenNode, k)
    		}
    		for k := range seenEdge {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 31K bytes
    - Viewed (0)
  5. src/compress/flate/deflate.go

    // Otherwise the error returned will be non-nil.
    func NewWriter(w io.Writer, level int) (*Writer, error) {
    	var dw Writer
    	if err := dw.d.init(w, level); err != nil {
    		return nil, err
    	}
    	return &dw, nil
    }
    
    // NewWriterDict is like [NewWriter] but initializes the new
    // [Writer] with a preset dictionary. The returned [Writer] behaves
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 26 13:32:40 UTC 2024
    - 20.3K bytes
    - Viewed (0)
  6. src/time/mono_test.go

    	sub := func(txs, tys string, tx, txw, ty, tyw Time, d, dw Duration) {
    		check := func(expr string, d, want Duration) {
    			if d != want {
    				t.Errorf("%s = %v, want %v", expr, d, want)
    			}
    		}
    		check(txs+".Sub("+tys+")", tx.Sub(ty), d)
    		check(txs+"w.Sub("+tys+")", txw.Sub(ty), dw)
    		check(txs+".Sub("+tys+"w)", tx.Sub(tyw), dw)
    		check(txs+"w.Sub("+tys+"w)", txw.Sub(tyw), dw)
    	}
    	sub("t1", "t1", t1, t1w, t1, t1w, 0, 0)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 19 17:10:49 UTC 2022
    - 8.3K bytes
    - Viewed (0)
  7. src/cmd/link/internal/ld/dwarf_test.go

    	}
    	defer exe.Close()
    	dw, err := exe.DWARF()
    	if err != nil {
    		t.Fatalf("error parsing DWARF: %v", err)
    	}
    	rdr := dw.Reader()
    	for {
    		e, err := rdr.Next()
    		if err != nil {
    			t.Fatalf("error reading DWARF: %v", err)
    		}
    		if e == nil {
    			break
    		}
    		if e.Tag != dwarf.TagCompileUnit {
    			continue
    		}
    		lnrdr, err := dw.LineReader(e)
    		if err != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 08 01:38:11 UTC 2024
    - 48.6K bytes
    - Viewed (0)
  8. tensorflow/c/eager/gradient_checker.h

    /* Returns numerical grad inside `dtheta_approx` given `forward` model and
     * parameter specified by `input_index`.
     *
     * I.e. if y = <output of the forward model> and w = inputs[input_index],
     * this will calculate dy/dw numerically.
     *
     * `use_function` indicates whether to use graph mode(true) or eager(false).
     *
     * `numerical_grad` is the pointer to the AbstractTensorHandle* which will
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri Dec 11 02:34:32 UTC 2020
    - 1.8K bytes
    - Viewed (0)
  9. src/cmd/link/internal/dwtest/dwtest.go

    func (ex *Examiner) FileRef(dw *dwarf.Data, dieIdx int, fileRef int64) (string, error) {
    
    	// Find the parent compilation unit DIE for the specified DIE.
    	cuDie := ex.ParentCU(dieIdx)
    	if cuDie == nil {
    		return "", fmt.Errorf("no parent CU DIE for DIE with idx %d?", dieIdx)
    	}
    	// Construct a line reader and then use it to get the file string.
    	lr, lrerr := dw.LineReader(cuDie)
    	if lrerr != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 02 15:22:18 UTC 2024
    - 5.4K bytes
    - Viewed (0)
  10. src/net/lookup_windows.go

    	}
    	rec := make([]*syscall.DNSRecord, 0, 10)
    	for p := r; p != nil; p = p.Next {
    		// in case of a local machine, DNS records are returned with DNSREC_QUESTION flag instead of DNS_ANSWER
    		if p.Dw&dnsSectionMask != syscall.DnsSectionAnswer && p.Dw&dnsSectionMask != syscall.DnsSectionQuestion {
    			continue
    		}
    		if p.Type != dnstype {
    			continue
    		}
    		if !syscall.DnsNameCompare(cname, p.Name) {
    			continue
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sun Apr 14 18:23:45 UTC 2024
    - 14.2K bytes
    - Viewed (0)
Back to top