Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 81 for digit (0.08 sec)

  1. src/cmd/asm/internal/lex/tokenizer.go

    	case '\u00B7': // Represents the period in runtime.exit. U+00B7 '·' middle dot
    		return true
    	case '\u2215': // Represents the slash in runtime/debug.setGCPercent. U+2215 '∕' division slash
    		return true
    	}
    	// Digits are OK only after the first character.
    	return i > 0 && unicode.IsDigit(ch)
    }
    
    func (t *Tokenizer) Text() string {
    	switch t.tok {
    	case LSH:
    		return "<<"
    	case RSH:
    		return ">>"
    	case ARR:
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Aug 04 20:35:21 UTC 2022
    - 3K bytes
    - Viewed (0)
  2. okhttp/src/main/kotlin/okhttp3/internal/http/StatusLine.kt

            protocol = Protocol.HTTP_1_1
            codeStart = 12
          } else {
            throw ProtocolException("Unexpected status line: $statusLine")
          }
    
          // Parse response code like "200". Always 3 digits.
          if (statusLine.length < codeStart + 3) {
            throw ProtocolException("Unexpected status line: $statusLine")
          }
          val code =
            statusLine.substring(codeStart, codeStart + 3).toIntOrNull()
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Tue Jan 09 12:33:05 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  3. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

          for (int i = n1 + 1; i <= n2; i++) {
            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
         * We want each multiplication to have both sides with approximately the same number of digits.
         * Currently, we just divide the range in half.
         */
        int mid = (n1 + n2) >>> 1;
        return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
      }
    
      @Benchmark
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  4. docs/en/docs/tutorial/response-status-code.md

    ///
    
    ## About HTTP status codes
    
    /// note
    
    If you already know what HTTP status codes are, skip to the next section.
    
    ///
    
    In HTTP, you send a numeric status code of 3 digits as part of the response.
    
    These status codes have a name associated to recognize them, but the important part is the number.
    
    In short:
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Mon Oct 28 11:13:18 UTC 2024
    - 3.9K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/primitives/Ints.java

       *
       * <p>Unlike {@link Integer#parseInt(String)}, this method returns {@code null} instead of
       * throwing an exception if parsing fails. Additionally, this method only accepts ASCII digits,
       * and returns {@code null} if non-ASCII digits are present in the string.
       *
       * <p>Note that strings prefixed with ASCII {@code '+'} are rejected, even though {@link
       * Integer#parseInt(String)} accepts them.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 31K bytes
    - Viewed (0)
  6. docs/pt/docs/environment-variables.md

    * `C:\Program Files\Python312\Scripts`
    * `C:\Program Files\Python312`
    * `C:\Windows\System32`
    
    ////
    
    Quando você digita um **comando** no terminal, o sistema operacional **procura** o programa em **cada um dos diretórios** listados na variável de ambiente `PATH`.
    
    Por exemplo, quando você digita `python` no terminal, o sistema operacional procura um programa chamado `python` no **primeiro diretório** dessa lista.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Sep 10 10:36:42 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  7. internal/s3select/json/record.go

    	// This matches most other JSON generators.
    	// See golang.org/issue/6384 and golang.org/issue/14135.
    	// Like fmt %g, but the exponent cutoffs are different
    	// and exponents themselves are not padded to two digits.
    	abs := math.Abs(f)
    	fmt := byte('f')
    	if abs != 0 {
    		if abs < 1e-6 || abs >= 1e21 {
    			fmt = 'e'
    		}
    	}
    	dst = strconv.AppendFloat(dst, f, fmt, -1, 64)
    	if fmt == 'e' {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 23 19:35:41 UTC 2024
    - 5.3K bytes
    - Viewed (0)
  8. docs/pt/docs/tutorial/security/first-steps.md

    <img src="/img/tutorial/security/image02.png">
    
    /// note | "Nota"
    
    
    
    ///
    
    	Não importa o que você digita no formulário, não vai funcionar ainda. Mas nós vamos chegar lá.
    
    Claro que este não é o frontend para os usuários finais, mas é uma ótima ferramenta automática para documentar interativamente toda sua API.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/net/HostAndPortTest.java

        checkFromStringCase("[2001::2]:85", 77, "2001::2", 85, true);
      }
    
      public void testFromStringNonAsciiDigits() {
        // Same as testFromStringUnusedDefaultPort but with Gujarati digits for port numbers.
        checkFromStringCase("gmail.com:૮1", 77, null, -1, false);
        checkFromStringCase("192.0.2.2:૮૩", 77, null, -1, false);
        checkFromStringCase("[2001::2]:૮૫", 77, null, -1, false);
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 15:41:36 UTC 2024
    - 9.4K bytes
    - Viewed (0)
  10. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

          for (int i = n1 + 1; i <= n2; i++) {
            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
         * We want each multiplication to have both sides with approximately the same number of digits.
         * Currently, we just divide the range in half.
         */
        int mid = (n1 + n2) >>> 1;
        return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
      }
    
      @Benchmark
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
Back to top