Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 92 for Optimization (0.06 sec)

  1. guava/src/com/google/common/hash/LittleEndianByteArray.java

           * crashes on Android when running in 32-bit mode. For maximum safety, we shouldn't use
           * Unsafe.getLong() at all, but the performance benefit on x86_64 is too great to ignore, so
           * as a compromise, we enable the optimization only on platforms that we specifically know to
           * work.
           *
           * In the future, the use of Unsafe.getLong() should be replaced by ByteBuffer.getLong(),
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 12 03:49:18 UTC 2025
    - 12.3K bytes
    - Viewed (0)
  2. 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)
  3. 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)
  4. guava/src/com/google/common/base/Joiner.java

         *
         * We could consider recognizing specific other collections as safe (like ImmutableCollection,
         * except ContiguousSet!) or as not worth this optimization (CopyOnWriteArrayList?).
         */
        if (parts instanceof List) {
          int size = ((List<?>) parts).size();
          if (size == 0) {
            return "";
          }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 15:16:19 UTC 2025
    - 21K bytes
    - Viewed (0)
  5. 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)
  6. configure.py

        return curr_version
    
      print('You have bazel %s installed.' % curr_version)
      return curr_version
    
    
    def set_cc_opt_flags(environ_cp):
      """Set up architecture-dependent optimization flags.
    
      Also append CC optimization flags to bazel.rc..
    
      Args:
        environ_cp: copy of the os.environ.
      """
      if is_ppc64le():
        # gcc on ppc64le does not support -march, use mcpu instead
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Wed Apr 30 15:18:54 UTC 2025
    - 48.3K bytes
    - Viewed (0)
  7. README.md

    *   [TensorFlow Twitter](https://twitter.com/tensorflow)
    *   [TensorFlow YouTube](https://www.youtube.com/channel/UC0rqucBdTuFTjJiefW5t-IQ)
    *   [TensorFlow model optimization roadmap](https://www.tensorflow.org/model_optimization/guide/roadmap)
    *   [TensorFlow White Papers](https://www.tensorflow.org/about/bib)
    *   [TensorBoard Visualization Toolkit](https://github.com/tensorflow/tensorboard)
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Fri Jul 18 14:09:03 UTC 2025
    - 11.6K bytes
    - Viewed (0)
  8. 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)
  9. cmd/object-api-datatypes.go

    		ts.NumObjects = 1
    	}
    	return ts
    }
    
    // ToObjectInfo converts a replication object info to a partial ObjectInfo
    // do not rely on this function to give you correct ObjectInfo, this
    // function is merely and optimization.
    func (ri ReplicateObjectInfo) ToObjectInfo() ObjectInfo {
    	return ObjectInfo{
    		Name:                       ri.Name,
    		Bucket:                     ri.Bucket,
    		VersionID:                  ri.VersionID,
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 21.2K bytes
    - Viewed (0)
  10. cmd/metacache-walk.go

    	// Limit the number of returned objects if > 0.
    	Limit int
    
    	// DiskID contains the disk ID of the disk.
    	// Leave empty to not check disk ID.
    	DiskID string
    }
    
    // supported FS for Nlink optimization in readdir.
    const (
    	xfs  = "XFS"
    	ext4 = "EXT4"
    )
    
    // WalkDir will traverse a directory and return all entries found.
    // On success a sorted meta cache stream will be returned.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon May 26 07:06:43 UTC 2025
    - 12.6K bytes
    - Viewed (0)
Back to top