ArrayList<BTreeVisitor.Predicate<Location>> missingPredicates = new ArrayList<>(); for (Integer missing : missingJournalFiles) { missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(missing, 0), new Location(missing + 1, 0))); int id = dataFile.getDataFileId(); missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(id, dataFile.getLength()), new Location(id + 1, 0))); Sequence seq = dataFile.getCorruptedBlocks().getHead(); while (seq != null) { BTreeVisitor.BetweenVisitor<Location, Long> visitor = new BTreeVisitor.BetweenVisitor<>(new Location(id, (int) seq.getFirst()), new Location(id, (int) seq.getLast() + 1)); missingPredicates.add(visitor); knownCorruption.add(visitor);
ArrayList<BTreeVisitor.Predicate<Location>> missingPredicates = new ArrayList<>(); for (Integer missing : missingJournalFiles) { missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(missing, 0), new Location(missing + 1, 0))); int id = dataFile.getDataFileId(); missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(id, dataFile.getLength()), new Location(id + 1, 0))); Sequence seq = dataFile.getCorruptedBlocks().getHead(); while (seq != null) { BTreeVisitor.BetweenVisitor<Location, Long> visitor = new BTreeVisitor.BetweenVisitor<>(new Location(id, (int) seq.getFirst()), new Location(id, (int) seq.getLast() + 1)); missingPredicates.add(visitor); knownCorruption.add(visitor);
ArrayList<BTreeVisitor.Predicate<Location>> missingPredicates = new ArrayList<>(); for (Integer missing : missingJournalFiles) { missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(missing, 0), new Location(missing + 1, 0))); int id = dataFile.getDataFileId(); missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(id, dataFile.getLength()), new Location(id + 1, 0))); Sequence seq = dataFile.getCorruptedBlocks().getHead(); while (seq != null) { BTreeVisitor.BetweenVisitor<Location, Long> visitor = new BTreeVisitor.BetweenVisitor<>(new Location(id, (int) seq.getFirst()), new Location(id, (int) seq.getLast() + 1)); missingPredicates.add(visitor); knownCorruption.add(visitor);
ArrayList<BTreeVisitor.Predicate<Location>> missingPredicates = new ArrayList<>(); for (Integer missing : missingJournalFiles) { missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(missing, 0), new Location(missing + 1, 0))); int id = dataFile.getDataFileId(); missingPredicates.add(new BTreeVisitor.BetweenVisitor<Location, Long>(new Location(id, dataFile.getLength()), new Location(id + 1, 0))); Sequence seq = dataFile.getCorruptedBlocks().getHead(); while (seq != null) { BTreeVisitor.BetweenVisitor<Location, Long> visitor = new BTreeVisitor.BetweenVisitor<>(new Location(id, (int) seq.getFirst()), new Location(id, (int) seq.getLast() + 1)); missingPredicates.add(visitor); knownCorruption.add(visitor);