-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathch03.cpp
More file actions
52 lines (49 loc) · 1.56 KB
/
ch03.cpp
File metadata and controls
52 lines (49 loc) · 1.56 KB
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
// Copyright (c) 2014 Alexander A. Stepanov and Daniel E. Rose
//
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without
// fee, provided that the above copyright notice appear in all copies
// and that both that copyright notice and this permission notice
// appear in supporting documentation. The authors make no
// representations about the suitability of this software for any
// purpose. It is provided "as is" without express or implied
// warranty.
//
// This code accompanies the "fM2GP" book:
//
// From Mathematics to Generic Programming
// by Alexander Stepanov and Daniel E. Rose
// Addison-Wesley Professional, 2015
//
// -------------------------------------------------------------------
// ch03.cpp -- For testing functions from Chapter 3 of fM2GP.
// -------------------------------------------------------------------
#include <iostream>
#include <vector>
#include "ch03.h"
template <RandomAccessIterator I, Integer N>
void print_sieve(I first, N n) {
N i {0};
std::cout << 2;
while (i < n) {
if (*first) {
std::cout << " " << 2 * i + 3;
}
++first;
++i;
}
std::cout << std::endl;
}
int main() {
std::vector<int> v(500);
sift0(begin(v), 50);
std::cout << "sift0(begin(v), 50):\n";
print_sieve(begin(v), 50);
sift1(begin(v), 50);
std::cout << "sift1(begin(v), 50):\n";
print_sieve(begin(v), 50);
sift(begin(v), 500);
std::cout << "sift(begin(v), 500):\n";
print_sieve(begin(v), 500);
std::cout << "gcm(15, 9) = " << gcm(15, 9) << std::endl;
}