Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 531 - 540 of 728 for help (0.03 seconds)

  1. guava-tests/test/com/google/common/hash/ChecksumHashFunctionTest.java

        assertChecksum(ADLER_32, "");
        assertChecksum(ADLER_32, "Z");
        assertChecksum(ADLER_32, "foobar");
      }
    
      public void testCrc32_knownValues() throws Exception {
        assertHash32(0x1C8600E3, CRC_32, "hell");
        assertHash32(0x3610A686, CRC_32, "hello");
        assertHash32(0xED81F9F6, CRC_32, "hello ");
        assertHash32(0x4850DDC2, CRC_32, "hello w");
        assertHash32(0x7A2D6005, CRC_32, "hello wo");
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 3.3K bytes
    - Click Count (0)
  2. README.md

    ## Install using Helm Charts
    
    There are two paths for installing MinIO onto Kubernetes infrastructure:
    
    - Use the [MinIO Operator](https://github.com/minio/operator)
    - Use the community-maintained [Helm charts](https://github.com/minio/minio/tree/master/helm/minio)
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Feb 12 20:18:48 GMT 2026
    - 8.8K bytes
    - Click Count (0)
  3. .github/bot_config.yml

       
       *Please let us know if this helps.*
       
    windows_comment: >
       From the stack trace it looks like you are hitting windows path length limit.
          * Try to disable path length limit on Windows 10.
            * Refer [disable path length limit instructions guide.](https://mspoweruser.com/ntfs-260-character-windows-10/)
       
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Jun 30 16:38:59 GMT 2025
    - 4K bytes
    - Click Count (1)
  4. guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java

      }
    
      public void testKnownStringInputs() {
        assertHash(0, murmur3_32().hashUnencodedChars(""));
        assertHash(679745764, murmur3_32().hashUnencodedChars("k"));
        assertHash(1510782915, murmur3_32().hashUnencodedChars("hell"));
        assertHash(-675079799, murmur3_32().hashUnencodedChars("hello"));
        assertHash(1935035788, murmur3_32().hashUnencodedChars("http://www.google.com/"));
        assertHash(
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 8.4K bytes
    - Click Count (0)
  5. src/main/webapp/css/admin/bootstrap.min.css.map

    behavior.\n// 4. Remove the bottom border in Firefox 39-.\n// 5. Prevent the text-decoration to be skipped.\n\nabbr[title],\nabbr[data-original-title] { // 1\n  text-decoration: underline; // 2\n  text-decoration: underline dotted; // 2\n  cursor: help; // 3\n  border-bottom: 0; // 4\n  text-decoration-skip-ink: none; // 5\n}\n\naddress {\n  margin-bottom: 1rem;\n  font-style: normal;\n  line-height: inherit;\n}\n\nol,\nul,\ndl {\n  margin-top: 0;\n  margin-bottom: 1rem;\n}\n\nol ol,\nul ul,\nol...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 639.3K bytes
    - Click Count (1)
  6. docs_src/metadata/tutorial001_py310.py

    from fastapi import FastAPI
    
    description = """
    ChimichangApp API helps you do awesome stuff. 🚀
    
    ## Items
    
    You can **read items**.
    
    ## Users
    
    You will be able to:
    
    * **Create users** (_not implemented_).
    * **Read users** (_not implemented_).
    """
    
    app = FastAPI(
        title="ChimichangApp",
        description=description,
        summary="Deadpool's favorite app. Nuff said.",
        version="0.0.1",
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Feb 12 13:19:43 GMT 2026
    - 805 bytes
    - Click Count (0)
  7. docs/ru/llm-prompt.md

    * full stack: full stack (do not translate)
    * full-stack: full-stack (do not translate)
    * loop (as in async loop): цикл событий
    * Machine Learning: Машинное обучение
    * Deep Learning: Глубокое обучение
    * callback hell: callback hell (clarify as `ад обратных вызовов`)
    * on the fly: на лету
    * scratch the surface: поверхностно ознакомиться
    * tip: совет (or `подсказка` depending on context)
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Jan 22 07:07:05 GMT 2026
    - 6.5K bytes
    - Click Count (0)
  8. android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java

      // NotApplicableException in the expensive comparator case.
      @Param({"100", "10000"})
      private int size;
    
      @Param private HeapType heap;
    
      private Queue<Integer> queue;
    
      private final Random random = new Random();
    
      @BeforeExperiment
      void setUp() {
        queue = heap.create(comparator.get());
        for (int i = 0; i < size; i++) {
          queue.add(random.nextInt());
        }
      }
    
      @Benchmark
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 4.4K bytes
    - Click Count (0)
  9. android/guava-tests/test/com/google/common/collect/LockHeldAssertingSet.java

    import java.util.Collection;
    import java.util.Set;
    import org.jspecify.annotations.NullUnmarked;
    import org.jspecify.annotations.Nullable;
    
    /**
     * {@link Set} implementation that asserts that a given lock is held whenever one of its methods is
     * called.
     */
    @NullUnmarked
    class LockHeldAssertingSet<E> extends ForwardingSet<E> implements Serializable {
      final Set<E> delegate;
      final Object mutex;
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Feb 13 17:34:21 GMT 2025
    - 4.3K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java

      // NotApplicableException in the expensive comparator case.
      @Param({"100", "10000"})
      private int size;
    
      @Param private HeapType heap;
    
      private Queue<Integer> queue;
    
      private final Random random = new Random();
    
      @BeforeExperiment
      void setUp() {
        queue = heap.create(comparator.get());
        for (int i = 0; i < size; i++) {
          queue.add(random.nextInt());
        }
      }
    
      @Benchmark
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 4.4K bytes
    - Click Count (0)
Back to Top