RubiscoSimulation/endmove.hpp at master · binarybin/RubiscoSimulation · 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
//
//  endmove.hpp
//  polymersim
//
//  Created by Bin Xu on 11/18/15.
//  Copyright © 2015 Bin Xu. All rights reserved.
//

#ifndef endmove_hpp
#define endmove_hpp
#include <tuple>
#include <vector>

using std::tuple;
using std::vector;
using std::make_tuple;

template <class S, class P> class EndMove
{
private:
    S& space;
public:
    EndMove(S& thespace) : space(thespace) {}

    void UpdatePolymer(Polymer<P>& poly, int pointid, P& newpoint)
    {
        poly.locs[pointid] = newpoint;
    }

    vector<tuple<int, int, P>> GetPossibleMoves(Polymer<P>& poly)
    {
        int endloc_head = 0; int nextloc_head = 1;
        int endloc_tail = (int)poly.locs.size() - 1; int nextloc_tail = (int)poly.locs.size() - 2;
        vector<tuple<int, int, P>> possible_moves;

        for (auto pos : space.Neighbor(poly.locs[nextloc_head]))
            if (space.EmptyPos(pos))
                possible_moves.push_back(make_tuple(endloc_head, endloc_head, pos));

        for (auto pos : space.Neighbor(poly.locs[nextloc_tail]))
            if (space.EmptyPos(pos))
                possible_moves.push_back(make_tuple(endloc_tail, endloc_head, pos));

        return possible_moves;
    }


    void UpdateReverseCheckingSpace(P& oldpoint, P& newpoint, Polymer<P>& poly)
    {
        space.RSpacePointMove(oldpoint, newpoint);
    }

};


#endif /* endmove_hpp */