Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 42 for optimization (0.04 sec)

  1. src/main/java/jcifs/smb/SmbFileInputStream.java

                }
    
                final int type = this.file.getType();
                int r, n;
                final int blockSize = type == SmbConstants.TYPE_FILESYSTEM ? this.readSizeFile : this.readSize;
    
                // Optimization: Use larger block sizes for better performance
                final int optimizedBlockSize = Math.min(blockSize * 2, 64 * 1024); // Cap at 64KB for memory efficiency
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 15.6K bytes
    - Viewed (0)
  2. src/main/java/jcifs/audit/SecurityAuditLogger.java

        private static final Pattern IP_PATTERN = Pattern.compile("\\b(?:[0-9]{1,3}\\.){3}[0-9]{1,3}\\b");
    
        // Object pools for performance optimization
        private final Queue<AuditEntry> auditEntryPool = new ConcurrentLinkedQueue<>();
        private final Queue<StringBuilder> stringBuilderPool = new ConcurrentLinkedQueue<>();
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 26.6K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/RegularImmutableMap.java

            entry != null;
            entry = entry.getNextInKeyBucket()) {
          Object candidateKey = entry.getKey();
    
          /*
           * Assume that equals uses the == optimization when appropriate, and that
           * it would check hash codes as an optimization when appropriate. If we
           * did these things, it would just make things worse for the most
           * performance-conscious users.
           */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 15.8K bytes
    - Viewed (0)
  4. cmd/config.go

    	_, err := objAPI.DeleteObject(ctx, minioMetaBucket, historyFile, ObjectOptions{
    		DeletePrefix:       true,
    		DeletePrefixObject: true, // use prefix delete on exact object (this is an optimization to avoid fan-out calls)
    	})
    	return err
    }
    
    func readServerConfigHistory(ctx context.Context, objAPI ObjectLayer, uuidKV string) ([]byte, error) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 5.9K bytes
    - Viewed (0)
  5. src/test/java/org/codelibs/fess/exception/UserRoleLoginExceptionTest.java

            assertEquals("org.codelibs.fess.app.web.RootAction", actionClass.getName());
        }
    
        public void test_fillInStackTrace() {
            // Test fillInStackTrace returns null for performance optimization
            UserRoleLoginException exception = new UserRoleLoginException(RootAction.class);
            Throwable result = exception.fillInStackTrace();
            assertNull(result);
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 4.8K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/primitives/UnsignedLongs.java

          if (compare(dividend, divisor) < 0) {
            return 0; // dividend < divisor
          } else {
            return 1; // dividend >= divisor
          }
        }
    
        // Optimization - use signed division if dividend < 2^63
        if (dividend >= 0) {
          return dividend / divisor;
        }
    
        /*
         * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 17.8K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/Graphs.java

        if (numEdges == 0) {
          return false; // An edge-free graph is acyclic by definition.
        }
        if (!graph.isDirected() && numEdges >= graph.nodes().size()) {
          return true; // Optimization for the undirected case: at least one cycle must exist.
        }
    
        Map<Object, NodeVisitState> visitedNodes =
            Maps.newHashMapWithExpectedSize(graph.nodes().size());
        for (N node : graph.nodes()) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/Graphs.java

        if (numEdges == 0) {
          return false; // An edge-free graph is acyclic by definition.
        }
        if (!graph.isDirected() && numEdges >= graph.nodes().size()) {
          return true; // Optimization for the undirected case: at least one cycle must exist.
        }
    
        Map<Object, NodeVisitState> visitedNodes =
            Maps.newHashMapWithExpectedSize(graph.nodes().size());
        for (N node : graph.nodes()) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb/SmbFile.java

         */
        @Override
        public synchronized void close() {
            final SmbTreeHandleImpl th = this.treeHandle;
            if (th != null) {
                this.treeHandle = null;
    
                // Optimization: For non-strict lifecycle, delay tree handle closure
                // to allow connection reuse for subsequent operations
                if (this.transportContext.getConfig().isStrictResourceLifecycle()) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 103.2K bytes
    - Viewed (0)
  10. cmd/erasure-server-pool.go

    		// from older format, for older format we will rewrite them as
    		// newer using PutObject() - this is an optimization to save space
    		if dstOpts.Versioned && srcOpts.VersionID != dstOpts.VersionID && !srcInfo.Legacy {
    			// CopyObject optimization where we don't create an entire copy
    			// of the content, instead we add a reference.
    			srcInfo.versionOnly = true
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 89.1K bytes
    - Viewed (0)
Back to top