time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

repl.txt (1053B)

      1 
      2 {{alias}}( x, y )
      3     Computes the hypotenuse using the alpha max plus beta min algorithm.
      4 
      5     The algorithm computes only an approximation.
      6 
      7     Parameters
      8     ----------
      9     x: number
     10         First number.
     11 
     12     y: number
     13         Second number.
     14 
     15     Returns
     16     -------
     17     out: number
     18         Hypotenuse.
     19 
     20     Examples
     21     --------
     22     > var h = {{alias}}( 5.0, 12.0 )
     23     ~13.514
     24 
     25 
     26 {{alias}}.factory( alpha, beta, [nonnegative[, ints]] )
     27     Returns a function to compute a hypotenuse using the alpha max plus beta min
     28     algorithm.
     29 
     30     Parameters
     31     ----------
     32     alpha: number
     33         Alpha.
     34 
     35     beta: number
     36         Beta.
     37 
     38     nonnegative: boolean (optional)
     39         Boolean indicating whether input values are always nonnegative.
     40 
     41     ints: boolean (optional)
     42         Boolean indicating whether input values are always 32-bit integers.
     43 
     44     Returns
     45     -------
     46     fcn: Function
     47         Function to compute a hypotenuse.
     48 
     49     Examples
     50     --------
     51     > var hypot = {{alias}}.factory( 1.0, 0.5 )
     52     <Function>
     53 
     54     See Also
     55     --------
     56