Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for chinese (0.09 sec)

  1. src/test/java/org/codelibs/fess/mylasta/direction/FessPropTest.java

            assertEquals(Locale.ROOT, fessConfig.getQueryLocaleFromName("ja"));
            assertEquals(Locale.JAPANESE, fessConfig.getQueryLocaleFromName("test_ja"));
            assertEquals(Locale.CHINESE, fessConfig.getQueryLocaleFromName("test_zh"));
            assertEquals(Locale.SIMPLIFIED_CHINESE, fessConfig.getQueryLocaleFromName("test_zh_cn"));
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/reflect/ClassPathTest.java

            .isEqualTo(new File("/C:\\Program Files\\Apache Software Foundation/"));
        assertThat(ClassPath.toFile(new URL("file:///C:\\\u20320 \u22909"))) // Chinese Ni Hao
            .isEqualTo(new File("/C:\\\u20320 \u22909"));
      }
    
    
      @AndroidIncompatible // Android forbids null parent ClassLoader
      // https://github.com/google/guava/issues/2152
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Apr 26 14:02:27 UTC 2024
    - 24.9K bytes
    - Viewed (0)
  3. src/crypto/rsa/rsa.go

    	// complexity.
    	CRTValues []CRTValue
    
    	n, p, q *bigmod.Modulus // moduli for CRT with Montgomery precomputed constants
    }
    
    // CRTValue contains the precomputed Chinese remainder theorem values.
    type CRTValue struct {
    	Exp   *big.Int // D mod (prime-1).
    	Coeff *big.Int // R·Coeff ≡ 1 mod Prime.
    	R     *big.Int // product of primes prior to this (inc p and q).
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 00:11:18 UTC 2024
    - 23.4K bytes
    - Viewed (0)
  4. src/math/big/nat.go

    	}
    
    	return z.norm()
    }
    
    // expNNMontgomeryEven calculates x**y mod m where m = m1 × m2 for m1 = 2ⁿ and m2 odd.
    // It uses two recursive calls to expNN for x**y mod m1 and x**y mod m2
    // and then uses the Chinese Remainder Theorem to combine the results.
    // The recursive call using m1 will use expNNWindowed,
    // while the recursive call using m2 will use expNNMontgomery.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 21:31:58 UTC 2024
    - 31.7K bytes
    - Viewed (0)
  5. docs/fr/docs/tutorial/path-params.md

    #### Retourner des *membres d'énumération*
    
    Vous pouvez retourner des *membres d'énumération* dans vos *fonctions de chemin*, même imbriquée dans un JSON (e.g. un `dict`).
    
    Ils seront convertis vers leurs valeurs correspondantes (chaînes de caractères ici) avant d'être transmis au client :
    
    ```Python hl_lines="18  21  23"
    {!../../../docs_src/path_params/tutorial005.py!}
    ```
    
    Le client recevra une réponse JSON comme celle-ci :
    
    ```JSON
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 10K bytes
    - Viewed (0)
  6. src/go/parser/parser_test.go

    /* 2a
    */
    // 2b
    const pi = 3.1415
    /* 3a */ // 3b
    /* 3c */ const e = 2.7182
    
    // Example from go.dev/issue/3139
    func ExampleCount() {
    	fmt.Println(strings.Count("cheese", "e"))
    	fmt.Println(strings.Count("five", "")) // before & after each rune
    	// Output:
    	// 3
    	// 5
    }
    `, ParseComments)
    	if err != nil {
    		t.Fatal(err)
    	}
    	expected := [][]string{
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jan 31 20:26:14 UTC 2024
    - 24.6K bytes
    - Viewed (0)
Back to top