- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 199 for algorithm (0.1 sec)
-
src/main/java/org/codelibs/fess/app/web/admin/dict/stemmeroverride/EditForm.java
* This form extends CreateForm to include fields necessary for updating existing stemmer override entries. * Stemmer overrides define custom stemming rules that take precedence over the default stemming algorithm. * */ public class EditForm extends CreateForm { /** * Creates a new EditForm instance. */ public EditForm() { super(); } /**
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 1.8K bytes - Viewed (0) -
src/main/java/jcifs/internal/dtyp/ACE.java
* based on these entries. * <p> * To fully understand the information exposed by this class a description * of the access check algorithm used by Windows is required. The following * is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 5.6K bytes - Viewed (0) -
cmd/sftp-server.go
found = true break } } if !found { logger.Fatal(fmt.Errorf("unknown algorithm %q passed to --sftp=%s\nValid algorithms: %v", algo, arg, strings.Join(allowed, ", ")), "unable to start SFTP server") } } if len(filteredAlgos) == 0 { logger.Fatal(fmt.Errorf("no valid algorithms passed to --sftp=%s\nValid algorithms: %v", arg, strings.Join(allowed, ", ")), "unable to start SFTP server") } return filteredAlgos }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 16.5K bytes - Viewed (0) -
src/test/java/jcifs/smb/compression/CompressionNegotiateContextTest.java
} @Test @DisplayName("Test supported algorithms") public void testSupportedAlgorithms() { int[] algorithms = context.getCompressionAlgorithms(); assertNotNull(algorithms); assertEquals(3, algorithms.length); assertTrue(context.supportsAlgorithm(CompressionNegotiateContext.COMPRESSION_LZ77));
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 5.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SigningDigest.java
* * @param macSigningKey the MAC signing key for message authentication * @param bypass whether to bypass MAC signing * @throws SmbException if MD5 algorithm is not available */ public SigningDigest(final byte[] macSigningKey, final boolean bypass) throws SmbException { try { digest = MessageDigest.getInstance("MD5");
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 7.9K bytes - Viewed (0) -
src/main/java/jcifs/ACE.java
* based on these entries. * <p> * To fully understand the information exposed by this class a description * of the access check algorithm used by Windows is required. The following * is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 7.1K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
* based on these entries. * <p> * To fully understand the information exposed by this class a description * of the access check algorithm used by Windows is required. The following * is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * topological sort) that only need a way of accessing the predecessors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction); * } *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction); * } *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
docs/bucket/versioning/DESIGN.md
"X-Minio-Internal-Server-Side-Encryption-Seal-Algorithm": "REFSRXYyLUhNQUMtU0hBMjU2", "X-Minio-Internal-Server-Side-Encryption-Iv": "bW5YRDhRUGczMVhkc2pJT1V1UVlnbWJBcndIQVhpTUN1dnVBS0QwNUVpaz0=",
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Jul 17 15:43:14 UTC 2022 - 5.8K bytes - Viewed (0)