Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for cfml (0.04 sec)

  1. cmd/common-main.go

    	ctxt.ConsoleAddr = ctx.GlobalString("console-address")
    	if ctxt.ConsoleAddr == "" {
    		ctxt.ConsoleAddr = ctx.String("console-address")
    	}
    
    	if cxml := ctx.String("crossdomain-xml"); cxml != "" {
    		buf, err := os.ReadFile(cxml)
    		if err != nil {
    			return err
    		}
    		ctxt.CrossDomainXML = string(buf)
    	}
    
    	// Check "no-compat" flag from command line argument.
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu May 30 11:58:12 UTC 2024
    - 31.5K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     * conventional bounded queues, which either block or reject new elements when full.
     *
     * <p>This implementation is based on the <a
     * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
     * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
     * as the traditional heap data structure used in {@link PriorityQueue}.
     *
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 34K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     * conventional bounded queues, which either block or reject new elements when full.
     *
     * <p>This implementation is based on the <a
     * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
     * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
     * as the traditional heap data structure used in {@link PriorityQueue}.
     *
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 34K bytes
    - Viewed (1)
  4. src/cmd/vendor/github.com/google/pprof/internal/report/report.go

    		// Print outgoing edges.
    		for _, out := range n.Out.Sort() {
    			c, _ := measurement.Scale(out.Weight, o.SampleUnit, o.OutputUnit)
    			callee := out.Dest
    			fmt.Fprintln(w, "cfl="+callgrindName(files, callee.Info.File))
    			fmt.Fprintln(w, "cfn="+callgrindName(names, nodeNames[callee]))
    			// pprof doesn't have a flat weight for a call, leave as 0.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 37.5K bytes
    - Viewed (0)
Back to top