Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 410 for taip (0.02 sec)

  1. src/main/resources/fess_indices/_aws/fess.json

    "juos", "juose", "jus", "jūs", "jūsų", "ką", "kad", "kai", "kaip", "kas", "kiek", "kol", "kur", "kurie", "kuris", "man", "mane", "manęs", "manimi", "mano", "manyje", "mes", "metu", "mudu", "mudvi", "mudviejų", "mudviem", "mudviese", "mumis", "mums", "mumyse", "mus", "mūsų", "nei", "nes", "net", "nors", "nuo", "o", "pat", "per", "po", "prie", "prieš", "sau", "save", "savęs", "savimi", "savo", "savyje", "su", "tačiau", "tada", "tai", "taip", "tas", "tau", "tave", "tavęs", "tavimi", "tavyje", "ten",...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Jun 14 00:36:40 UTC 2025
    - 117.3K bytes
    - Viewed (0)
  2. docs/vi/docs/index.md

    * Chuyển đổi tự động các JSON object đến và JSON object đi.
    * Tài liệu hóa mọi thứ với OpenAPI, tài liệu đó có thể được sử dụng bởi:
    
        * Các hệ thống tài liệu có thể tương tác.
        * Hệ thống sinh code tự động, cho nhiều ngôn ngữ lập trình.
    * Cung cấp trực tiếp 2 giao diện web cho tài liệu tương tác
    
    ---
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 21.9K bytes
    - Viewed (0)
  3. docs/vi/docs/virtual-environments.md

    ```
    
    </div>
    
    Lệnh này sẽ tải xuống một tệp nén với mã nguồn FastAPI, thường là từ <a href="https://pypi.org/project/fastapi/" class="external-link" target="_blank">PyPI</a>.
    
    Nó cũng sẽ **tải xuống** các tệp cho các gói khác mà FastAPI phụ thuộc vào.
    
    Sau đó, nó sẽ **giải nén** tất cả các tệp đó và đưa chúng vào một thư mục trong máy tính của bạn.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Feb 07 22:19:18 UTC 2025
    - 26.1K bytes
    - Viewed (0)
  4. src/test/java/jcifs/util/SmbCircuitBreakerTest.java

            long initialTime = circuitBreaker.getTimeSinceLastStateChange();
            assertTrue(initialTime >= 0, "Should have initial timestamp");
    
            // Trip circuit
            circuitBreaker.trip();
            Thread.sleep(100);
    
            long afterTripTime = circuitBreaker.getTimeSinceLastStateChange();
            assertTrue(afterTripTime >= 100, "Time should have advanced");
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 23.2K bytes
    - Viewed (0)
  5. src/test/java/jcifs/smb1/dcerpc/ndr/NdrHyperTest.java

     */
    @ExtendWith(MockitoExtension.class)
    public class NdrHyperTest {
    
        /**
         * Tests a simple round‑trip encode → decode retains the original value.
         */
        @Test
        @DisplayName("Basic round‑trip for a fixed value")
        public void testEncodeRoundTrip() throws NdrException {
            final long original = 0x1122334455667788L;
            NdrHyper hyper = new NdrHyper(original);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.3K bytes
    - Viewed (0)
  6. src/test/java/jcifs/spnego/NegTokenInitTest.java

            assertArrayEquals(mechs, parsed.getMechanisms(), "Mechanism OIDs should round-trip");
            assertEquals(flags, parsed.getContextFlags(), "Flags should round-trip");
            assertArrayEquals(mechToken, parsed.getMechanismToken(), "Mechanism token should round-trip");
            assertArrayEquals(mic, parsed.getMechanismListMIC(), "MIC should round-trip");
    
            assertTrue(parsed.getContextFlag(NegTokenInit.DELEGATION));
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 21K bytes
    - Viewed (0)
  7. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

     * elements FIFO (first-in-first-out). The head of the queue is that element that has been
     * on the queue the longest time. The tail of the queue is that element that has been on
     * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue
     * retrieval operations obtain elements at the head of the queue.
     *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  8. src/test/java/jcifs/dcerpc/ndr/NdrShortTest.java

                assertEquals(largeValue, ndrShort.value);
            }
        }
    
        @Nested
        @DisplayName("Round-trip Tests")
        class RoundTripTests {
    
            @Test
            @DisplayName("Should handle encode-decode round-trip correctly")
            void testEncodeDecodeRoundTrip() throws NdrException {
                // Given: Original value that fits in byte range
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.2K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/cache/ReferenceEntry.java

      /** Returns the key for this entry. */
      @Nullable K getKey();
    
      /*
       * Used by entries that use access order. Access entries are maintained in a doubly-linked list.
       * New entries are added at the tail of the list at write time; stale entries are expired from
       * the head of the list.
       */
    
      /** Returns the time that this entry was last accessed, in ns. */
      @SuppressWarnings("GoodTime")
      long getAccessTime();
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Feb 11 18:34:30 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  10. src/test/java/jcifs/spnego/SpnegoTokenTest.java

            TestSpnegoToken t = new TestSpnegoToken();
            byte[] data = new byte[] { 1, 2, 3 };
            t.setMechanismToken(data);
            assertArrayEquals(data, t.getMechanismToken(), "mechanismToken should round-trip");
    
            // Document current behavior: no defensive copy (reference exposed)
            data[0] = 9;
            assertEquals(9, t.getMechanismToken()[0], "no defensive copy; reflects external mutation");
        }
    
        @Test
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.6K bytes
    - Viewed (0)
Back to top