Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 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 Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Sep 24 21:50:11 UTC 2024
    - 31.7K 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: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K 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: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
Back to top