Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 82 for saniye (0.05 sec)

  1. docs/uk/docs/alternatives.md

    Використовувати типи Python, щоб мати чудову підтримку редактора.
    
     Мати потужну систему впровадження залежностей. Знайдіть спосіб звести до мінімуму повторення коду.
    
    ///
    
    ### <a href="https://sanic.readthedocs.io/en/latest/" class="external-link" target="_blank">Sanic</a>
    
    Це був один із перших надзвичайно швидких фреймворків Python на основі `asyncio`. Він був дуже схожий на Flask.
    
    /// note | Технічні деталі
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 38.1K bytes
    - Viewed (0)
  2. docs/de/docs/alternatives.md

    Über ein leistungsstarkes Dependency Injection System zu verfügen. Eine Möglichkeit zu finden, Codeverdoppelung zu minimieren.
    
    ///
    
    ### <a href="https://sanic.readthedocs.io/en/latest/" class="external-link" target="_blank">Sanic</a>
    
    Es war eines der ersten extrem schnellen Python-Frameworks, welches auf `asyncio` basierte. Es wurde so gestaltet, dass es Flask sehr ähnlich ist.
    
    /// note | Technische Details
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 26.7K bytes
    - Viewed (0)
  3. docs/pt/docs/alternatives.md

    Usar tipos Python para ter um ótimo suporte do editor.
    
    Ter um sistema de injeção de dependência poderoso. Achar um jeito de minimizar repetição de código.
    
    ///
    
    ### <a href="https://sanic.readthedocs.io/en/latest/" class="external-link" target="_blank">Sanic</a>
    
    Ele foi um dos primeiros frameworks Python extremamente rápido baseado em `asyncio`. Ele foi feito para ser muito similar ao Flask.
    
    /// note | Detalhes técnicos
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  4. docs/es/docs/alternatives.md

    Tener un poderoso sistema de inyección de dependencias. Encontrar una forma de minimizar la repetición de código.
    
    ///
    
    ### <a href="https://sanic.readthedocs.io/en/latest/" class="external-link" target="_blank">Sanic</a>
    
    Fue uno de los primeros frameworks de Python extremadamente rápidos basados en `asyncio`. Fue hecho para ser muy similar a Flask.
    
    /// note | Detalles Técnicos
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Dec 30 18:26:57 UTC 2024
    - 25.4K bytes
    - Viewed (0)
  5. docs/fr/docs/alternatives.md

    Disposer d'un puissant système d'injection de dépendances. Trouver un moyen de minimiser la répétition du code.
    
    ///
    
    ### <a href="https://sanic.readthedocs.io/en/latest/" class="external-link" target="_blank">Sanic</a>
    
    C'était l'un des premiers frameworks Python extrêmement rapides basés sur `asyncio`. Il a été conçu pour être très similaire à Flask.
    
    /// note | Détails techniques
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 27.5K bytes
    - Viewed (0)
  6. src/main/resources/fess_indices/fess/tr/stopwords.txt

    kendisi
    kendisine
    kendisini
    kez
    ki
    kim
    kimden
    kime
    kimi
    kimse
    kırk
    milyar
    milyon
    mu
    mü
    mı
    nasıl
    ne
    neden
    nedenle
    nerde
    nerede
    nereye
    niye
    niçin
    o
    olan
    olarak
    oldu
    olduğu
    olduğunu
    olduklarını
    olmadı
    olmadığı
    olmak
    olması
    olmayan
    olmaz
    olsa
    olsun
    olup
    olur
    olursa
    oluyor
    on
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 19 06:31:02 UTC 2018
    - 1.5K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/HashCodeTest.java

        mutated[0]++;
        assertTrue(Arrays.equals(original, hash.asBytes()));
      }
    
      private static void assertReadableBytes(HashCode hashCode) {
        assertTrue(hashCode.bits() >= 32); // sanity
        byte[] hashBytes = hashCode.asBytes();
        int totalBytes = hashCode.bits() / 8;
    
        for (int bytes = 0; bytes < totalBytes; bytes++) {
          byte[] bb = new byte[bytes];
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/hash/HashCodeTest.java

        mutated[0]++;
        assertTrue(Arrays.equals(original, hash.asBytes()));
      }
    
      private static void assertReadableBytes(HashCode hashCode) {
        assertTrue(hashCode.bits() >= 32); // sanity
        byte[] hashBytes = hashCode.asBytes();
        int totalBytes = hashCode.bits() / 8;
    
        for (int bytes = 0; bytes < totalBytes; bytes++) {
          byte[] bb = new byte[bytes];
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  9. guava/src/com/google/common/hash/LittleEndianByteArray.java

          }
        }
    
        static {
          theUnsafe = getUnsafe();
          BYTE_ARRAY_BASE_OFFSET = theUnsafe.arrayBaseOffset(byte[].class);
    
          // sanity check - this should never fail
          if (theUnsafe.arrayIndexScale(byte[].class) != 1) {
            throw new AssertionError();
          }
        }
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 12 03:49:18 UTC 2025
    - 12.3K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/base/Utf8Test.java

        // Not a valid string
        assertNotWellFormed(-1, 0, -1, 0);
      }
    
      public void testShardsHaveExpectedRoundTrippables() {
        // A sanity check.
        long actual = 0;
        for (long expected : generateFourByteShardsExpectedRunnables()) {
          actual += expected;
        }
        assertEquals(EXPECTED_FOUR_BYTE_ROUNDTRIPPABLE_COUNT, actual);
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 12.8K bytes
    - Viewed (0)
Back to top