Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 201 - 210 of 251 for franco (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

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

    					i++
    				}
    				continue
    			}
    			buf = append(buf, c)
    		}
    
    		f := strings.Fields(string(buf))
    
    		// Turn relative (PC) into absolute (PC) automatically,
    		// so that most branch instructions don't need comments
    		// giving the absolute form.
    		if len(f) > 0 && strings.Contains(printed, "(PC)") {
    			index := len(f) - 1
    			suf := "(PC)"
    			for !strings.HasSuffix(f[index], suf) {
    				index--
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Mar 20 17:02:17 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  2. docs/ko/docs/index.md

        FastAPI 프레임워크, 고성능, 간편한 학습, 빠른 코드 작성, 준비된 프로덕션
    </p>
    <p align="center">
    <a href="https://github.com/fastapi/fastapi/actions?query=workflow%3ATest+event%3Apush+branch%3Amaster">
        <img src="https://github.com/fastapi/fastapi/actions/workflows/test.yml/badge.svg?event=push&branch=master" alt="Test">
    </a>
    <a href="https://coverage-badge.samuelcolvin.workers.dev/redirect/fastapi/fastapi">
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:06:26 GMT 2026
    - 23.4K bytes
    - Click Count (0)
  3. src/cmd/asm/internal/asm/testdata/riscv64error.s

    	SRLI	$64, X5, X6			// ERROR "immediate out of range 0 to 63"
    	SRAI	$64, X5, X6			// ERROR "immediate out of range 0 to 63"
    	BEQ	X5, X6, $1			// ERROR "instruction with branch-like opcode lacks destination"
    	BEQ	X5, X6, 31(X10)			// ERROR "instruction with branch-like opcode lacks destination"
    	RORI	$-1, X5, X6			// ERROR "immediate out of range 0 to 63"
    	SLLI	$-1, X5, X6			// ERROR "immediate out of range 0 to 63"
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 04:17:57 GMT 2026
    - 27.2K bytes
    - Click Count (0)
  4. docs/pt/docs/tutorial/dependencies/index.md

    Isso é bastante útil quando você precisa:
    
    * Definir uma lógica compartilhada (mesmo formato de código repetidamente).
    * Compartilhar conexões com banco de dados.
    * Aplicar regras de segurança, autenticação, papéis de usuários, etc.
    * E muitas outras coisas...
    
    Tudo isso, enquanto minimizamos a repetição de código.
    
    ## Primeiros passos { #first-steps }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 10.6K bytes
    - Click Count (0)
  5. src/test/java/jcifs/netbios/NameServicePacketTest.java

            assertEquals(expectedString, packet.toString());
    
            // Test recordName == questionName branch in toString
            packet.recordName = packet.questionName;
            expectedString =
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 17.9K bytes
    - Click Count (0)
  6. src/test/java/jcifs/smb/SmbResourceLocatorImplTest.java

            NetbiosAddress nb = mock(NetbiosAddress.class);
            when(addr.unwrap(NetbiosAddress.class)).thenReturn(nb);
            when(nb.getNameType()).thenReturn(0x1d); // workgroup code
            // getFirstAddress branch: host given and path non-root -> possibleNTDomain=false
            when(nsc.getAllByName(eq("server"), eq(false))).thenReturn(new Address[] { addr });
            SmbResourceLocatorImpl workgroupLike = locator("smb://server/");
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 17.6K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/math/BigIntegerMath.java

         */
    
        if (approxCmp > 0) {
          /*
           * The code is written so that even completely incorrect approximations will still yield the
           * correct answer eventually, but in practice this branch should almost never be entered, and
           * even then the loop should not run more than once.
           */
          do {
            approxLog10--;
            approxPow = approxPow.divide(BigInteger.TEN);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 18.8K bytes
    - Click Count (0)
  8. docs/es/docs/async.md

    Pero aún así, la experiencia final no es la mejor. 😞
    
    ---
    
    Esta sería la historia equivalente de las hamburguesas paralelas. 🍔
    
    Para un ejemplo más "de la vida real" de esto, imagina un banco.
    
    Hasta hace poco, la mayoría de los bancos tenían múltiples cajeros 👨‍💼👨‍💼👨‍💼👨‍💼 y una gran fila 🕙🕙🕙🕙🕙🕙🕙🕙.
    
    Todos los cajeros haciendo todo el trabajo con un cliente tras otro 👨‍💼⏯.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 24.8K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/MapMakerInternalMap.java

                V entryValue = e.getValue();
    
                if (entryValue != null) {
                  // TODO(kak): Remove this branch
                } else if (isCollected(e)) {
                  // TODO(kak): Remove this branch
                } else {
                  return null;
                }
    
                ++modCount;
                E newFirst = removeFromChain(first, e);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/math/DoubleMath.java

      public static boolean fuzzyEquals(double a, double b, double tolerance) {
        MathPreconditions.checkNonNegative("tolerance", tolerance);
        return Math.copySign(a - b, 1.0) <= tolerance
            // copySign(x, 1.0) is a branch-free version of abs(x), but with different NaN semantics
            || (a == b) // needed to ensure that infinities equal themselves
            || (Double.isNaN(a) && Double.isNaN(b));
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 19.3K bytes
    - Click Count (0)
Back to Top