copyIpcount = t->tree[i].pcount;
for (it = copyIpcount.begin(); it != copyIpcount.end();) {
- if (inUsersGroups(it->first, groups) != true) {
+ if (m->inUsersGroups(it->first, groups) != true) {
copyIpcount.erase(it++);
}else { it++; }
}
copyIpcount = t->tree[i].pcount;
for (it = copyIpcount.begin(); it != copyIpcount.end();) {
- if (inUsersGroups(it->first, groups) != true) {
+ if (m->inUsersGroups(it->first, groups) != true) {
copyIpcount.erase(it++);
}else { it++; }
}
//This section adds in all lengths that are non leaf
copyIpcount = copyTree->tree[i].pcount;
for (it = copyIpcount.begin(); it != copyIpcount.end();) {
- if (inUsersGroups(it->first, groups) != true) {
+ if (m->inUsersGroups(it->first, groups) != true) {
copyIpcount.erase(it++);
}else { it++; }
}
copyIpcount = copyTree->tree[i].pcount;
for (it = copyIpcount.begin(); it != copyIpcount.end();) {
- if (inUsersGroups(it->first, groups) != true) {
+ if (m->inUsersGroups(it->first, groups) != true) {
copyIpcount.erase(it++);
}else { it++; }
}