- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 80 for hiding (0.06 seconds)
-
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() {} /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 19:26:39 GMT 2026 - 64.2K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
* the {@link ExecutionException} thrown by {@link Future#get()} on the {@link Future} * underlying this step or, if {@code get()} throws a different kind of exception, that * exception itself. To avoid hiding bugs and other unrecoverable errors, callers should * prefer more specific types, avoiding {@code Throwable.class} in particular.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 101.7K bytes - Click Count (0) -
docs/en/docs/release-notes.md
* Allow having empty paths in *path operations* used with `include_router` and a `prefix`. * This allows having a router for `/cats` and all its *path operations*, while having one of them for `/cats`. * Now it doesn't have to be only `/cats/` (with a trailing slash).Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0) -
CONTRIBUTING.md
### Additional help If you run into any trouble, please reach out to us on the issue you are working on. There is a `#contributing` channel on the community Slack which you can use to ask any questions. ## Finding issues to work on If you are looking for good first issues, take a look at the list of [good first issues](https://github.com/gradle/gradle/labels/good%20first%20issue) that should be actionable and ready for a contribution.
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Fri Mar 27 18:43:39 GMT 2026 - 19.1K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/mylasta/creator/PagerCreatorTest.java
@Test 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 PagerCreated: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 13.7K bytes - Click Count (0) -
CONTRIBUTING.md
are working on. And as mentioned above, API changes should be discussed thoroughly before moving to code. Some examples of types of pull requests that are immediately helpful: - Fixing a bug without changing a public API. - Fixing or improving documentation. - Improvements to Maven configuration. Guidelines for any code contributions: 1. Any significant changes should be accompanied by tests. The project already
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 18 17:53:05 GMT 2026 - 4.3K bytes - Click Count (0) -
docs/en/docs/management-tasks.md
* Edit the text of the PR title to start in "imperative", like giving an order. So, instead of `Adding support for teleporting` use `Add support for teleporting`.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Mon Mar 23 13:59:26 GMT 2026 - 10.7K bytes - Click Count (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)Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Mar 26 02:24:08 GMT 2026 - 15.8K bytes - Click Count (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();Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 24.4K bytes - Click Count (0) -
RELEASE.md
* Fixes an undefined behavior arising from reference binding to nullptr in `RaggedTensorToSparse` ([CVE-2021-37656](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-37656)) * Fixes an undefined behavior arising from reference binding to nullptr in `MatrixDiagV*` ops ([CVE-2021-37657](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-37657))Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3)