Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 257 for France (0.15 sec)

  1. compat/maven-compat/src/main/java/org/apache/maven/artifact/manager/DefaultWagonManager.java

    @Deprecated
    public class DefaultWagonManager extends org.apache.maven.repository.legacy.DefaultWagonManager
            implements WagonManager {
    
        // NOTE: This must use a different field name than in the super class or IoC has no chance to inject the loggers
        @Inject
        private Logger log;
    
        @Inject
        private LegacySupport legacySupport;
    
        @Inject
        private SettingsDecrypter settingsDecrypter;
    
        @Inject
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 6.5K bytes
    - Viewed (0)
  2. README.md

    ### Development Workflow
    1. **Fork** the repository on GitHub
    2. **Create** your feature branch: `git checkout -b feature/amazing-feature`
    3. **Follow** the coding standards: `mvn formatter:format`
    4. **Add** comprehensive tests for new functionality
    5. **Commit** your changes: `git commit -m 'Add amazing feature'`
    6. **Push** to the branch: `git push origin feature/amazing-feature`
    7. **Submit** a Pull Request with detailed description
    
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Sun Aug 31 02:56:02 UTC 2025
    - 12.7K bytes
    - Viewed (0)
  3. okhttp/src/jvmTest/kotlin/okhttp3/internal/ws/WebSocketReaderTest.kt

          assertThat(expected.message)
            .isEqualTo("Code must be in range [1000,5000): 1")
        }
        data.write("88021388".decodeHex()) // Close with code 5000
        assertFailsWith<ProtocolException> {
          clientReader.processNextFrame()
        }.also { expected ->
          assertThat(expected.message)
            .isEqualTo("Code must be in range [1000,5000): 5000")
        }
      }
    
      @Test fun closeReservedSetThrows() {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 14.4K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

      int max;
    
      static AtomicLong requests = new AtomicLong(0);
      static AtomicLong misses = new AtomicLong(0);
    
      @BeforeExperiment
      void setUp() {
        // random integers will be generated in this range, then raised to the
        // power of (1/concentration) and floor()ed
        max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration));
    
        cache =
            CacheBuilder.newBuilder()
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  5. src/main/java/jcifs/internal/smb2/lock/Smb2LockRequest.java

    import jcifs.internal.smb2.ServerMessageBlock2Request;
    import jcifs.internal.smb2.Smb2Constants;
    import jcifs.internal.util.SMBUtil;
    
    /**
     * SMB2 Lock request message. This command is used to request byte-range locks
     * on portions of a file.
     *
     * @author mbechler
     *
     */
    public class Smb2LockRequest extends ServerMessageBlock2Request<Smb2LockResponse> implements RequestWithFileId {
    
        private int lockSequenceNumber;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 3.8K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/primitives/Longs.java

       * constraining a {@code long} input to an {@code int} range.
       *
       * @param value the {@code long} value to constrain
       * @param min the lower bound (inclusive) of the range to constrain {@code value} to
       * @param max the upper bound (inclusive) of the range to constrain {@code value} to
       * @throws IllegalArgumentException if {@code min > max}
       * @since 21.0
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.1K bytes
    - Viewed (0)
  7. src/test/java/jcifs/smb/SmbResourceLocatorImplTest.java

            NetbiosAddress nb = mock(NetbiosAddress.class);
            when(addr.unwrap(NetbiosAddress.class)).thenReturn(nb);
            when(nb.getNameType()).thenReturn(0x1d); // workgroup code
            // getFirstAddress branch: host given and path non-root -> possibleNTDomain=false
            when(nsc.getAllByName(eq("server"), eq(false))).thenReturn(new Address[] { addr });
            SmbResourceLocatorImpl workgroupLike = locator("smb://server/");
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 17.6K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java

          putNext(this, next);
        }
    
        void unpark() {
          // This is racy with removeWaiter. The consequence of the race is that we may spuriously call
          // unpark even though the thread has already removed itself from the list. But even if we did
          // use a CAS, that race would still exist (it would just be ever so slightly smaller).
          Thread w = thread;
          if (w != null) {
            thread = null;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 33.2K bytes
    - Viewed (0)
  9. src/main/java/jcifs/internal/smb1/net/NetShareEnumResponse.java

                off = (off & 0xFFFF) - this.converter;
                off = start + off;
                e.remark = readString(buffer, off, 128, false);
    
                if (log.isTraceEnabled()) {
                    log.trace(e.toString());
                }
            }
            setResults(results);
    
            return bufferIndex - start;
        }
    
        @Override
        public String toString() {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 4K bytes
    - Viewed (0)
  10. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

          }
          return BigInteger.valueOf(result);
        }
    
        /*
         * We want each multiplication to have both sides with approximately the same number of digits.
         * Currently, we just divide the range in half.
         */
        int mid = (n1 + n2) >>> 1;
        return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
      }
    
      @Benchmark
      int slowFactorial(int reps) {
        int tmp = 0;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
Back to top