Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1271 - 1280 of 1,516 for exemple (0.03 sec)

  1. android/guava/src/com/google/common/util/concurrent/InterruptibleTask.java

            // This will make sure that tasks don't get stuck busy waiting.
            // Some of this is fixed in jdk11 (see https://bugs.openjdk.org/browse/JDK-8198692) but
            // not all.  See the test cases for examples on how this can happen.
            try {
              ((Thread) currentRunner).interrupt();
            } finally {
              Runnable prev = getAndSet(DONE);
              if (prev == PARKED) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 10K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/util/concurrent/ListenableFuture.java

     * FluentFuture.transform}), but you will often find it easier to use a framework. Frameworks
     * automate the process, often adding features like monitoring, debugging, and cancellation.
     * Examples of frameworks include:
     *
     * <ul>
     *   <li><a href="https://dagger.dev/producers.html">Dagger Producers</a>
     * </ul>
     *
     * <p>The main purpose of {@link #addListener addListener} is to support this chaining. You will
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 8K bytes
    - Viewed (0)
  3. docs/es/docs/tutorial/body.md

    Al igual que al declarar parámetros de query, cuando un atributo del modelo tiene un valor por defecto, no es obligatorio. De lo contrario, es obligatorio. Usa `None` para hacerlo opcional.
    
    Por ejemplo, el modelo anterior declara un “`object`” JSON (o `dict` en Python) como:
    
    ```JSON
    {
        "name": "Foo",
        "description": "An optional description",
        "price": 45.2,
        "tax": 3.5
    }
    ```
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 7.6K bytes
    - Viewed (0)
  4. src/test/java/jcifs/internal/util/SMBUtilTest.java

            long time = SMBUtil.readTime(src, 0);
            assertEquals(-SmbConstants.MILLISECONDS_BETWEEN_1970_AND_1601, time);
    
            // Test with specific time value
            long testTime = 131768928000000000L; // Example Windows file time
            SMBUtil.writeInt8(testTime, src, 8);
            long readTime = SMBUtil.readTime(src, 8);
            assertEquals((testTime / 10000L - SmbConstants.MILLISECONDS_BETWEEN_1970_AND_1601), readTime);
        }
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.1K bytes
    - Viewed (0)
  5. fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/HtmlXpathExtractor.java

        /**
         * Regular expression pattern to match the charset attribute in the meta tag of HTML documents.
         * The pattern captures the charset value specified in the content attribute of the meta tag.
         * Example: &lt;meta http-equiv="Content-Type" content="text/html; charset=UTF-8"&gt;
         */
        protected Pattern metaCharsetPattern = Pattern.compile("<meta.*content\\s*=\\s*['\"].*;\\s*charset=([\\w\\d\\-_]*)['\"]\\s*/?>",
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Sat Oct 04 08:47:19 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  6. src/main/java/jcifs/smb1/smb1/ACE.java

     * more ACEs are evaluated until all desired access bits (combined)
     * are "allowed". If all of the desired access bits are not "allowed"
     * the then same process is repeated for inherited ACEs.
     * <p>
     * For example, if user <code>WNET\alice</code> tries to open a file
     * with desired access bits <code>0x00000003</code> (<code>FILE_READ_DATA |
     * FILE_WRITE_DATA</code>) and the target file has the following security
     * descriptor ACEs:
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 8.8K bytes
    - Viewed (0)
  7. guava/src/com/google/common/base/Stopwatch.java

     *       in any other way than how {@code Stopwatch} uses them.
     *   <li>An alternative source of nanosecond ticks can be substituted, for example for testing or
     *       performance reasons, without affecting most of your code.
     * </ul>
     *
     * <p>The one downside of {@code Stopwatch} relative to {@link System#nanoTime()} is that {@code
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Oct 08 18:55:33 UTC 2025
    - 9.2K bytes
    - Viewed (0)
  8. internal/lock/lock_windows.go

    // path when needed, in order to avoid the default 260 character file
    // path limit imposed by Windows. If path is not easily converted to
    // the extended-length form (for example, if path is a relative path
    // or contains .. elements), or is short enough, fixLongPath returns
    // path unmodified.
    //
    // See https://msdn.microsoft.com/en-us/library/windows/desktop/aa365247(v=vs.85).aspx#maxpath
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb1/smb1/SID.java

                }
            }
        }
    
        /**
         * Construct a SID from a domain SID and an RID
         * (relative identifier). For example, a domain SID
         * {@code S-1-5-21-1496946806-2192648263-3843101252} and RID {@code 1029} would
         * yield the SID {@code S-1-5-21-1496946806-2192648263-3843101252-1029}.
         */
        /**
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 31.5K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/hash/HashTestUtils.java

       * 'affect' a bit(j) in the output if two inputs, identical but for bit(i), will differ at output
       * bit(j) about half the time
       *
       * <p>Funneling is pretty simple to detect. The key idea is to find example keys which
       * unequivocally demonstrate that funneling cannot be occurring. This is done bit-by-bit. For each
       * input bit(i) and output bit(j), two pairs of keys must be found with all bits identical except
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
Back to top