routingkit-cch 0.1.4

Rust bindings for RoutingKit's Customizable Contraction Hierarchies (CCH)
Documentation 
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165

#ifndef ROUTING_KIT_PERMUTATION_H
#define ROUTING_KIT_PERMUTATION_H


#include <routingkit/constants.h>

#include <vector>
#include <assert.h>
#include <algorithm>

namespace RoutingKit{

//
//  Applying a permutation p to a vector v consists of computing the vector {v[p[0]], v[p[1]], v[p[2]], ... , v[p[n]]}
//
//  Applying a permutation p to the elements of a vector v consists of computing the vector {p[v[0]], p[v[1]], p[v[2]], ... , p[v[n]]}
//

inline
bool is_permutation(const std::vector<unsigned>&p){
	std::vector<bool>found(p.size(), false);
	for(unsigned x:p){
		if(x >= p.size())
			return false;
		if(found[x])
			return false;
		found[x] = true;
	}
	return true;
}

inline
std::vector<unsigned>chain_permutation_first_left_then_right(const std::vector<unsigned>&p, const std::vector<unsigned>&q){
	assert(is_permutation(p) && "p must be a permutation");
	assert(is_permutation(q) && "q must be a permutation");
	assert(p.size() == q.size() && "p and q must permute the same number of objects");
	std::vector<unsigned>r(p.size());
	for(unsigned i=0; i<r.size(); ++i)
		r[i] = p[q[i]];
	return r;
}

inline
std::vector<unsigned>chain_permutation_first_right_then_left(const std::vector<unsigned>&p, const std::vector<unsigned>&q){
	return chain_permutation_first_left_then_right(q, p);
}

template<class T>
std::vector<T> apply_permutation(const std::vector<unsigned>&p, const std::vector<T>&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(p.size() == v.size() && "permutation and vector must have the same size");

	std::vector<T>r(v.size());
	for(unsigned i = 0; i<v.size(); ++i)
		r[i] = v[p[i]];

	return r; // NVRO
}

template<class T>
std::vector<T> apply_permutation(const std::vector<unsigned>&p, std::vector<T>&&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(p.size() == v.size() && "permutation and vector must have the same size");

	std::vector<T>r(v.size());
	for(unsigned i = 0; i<v.size(); ++i)
		r[i] = std::move(v[p[i]]);

	return r; // NVRO
}

template<class T>
std::vector<T> apply_inverse_permutation(const std::vector<unsigned>&p, const std::vector<T>&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(p.size() == v.size() && "permutation and vector must have the same size");

	std::vector<T>r(v.size());
	for(unsigned i = 0; i<v.size(); ++i)
		r[p[i]] = v[i];

	return r; // NVRO
}

template<class T>
std::vector<T> apply_inverse_permutation(const std::vector<unsigned>&p, std::vector<T>&&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(p.size() == v.size() && "permutation and vector must have the same size");

	std::vector<T>r(v.size());
	for(unsigned i = 0; i<v.size(); ++i)
		r[p[i]] = std::move(v[i]);

	return r; // NVRO
}

inline
void inplace_apply_permutation_to_elements_of(const std::vector<unsigned>&p, std::vector<unsigned>&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(std::all_of(v.begin(), v.end(), [&](unsigned x){return x < p.size();}) && "v has an out of bounds element");
	
	for(unsigned i=0; i<v.size(); ++i)
		v[i] = p[v[i]];
}

inline
std::vector<unsigned> apply_permutation_to_elements_of(const std::vector<unsigned>&p, const std::vector<unsigned>&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(std::all_of(v.begin(), v.end(), [&](unsigned x){return x < p.size();}) && "v has an out of bounds element");
	
	std::vector<unsigned> r = v;
	inplace_apply_permutation_to_elements_of(p, r);
	return r; // NVRO
}


inline
void inplace_apply_permutation_to_possibly_invalid_elements_of(const std::vector<unsigned>&p, std::vector<unsigned>&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(std::all_of(v.begin(), v.end(), [&](unsigned x){return x < p.size() || x == invalid_id;}) && "v has an out of bounds element");
	
	for(unsigned i=0; i<v.size(); ++i)
		if(v[i] != invalid_id)
			v[i] = p[v[i]];
}

inline
std::vector<unsigned> apply_permutation_to_possibly_invalid_elements_of(const std::vector<unsigned>&p, const std::vector<unsigned>&v){
	assert(is_permutation(p) && "p must be a permutation");
	assert(std::all_of(v.begin(), v.end(), [&](unsigned x){return x < p.size() || x == invalid_id;}) && "v has an out of bounds element");
	
	std::vector<unsigned> r = v;
	inplace_apply_permutation_to_elements_of(p, r);
	return r; // NVRO
}


inline
std::vector<unsigned> invert_permutation(const std::vector<unsigned>&p){
	assert(is_permutation(p) && "p must be a permutation");
	
	std::vector<unsigned> inv_p(p.size());
	for(unsigned i=0; i<p.size(); ++i)
		inv_p[p[i]] = i;
	
	return inv_p; // NVRO
}

inline
std::vector<unsigned> identity_permutation(unsigned n){
	std::vector<unsigned> p(n);
	for(unsigned i=0; i<n; ++i)
		p[i] = i;
	return p; // NVRO
}

template<class RandomGenerator>
std::vector<unsigned> random_permutation(unsigned n, RandomGenerator&&gen){
	auto r = identity_permutation(n);
	std::shuffle(r.begin(), r.end(), std::forward<RandomGenerator>(gen));
	return r;
}

} // RoutingKit

#endif