Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 41 for divisor (0.14 sec)

  1. src/cmd/asm/internal/asm/expr_test.go

    		}
    	}
    }
    
    type badExprTest struct {
    	input string
    	error string // Empty means no error.
    }
    
    var badExprTests = []badExprTest{
    	{"0/0", "division by zero"},
    	{"3/0", "division by zero"},
    	{"(1<<63)/0", "divide of value with high bit set"},
    	{"3%0", "modulo by zero"},
    	{"(1<<63)%0", "modulo of value with high bit set"},
    	{"3<<-4", "negative left shift count"},
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Aug 29 07:48:38 UTC 2023
    - 3.2K bytes
    - Viewed (0)
  2. src/main/webapp/css/admin/adminlte.min.css.map

    true !default;\n\n// Cache $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...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 3.7M bytes
    - Viewed (1)
  3. guava/src/com/google/common/hash/Fingerprint2011.java

     * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent
     * to unsigned arithmetic in all cases except:
     *
     * <ul>
     *   <li>comparisons (signed values can be negative)
     *   <li>division (avoided here)
     *   <li>shifting (right shift must be unsigned)
     * </ul>
     *
     * @author ******@****.*** (Kyle Maddison)
     * @author ******@****.*** (Geoff Pike)
     */
    @ElementTypesAreNonnullByDefault
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Dec 28 17:50:25 UTC 2021
    - 6.5K bytes
    - Viewed (0)
  4. src/main/webapp/js/admin/moment-with-locales.min.js.map

    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 224.8K bytes
    - Viewed (0)
  5. src/main/webapp/js/admin/popper.min.js.map

    const splitRegex = /\\s*,\\s*|\\s+/;\n  let ops = divider !== -1\n    ? [\n        fragments\n          .slice(0, divider)\n          .concat([fragments[divider].split(splitRegex)[0]]),\n        [fragments[divider].split(splitRegex)[1]].concat(\n          fragments.slice(divider + 1)\n        ),\n      ]\n    : [fragments];\n\n  // Convert the values with units to absolute pixels to allow our computations\n  ops = ops.map((op, index) => {\n    // Most of the units rely on the orientation of the popper\n...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 120.9K bytes
    - Viewed (0)
  6. .teamcity/src/main/kotlin/model/PerformanceTestBucketProvider.kt

                    .firstOrNull() ?: PerformanceTestDuration(scenario.scenario, 1) // Fallback for new performance tests (don't use 0 to avoid division by zero)
            })
            .entries
            .map { TestProjectDuration(it.key, it.value) }
            .sortedBy { -it.totalTime }
        return splitIntoBuckets(
            LinkedList(testProjectDurations),
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Mon Feb 19 11:22:56 UTC 2024
    - 15.3K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/asm/testdata/riscv64.s

    	// 13.1: Multiplication Operations
    	MUL	X5, X6, X7				// b3035302
    	MULH	X5, X6, X7				// b3135302
    	MULHU	X5, X6, X7				// b3335302
    	MULHSU	X5, X6, X7				// b3235302
    	MULW	X5, X6, X7				// bb035302
    
    	// 13.2: Division Operations
    	DIV	X5, X6, X7				// b3435302
    	DIVU	X5, X6, X7				// b3535302
    	REM	X5, X6, X7				// b3635302
    	REMU	X5, X6, X7				// b3735302
    	DIVW	X5, X6, X7				// bb435302
    	DIVUW	X5, X6, X7				// bb535302
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Oct 25 12:05:29 UTC 2024
    - 16.8K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/math/Quantiles.java

          checkArgument(dataset.length > 0, "Cannot calculate quantiles of an empty dataset");
          if (containsNaN(dataset)) {
            return NaN;
          }
    
          // Calculate the quotient and remainder in the integer division x = k * (N-1) / q, i.e.
          // index * (dataset.length - 1) / scale. If there is no remainder, we can just find the value
          // whose index in the sorted dataset equals the quotient; if there is a remainder, we
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 29.9K bytes
    - Viewed (0)
  9. docs/pt/docs/async.md

    Levaria o mesmo tempo para finalizar com ou sem chamadas (concorrência) e você teria feito o mesmo tanto de trabalho.
    
    Mas nesse caso, se você trouxesse os 8 ex-caixas / cozinheiros / agora-faxineiros, e cada um deles (mais você) pudessem dividir a casa para limpá-la, vocês fariam toda a limpeza em **paralelo**, com a ajuda extra, e terminariam muito mais cedo.
    
    Nesse cenário, cada um dos faxineiros (incluindo você) poderia ser um processador, fazendo a sua parte do trabalho.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Aug 06 04:48:30 UTC 2024
    - 22.2K bytes
    - Viewed (0)
  10. docs/fr/docs/async.md

    *Oui, c'est toute l'histoire*.
    
    ---
    
    Il n'y a plus d'attente 🕙 nulle part, juste beaucoup de travail à effectuer, dans différentes pièces de la maison.
    
    Vous pourriez diviser en différentes sections comme avec les burgers, d'abord le salon, puis la cuisine, etc. Mais vous n'attendez 🕙 rien, vous ne faites que nettoyer et nettoyer, la séparation en sections ne changerait rien au final.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Aug 06 04:48:30 UTC 2024
    - 25.4K bytes
    - Viewed (0)
Back to top