Search Options

Results per page
Sort
Preferred Languages
Advance

Results 841 - 850 of 2,937 for rint (0.04 sec)

  1. src/main/java/jcifs/util/ByteEncodable.java

        private final byte[] bytes;
        private final int off;
        private final int len;
    
        /**
         * Constructs a ByteEncodable object wrapping a byte array segment.
         *
         * @param b the byte array to wrap
         * @param off the offset in the byte array
         * @param len the length of the segment to use
         */
        public ByteEncodable(final byte[] b, final int off, final int len) {
            this.bytes = b;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 1.9K bytes
    - Viewed (0)
  2. src/main/java/jcifs/smb1/ntlmssp/Type3Message.java

                }
                final int workstationLength = workstation != null ? workstation.length : 0;
                final byte[] lmResponse = getLMResponse();
                final int lmLength = lmResponse != null ? lmResponse.length : 0;
                final byte[] ntResponse = getNTResponse();
                final int ntLength = ntResponse != null ? ntResponse.length : 0;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 24.1K bytes
    - Viewed (0)
  3. src/main/java/jcifs/netbios/NameServiceClientImpl.java

                return doNameQuery(name, svr);
            }
    
            int IP = 0x00;
            int hitDots = 0;
            final char[] data = host.toCharArray();
    
            for (int i = 0; i < data.length; i++) {
                char c = data[i];
                if (c < 48 || c > 57) {
                    return doNameQuery(name, svr);
                }
                int b = 0x00;
                while (c != '.') {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 38.5K bytes
    - Viewed (0)
  4. src/test/java/jcifs/internal/smb2/Smb2CancelRequestTest.java

            // Given
            Smb2CancelRequest request = new Smb2CancelRequest(mockConfig, 1L, 0L);
    
            // When
            int size = request.size();
    
            // Then
            // Size should be aligned to 8 bytes: SMB2_HEADER_LENGTH + 4 bytes for cancel structure
            int expectedSize = ((Smb2Constants.SMB2_HEADER_LENGTH + 4 + 7) / 8) * 8;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 9.8K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/graph/GraphMutationTest.java

    @RunWith(JUnit4.class)
    
    @NullUnmarked
    public final class GraphMutationTest {
      private static final int NUM_TRIALS = 50;
      private static final int NUM_NODES = 100;
      private static final int NUM_EDGES = 1000;
      private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES
    
      @Test
      public void directedGraph() {
        testGraphMutation(GraphBuilder.directed());
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.2K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java

       * we change the rate.
       */
      public void testWeNeverGetABurstMoreThanOneSec() {
        RateLimiter limiter = RateLimiter.create(1.0, stopwatch);
        int[] rates = {1000, 1, 10, 1000000, 10, 1};
        for (int rate : rates) {
          int oneSecWorthOfWork = rate;
          stopwatch.sleepMillis(rate * 1000);
          limiter.setRate(rate);
          long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 21.9K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java

       * we change the rate.
       */
      public void testWeNeverGetABurstMoreThanOneSec() {
        RateLimiter limiter = RateLimiter.create(1.0, stopwatch);
        int[] rates = {1000, 1, 10, 1000000, 10, 1};
        for (int rate : rates) {
          int oneSecWorthOfWork = rate;
          stopwatch.sleepMillis(rate * 1000);
          limiter.setRate(rate);
          long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 21.9K bytes
    - Viewed (0)
  8. src/test/java/jcifs/internal/smb1/ServerMessageBlockTest.java

            @Override
            protected int writeParameterWordsWireFormat(byte[] dst, int dstIndex) {
                paramWordsWritten = 10;
                return paramWordsWritten;
            }
    
            @Override
            protected int writeBytesWireFormat(byte[] dst, int dstIndex) {
                bytesWritten = 20;
                return bytesWritten;
            }
    
            @Override
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 36.2K bytes
    - Viewed (0)
  9. tensorflow/c/c_api_experimental.cc

    int TF_CheckpointReaderHasTensor(TF_CheckpointReader* reader,
                                     const char* name) {
      return reader->HasTensor(name);
    }
    
    const char* TF_CheckpointReaderGetVariable(TF_CheckpointReader* reader,
                                               int index) {
      return reader->variable_list[index].c_str();
    }
    
    int TF_CheckpointReaderSize(TF_CheckpointReader* reader) {
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 03:53:25 UTC 2025
    - 29.5K bytes
    - Viewed (0)
  10. docs/debugging/hash-set/main.go

    // in the slices returned.
    func hashOrder(key string, cardinality int) []int {
    	if cardinality <= 0 {
    		// Returns an empty int slice for cardinality < 0.
    		return nil
    	}
    
    	nums := make([]int, cardinality)
    	keyCrc := crc32.Checksum([]byte(key), crc32.IEEETable)
    
    	start := int(keyCrc % uint32(cardinality))
    	for i := 1; i <= cardinality; i++ {
    		nums[i-1] = 1 + ((start + i) % cardinality)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 3.7K bytes
    - Viewed (0)
Back to top