- Sort Score
- Num 10 results
- Language All
Results 1861 - 1870 of 1,919 for fiction (0.13 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/en/docs/deployment/docker.md
You can read more about it in the [Docker docs for shell and exec form](https://docs.docker.com/reference/dockerfile/#shell-and-exec-form). This can be quite noticeable when using `docker compose`. See this Docker Compose FAQ section for more technical details: [Why do my services take 10 seconds to recreate or stop?](https://docs.docker.com/compose/faq/#why-do-my-services-take-10-seconds-to-recreate-or-stop). #### Directory Structure { #directory-structure }
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 28.3K bytes - Click Count (1) -
cmd/utils.go
CurvePreferences: crypto.TLSCurveIDs(), TCPOptions: globalTCPOptions, EnableHTTP2: false, }.NewRemoteTargetHTTPTransport(insecure) } // ceilFrac takes a numerator and denominator representing a fraction // and returns its ceiling. If denominator is 0, it returns 0 instead // of crashing. func ceilFrac(numerator, denominator int64) (ceil int64) { if denominator == 0 { // do nothing on invalid input return ceil
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 33K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Longs.java
// places left to rotate. int m = -distance % length; m = (m < 0) ? m + length : m; // The current index of what will become the first element of the rotated section. int newFirstIndex = m + fromIndex; if (newFirstIndex == fromIndex) { return; } reverse(array, fromIndex, newFirstIndex); reverse(array, newFirstIndex, toIndex);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 29K bytes - Click Count (0) -
cmd/metacache-set.go
} // gatherResults will collect all results on the input channel and filter results according // to the options or to the current bucket ILM expiry rules. // Caller should close the channel when done. // The returned function will return the results once there is enough or input is closed, // or the context is canceled. func (o *listPathOptions) gatherResults(ctx context.Context, in <-chan metaCacheEntry) func() (metaCacheEntriesSorted, error) {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 30.7K bytes - Click Count (0) -
cmd/site-replication.go
// server configuration, and convert it to minio-go's // replication configuration type (by converting to xml and // parsing it back), use minio-go's add rule function, and // finally convert it back to the server type (again via xml). // This is needed as there is no add-rule function in the server // yet. // Though we do not check if the rule already exists, this is // not a problem as we are always using the same replication
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 184.8K bytes - Click Count (1) -
docs/de/docs/async.md
### Ist Nebenläufigkeit besser als Parallelität? { #is-concurrency-better-than-parallelism } Nein! Das ist nicht die Moral der Geschichte.Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 27.3K bytes - Click Count (0) -
api/go1.10.txt
pkg debug/macho, type RpathCmd struct pkg debug/macho, type RpathCmd struct, Cmd LoadCmd pkg debug/macho, type RpathCmd struct, Len uint32 pkg debug/macho, type RpathCmd struct, Path uint32 pkg debug/macho, type Section struct, Relocs []Reloc pkg encoding/asn1, const TagNumericString = 18 pkg encoding/asn1, const TagNumericString ideal-int pkg encoding/asn1, func MarshalWithParams(interface{}, string) ([]uint8, error)
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Feb 06 05:00:01 GMT 2018 - 30.1K bytes - Click Count (0) -
docs/zh-hant/docs/async.md
這種類型的非同步性正是 NodeJS 成功的原因(儘管 NodeJS 不是平行的),這也是 Go 語言作為程式語言的一個強大優勢。 這與 **FastAPI** 所能提供的性能水平相同。 你可以同時利用並行性和平行性,進一步提升效能,這比大多數已測試的 NodeJS 框架都更快,並且與 Go 語言相當,而 Go 是一種更接近 C 的編譯語言([感謝 Starlette](https://www.techempower.com/benchmarks/#section=data-r17&hw=ph&test=query&l=zijmkf-1))。 ### 並行比平行更好嗎? { #is-concurrency-better-than-parallelism } 不是的!這不是故事的本意。 並行與平行不同。並行在某些 **特定** 的需要大量等待的情境下表現更好。正因如此,並行在 Web 應用程式開發中通常比平行更有優勢。但並不是所有情境都如此。Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 17:05:38 GMT 2026 - 21.7K bytes - Click Count (0) -
docs/zh/docs/async.md
这种异步机制正是 NodeJS 受到欢迎的原因(尽管 NodeJS 不是并行的),以及 Go 作为编程语言的优势所在。 这与 **FastAPI** 的性能水平相同。 你可以同时拥有并行性和异步性,你可以获得比大多数经过测试的 NodeJS 框架更高的性能,并且与 Go 不相上下, Go 是一种更接近于 C 的编译语言([全部归功于 Starlette](https://www.techempower.com/benchmarks/#section=data-r17&hw=ph&test=query&l=zijmkf-1))。 ### 并发比并行好吗? { #is-concurrency-better-than-parallelism } 不!这不是故事的本意。 并发不同于并行。而是在需要大量等待的特定场景下效果更好。因此,在 Web 应用程序开发中,它通常比并行要好得多,但这并不意味着全部。 因此,为了平衡这一点,想象一下下面的短篇故事:Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 17:06:37 GMT 2026 - 21.6K bytes - Click Count (0) -
api/go1.4.txt
pkg syscall (windows-386), func FullPath(string) (string, error) pkg syscall (windows-amd64), func FullPath(string) (string, error) # CL 98150043 testing: add Coverage function, Russ Cox <******@****.***> pkg testing, func Coverage() float64 # CL 148770043 cmd/go, testing: add TestMain support, Russ Cox <******@****.***>
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Dec 12 03:01:01 GMT 2014 - 34K bytes - Click Count (0)