- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for mortises (0.12 sec)
-
cmd/erasure-healing-common_test.go
return FileInfo{}, reducedErr } // List all the file commit ids from parts metadata. modTimes := listObjectModtimes(partsMetadata, errs) // Count all latest updated FileInfo values var count int var latestFileInfo FileInfo // Reduce list of UUIDs to a single common value - i.e. the last updated Time modTime := commonTime(modTimes, expectedRQuorum) if modTime.IsZero() || modTime.Equal(timeSentinel) {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 23K bytes - Viewed (0) -
cmd/erasure-healing-common.go
) // Boot modTimes up to disk count, setting the value to time sentinel. func bootModtimes(diskCount int) []time.Time { modTimes := make([]time.Time, diskCount) // Boots up all the modtimes. for i := range modTimes { modTimes[i] = timeSentinel } return modTimes }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 12.5K bytes - Viewed (0) -
cmd/object-handlers-common.go
// Return false for methods other than GET and HEAD. if r.Method != http.MethodPut { return false } // If the object doesn't have a modtime (IsZero), or the modtime // is obviously garbage (Unix time == 0), then ignore modtimes // and don't process the If-Modified-Since header. if objInfo.ModTime.IsZero() || objInfo.ModTime.Equal(time.Unix(0, 0)) { return false }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:31:51 UTC 2024 - 14.6K bytes - Viewed (0) -
docs/fr/docs/async.md
Ce "attendre quelque chose d'autre" fait généralement référence à des opérations <abbr title="Input/Output ou Entrées et Sorties ">I/O</abbr> qui sont relativement "lentes" (comparées à la vitesse du processeur et de la mémoire RAM) telles qu'attendre que : * de la donnée soit envoyée par le client à travers le réseau
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Mar 31 23:52:53 UTC 2024 - 24K bytes - Viewed (0) -
src/runtime/mcentral.go
traceRelease(trace) } // If we sweep spanBudget spans without finding any free // space, just allocate a fresh span. This limits the amount // of time we can spend trying to find free space and // amortizes the cost of small object sweeping over the // benefit of having a full free span to allocate from. By // setting this to 100, we limit the space overhead to 1%. // // TODO(austin,mknyszek): This still has bad worst-case
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K bytes - Viewed (0) -
src/runtime/mgcwork.go
// buffers, we shift the stack down by one work buffer by // bringing in a new empty buffer and discarding a full one. // This way we have one buffer's worth of hysteresis, which // amortizes the cost of getting or putting a work buffer over // at least one buffer of work and reduces contention on the // global work lists. // // wbuf1 is always the buffer we're currently pushing to and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 12.9K bytes - Viewed (0) -
src/sync/map.go
read := m.loadReadOnly() if read.amended { // m.dirty contains keys not in read.m. Fortunately, Range is already O(N) // (assuming the caller does not break out early), so a call to Range // amortizes an entire copy of the map: we can promote the dirty copy // immediately! m.mu.Lock() read = m.loadReadOnly() if read.amended { read = readOnly{m: m.dirty} copyRead := read
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 21:14:51 UTC 2024 - 15.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/types/objectpath/objectpath.go
// // It may be more efficient to reuse a single Encoder across several calls. func For(obj types.Object) (Path, error) { return new(Encoder).For(obj) } // An Encoder amortizes the cost of encoding the paths of multiple objects. // The zero value of an Encoder is ready to use. type Encoder struct { scopeMemo map[*types.Scope][]types.Object // memoization of scopeObjects }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 23.1K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// can accumulate on a P before updating gcController.assistTime. gcAssistTimeSlack = 5000 // gcOverAssistWork determines how many extra units of scan work a GC // assist does when an assist happens. This amortizes the cost of an // assist by pre-paying for this many bytes of future allocations. gcOverAssistWork = 64 << 10 // defaultHeapMinimum is the value of heapMinimum for GOGC==100.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/runtime/malloc.go
// Obtaining a whole span amortizes the cost of locking // the mcentral. // // 3. If the mcentral's mspan list is empty, obtain a run // of pages from the mheap to use for the mspan. // // 4. If the mheap is empty or has no page runs large enough, // allocate a new group of pages (at least 1MB) from the // operating system. Allocating a large run of pages // amortizes the cost of talking to the operating system. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0)