Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 41 - 50 of 977 for male (0.02 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. docs/config/README.md

    In most setups this will keep the scanner slow enough to not impact overall system performance. Setting the `delay` key to a *lower* value will make the scanner faster and setting it to 0 will make the scanner run at full speed (not recommended in production). Setting it to a higher value will make the scanner slower, consuming less resources with the trade off of not collecting metrics for operations like healing and disk usage as fast.
    
    ```
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 18.1K bytes
    - Click Count (1)
  2. docs/changelogs/changelog_2x.md

        `OkUrlFactory `responses.
     *  Fix: Don't include a default User-Agent header in requests made with the Call
        API. Requests made with OkUrlFactory will continue to have a default user
        agent.
     *  New: Guava-like API to create headers:
    
        ```java
        Headers headers = Headers.of(name1, value1, name2, value2, ...).
        ```
    
     *  New: Make the content-type header optional for request bodies.
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Feb 06 02:19:09 GMT 2022
    - 26.6K bytes
    - Click Count (0)
  3. src/archive/zip/reader.go

    		// We may also synthesize additional directory entries.
    		r.fileList = make([]fileListEntry, 0, len(r.File))
    		// files and knownDirs map from a file/directory name
    		// to an index into the r.fileList entry that we are
    		// building. They are used to mark duplicate entries.
    		files := make(map[string]int)
    		knownDirs := make(map[string]int)
    
    		// dirs[name] is true if name is known to be a directory,
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 15 18:35:56 GMT 2026
    - 28.5K bytes
    - Click Count (0)
  4. LICENSE

          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          (except as stated in this section) patent license to make, have made,
          use, offer to sell, sell, import, and otherwise transfer the Work,
          where such license applies only to those patent claims licensable
          by such Contributor that are necessarily infringed by their
    Created: Wed Apr 01 00:11:11 GMT 2026
    - Last Modified: Thu Feb 20 19:53:57 GMT 2020
    - 11.1K bytes
    - Click Count (0)
  5. LICENSE.txt

          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          (except as stated in this section) patent license to make, have made,
          use, offer to sell, sell, import, and otherwise transfer the Work,
          where such license applies only to those patent claims licensable
          by such Contributor that are necessarily infringed by their
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon Jul 23 14:02:28 GMT 2012
    - 11.1K bytes
    - Click Count (0)
  6. update-credits.sh

          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          (except as stated in this section) patent license to make, have made,
          use, offer to sell, sell, import, and otherwise transfer the Work,
          where such license applies only to those patent claims licensable
          by such Contributor that are necessarily infringed by their
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 11 05:08:38 GMT 2023
    - 11.4K bytes
    - Click Count (0)
  7. LICENSE

          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          (except as stated in this section) patent license to make, have made,
          use, offer to sell, sell, import, and otherwise transfer the Work,
          where such license applies only to those patent claims licensable
          by such Contributor that are necessarily infringed by their
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Mon Jan 11 04:26:17 GMT 2021
    - 11.1K bytes
    - Click Count (0)
  8. doc/go_mem.html

    and not yet overwritten.
    These implementation constraints make Go more like Java or JavaScript,
    in that most races have a limited number of outcomes,
    and less like C and C++, where the meaning of any program with a race
    is entirely undefined, and the compiler may do anything at all.
    Go's approach aims to make errant programs more reliable and easier to debug,
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Aug 05 15:41:37 GMT 2025
    - 26.6K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java

       *       to make such changes to our serialized forms, and we have made them before, usually
       *       without trouble. In this case, my guess is that our chosen approach is even less likely
       *       to lead to trouble than an incompatible change would be.
       *   <li>We could make {@link #countMap} no longer be {@code final}. Then we could write to it
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 22.3K bytes
    - Click Count (0)
  10. LICENSES/third_party/forked/shell2junit/LICENSE

    License, each Contributor hereby grants to You a perpetual, worldwide, 
    non-exclusive, no-charge, royalty-free, irrevocable (except as stated in 
    this section) patent license to make, have made, use, offer to sell, sell, 
    import, and otherwise transfer the Work, where such license applies only to 
    those patent claims licensable by such Contributor that are necessarily 
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu Jul 08 11:48:19 GMT 2021
    - 9.2K bytes
    - Click Count (0)
Back to Top