forked from couchbaselabs/JSUDF
-
Notifications
You must be signed in to change notification settings - Fork 0
/
example9.js
70 lines (55 loc) · 1.17 KB
/
example9.js
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
Recursive N1QL UDF example
==========================
Corresponding PL/SQL
--------------------
DECLARE
num number;
factorial number;
FUNCTION fact(x number)
RETURN number
IS
f number;
BEGIN
IF x=0 THEN
f := 1;
ELSE
f := x * fact(x-1);
END IF;
RETURN f;
END;
BEGIN
num:= 6;
factorial := fact(num);
dbms_output.put_line(' Factorial '|| num || ' is ' || factorial);
END;
N1QL definition
---------------
CREATE FUNCTION fact(x) LANGUAGE javascript AS "fact" at "libfact"
JS library
----------
curl -v -X POST http://localhost:8093/evaluator/v1/libraries/libfact -u Administrator:password –data-binary '@example9.js'
Synopsis
--------
Demonstrates nested or recursive javascript function calls and some error handling
*/
function fact(x) {
if (typeof(x) != "number" && typeof(x) != "bigint") {
throw "not a number";
}
if (x<0) {
throw "gamma and complex factorials not supported";
}
if (x==0) {
return 1;
}
/*
you don't need to use N1QL to recursevely execute fact(), eg
var f = EXECUTE FUNCTION fact($x - 1);
for (const x1 of f) {
return x * x1;
}
just call it directly
*/
return x * fact(x - 1);
}