Searched refs:finite (Results 26 - 40 of 40) sorted by relevance

12

/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/bits/
H A Dc++config.h286 /* Define to 1 if you have the `finite' function. */
1085 # define finite _finite macro
/macosx-10.9.5/ruby-104/ruby/test/bigdecimal/
H A Dtest_bigdecimal.rb510 assert_equal(true, x.finite?)
514 assert_equal(false, y.finite?)
518 assert_equal(false, y.finite?)
524 assert_equal(false, y.finite?)
/macosx-10.9.5/ruby-104/ruby/test/ruby/
H A Dtest_math.rb6 assert(!a.finite?, *rest)
/macosx-10.9.5/ruby-104/ruby/include/ruby/
H A Dwin32.h330 finite(double x) function
/macosx-10.9.5/ruby-104/ruby/
H A Dcommon.mk591 finite.$(OBJEXT): {$(VPATH)}finite.c
H A Dnumeric.c1451 * is finite, -infinity, or +infinity.
1472 * flt.finite? -> true or false
1486 if (!finite(value))
3980 rb_define_method(rb_cFloat, "finite?", flo_is_finite_p, 0);
/macosx-10.9.5/emacs-92/emacs/lisp/calc/
H A Dcalc-arith.el1330 (defun math-intv-constp (a &optional finite)
1333 (or (not finite)
1337 (or (not finite)
/macosx-10.9.5/vim-53/runtime/syntax/
H A Dmaple.vim365 syn keyword mvPkg_grobner finite gsolve
/macosx-10.9.5/tcl-102/tcl_ext/ffidl/ffidl/demos/mathswig/
H A Dmathswig_wrap.c1751 if (SWIG_GetArgs(interp, objc, objv,"d:finite double ",&arg1) == TCL_ERROR) SWIG_fail;
1752 result = (int)finite(arg1);
2115 { SWIG_prefix "finite", (swig_wrapper_func) _wrap_finite, NULL},
/macosx-10.9.5/CPANInternal-140/Tree-DAG_Node/lib/Tree/
H A DDAG_Node.pm56 * Each node can have any number (0 to any finite number) of daughter
/macosx-10.9.5/CPANInternal-140/Perl-Tidy-20121207/bin/
H A Dperltidy423 displaying arbitrarily deep data structures and code in a finite window,
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dtommath.tex3610 Modular reductions are normally used to create either finite groups, rings or fields. The most common usage for performance driven modular reductions
4706 in a finite field or ring, is called modular exponentiation. This latter style of operation is typically used in public key
4970 Modular exponentiation is essentially computing the power of a base within a finite field or ring. For example, computing
6343 denoted as $b = a^{-1}$. Technically speaking modular inversion is a well defined operation for any finite ring or field not just for rings and
6458 Prime numbers arise in cryptography considerably as they allow finite fields to be formed. The ability to determine whether an integer is prime or
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/
H A Dconfigure12571 for ac_func in finite isnand fp_class class fpclass
/macosx-10.9.5/llvmCore-3425.0.33/
H A Dconfigure19860 { echo "$as_me:$LINENO: checking for finite in <ieeefp.h>" >&5
19861 echo $ECHO_N "checking for finite in <ieeefp.h>... $ECHO_C" >&6; }
19881 float f; finite(f);
/macosx-10.9.5/llvmCore-3425.0.33/projects/sample/
H A Dconfigure19663 { echo "$as_me:$LINENO: checking for finite in <ieeefp.h>" >&5
19664 echo $ECHO_N "checking for finite in <ieeefp.h>... $ECHO_C" >&6; }
19684 float f; finite(f);

Completed in 265 milliseconds

12