Search Options

Results per page
Sort
Preferred Languages
Advance

Results 271 - 280 of 887 for Available (0.04 sec)

  1. android/guava/src/com/google/common/cache/Striped64.java

       * needed.
       *
       * A single spinlock ("busy") is used for initializing and
       * resizing the table, as well as populating slots with new Cells.
       * There is no need for a blocking lock; when the lock is not
       * available, threads try other slots (or the base).  During these
       * retries, there is increased contention and reduced locality,
       * which is still better than alternatives.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Jan 15 22:17:15 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  2. cmd/admin-handlers-idp-config.go

    	if objectAPI == nil {
    		return
    	}
    
    	if r.ContentLength > maxEConfigJSONSize || r.ContentLength == -1 {
    		// More than maxConfigSize bytes were available
    		writeErrorResponseJSON(ctx, w, errorCodes.ToAPIErr(ErrAdminConfigTooLarge), r.URL)
    		return
    	}
    
    	// Ensure body content type is opaque to ensure that request body has not
    	// been interpreted as form data.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Feb 18 16:25:55 UTC 2025
    - 12.7K bytes
    - Viewed (0)
  3. cmd/prepare-storage.go

    		case errors.Is(err, errErasureReadQuorum):
    			// no quorum available continue to wait for minimum number of servers.
    			logger.Info("Waiting for a minimum of %d drives to come online (elapsed %s)\n",
    				len(endpoints)/2, getElapsedTime())
    		case errors.Is(err, errErasureWriteQuorum):
    			// no quorum available continue to wait for minimum number of servers.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Jul 12 20:51:54 UTC 2024
    - 11.1K bytes
    - Viewed (1)
  4. SECURITY.md

    ### Saved graphs and checkpoints
    
    When loading untrusted serialized computation graphs (in form of a `GraphDef`,
    `SavedModel`, or equivalent on-disk format), the set of computation primitives
    available to TensorFlow is powerful enough that you should assume that the
    TensorFlow process effectively executes arbitrary code.
    
    The risk of loading untrusted checkpoints depends on the code or graph that you
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Wed Oct 16 16:10:43 UTC 2024
    - 9.6K bytes
    - Viewed (0)
  5. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataSource.java

    import java.util.List;
    
    import org.apache.maven.artifact.repository.ArtifactRepository;
    
    /**
     * Provides some metadata operations, like querying the remote repository for a list of versions available for an
     * artifact.
     *
     */
    @Deprecated
    public interface MetadataSource {
        String ROLE = MetadataSource.class.getName();
    
        MetadataResolution retrieve(
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 1.3K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/fess/job/PingSearchEngineJob.java

            } else if (status == 0) {
                resultBuf.append(ping.getClusterName()).append(" is alive.");
            } else {
                resultBuf.append(ping.getClusterName()).append(" is not available.");
            }
    
            return resultBuf.toString();
        }
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 4.4K bytes
    - Viewed (0)
  7. src/main/java/jcifs/internal/smb1/net/NetShareEnum.java

    import jcifs.internal.util.SMBUtil;
    
    /**
     * SMB1 NetShareEnum request message for enumerating network shares on a server.
     * This class implements the SMB1 transaction to retrieve a list of available shares
     * from the target server, including share names, types, and descriptions.
     */
    public class NetShareEnum extends SmbComTransaction {
    
        private static final String DESCR = "WrLeh\u0000B13BWz\u0000";
    
        /**
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 3.3K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/app/service/UserService.java

            cb.query().addOrderBy_Name_Asc();
    
            // search
    
        }
    
        /**
         * Retrieves a list of all available users in the system.
         * Returns up to the maximum configured number of users.
         *
         * @return a list of all available users
         */
        public List<User> getAvailableUserList() {
            return userBhv.selectList(cb -> {
                cb.query().matchAll();
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 6.7K bytes
    - Viewed (0)
  9. src/test/java/jcifs/internal/smb2/multichannel/MultiChannelIntegrationTest.java

                loadBalancer.setStrategy(strategy);
                assertEquals(strategy, loadBalancer.getStrategy());
            }
    
            // Test channel selection with mock request when no channels available
            ServerMessageBlock2Request mockRequest = mock(ServerMessageBlock2Request.class);
            when(mockRequest.getTreeId()).thenReturn(123);
    
            // Should throw NoAvailableChannelException when no healthy channels
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 21 11:13:46 UTC 2025
    - 8.2K bytes
    - Viewed (0)
  10. docs/metrics/prometheus/list.md

    |:-------------------------------|:------------------------------------------|
    | `minio_node_mem_available`     | Available memory on the node.             |
    | `minio_node_mem_available_avg` | Available memory on the node (avg).       |
    | `minio_node_mem_available_max` | Available memory on the node (max).       |
    | `minio_node_mem_buffers`       | Buffers memory on the node.               |
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 43.4K bytes
    - Viewed (0)
Back to top