MDPV2/diagram.h at master · v1com/MDPV2 · 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
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
#ifndef DIAGRAM_H
#define DIAGRAM_H
#include <QObject>
#include <iostream>

using namespace std;

class DiagramSignalsSlots : public QObject
 {
     Q_OBJECT

 public:
     explicit DiagramSignalsSlots(QObject *parent = 0) :
         QObject(parent) {}

 public slots:
 signals:

 };

template <class T>
class Diagram : public DiagramSignalsSlots
{
public:
    Diagram ();
    ~Diagram();
    void show();
    void addLink(T *firstEl, T *secondEl);
    void addElement (T *element);
    void deleteEl(T *element);
    vector<list<T*>> getVector() { return vertexes; }
    vector<list<T>> getVectorForRel();

private:
    vector <list <T*>> vertexes;
};

template <class T>
Diagram<T>::Diagram(){
}

template <class T>
vector <list<T>> Diagram<T>::getVectorForRel(){
    vector <list<T>> v;
    int size = vertexes.size();
        for (int i = 0; i < size; i++){
           typename list<T*>::iterator Iter = vertexes[i].begin();
           typename list<T*>::iterator endIter = vertexes[i].begin();
           while(Iter != endIter){
              // v[i].push_back(*(*Iter));
               ++Iter;
           }
        }
        return v;
}

template <class T>
void Diagram<T>::show() {
    int size = vertexes.size();
    list <T*> mylist;
    list <T*> tempList;
    typename list<T*>::iterator it;
    typename list<T*>::iterator temp;

    for(int i = 0; i != size; i++){
        mylist = vertexes[i];
        it = mylist.begin();
      //  s->addItem(*it);
    }

    for(int i = 0; i != size; i++){
        mylist = vertexes[i];
        temp = mylist.begin();
        for(it = mylist.begin(); it != mylist.end(); ++it){
            if (temp!=it){
         //       s->addItem(new Arrow(*temp,*it));
            }
        }
    }
}

template <class T>
Diagram<T>::~Diagram(){

    list <T*> mylist;
    typename list<T*>::iterator it;

    int size = vertexes.size();
    for(int i = 0; i != size; i++){
        mylist = vertexes[i];
        it = mylist.begin();
        while (it != mylist.end()){
            mylist.erase(it);
            ++it;
        }
    }
}

template <class T>
void Diagram<T>::addElement(T *element)
{
     list <T*> l1;
     l1.push_back(element);
     vertexes.push_back(l1);
}
template <class T>
void Diagram<T>::addLink(T *firstEl, T *secondEl)
{
    list <T*> tempList;
    tempList.push_back(firstEl);
    typename list <T*>::iterator temp = tempList.begin();
    int size = vertexes.size();
    for(int i = 0; i != size; i++){
        T *searchEl = vertexes[i].front();
        if (searchEl == firstEl){
            vertexes[i].push_back(secondEl);
        }
    }
}
template <class T>
void Diagram<T>::deleteEl(T *element)
{
    list <T*> mylist;
    typename list<T*>::iterator it;

    int size = vertexes.size();
    for(int i = 0; i != size; i++){
        mylist = vertexes[i];
        it = mylist.begin();
        if (it != element){
           while (it != mylist.end()){
               if (it == element){
                   mylist.erase(it);
               }
               ++it;
           }
        }
        else{
            while (it != mylist.end()){
                mylist.erase(it);
                ++it;
            }
            vertexes.erase(i);
        }
    }
}

#endif // DIAGRAM_H