- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for cfml (0.12 sec)
-
cmd/crossdomain-xml-handler.go
return http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) { cxml := crossDomainXML if globalServerCtxt.CrossDomainXML != "" { cxml = globalServerCtxt.CrossDomainXML } // Look for 'crossdomain.xml' in the incoming request. if r.URL.Path == crossDomainXMLEntity { // Write the standard cross domain policy xml. w.Write([]byte(cxml)) // Request completed, no need to serve to other handlers. return }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Mar 18 06:42:40 UTC 2024 - 2.2K bytes - Viewed (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
</mime-type> <mime-type type="chemical/x-cmdf"> <glob pattern="*.cmdf"/> </mime-type> <mime-type type="chemical/x-cml"> <glob pattern="*.cml"/> </mime-type> <mime-type type="chemical/x-csml"> <glob pattern="*.csml"/> </mime-type> <mime-type type="chemical/x-pdb"> <_comment>Brookhaven Protein Databank File</_comment> <glob pattern="*.pdb"/>
Registered: Sun Nov 10 03:50:12 UTC 2024 - Last Modified: Thu Sep 21 06:46:43 UTC 2023 - 298.5K bytes - Viewed (0) -
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) -
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) -
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) -
okhttp/src/test/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
edu.hn org.hn net.hn mil.hn gob.hn // hr : http://www.dns.hr/documents/pdf/HRTLD-regulations.pdf hr iz.hr from.hr name.hr com.hr // ht : http://www.nic.ht/info/charte.cfm ht com.ht shop.ht firm.ht info.ht adult.ht net.ht pro.ht org.ht med.ht art.ht coop.ht pol.ht asso.ht edu.ht rel.ht gouv.ht perso.ht
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Wed Dec 20 23:27:07 UTC 2023 - 240.3K bytes - Viewed (0)