File: repl.txt

package info (click to toggle)
node-stdlib 0.0.96%2Bds1%2B~cs0.0.429-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 421,476 kB
  • sloc: javascript: 1,562,831; ansic: 109,702; lisp: 49,823; cpp: 27,224; python: 7,871; sh: 6,807; makefile: 6,089; fortran: 3,102; awk: 387
file content (56 lines) | stat: -rw-r--r-- 1,053 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

{{alias}}( x, y )
    Computes the hypotenuse using the alpha max plus beta min algorithm.

    The algorithm computes only an approximation.

    Parameters
    ----------
    x: number
        First number.

    y: number
        Second number.

    Returns
    -------
    out: number
        Hypotenuse.

    Examples
    --------
    > var h = {{alias}}( 5.0, 12.0 )
    ~13.514


{{alias}}.factory( alpha, beta, [nonnegative[, ints]] )
    Returns a function to compute a hypotenuse using the alpha max plus beta min
    algorithm.

    Parameters
    ----------
    alpha: number
        Alpha.

    beta: number
        Beta.

    nonnegative: boolean (optional)
        Boolean indicating whether input values are always nonnegative.

    ints: boolean (optional)
        Boolean indicating whether input values are always 32-bit integers.

    Returns
    -------
    fcn: Function
        Function to compute a hypotenuse.

    Examples
    --------
    > var hypot = {{alias}}.factory( 1.0, 0.5 )
    <Function>

    See Also
    --------