-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParser.cpp
149 lines (116 loc) · 2.73 KB
/
Parser.cpp
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
//
// Created by Alex on 10/9/18.
//
#include "Parser.h"
#include "Exception.h"
#include <future>
#include <thread>
#include <queue>
Parser::Parser() {}
void Parser::parse(const std::string &path)
{
this->path = path;
using myFuture = std::future<std::vector<int>>;
std::string tag;
std::queue<myFuture> results;
int low = 0, high = 0;
fin.open(this->path);
if ( fin.is_open() )
{
while ( !fin.eof() )
{
fin >> tag;
if ( tag == "<low>" )
{
fin >> low;
isPositive(low);
}
if ( tag == "<high>" )
{
fin >> high;
isPositive(high);
try
{
isCorrect(low, high);
}
catch ( Exception& ex )
{
low = 0;
high = 0;
continue;
}
results.push(std::async(std::launch::async, &Parser::parseSequence,this, low, high));
}
}
}
else
{
throw Exception("File is not open!");
}
while ( !results.empty() )
{
writeInFile(results.front().get());
results.pop();
}
fout << "</root>" << std::endl;
fout.close();
fin.close();
}
std::vector<int> Parser::parseSequence(unsigned int low, unsigned int high)
{
std::vector<int> primerList(high);
// Declare array with range 0 to high
for (int i = 2; i < high; i++)
{
primerList[i] = i;
}
// Zero all non prime numbers
for (int i = 2; i < high; i++)
{
for (int j = i*i; j < high; j += i){
primerList[j] = 0;
}
}
// Remove all numbers before low
auto firstPrimeNumder = primerList.begin();
std::advance(firstPrimeNumder, low);
std::sort(firstPrimeNumder, primerList.end());
for ( ; firstPrimeNumder != primerList.end(); ++firstPrimeNumder )
{
if ( *firstPrimeNumder != 0 )
{
break;
}
}
primerList.erase(primerList.begin(), firstPrimeNumder);
return primerList;
}
void Parser::writeInFile(std::vector<int> primerList)
{
if ( !fout.is_open() )
{
fout.open("out.xml");
fout << "<? xml version=\"1.0\" ?>" << std::endl;
fout << "<root>" << std::endl;
}
fout << " <primes> ";
for( auto iter : primerList )
{
fout << iter << " ";
}
fout << "</primes>" << std::endl;
}
void Parser::isPositive(int& bound)
{
if ( bound < 0 )
{
bound = 0;
}
}
void Parser::isCorrect(int low, int high)
{
if ( high < low )
{
throw Exception("Incorrect interval!");
}
}