Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for dividend (0.11 seconds)

  1. src/main/webapp/css/bootstrap.min.css.map

    !default;\n\n// Cache $rfs-base-value unit\n$rfs-base-value-unit: unit($rfs-base-value);\n\n@function divide($dividend, $divisor, $precision: 10) {\n  $sign: if($dividend > 0 and $divisor > 0 or $dividend < 0 and $divisor < 0, 1, -1);\n  $dividend: abs($dividend);\n  $divisor: abs($divisor);\n  @if $dividend == 0 {\n    @return 0;\n  }\n  @if $divisor == 0 {\n    @error \"Cannot divide by 0\";\n  }\n  $remainder: $dividend;\n  $result: 0;\n  $factor: 10;\n  @while ($remainder > 0 and $precision >= 0) {\n    $quotient:...
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Sun Jan 12 06:14:02 GMT 2025
    - 575.5K bytes
    - Click Count (0)
  2. src/main/webapp/css/admin/bootstrap.min.css.map

    $rfs-base-font-size unit\n$rfs-base-font-size-unit: unit($rfs-base-font-size);\n\n@function divide($dividend, $divisor, $precision: 10) {\n  $sign: if($dividend > 0 and $divisor > 0 or $dividend < 0 and $divisor < 0, 1, -1);\n  $dividend: abs($dividend);\n  $divisor: abs($divisor);\n  @if $dividend == 0 {\n    @return 0;\n  }\n  @if $divisor == 0 {\n    @error \"Cannot divide by 0\";\n  }\n  $remainder: $dividend;\n  $result: 0;\n  $factor: 10;\n  @while ($remainder > 0 and $precision >= 0) {\n    $quotient:...
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 639.3K bytes
    - Click Count (1)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    to compute (y * q) / 2ᵈ, rounded to nearest integer, with 1/2 // rounding up (see FIPS 203, Section 2.3). dividend := uint32(y) * q quotient := dividend >> d // (y * q) / 2ᵈ // The d'th least-significant bit of the dividend (the most significant bit // of the remainder) is 1 for the top half of the values that divide to the // same quotient, which are the ones that round up. quotient += dividend >> (d - 1) & 1 // quotient is at most (2¹¹-1) * q / 2¹¹ + 1 = 3328, so it didn't overflow. return fieldElement(quotient)...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.1.0-rc1.zip

    to compute (y * q) / 2ᵈ, rounded to nearest integer, with 1/2 // rounding up (see FIPS 203, Section 2.3). dividend := uint32(y) * q quotient := dividend >> d // (y * q) / 2ᵈ // The d'th least-significant bit of the dividend (the most significant bit // of the remainder) is 1 for the top half of the values that divide to the // same quotient, which are the ones that round up. quotient += dividend >> (d - 1) & 1 // quotient is at most (2¹¹-1) * q / 2¹¹ + 1 = 3328, so it didn't overflow. return fieldElement(quotient)...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  5. RELEASE.md

            passed to the optimizer but the reported loss will be a scalar value.
        *   `SUM`: Scalar sum of weighted losses. 4. `SUM_OVER_BATCH_SIZE`: Scalar
            `SUM` divided by number of elements in losses. This reduction type is
            not supported when used with `tf.distribute.Strategy` outside of
            built-in training loops like `tf.keras` `compile`/`fit`.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  6. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2CF4..2CF8    ; disallowed                             # NA   <reserved-2CF4>..<reserved-2CF8>
    2CF9..2CFF    ; valid                  ;      ; NV8    # 4.1  COPTIC OLD NUBIAN FULL STOP..COPTIC MORPHOLOGICAL DIVIDER
    2D00..2D25    ; valid                                  # 4.1  GEORGIAN SMALL LETTER AN..GEORGIAN SMALL LETTER HOE
    2D26          ; disallowed                             # NA   <reserved-2D26>
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
Back to Top