int n, o; for (n = o = 0; n < newLength && o < oldLength; n++, o++) { if (newSourceLocations[n].equals(oldSourceLocations[o])) continue; // checks source & output folders try { if (newSourceLocations[n].sourceFolder.members().length == 0) { // added new empty source folder
int n, o; for (n = o = 0; n < newLength && o < oldLength; n++, o++) { if (newSourceLocations[n].equals(oldSourceLocations[o])) continue; // checks source & output folders try { if (newSourceLocations[n].sourceFolder.members().length == 0) { // added new empty source folder
int n, o; for (n = o = 0; n < newLength && o < oldLength; n++, o++) { if (newSourceLocations[n].equals(oldSourceLocations[o])) continue; // checks source & output folders try { if (newSourceLocations[n].sourceFolder.members().length == 0) { // added new empty source folder
int n, o; for (n = o = 0; n < newLength && o < oldLength; n++, o++) { if (newSourceLocations[n].equals(oldSourceLocations[o])) continue; // checks source & output folders try { if (newSourceLocations[n].sourceFolder.members().length == 0) { // added new empty source folder
int n, o; for (n = o = 0; n < newLength && o < oldLength; n++, o++) { if (newSourceLocations[n].equals(oldSourceLocations[o])) continue; // checks source & output folders try { if (newSourceLocations[n].sourceFolder.members().length == 0) { // added new empty source folder
int n, o; for (n = o = 0; n < newLength && o < oldLength; n++, o++) { if (newSourceLocations[n].equals(oldSourceLocations[o])) continue; // checks source & output folders try { if (newSourceLocations[n].sourceFolder.members().length == 0) { // added new empty source folder