Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1421 - 1430 of 1,554 for field (0.02 seconds)

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

  1. android/guava-tests/test/com/google/common/io/MoreFilesTest.java

                // this test is mainly checking that the contents of /dontdelete aren't deleted under
                // any circumstances
                assertEquals(3, MoreFiles.listFiles(symlinkTarget).size());
    
                Thread.yield();
              }
            } finally {
              executor.shutdownNow();
            }
    
            switcher.get(); // to check for (extremely unlikely) exceptions
          }
        }
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 19:26:39 GMT 2026
    - 26.6K bytes
    - Click Count (0)
  2. src/test/java/jcifs/smb1/smb1/AndXServerMessageBlockTest.java

            assertEquals((byte) 0xFF, buf[1]);
            assertNull(block.andx, "andx should be cleared when batching prevented");
        }
    
        @Test
        @DisplayName("writeAndXWireFormat chains non-AndX SMB and propagates header fields")
        void testWriteAndXWireFormatChainsPlainSMB() {
            DummyPlainSMB next = new DummyPlainSMB();
            DummyAndXBlock block = new DummyAndXBlock(next);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 12.5K bytes
    - Click Count (0)
  3. docs/ja/docs/tutorial/middleware.md

    * 次に、アプリケーションの残りの部分に**リクエスト**を渡して (*path operation* によって) 処理させます。
    * 次に、ミドルウェアはアプリケーション (の *path operation*) によって生成された**レスポンス**を受け取ります。
    * その**レスポンス**に対して何かを実行したり、必要なコードを実行したりできます。
    * そして、**レスポンス**を返します。
    
    /// note | 技術詳細
    
    `yield` を使った依存関係をもつ場合は、終了コードはミドルウェアの *後に* 実行されます。
    
    バックグラウンドタスク ([バックグラウンドタスク](background-tasks.md) セクションで説明します。後で確認できます) がある場合は、それらは全てのミドルウェアの *後に* 実行されます。
    
    ///
    
    ## ミドルウェアの作成 { #create-a-middleware }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:07:17 GMT 2026
    - 5.2K bytes
    - Click Count (0)
  4. src/bytes/reader_test.go

    			defer wg.Done()
    			var buf [1]byte
    			r.ReadAt(buf[:], int64(i))
    		}(i)
    	}
    	wg.Wait()
    }
    
    func TestEmptyReaderConcurrent(t *testing.T) {
    	// Test for the race detector, to verify a Read that doesn't yield any bytes
    	// is okay to use from multiple goroutines. This was our historic behavior.
    	// See golang.org/issue/7856
    	r := NewReader([]byte{})
    	var wg sync.WaitGroup
    	for i := 0; i < 5; i++ {
    		wg.Add(2)
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Dec 13 18:45:54 GMT 2021
    - 8K bytes
    - Click Count (0)
  5. README.md

        .setRoles(new String[]{"user"})         // filter by roles  
        .setLanguages(new String[]{"en", "ja"}) // language preference
        .setFields(new String[]{"title"})       // search specific fields
        .execute()
        .getResponse();
    ```
    
    ## Project Structure
    
    ```
    src/
    ├── main/java/org/codelibs/fess/suggest/
    │   ├── Suggester.java              # Main suggester API
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sun Aug 31 03:31:14 GMT 2025
    - 12.1K bytes
    - Click Count (1)
  6. src/test/java/org/codelibs/fess/entity/FessUserTest.java

            // Verify the interface extends Serializable
            assertTrue(user instanceof java.io.Serializable);
        }
    
        @Test
        public void test_allFieldsCombination() {
            // Test with all fields populated
            String name = "complexUser";
            String[] roles = { "admin", "user", "viewer" };
            String[] groups = { "developers", "managers", "qa" };
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Jan 11 08:43:05 GMT 2026
    - 11.2K bytes
    - Click Count (0)
  7. docs/contribute/concurrency.md

    We have 3 different things that we synchronize on.
    
    #### Http2Connection
    
    This lock guards internal state of each connection. This lock is never held for blocking operations. That means that we acquire the lock, read or write a few fields and release the lock. No I/O and no application-layer callbacks.
    
    #### Http2Stream
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Feb 06 16:35:36 GMT 2022
    - 7K bytes
    - Click Count (0)
  8. okhttp/src/jvmTest/kotlin/okhttp3/FastFallbackTest.kt

            localhostIpv6,
            TestUtil.UNREACHABLE_ADDRESS_IPV4.address,
          )
        serverIpv4.protocols = listOf(Protocol.H2_PRIOR_KNOWLEDGE)
        serverIpv6.protocols = listOf(Protocol.H2_PRIOR_KNOWLEDGE)
    
        // Yield the first IP address so the second IP address completes first.
        val firstConnectLatch = CountDownLatch(1)
        val socketFactory =
          object : DelegatingSocketFactory(SocketFactory.getDefault()) {
            var first = true
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Nov 04 19:13:52 GMT 2025
    - 10.6K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/CompactLinkedHashSet.java

      }
    
      private static final int ENDPOINT = -2;
    
      // TODO(user): predecessors and successors should be collocated (reducing cache misses).
      // Might also explore collocating all of [hash, next, predecessor, successor] fields of an
      // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2
    
      /**
       * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Aug 06 14:59:07 GMT 2025
    - 9.4K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/CompactLinkedHashSet.java

      }
    
      private static final int ENDPOINT = -2;
    
      // TODO(user): predecessors and successors should be collocated (reducing cache misses).
      // Might also explore collocating all of [hash, next, predecessor, successor] fields of an
      // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2
    
      /**
       * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Aug 06 14:59:07 GMT 2025
    - 9.6K bytes
    - Click Count (0)
Back to Top