Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 41 for divisor (0.07 sec)

  1. okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/Http2ConnectionTest.kt

        ) {
          events.add(AssertionError("onReset"))
          notifyAll()
        }
      }
    
      companion object {
        fun roundUp(
          num: Int,
          divisor: Int,
        ): Int = (num + divisor - 1) / divisor
    
        val IGNORE =
          object : PushObserver {
            override fun onRequest(
              streamId: Int,
              requestHeaders: List<Header>,
            ) = false
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Thu Jul 31 04:18:40 UTC 2025
    - 75.5K bytes
    - Viewed (0)
  2. src/main/webapp/css/admin/bootstrap.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 Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 639.3K bytes
    - Viewed (1)
  3. src/main/webapp/css/bootstrap.min.css.map

    false\n$enable-rfs: true !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...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Jan 12 06:14:02 UTC 2025
    - 575.5K bytes
    - Viewed (0)
  4. doc/go_spec.html

    int32             -2147483648
    int64    -9223372036854775808
    </pre>
    
    <p>
    If the divisor is a <a href="#Constants">constant</a>, it must not be zero.
    If the divisor is zero at run time, a <a href="#Run_time_panics">run-time panic</a> occurs.
    If the dividend is non-negative and the divisor is a constant power of 2,
    the division may be replaced by a right shift, and computing the remainder may
    be replaced by a bitwise AND operation:
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue May 06 19:12:15 UTC 2025
    - 286.2K bytes
    - Viewed (0)
  5. RELEASE.md

    *   Fixes a division by 0 in `Conv2DBackpropInput`
        ([CVE-2021-29525](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29525))
    *   Fixes a division by 0 in `Conv2D`
        ([CVE-2021-29526](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29526))
    *   Fixes a division by 0 in `QuantizedConv2D`
        ([CVE-2021-29527](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29527))
    *   Fixes a division by 0 in `QuantizedMul`
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  6. src/cmd/asm/internal/lex/tokenizer.go

    	return &Tokenizer{
    		s:    &s,
    		base: src.NewFileBase(name, objabi.AbsFile(objabi.WorkingDir(), name, *flags.TrimPath)),
    		line: 1,
    		file: file,
    	}
    }
    
    // We want center dot (·) and division slash (∕) to work as identifier characters.
    func isIdentRune(ch rune, i int) bool {
    	if unicode.IsLetter(ch) {
    		return true
    	}
    	switch ch {
    	case '_': // Underscore; traditional.
    		return true
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Thu Aug 04 20:35:21 UTC 2022
    - 3K bytes
    - Viewed (0)
  7. 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 Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Aug 29 07:48:38 UTC 2023
    - 3.2K bytes
    - Viewed (0)
  8. 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 Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 3.7M bytes
    - Viewed (1)
  9. src/main/resources/fess_message_pt_BR.properties

    errors.failed_to_upload_mapping_file = Não foi possível carregar o arquivo de mapeamento.
    errors.invalid_kuromoji_token={0} não é um token válido.
    errors.invalid_kuromoji_segmentation=O número de divisões de {0} não corresponde ao número de divisões de {1}.
    errors.invalid_str_is_included = {1} é inválido em {0}.
    errors.blank_password = A senha é obrigatória.
    errors.invalid_confirm_password = A confirmação da senha não corresponde.
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 10 04:56:21 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  10. src/main/webapp/js/admin/moment-with-locales.min.js.map

    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 224.8K bytes
    - Viewed (1)
Back to top