Performance-Tool/data.cpp at main · ishitachail/Performance-Tool · GitHub

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
#include <iostream>
#include <vector>
#include <time.h>
#include <stdlib.h>
#include </Users/user/source/data.h>

using namespace std;
std::vector<int> sortedinteger ::createvector(int size){
    time_t t1;
    std::vector<int> v(size,0);
    srand ( (unsigned) time (&t1));
    generate(v.begin(), v.end(), rand);
    sort(v.begin(),v.end());
    return v;
}
std::vector<int> unsortedinteger:: createvector(int size){
    time_t t1;
    std::vector<int> v(size,0);
    srand ( (unsigned) time (&t1));
    generate(v.begin(), v.end(), rand);
    return v;
}

std::vector<int> reversesortedinteger:: createvector(int size){
    time_t t1;
    std::vector<int> v(size,0);
    srand ( (unsigned) time (&t1));
    generate(v.begin(), v.end(), rand);
    sort(v.begin(), v.end(), greater<int>());
    return v;
}

std::vector<double> sorteddouble :: createvector(int size){
    time_t t1;
    //std::vector<double> v(size,0);
    //srand ( (unsigned) time (&t1));
    //generate(v.begin(), v.end(), rand);
    std::vector<double> randomDoubles;
    for (int i = 0; i < size; ++i) {
        double randomDouble = static_cast<double>(rand()) / RAND_MAX;
        randomDoubles.push_back(randomDouble);
    }
    sort(randomDoubles.begin(),randomDoubles.end());
    return randomDoubles;
}

std::vector<double> unsorteddouble:: createvector(int size){
    time_t t1;
    //std::vector<double> v(size,0);
    //srand ( (unsigned) time (&t1));
    //generate(v.begin(), v.end(), rand);
    std::vector<double> randomDoubles;
    for (int i = 0; i < size; ++i) {
        double randomDouble = static_cast<double>(rand()) / RAND_MAX;
        randomDoubles.push_back(randomDouble);
    }
    //sort(randomDoubles.begin(),randomDoubles.end());
    return randomDoubles;
}

std::vector<double> reversesorteddouble :: createvector(int size){
    time_t t1;
    std::vector<double> randomDoubles;
    for (int i = 0; i < size; ++i) {
        double randomDouble = static_cast<double>(rand()) / RAND_MAX;
        randomDoubles.push_back(randomDouble);
    }
    sort(randomDoubles.begin(),randomDoubles.end(),greater<double>());
    return randomDoubles;
}

integer* sortedfactory:: createinteger(){
    return new sortedinteger();
}

doubled*  sortedfactory :: createdouble(){
    return new sorteddouble();
}

integer* unsortedfactory:: createinteger(){
    return new unsortedinteger();
}

doubled* unsortedfactory :: createdouble(){
    return new unsorteddouble();
}


integer* reversesortedfactory :: createinteger(){
    return new reversesortedinteger();
}

doubled* reversesortedfactory :: createdouble(){
    return new reversesorteddouble();
}


num_factory*  datafactory :: createfactory(characteristic c){
switch (c)
{
    case characteristic::sorted:
        return new sortedfactory();
        break;
    case characteristic::unsorted:
        return new unsortedfactory();
        break;
    case characteristic::reversesorted:
        return new reversesortedfactory();
        break;
    default:
        break;
}
}