Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 84 for _sin (0.04 sec)

  1. tensorflow/cc/gradients/math_grad_test.cc

            y = Sigmoid(scope_, x);
            break;
          case SIGN:
            y = Sign(scope_, x);
            break;
          case SIN:
            y = Sin(scope_, x);
            break;
          case COS:
            y = Cos(scope_, x);
            break;
          case ASIN:
            y = Asin(scope_, x);
            break;
          case ACOS:
            y = Acos(scope_, x);
            break;
          case TAN:
            y = Tan(scope_, x);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri Aug 25 18:20:20 UTC 2023
    - 36K bytes
    - Viewed (0)
  2. src/math/all_test.go

    }
    
    func TestAsin(t *testing.T) {
    	for i := 0; i < len(vf); i++ {
    		a := vf[i] / 10
    		if f := Asin(a); !veryclose(asin[i], f) {
    			t.Errorf("Asin(%g) = %g, want %g", a, f, asin[i])
    		}
    	}
    	for i := 0; i < len(vfasinSC); i++ {
    		if f := Asin(vfasinSC[i]); !alike(asinSC[i], f) {
    			t.Errorf("Asin(%g) = %g, want %g", vfasinSC[i], f, asinSC[i])
    		}
    	}
    }
    
    func TestAsinh(t *testing.T) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jul 07 17:39:26 UTC 2023
    - 86.8K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/util/concurrent/SimpleTimeLimiterTest.java

        Stopwatch stopwatch = Stopwatch.createStarted();
    
        String result = proxy.sleepThenReturnInput("x");
    
        assertThat(result).isEqualTo("x");
        assertThat(stopwatch.elapsed(MILLISECONDS)).isIn(Range.closed(DELAY_MS, ENOUGH_MS));
        assertThat(target.finished).isTrue();
      }
    
      public void testNewProxy_goodMethodWithNotEnoughTime() throws Exception {
        SampleImpl target = new SampleImpl(9999);
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 9.5K bytes
    - Viewed (0)
  4. okhttp/src/test/java/okhttp3/CallHandshakeTest.kt

     * See the License for the specific language governing permissions and
     * limitations under the License.
     */
    package okhttp3
    
    import assertk.assertThat
    import assertk.assertions.containsExactly
    import assertk.assertions.isIn
    import javax.net.ssl.SSLSocket
    import mockwebserver3.MockResponse
    import mockwebserver3.MockWebServer
    import okhttp3.CipherSuite.Companion.TLS_AES_128_GCM_SHA256
    import okhttp3.CipherSuite.Companion.TLS_AES_256_GCM_SHA384
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Sat Jan 20 10:30:28 UTC 2024
    - 11.2K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/util/concurrent/SimpleTimeLimiterTest.java

        Stopwatch stopwatch = Stopwatch.createStarted();
    
        String result = proxy.sleepThenReturnInput("x");
    
        assertThat(result).isEqualTo("x");
        assertThat(stopwatch.elapsed(MILLISECONDS)).isIn(Range.closed(DELAY_MS, ENOUGH_MS));
        assertThat(target.finished).isTrue();
      }
    
      public void testNewProxy_goodMethodWithNotEnoughTime() throws Exception {
        SampleImpl target = new SampleImpl(9999);
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 9.5K bytes
    - Viewed (0)
  6. src/math/lgamma.go

    //   4. For negative x, since (G is gamma function)
    //              -x*G(-x)*G(x) = pi/sin(pi*x),
    //      we have
    //              G(x) = pi/(sin(pi*x)*(-x)*G(-x))
    //      since G(-x) is positive, sign(G(x)) = sign(sin(pi*x)) for x<0
    //      Hence, for x<0, signgam = sign(sin(pi*x)) and
    //              lgamma(x) = log(|Gamma(x)|)
    //                        = log(pi/(|x*sin(pi*x)|)) - lgamma(-x);
    //      Note: one should avoid computing pi*(-x) directly in the
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 11:59:09 UTC 2023
    - 11K bytes
    - Viewed (0)
  7. src/math/huge_test.go

    		}
    	}
    }
    
    func TestHugeSin(t *testing.T) {
    	for i := 0; i < len(trigHuge); i++ {
    		f1 := sinHuge[i]
    		f2 := Sin(trigHuge[i])
    		if !close(f1, f2) {
    			t.Errorf("Sin(%g) = %g, want %g", trigHuge[i], f2, f1)
    		}
    		f3 := Sin(-trigHuge[i])
    		if !close(-f1, f3) {
    			t.Errorf("Sin(%g) = %g, want %g", -trigHuge[i], f3, -f1)
    		}
    	}
    }
    
    func TestHugeSinCos(t *testing.T) {
    	for i := 0; i < len(trigHuge); i++ {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jul 31 16:23:41 UTC 2023
    - 2.9K bytes
    - Viewed (0)
  8. okhttp/src/test/java/okhttp3/ConnectionListenerTest.kt

     */
    package okhttp3
    
    import assertk.assertThat
    import assertk.assertions.containsExactly
    import assertk.assertions.hasMessage
    import assertk.assertions.isEqualTo
    import assertk.assertions.isIn
    import java.io.IOException
    import java.net.InetSocketAddress
    import java.net.UnknownHostException
    import java.time.Duration
    import java.util.Arrays
    import java.util.concurrent.TimeUnit
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Sat Jan 20 10:30:28 UTC 2024
    - 9.6K bytes
    - Viewed (0)
  9. src/math/sin_s390x.s

    GLOBL sincoss7<>+0(SB), RODATA, $8
    
    // Sin returns the sine of the radian argument x.
    //
    // Special cases are:
    //      Sin(±0) = ±0
    //      Sin(±Inf) = NaN
    //      Sin(NaN) = NaN
    // The algorithm used is minimax polynomial approximation.
    // with coefficients determined with a Remez exchange algorithm.
    
    TEXT ·sinAsm(SB),NOSPLIT,$0-16
    	FMOVD   x+0(FP), F0
    	//special case Sin(±0) = ±0
    	FMOVD   $(0.0), F1
    	FCMPU   F0, F1
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jul 31 04:25:54 UTC 2023
    - 8.6K bytes
    - Viewed (0)
  10. docs/tr/docs/benchmarks.md

        * Eğer Uvicorn'u karşılaştırıyorsanız, Daphne, Hypercorn, uWSGI, vb. uygulama sunucuları ile karşılaştırın.
    * **Starlette**:
        * Uvicorn'dan sonraki en iyi performansa sahip olacaktır. İşin aslı, Starlette çalışmak için Uvicorn'u kullanıyor. Dolayısıyla, daha fazla kod çalıştırmaası gerektiğinden muhtemelen Uvicorn'dan sadece "daha yavaş" olabilir.
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Tue Jan 23 14:10:30 UTC 2024
    - 3.9K bytes
    - Viewed (0)
Back to top