Search Options

Results per page
Sort
Preferred Languages
Advance

Results 141 - 150 of 484 for performed (0.07 sec)

  1. src/main/java/org/codelibs/fess/app/service/JobLogService.java

         */
        public OptionalEntity<JobLog> getJobLog(final String id) {
            return jobLogBhv.selectByPK(id);
        }
    
        /**
         * Stores a job log entry in the database.
         * Performs an insert or update operation based on whether the job log already exists.
         *
         * @param jobLog the job log to store
         */
        public void store(final JobLog jobLog) {
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 6.6K bytes
    - Viewed (0)
  2. doc/go_spec.html

    the associativity of the operators.  Explicit parentheses affect the evaluation
    by overriding the default associativity.
    In the expression <code>x + (y + z)</code> the addition <code>y + z</code>
    is performed before adding <code>x</code>.
    </p>
    
    <h2 id="Statements">Statements</h2>
    
    <p>
    Statements control execution.
    </p>
    
    <pre class="ebnf">
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue May 06 19:12:15 UTC 2025
    - 286.2K bytes
    - Viewed (0)
  3. api/maven-api-core/src/main/java/org/apache/maven/api/services/Lookup.java

    public interface Lookup extends Service {
        /**
         * Performs a lookup for given typed component.
         *
         * @param type The component type.
         * @return The component.
         * @param <T> The component type.
         * @throws LookupException if no such component or there is some provisioning related issue.
         */
        @Nonnull
        <T> T lookup(Class<T> type);
    
        /**
         * Performs a lookup for given typed component.
         *
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Jan 10 12:55:54 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  4. src/test/java/jcifs/EmptyIteratorTest.java

                // When
                for (int i = 0; i < threadCount; i++) {
                    final int index = i;
                    threads[i] = new Thread(() -> {
                        // Each thread performs multiple operations
                        for (int j = 0; j < 100; j++) {
                            boolean hasNext = sharedIterator.hasNext();
                            SmbResource next = sharedIterator.next();
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 12K bytes
    - Viewed (0)
  5. CHANGELOG/CHANGELOG-1.19.md

    - Kubeadm: during join when a check is performed that a Node with the same name already exists in the cluster, make sure the NodeReady condition is properly validated ([#89602](https://github.com/kubernetes/kubernetes/pull/89602), [@kvaps](https://github.com/kvaps)) [SIG Cluster Lifecycle]
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  6. apache-maven/src/main/appended-resources/licenses/EPL-2.0.txt

    applicable law, it shall not affect the validity or enforceability of
    the remainder of the terms of this Agreement, and without further
    action by the parties hereto, such provision shall be reformed to the
    minimum extent necessary to make such provision valid and enforceable.
    
    If Recipient institutes patent litigation against any entity
    (including a cross-claim or counterclaim in a lawsuit) alleging that the
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Tue Jun 04 06:45:16 UTC 2024
    - 13.9K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/math/Quantiles.java

        int len = ints.length;
        double[] doubles = new double[len];
        for (int i = 0; i < len; i++) {
          doubles[i] = ints[i];
        }
        return doubles;
      }
    
      /**
       * Performs an in-place selection to find the element which would appear at a given index in a
       * dataset if it were sorted. The following preconditions should hold:
       *
       * <ul>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 30.1K bytes
    - Viewed (0)
  8. src/main/java/jcifs/internal/SMBSigningDigest.java

     * message integrity and authenticity using MAC (Message Authentication Code) algorithms.
     *
     * @author mbechler
     */
    public interface SMBSigningDigest {
    
        /**
         * Performs MAC signing of the SMB. This is done as follows.
         * The signature field of the SMB is overwritten with the sequence number;
         * The MD5 digest of the MAC signing key + the entire SMB is taken;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 2.5K bytes
    - Viewed (0)
  9. src/test/java/jcifs/context/CIFSContextCredentialWrapperTest.java

            wrapper = new CIFSContextCredentialWrapper(mockDelegate, mockRenewableCredentials);
            when(mockRenewableCredentials.renew()).thenReturn(mockRenewedCredentialsInternal);
    
            // Perform the renewal
            boolean renewed = wrapper.renewCredentials("locationHint", null);
    
            // Verify that renew() was called and credentials were updated
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  10. src/main/java/jcifs/internal/smb2/rdma/disni/DisniRdmaConnection.java

            if (state != RdmaConnectionState.ESTABLISHED) {
                throw new IOException("Connection not established");
            }
    
            try {
                // In real implementation, this would perform RDMA read:
                // DisniMemoryRegion disniRegion = (DisniMemoryRegion) localRegion;
                // IbvSendWR readWR = new IbvSendWR();
                // readWR.setWr_id(System.nanoTime());
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 05:11:12 UTC 2025
    - 10.2K bytes
    - Viewed (0)
Back to top