Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 155 for calculation (0.05 sec)

  1. src/test/java/jcifs/internal/smb2/io/Smb2ReadRequestTest.java

            void testVariousOffsets(long offset) {
                assertDoesNotThrow(() -> request.setOffset(offset));
            }
        }
    
        @Nested
        @DisplayName("Size Calculation Tests")
        class SizeCalculationTests {
    
            @Test
            @DisplayName("Should calculate size correctly")
            void testSize() {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/math/QuantilesTest.java

      }
    
      public void testScale_indexes_largeVarargs_compute_doubleCollection() {
        int scale = Integer.MAX_VALUE;
        int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly
        // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and
        // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part
        // (1-5/Integer.MAX_VALUE).
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 11 20:45:32 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/math/QuantilesTest.java

      }
    
      public void testScale_indexes_largeVarargs_compute_doubleCollection() {
        int scale = Integer.MAX_VALUE;
        int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly
        // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and
        // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part
        // (1-5/Integer.MAX_VALUE).
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 11 20:45:32 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  4. src/test/java/jcifs/internal/smb2/io/Smb2WriteRequestTest.java

            void testVariousRemainingBytes(int remaining) {
                assertDoesNotThrow(() -> request.setRemainingBytes(remaining));
            }
        }
    
        @Nested
        @DisplayName("Size Calculation Tests")
        class SizeCalculationTests {
    
            @Test
            @DisplayName("Should calculate size correctly with no data")
            void testSizeWithNoData() {
                request.setData(new byte[0], 0, 0);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  5. src/test/java/jcifs/internal/smb2/info/Smb2QueryDirectoryResponseTest.java

            // Even with -1, the do-while loop executes at least once due to the bug
            assertEquals(1, response.getResults().length);
        }
    
        @Test
        @DisplayName("Test readBytesWireFormat with offset calculation")
        void testReadBytesWireFormatOffsetCalculation() throws Exception {
            response = new Smb2QueryDirectoryResponse(mockConfig, Smb2QueryDirectoryRequest.FILE_BOTH_DIRECTORY_INFO);
    
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 23.5K bytes
    - Viewed (0)
  6. src/test/java/jcifs/internal/smb1/ServerMessageBlockTest.java

                String result = testBlock.readString(buffer, 0);
    
                assertEquals("Test", result);
            }
    
            @Test
            @DisplayName("Test string wire length calculation")
            void testStringWireLength() {
                testBlock.setUseUnicode(false);
                assertEquals(5, testBlock.stringWireLength("Test", 0));
    
                testBlock.setUseUnicode(true);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 36.2K bytes
    - Viewed (0)
  7. src/test/java/jcifs/internal/smb2/lock/Smb2LockRequestTest.java

                request.setFileId(secondFileId);
    
                assertDoesNotThrow(() -> request.setFileId(secondFileId));
            }
        }
    
        @Nested
        @DisplayName("Size Calculation Tests")
        class SizeCalculationTests {
    
            @Test
            @DisplayName("Should calculate size correctly with single lock")
            void testSizeWithSingleLock() {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 25.3K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/math/StatsAccumulator.java

          min = otherMin;
          max = otherMax;
        } else {
          count += otherCount;
          if (isFinite(mean) && isFinite(otherMean)) {
            // This is a generalized version of the calculation in add(double) above.
            double delta = otherMean - mean;
            mean += delta * otherCount / count;
            sumOfSquaresOfDeltas += otherSumOfSquaresOfDeltas + delta * (otherMean - mean) * otherCount;
          } else {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 15.8K bytes
    - Viewed (0)
  9. src/test/java/jcifs/netbios/NameTest.java

        }
    
        @Test
        void readWireFormat_withNonSpacePaddingCharacters_shouldPreserveLength() {
            // Test that non-space characters in padding are preserved in length calculation
            byte[] src = new byte[100];
            src[0] = 0x20;
    
            // Encode "AB" followed by non-space padding
            src[1] = 'E';
            src[2] = 'B'; // A
            src[3] = 'E';
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 19.4K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/Collections2.java

          calculateNextPermutation();
          return next;
        }
    
        void calculateNextPermutation() {
          j = list.size() - 1;
          int s = 0;
    
          // Handle the special case of an empty list. Skip the calculation of the
          // next permutation.
          if (j == -1) {
            return;
          }
    
          while (true) {
            int q = c[j] + o[j];
            if (q < 0) {
              switchDirection();
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 22.6K bytes
    - Viewed (0)
Back to top