Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 21 - 30 of 209 for drop (0.02 seconds)

  1. internal/handlers/forwarder.go

    type bufPool struct {
    	sz   int
    	pool bpool.Pool[*[]byte]
    }
    
    func (b *bufPool) Put(buf []byte) {
    	if cap(buf) < b.sz || cap(buf) > b.sz*2 {
    		// Buffer too small or will likely leak memory after being expanded.
    		// Drop it.
    		return
    	}
    	b.pool.Put(&buf)
    }
    
    func (b *bufPool) Get() []byte {
    	bufp := b.pool.Get()
    	if bufp == nil || cap(*bufp) < b.sz {
    		return make([]byte, 0, b.sz)
    	}
    	return (*bufp)[:b.sz]
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 5.7K bytes
    - Click Count (0)
  2. internal/http/response-recorder.go

    	lrw.bytesWritten += n
    	if lrw.ttfbBody == 0 {
    		lrw.ttfbBody = time.Now().UTC().Sub(lrw.StartTime)
    	}
    
    	if (lrw.LogErrBody && lrw.StatusCode >= http.StatusBadRequest) || lrw.LogAllBody {
    		// If body is > 10MB, drop it.
    		if lrw.bytesWritten+len(p) > 10<<20 {
    			lrw.LogAllBody = false
    			lrw.body = bytes.Buffer{}
    		} else {
    			// Always logging error responses.
    			lrw.body.Write(p)
    		}
    	}
    	if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Mar 30 00:56:02 GMT 2025
    - 5.5K bytes
    - Click Count (0)
  3. dbflute_fess/dfprop/replaceSchemaMap.dfprop

        #    }
        #}
        # - - - - - - - - - -/
    
        # /- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        # o additionalDropMapList: (NotRequired - Default list:{})
        #  You can drop additional other schemas.
        #  Elements of this map are as below:
        #   o url: (NotRequired - Default same as main schema)
        #   o schema: (Required: if empty schema means valid schema, not required)
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 31 23:35:14 GMT 2015
    - 9.3K bytes
    - Click Count (0)
  4. cmd/metacache.go

    	}
    
    	if m.status == scanStateStarted && update.status != scanStateStarted {
    		m.status = update.status
    	}
    
    	if m.status == scanStateStarted && time.Since(m.lastHandout) > metacacheMaxClientWait {
    		// Drop if client hasn't been seen for 3 minutes.
    		m.status = scanStateError
    		m.error = "client not seen"
    	}
    
    	if m.error == "" && update.error != "" {
    		m.error = update.error
    		m.status = scanStateError
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Jul 12 16:23:16 GMT 2024
    - 6K bytes
    - Click Count (0)
  5. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Hpack.kt

            if (index != -1) { // Index -1 == new header.
              delta -= dynamicTable[dynamicTableIndex(index)]!!.hpackSize
            }
    
            // if the new or replacement header is too big, drop all entries.
            if (delta > maxDynamicTableByteCount) {
              clearDynamicTable()
              return
            }
    
            // Evict headers to the required length.
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:02:18 GMT 2026
    - 23.2K bytes
    - Click Count (0)
  6. guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

      }
    
      static double select(int k, double[] array) {
        // This is basically a copy of com.google.math.Rank#select, with a small change in the method
        // signature: we make k 0-based rather than 1-based; and we drop from and to, and always work on
        // the whole array.
        int from = 0;
        int to = array.length - 1;
    
        while (true) {
          if (to <= from + 1) {
            // Two or less elements left.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  7. android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

      }
    
      static double select(int k, double[] array) {
        // This is basically a copy of com.google.math.Rank#select, with a small change in the method
        // signature: we make k 0-based rather than 1-based; and we drop from and to, and always work on
        // the whole array.
        int from = 0;
        int to = array.length - 1;
    
        while (true) {
          if (to <= from + 1) {
            // Two or less elements left.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  8. docs/tr/docs/deployment/manually.md

    Benzer bir süreç, diğer ASGI server programlarının tamamı için de geçerlidir.
    
    /// tip | İpucu
    
    `standard` eklediğinizde Uvicorn, önerilen bazı ek bağımlılıkları kurar ve kullanır.
    
    Bunlara, `asyncio` için yüksek performanslı bir drop-in replacement olan ve concurrency performansını ciddi şekilde artıran `uvloop` da dahildir.
    
    FastAPI'yi `pip install "fastapi[standard]"` gibi bir şekilde kurduğunuzda `uvicorn[standard]` da zaten kurulmuş olur.
    
    ///
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 07:53:17 GMT 2026
    - 7.1K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/util/concurrent/ExecutionList.java

        // in the opposite order from how they were added so we need to reverse the list to fulfill our
        // contract.
        // This is somewhat annoying, but turns out to be very fast in practice. Alternatively, we could
        // drop the contract on the method that enforces this queue like behavior since depending on it
        // is likely to be a bug anyway.
    
        // N.B. All writes to the list and the next pointers must have happened before the above
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Feb 10 11:51:21 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  10. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt

          } else {
            // Otherwise the rule is for a public suffix, so we must take one more label.
            domainLabels.size - (rule.size + 1)
          }
    
        return splitDomain(domain).asSequence().drop(firstLabelOffset).joinToString(".")
      }
    
      private fun splitDomain(domain: String): List<String> {
        val domainLabels = domain.split('.')
    
        if (domainLabels.last() == "") {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon Jul 28 07:33:49 GMT 2025
    - 8.5K bytes
    - Click Count (0)
Back to Top