Search Options

Results per page
Sort
Preferred Languages
Advance

Results 81 - 90 of 130 for negligible (0.16 sec)

  1. src/runtime/mpagealloc.go

    			const l2Size = unsafe.Sizeof(*p.chunks[0])
    			r := sysAlloc(l2Size, p.sysStat)
    			if r == nil {
    				throw("pageAlloc: out of memory")
    			}
    			if !p.test {
    				// Make the chunk mapping eligible or ineligible
    				// for huge pages, depending on what our current
    				// state is.
    				if p.chunkHugePages {
    					sysHugePage(r, l2Size)
    				} else {
    					sysNoHugePage(r, l2Size)
    				}
    			}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 19:53:03 UTC 2024
    - 39.2K bytes
    - Viewed (0)
  2. staging/src/k8s.io/api/batch/v1/types.go

    	// ttlSecondsAfterFinished after the Job finishes, it is eligible to be
    	// automatically deleted. When the Job is being deleted, its lifecycle
    	// guarantees (e.g. finalizers) will be honored. If this field is unset,
    	// the Job won't be automatically deleted. If this field is set to zero,
    	// the Job becomes eligible to be deleted immediately after it finishes.
    	// +optional
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 05 18:37:07 UTC 2024
    - 40.6K bytes
    - Viewed (0)
  3. pkg/apis/batch/types.go

    	// ttlSecondsAfterFinished after the Job finishes, it is eligible to be
    	// automatically deleted. When the Job is being deleted, its lifecycle
    	// guarantees (e.g. finalizers) will be honored. If this field is unset,
    	// the Job won't be automatically deleted. If this field is set to zero,
    	// the Job becomes eligible to be deleted immediately after it finishes.
    	// +optional
    	TTLSecondsAfterFinished *int32
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed May 29 12:01:28 UTC 2024
    - 33K bytes
    - Viewed (0)
  4. src/runtime/mfinal.go

    	}
    	ot := (*ptrtype)(unsafe.Pointer(etyp))
    	if ot.Elem == nil {
    		throw("nil elem type!")
    	}
    
    	if inUserArenaChunk(uintptr(e.data)) {
    		// Arena-allocated objects are not eligible for finalizers.
    		throw("runtime.SetFinalizer: first argument was allocated into an arena")
    	}
    
    	// find the containing object
    	base, span, _ := findObject(uintptr(e.data), 0, 0)
    
    	if base == 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 01:56:56 UTC 2024
    - 19K bytes
    - Viewed (0)
  5. src/runtime/metrics/description.go

    		Description: "The stack size of new goroutines.",
    		Kind:        KindUint64,
    		Cumulative:  false,
    	},
    	{
    		Name: "/memory/classes/heap/free:bytes",
    		Description: "Memory that is completely free and eligible to be returned to the underlying system, " +
    			"but has not been. This metric is the runtime's estimate of free address space that is backed by " +
    			"physical memory.",
    		Kind: KindUint64,
    	},
    	{
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Dec 06 17:59:12 UTC 2023
    - 19.6K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/cache/CacheBuilder.java

      long getExpireAfterAccessNanos() {
        return (expireAfterAccessNanos == UNSET_INT)
            ? DEFAULT_EXPIRATION_NANOS
            : expireAfterAccessNanos;
      }
    
      /**
       * Specifies that active entries are eligible for automatic refresh once a fixed duration has
       * elapsed after the entry's creation, or the most recent replacement of its value. The semantics
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 44.8K bytes
    - Viewed (0)
  7. src/runtime/metrics/doc.go

    		The number of non-default behaviors executed by the archive/zip
    		package due to a non-default GODEBUG=zipinsecurepath=...
    		setting.
    
    	/memory/classes/heap/free:bytes
    		Memory that is completely free and eligible to be returned to
    		the underlying system, but has not been. This metric is the
    		runtime's estimate of free address space that is backed by
    		physical memory.
    
    	/memory/classes/heap/objects:bytes
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 22:58:43 UTC 2024
    - 20K bytes
    - Viewed (0)
  8. docs/changelogs/changelog_4x.md

        the stream only or the entire connection. With this fix OkHttp will now send HTTP/2 pings after
        a stream timeout to determine whether the connection should remain eligible for pooling.
    
     *  Fix: Don't call `EventListener.responseHeadersStart()` or `responseBodyStart()` until bytes have
        been received. Previously these events were incorrectly sent too early, when OkHttp was ready to
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Wed Apr 17 13:25:31 UTC 2024
    - 25.2K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/ImmutableList.java

       * strong reference to {@code this}, which may prevent the original list from being garbage
       * collected. If you want the original list to be eligible for garbage collection, you should
       * create and use a copy of the sub list (e.g., {@code
       * ImmutableList.copyOf(originalList.subList(...))}).
       */
      @Override
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Sun Jun 02 13:36:19 UTC 2024
    - 27.1K bytes
    - Viewed (0)
  10. src/internal/trace/internal/oldtrace/parser.go

    	// Note: technically we don't need a priority queue here. We're only ever
    	// interested in the earliest elligible event, which means we just have to
    	// track the smallest element. However, in practice, the priority queue
    	// performs better, because for each event we only have to compute its state
    	// transition once, not on each iteration. If it was elligible before, it'll
    	// already be in the queue. Furthermore, on average, we only have one P to
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 24 21:15:28 UTC 2024
    - 46.8K bytes
    - Viewed (0)
Back to top