- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 114 for hiding (0.08 sec)
-
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
// safely publish these objects and we won't need this whole discussion. // TODO(user,lukes): consider adding volatile to all these fields since in current known JVMs // that should resolve the issue. This comes at the cost of adding more write barriers to the // implementations. private Futures() {} /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 64.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
* AutoCloseable}. For users of the {@code -android} flavor, the object must be a {@code * Closeable}. (For more about the flavors, see <a * href="https://github.com/google/guava#adding-guava-to-your-build">Adding Guava to your * build</a>.) * * <p>Be careful when targeting an older SDK than you are building against (most commonly when
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 23 15:26:56 UTC 2025 - 97.8K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/ClosingFuture.java
* AutoCloseable}. For users of the {@code -android} flavor, the object must be a {@code * Closeable}. (For more about the flavors, see <a * href="https://github.com/google/guava#adding-guava-to-your-build">Adding Guava to your * build</a>.) * * <p>Be careful when targeting an older SDK than you are building against (most commonly when
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 23 15:26:56 UTC 2025 - 98.1K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/mylasta/creator/PagerCreatorTest.java
public void test_fromClassNameToComponentName() { // Test with class name ending with Pager String componentName = namingConvention.fromClassNameToComponentName("com.example.TestPager"); assertNotNull(componentName); assertEquals("testPager", componentName); // Test with class name not ending with Pager
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 13.6K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/admin/general/EditForm.java
*/ @Size(max = 1000) public String ldapBaseDn; /** * LDAP filter for finding user accounts. * Defines the search filter used to locate user accounts in LDAP. */ @Size(max = 1000) public String ldapAccountFilter; /** * LDAP filter for finding groups. * Defines the search filter used to locate groups in LDAP. */ @Size(max = 1000)
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 9.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.31.md
- [Changelog since v1.31.11](#changelog-since-v13111) - [Important Security Information](#important-security-information) - [CVE-2025-5187: Nodes can delete themselves by adding an OwnerReference](#cve-2025-5187-nodes-can-delete-themselves-by-adding-an-ownerreference) - [Changes by Kind](#changes-by-kind) - [Feature](#feature) - [Bug or Regression](#bug-or-regression) - [Dependencies](#dependencies) - [Added](#added)
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Aug 13 19:49:57 UTC 2025 - 429.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/thumbnail/impl/BaseThumbnailGeneratorTest.java
} public void test_addCondition() { // Test adding conditions generator = new TestThumbnailGenerator(); // Test adding single condition generator.addCondition("field1", "value1"); // Test adding multiple conditions for same field generator.addCondition("field1", "value2"); // Test adding conditions for different fields
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 6.1K bytes - Viewed (0)