TestReferenceNeighborList.cpp 3.68 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
#include "../../../tests/AssertionUtilities.h"
#include "../src/SimTKReference/ReferenceNeighborList.h"
#include "../src/sfmt/SFMT.h"
#include <cassert>
#include <iostream>

using namespace std;
using namespace OpenMM;

void testNeighborList()
{
Peter Eastman's avatar
Peter Eastman committed
12
13
14
15
16
17
18
19
20
21
    RealOpenMM* particleList[2];
    particleList[0] = new RealOpenMM[3];
    particleList[1] = new RealOpenMM[3];
    particleList[2] = new RealOpenMM[3];
    particleList[0][0] = 13.6f;
    particleList[0][1] = 0;
    particleList[0][2] = 0;
    particleList[1][0] = 0;
    particleList[1][1] = 0;
    particleList[1][2] = 0;
22
23
24
25
    vector<set<int> > exclusions(2);
    
    NeighborList neighborList;
    
Peter Eastman's avatar
Peter Eastman committed
26
    computeNeighborListNaive(neighborList, 2, particleList, exclusions, NULL, 13.7, 0.01);
27
28
    assert(neighborList.size() == 1);
    
Peter Eastman's avatar
Peter Eastman committed
29
    computeNeighborListNaive(neighborList, 2, particleList, exclusions, NULL, 13.5, 0.01);
30
31
    assert(neighborList.size() == 0);
    
Peter Eastman's avatar
Peter Eastman committed
32
    computeNeighborListVoxelHash(neighborList, 2, particleList, exclusions, NULL, 13.7, 0.01);
33
34
    assert(neighborList.size() == 1);
    
Peter Eastman's avatar
Peter Eastman committed
35
    computeNeighborListVoxelHash(neighborList, 2, particleList, exclusions, NULL, 13.5, 0.01);
36
37
    assert(neighborList.size() == 0);
    
Peter Eastman's avatar
Peter Eastman committed
38
39
40
    delete[] particleList[0];
    delete[] particleList[1];
    delete[] particleList[2];
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
}

double periodicDifference(double val1, double val2, double period) {
    double diff = val1-val2;
    double base = floor(diff/period+0.5)*period;
    return diff-base;
}

double distance2(RealOpenMM* pos1, RealOpenMM* pos2, const RealOpenMM* periodicBoxSize) {
    double dx = periodicDifference(pos1[0], pos2[0], periodicBoxSize[0]);
    double dy = periodicDifference(pos1[1], pos2[1], periodicBoxSize[1]);
    double dz = periodicDifference(pos1[2], pos2[2], periodicBoxSize[2]);
    return dx*dx+dy*dy+dz*dz;
}

Peter Eastman's avatar
Peter Eastman committed
56
void verifyNeighborList(NeighborList& list, int numParticles, RealOpenMM** positions, const RealOpenMM* periodicBoxSize, double cutoff) {
57
    for (int i = 0; i < (int) list.size(); i++) {
Peter Eastman's avatar
Peter Eastman committed
58
59
60
        int particle1 = list[i].first;
        int particle2 = list[i].second;
        ASSERT(distance2(positions[particle1], positions[particle2], periodicBoxSize) <= cutoff*cutoff);
61
62
    }
    int count = 0;
Peter Eastman's avatar
Peter Eastman committed
63
64
    for (int i = 0; i < numParticles; i++)
        for (int j = i+1; j < numParticles; j++)
65
66
67
68
69
70
            if (distance2(positions[i], positions[j], periodicBoxSize) <= cutoff*cutoff)
                count++;
    ASSERT(count == list.size());
}

void testPeriodic() {
Peter Eastman's avatar
Peter Eastman committed
71
    const int numParticles = 100;
72
73
    const double cutoff = 3.0;
    const RealOpenMM periodicBoxSize[3] = {20.0, 15.0, 22.0};
Peter Eastman's avatar
Peter Eastman committed
74
    RealOpenMM* particleList[numParticles];
75
    init_gen_rand(0);
Peter Eastman's avatar
Peter Eastman committed
76
77
78
79
80
    for (int i = 0; i <numParticles; i++) {
        particleList[i] = new RealOpenMM[3];
        particleList[i][0] = (RealOpenMM) (genrand_real2()*periodicBoxSize[0]*3);
        particleList[i][1] = (RealOpenMM) (genrand_real2()*periodicBoxSize[1]*3);
        particleList[i][2] = (RealOpenMM) (genrand_real2()*periodicBoxSize[2]*3);
81
    }
Peter Eastman's avatar
Peter Eastman committed
82
    vector<set<int> > exclusions(numParticles);
83
    NeighborList neighborList;
Peter Eastman's avatar
Peter Eastman committed
84
85
86
87
88
89
    computeNeighborListNaive(neighborList, numParticles, particleList, exclusions, periodicBoxSize, cutoff);
    verifyNeighborList(neighborList, numParticles, particleList, periodicBoxSize, cutoff);
    computeNeighborListVoxelHash(neighborList, numParticles, particleList, exclusions, periodicBoxSize, cutoff);
    verifyNeighborList(neighborList, numParticles, particleList, periodicBoxSize, cutoff);
    for (int i = 0; i <numParticles; i++)
        delete[] particleList[i];
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
}

int main() 
{
try {
    testNeighborList();
    testPeriodic();
    
    cout << "Test Passed" << endl;
    return 0;
}
catch (...) {
    cerr << "*** ERROR: Test Failed ***" << endl;
    return 1;
}
}