me/toddcox-faster
1
0
Fork 0
forked from mirror/toddcox-faster
Code Pull Requests Activity

Add order tests

Browse Source
This commit is contained in:
David Allemang
2021-11-05 16:58:04 -04:00
parent 4f3fcb6c0f
commit c462d9ce62
6 changed files with 140 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
include/tc/solver.hpp
View File

@@ -160,7 +160,7 @@ namespace tc {
* Assumes that g is a coxeter group - that is, self-adjoint and the diagonal is 2.
*/
template<unsigned int Rank>
tc::Cosets<Rank> solve(const Group <Rank> &group, const std::vector<int> &sub_gens = {}) {
tc::Cosets<Rank> solve(const Group <Rank> &group, const std::vector<unsigned int> &sub_gens = {}) {
tc::Cosets<Rank> cosets;
cosets.add_row();
@@ -168,7 +168,7 @@ namespace tc {
return cosets;
}
for (int gen: sub_gens) {
for (unsigned int gen: sub_gens) {
if (gen < Rank)
cosets.put(0, gen, 0);
}