Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for 20L (0.01 seconds)

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

  1. src/test/java/jcifs/smb/FileEntryTest.java

            FileEntry e = new TestFileEntry("doc.pdf", 2, 0x10, 10L, 20L, 30L, 4096L, 3);
    
            // Act & Assert: getters return exactly what was provided
            assertAll(() -> assertEquals("doc.pdf", e.getName()), () -> assertEquals(2, e.getType()),
                    () -> assertEquals(0x10, e.getAttributes()), () -> assertEquals(10L, e.createTime()),
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 10K bytes
    - Click Count (0)
  2. okhttp/src/jvmTest/kotlin/okhttp3/HeadersJvmTest.kt

            .byteCount(),
        ).isEqualTo(10L)
        assertThat(
          Headers
            .Builder()
            .add("abc", "def")
            .add("ghi", "jkl")
            .build()
            .byteCount(),
        ).isEqualTo(20L)
      }
    
      @Test fun addDate() {
        val expected = Date(0L)
        val headers =
          Headers
            .Builder()
            .add("testDate", expected)
            .build()
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Tue May 27 14:51:25 GMT 2025
    - 5.7K bytes
    - Click Count (0)
  3. src/test/java/org/codelibs/fess/suggest/entity/SuggestItemTest.java

            // Test getUpdatedSource method
            String[] text = { "test" };
            String[][] readings = { { "test" } };
            SuggestItem item = new SuggestItem(text, readings, null, 10L, 20L, 1.0f, null, null, null, SuggestItem.Kind.QUERY);
    
            Map<String, Object> existingSource = new HashMap<>();
            existingSource.put(FieldNames.QUERY_FREQ, 5L);
            existingSource.put(FieldNames.DOC_FREQ, 10L);
    Created: Sat Dec 20 13:04:59 GMT 2025
    - Last Modified: Mon Sep 01 13:33:03 GMT 2025
    - 16.7K bytes
    - Click Count (0)
Back to Top