Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 771 - 780 of 1,356 for afterFn (0.1 seconds)

  1. src/main/java/jcifs/SidResolver.java

         *            return names for SIDs corresponding to local accounts for which the domain controller is not an
         *            authority.
         * @param sids
         *            The SIDs that should be resolved. After this function is called, the names associated with the SIDs
         *            may be queried with the <code>toDisplayString</code>, <code>getDomainName</code>, and <code>getAccountName</code>
         *            methods.
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 5.2K bytes
    - Click Count (0)
  2. docs/en/docs/history-design-future.md

    All in a way that provided the best development experience for all the developers.
    
    ## Requirements { #requirements }
    
    After testing several alternatives, I decided that I was going to use <a href="https://docs.pydantic.dev/" class="external-link" target="_blank">**Pydantic**</a> for its advantages.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Oct 11 17:48:49 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  3. docs/en/docs/tutorial/query-params.md

    {* ../../docs_src/query_params/tutorial001_py39.py hl[9] *}
    
    The query is the set of key-value pairs that go after the `?` in a URL, separated by `&` characters.
    
    For example, in the URL:
    
    ```
    http://127.0.0.1:8000/items/?skip=0&limit=10
    ```
    
    ...the query parameters are:
    
    * `skip`: with a value of `0`
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 4.5K bytes
    - Click Count (0)
  4. cmd/leak-detect_test.go

    		if len(leaked) == 0 {
    			return
    		}
    		// wait a test again will deadline.
    		if UTCNow().Before(deadline) {
    			time.Sleep(leakDetectPauseTimeMs * time.Millisecond)
    			continue
    		}
    		// after the deadline time report all the difference in the latest snapshot compared with the initial one.
    		for _, g := range leaked {
    			t.Errorf("Leaked goroutine: %v", g)
    		}
    		return
    	}
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 5.2K bytes
    - Click Count (0)
  5. src/builtin/builtin.go

    // The close built-in function closes a channel, which must be either
    // bidirectional or send-only. It should be executed only by the sender,
    // never the receiver, and has the effect of shutting down the channel after
    // the last sent value is received. After the last value has been received
    // from a closed channel c, any receive from c will succeed without
    // blocking, returning the zero value for the channel element. The form
    //
    //	x, ok := <-c
    //
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Dec 30 23:59:23 GMT 2024
    - 12.8K bytes
    - Click Count (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/HttpHeaders.kt

          result.add(Challenge(schemeName, emptyMap()))
          return
        }
    
        var eqCount = skipAll('='.code.toByte())
        val commaSuffixed = skipCommasAndWhitespace()
    
        // It's a token68 because there isn't a value after it.
        if (!commaPrefixed && (commaSuffixed || exhausted())) {
          result.add(
            Challenge(
              schemeName,
              Collections.singletonMap<String?, String>(null, peek + "=".repeat(eqCount)),
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Mon May 05 16:01:00 GMT 2025
    - 7.2K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/ArrayListMultimap.java

     *
     * <p>When iterating through the collections supplied by this class, the ordering of values for a
     * given key agrees with the order in which the values were added.
     *
     * <p>This multimap allows duplicate key-value pairs. After adding a new key-value pair equal to an
     * existing key-value pair, the {@code ArrayListMultimap} will contain entries for both the new
     * value and the old value.
     *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Dec 05 23:15:58 GMT 2025
    - 6.8K bytes
    - Click Count (0)
  8. docs/integrations/veeam/README.md

    - Follow the on screen wizard
    
    - On the Capacity Tier screen, check the box to Extend scale-out backup repository capacity with object storage checkbox and select the object storage. If you want to be able to test backup data immediately after a job is run, under the object storage selection, check the "Copy" box and uncheck the "Move" box.
    
    ### Create a backup job
    
    #### Backup Virtual Machines with Veeam Backup and Replication
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 5.5K bytes
    - Click Count (0)
  9. cmd/xl-storage-format-utils_test.go

    	}
    
    	sort.Slice(versions, func(i, j int) bool {
    		if versions[i].IsLatest {
    			return true
    		}
    		if versions[j].IsLatest {
    			return false
    		}
    		return versions[i].ModTime.After(versions[j].ModTime)
    	})
    
    	for i, fi := range fivs.Versions {
    		if fi.VersionID != versions[i].VersionID {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  10. internal/handlers/forwarder.go

    	return f
    }
    
    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)
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 5.7K bytes
    - Click Count (0)
Back to Top