-
Notifications
You must be signed in to change notification settings - Fork 0
/
Mesh.cpp
67 lines (62 loc) · 1.38 KB
/
Mesh.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
#include "include/Mesh.h"
#include <cstdlib>
#include <cstdio>
Mesh::Mesh()
{
//ctor
}
void Mesh::mergeInto(Mesh *other)
{
for (std::vector<VerletEdge*>::iterator i = other->edges.begin();
i != other->edges.end(); ++i)
{
edges.push_back((*i));
}
for (std::vector<Verlet*>::iterator i = other->verlets.begin();
i != other->verlets.end(); ++i)
{
verlets.push_back((*i));
}
}
void Mesh::sim()
{
//printf("about to restitute %d edges\n", edges.size());
for (std::vector<VerletEdge*>::iterator i = edges.begin();
i != edges.end(); ++i)
{
(*i)->restitute();
}
//printf("about to move\n");
for (std::vector<Verlet*>::iterator i = verlets.begin();
i != verlets.end(); ++i)
{
(*i)->move();
}
}
void Mesh::wipe()
{
// the /actual/ clean-all-contents method
for (std::vector<VerletEdge*>::iterator i = edges.begin();
i != edges.end(); ++i)
{
if (NULL != *i)
{
delete *i;
*i = NULL;
}
}
for (std::vector<Verlet*>::iterator i = verlets.begin();
i != verlets.end(); ++i)
{
if (NULL != *i)
{
delete *i;
*i = NULL;
}
}
}
Mesh::~Mesh()
{
//dtor
// Verlets and Edges are stored by reference --
}