// array values represent bit mask, '1' for revision that shall re reported as descendant
// least significant bit is revision 0, and so on, so that 1<<revision points to bit in the bitmask
int[] descendantBitset = new int[] { 0x01FFFF, 0x0396, 0x0384, 0x01FC68, 0x010, 0x01FC60 };
RevisionDescendants[] result = new RevisionDescendants[roots.length];
for (int i = 0; i < roots.length; i++) {
result[i] = new RevisionDescendants(hgRepo, roots[i]);
result[i].build();
}
/*
for (int i = 0; i < roots.length; i++) {
System.out.printf("For root %d descendats are:", roots[i]);