aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDeterminant <ted.sybil@gmail.com>2018-06-28 16:53:00 -0400
committerDeterminant <ted.sybil@gmail.com>2018-06-28 16:53:00 -0400
commitcdabab89cbe05d456273a7bd43e1f1e435a093b6 (patch)
treed57ef8be59a9cc38bf8db96d4e99865884e4fe16
parent924be7bb303bacae3eedd7610383e638d5b096d8 (diff)
...
-rw-r--r--README.rst2
-rw-r--r--test.cpp2
-rw-r--r--test_ref.txt2
3 files changed, 3 insertions, 3 deletions
diff --git a/README.rst b/README.rst
index eb1f591..68fe33a 100644
--- a/README.rst
+++ b/README.rst
@@ -35,7 +35,7 @@ Calculate the factorial of n, the hard way:
return p;
});
t.then([](std::pair<int, int> p) {
- printf("fac(%d) = %d\n", p.second, p.first);
+ printf("fac(%d) = %d\n", p.second - 1, p.first);
});
/* no actual calculation until here */
root.resolve(std::make_pair(1, 1));
diff --git a/test.cpp b/test.cpp
index 7fa7f60..5d2e4a5 100644
--- a/test.cpp
+++ b/test.cpp
@@ -40,7 +40,7 @@ void test_fac() {
return p;
});
t.then([](std::pair<int, int> p) {
- printf("fac(%d) = %d\n", p.second, p.first);
+ printf("fac(%d) = %d\n", p.second - 1, p.first);
});
root.resolve(std::make_pair(1, 1));
}
diff --git a/test_ref.txt b/test_ref.txt
index 40d1b22..6519025 100644
--- a/test_ref.txt
+++ b/test_ref.txt
@@ -27,4 +27,4 @@ promise 9 resolved with 101
rejecting with value -1
reason: -1
reason: 0
-fac(11) = 3628800
+fac(10) = 3628800