2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
23 import java.util.ArrayList;
24 import java.util.Arrays;
25 import java.util.HashMap;
26 import java.util.Iterator;
27 import java.util.List;
30 import jalview.analysis.AlignmentSorter;
31 import jalview.api.AlignViewportI;
32 import jalview.bin.Cache;
33 import jalview.commands.CommandI;
34 import jalview.commands.EditCommand;
35 import jalview.commands.EditCommand.Action;
36 import jalview.commands.EditCommand.Edit;
37 import jalview.commands.OrderCommand;
38 import jalview.datamodel.AlignedCodonFrame;
39 import jalview.datamodel.AlignmentI;
40 import jalview.datamodel.AlignmentOrder;
41 import jalview.datamodel.ColumnSelection;
42 import jalview.datamodel.HiddenColumns;
43 import jalview.datamodel.SearchResultMatchI;
44 import jalview.datamodel.SearchResults;
45 import jalview.datamodel.SearchResultsI;
46 import jalview.datamodel.Sequence;
47 import jalview.datamodel.SequenceGroup;
48 import jalview.datamodel.SequenceI;
51 * Helper methods for manipulations involving sequence mappings.
56 public final class MappingUtils
60 * Helper method to map a CUT or PASTE command.
63 * the original command
65 * if true, the command is to be undone
67 * the mapped sequences to apply the mapped command to
69 * the mapped EditCommand to add to
72 protected static void mapCutOrPaste(Edit edit, boolean undo,
73 List<SequenceI> targetSeqs, EditCommand result,
74 List<AlignedCodonFrame> mappings)
76 Action action = edit.getAction();
79 action = action.getUndoAction();
82 Cache.log.error("MappingUtils.mapCutOrPaste not yet implemented");
86 * Returns a new EditCommand representing the given command as mapped to the
87 * given sequences. If there is no mapping, returns null.
96 public static EditCommand mapEditCommand(EditCommand command,
97 boolean undo, final AlignmentI mapTo, char gapChar,
98 List<AlignedCodonFrame> mappings)
101 * For now, only support mapping from protein edits to cDna
103 if (!mapTo.isNucleotide())
109 * Cache a copy of the target sequences so we can mimic successive edits on
110 * them. This lets us compute mappings for all edits in the set.
112 Map<SequenceI, SequenceI> targetCopies = new HashMap<>();
113 for (SequenceI seq : mapTo.getSequences())
115 SequenceI ds = seq.getDatasetSequence();
118 final SequenceI copy = new Sequence(seq);
119 copy.setDatasetSequence(ds);
120 targetCopies.put(ds, copy);
125 * Compute 'source' sequences as they were before applying edits:
127 Map<SequenceI, SequenceI> originalSequences = command.priorState(undo);
129 EditCommand result = new EditCommand();
130 Iterator<Edit> edits = command.getEditIterator(!undo);
131 while (edits.hasNext())
133 Edit edit = edits.next();
134 if (edit.getAction() == Action.CUT
135 || edit.getAction() == Action.PASTE)
137 mapCutOrPaste(edit, undo, mapTo.getSequences(), result, mappings);
139 else if (edit.getAction() == Action.INSERT_GAP
140 || edit.getAction() == Action.DELETE_GAP)
142 mapInsertOrDelete(edit, undo, originalSequences,
143 mapTo.getSequences(), targetCopies, gapChar, result,
147 return result.getSize() > 0 ? result : null;
151 * Helper method to map an edit command to insert or delete gaps.
154 * the original command
156 * if true, the action is to undo the command
157 * @param originalSequences
158 * the sequences the command acted on
160 * @param targetCopies
163 * the new EditCommand to add mapped commands to
166 protected static void mapInsertOrDelete(Edit edit, boolean undo,
167 Map<SequenceI, SequenceI> originalSequences,
168 final List<SequenceI> targetSeqs,
169 Map<SequenceI, SequenceI> targetCopies, char gapChar,
170 EditCommand result, List<AlignedCodonFrame> mappings)
172 Action action = edit.getAction();
175 * Invert sense of action if an Undo.
179 action = action.getUndoAction();
181 final int count = edit.getNumber();
182 final int editPos = edit.getPosition();
183 for (SequenceI seq : edit.getSequences())
186 * Get residue position at (or to right of) edit location. Note we use our
187 * 'copy' of the sequence before editing for this.
189 SequenceI ds = seq.getDatasetSequence();
194 final SequenceI actedOn = originalSequences.get(ds);
195 final int seqpos = actedOn.findPosition(editPos);
198 * Determine all mappings from this position to mapped sequences.
200 SearchResultsI sr = buildSearchResults(seq, seqpos, mappings);
204 for (SequenceI targetSeq : targetSeqs)
206 ds = targetSeq.getDatasetSequence();
211 SequenceI copyTarget = targetCopies.get(ds);
212 final int[] match = sr.getResults(copyTarget, 0,
213 copyTarget.getLength());
216 final int ratio = 3; // TODO: compute this - how?
217 final int mappedCount = count * ratio;
220 * Shift Delete start position left, as it acts on positions to its
223 int mappedEditPos = action == Action.DELETE_GAP
224 ? match[0] - mappedCount
226 Edit e = result.new Edit(action, new SequenceI[] { targetSeq },
227 mappedEditPos, mappedCount, gapChar);
231 * and 'apply' the edit to our copy of its target sequence
233 if (action == Action.INSERT_GAP)
235 copyTarget.setSequence(new String(
236 StringUtils.insertCharAt(copyTarget.getSequence(),
237 mappedEditPos, mappedCount, gapChar)));
239 else if (action == Action.DELETE_GAP)
241 copyTarget.setSequence(new String(
242 StringUtils.deleteChars(copyTarget.getSequence(),
243 mappedEditPos, mappedEditPos + mappedCount)));
249 * and 'apply' the edit to our copy of its source sequence
251 if (action == Action.INSERT_GAP)
253 actedOn.setSequence(new String(StringUtils.insertCharAt(
254 actedOn.getSequence(), editPos, count, gapChar)));
256 else if (action == Action.DELETE_GAP)
258 actedOn.setSequence(new String(StringUtils.deleteChars(
259 actedOn.getSequence(), editPos, editPos + count)));
265 * Returns a SearchResults object describing the mapped region corresponding
266 * to the specified sequence position.
273 public static SearchResultsI buildSearchResults(SequenceI seq, int index,
274 List<AlignedCodonFrame> seqmappings)
276 SearchResultsI results = new SearchResults();
277 addSearchResults(results, seq, index, seqmappings);
282 * Adds entries to a SearchResults object describing the mapped region
283 * corresponding to the specified sequence position.
290 public static void addSearchResults(SearchResultsI results, SequenceI seq,
291 int index, List<AlignedCodonFrame> seqmappings)
293 if (index >= seq.getStart() && index <= seq.getEnd())
295 for (AlignedCodonFrame acf : seqmappings)
297 acf.markMappedRegion(seq, index, results);
303 * Returns a (possibly empty) SequenceGroup containing any sequences in the
304 * mapped viewport corresponding to the given group in the source viewport.
311 public static SequenceGroup mapSequenceGroup(final SequenceGroup sg,
312 final AlignViewportI mapFrom, final AlignViewportI mapTo)
315 * Note the SequenceGroup holds aligned sequences, the mappings hold dataset
318 boolean targetIsNucleotide = mapTo.isNucleotide();
319 AlignViewportI protein = targetIsNucleotide ? mapFrom : mapTo;
320 List<AlignedCodonFrame> codonFrames = protein.getAlignment()
323 * Copy group name, colours etc, but not sequences or sequence colour scheme
325 SequenceGroup mappedGroup = new SequenceGroup(sg);
326 mappedGroup.setColourScheme(mapTo.getGlobalColourScheme());
329 int minStartCol = -1;
331 final int selectionStartRes = sg.getStartRes();
332 final int selectionEndRes = sg.getEndRes();
333 for (SequenceI selected : sg.getSequences())
336 * Find the widest range of non-gapped positions in the selection range
338 int firstUngappedPos = selectionStartRes;
339 while (firstUngappedPos <= selectionEndRes
340 && Comparison.isGap(selected.getCharAt(firstUngappedPos)))
346 * If this sequence is only gaps in the selected range, skip it
348 if (firstUngappedPos > selectionEndRes)
353 int lastUngappedPos = selectionEndRes;
354 while (lastUngappedPos >= selectionStartRes
355 && Comparison.isGap(selected.getCharAt(lastUngappedPos)))
361 * Find the selected start/end residue positions in sequence
363 int startResiduePos = selected.findPosition(firstUngappedPos);
364 int endResiduePos = selected.findPosition(lastUngappedPos);
366 for (AlignedCodonFrame acf : codonFrames)
368 SequenceI mappedSequence = targetIsNucleotide
369 ? acf.getDnaForAaSeq(selected)
370 : acf.getAaForDnaSeq(selected);
371 if (mappedSequence != null)
373 for (SequenceI seq : mapTo.getAlignment().getSequences())
375 int mappedStartResidue = 0;
376 int mappedEndResidue = 0;
377 if (seq.getDatasetSequence() == mappedSequence)
380 * Found a sequence mapping. Locate the start/end mapped residues.
382 List<AlignedCodonFrame> mapping = Arrays
383 .asList(new AlignedCodonFrame[]
385 SearchResultsI sr = buildSearchResults(selected,
386 startResiduePos, mapping);
387 for (SearchResultMatchI m : sr.getResults())
389 mappedStartResidue = m.getStart();
390 mappedEndResidue = m.getEnd();
392 sr = buildSearchResults(selected, endResiduePos, mapping);
393 for (SearchResultMatchI m : sr.getResults())
395 mappedStartResidue = Math.min(mappedStartResidue,
397 mappedEndResidue = Math.max(mappedEndResidue, m.getEnd());
401 * Find the mapped aligned columns, save the range. Note findIndex
402 * returns a base 1 position, SequenceGroup uses base 0
404 int mappedStartCol = seq.findIndex(mappedStartResidue) - 1;
405 minStartCol = minStartCol == -1 ? mappedStartCol
406 : Math.min(minStartCol, mappedStartCol);
407 int mappedEndCol = seq.findIndex(mappedEndResidue) - 1;
408 maxEndCol = maxEndCol == -1 ? mappedEndCol
409 : Math.max(maxEndCol, mappedEndCol);
410 mappedGroup.addSequence(seq, false);
417 mappedGroup.setStartRes(minStartCol < 0 ? 0 : minStartCol);
418 mappedGroup.setEndRes(maxEndCol < 0 ? 0 : maxEndCol);
423 * Returns an OrderCommand equivalent to the given one, but acting on mapped
424 * sequences as described by the mappings, or null if no mapping can be made.
427 * the original order command
429 * if true, the action is to undo the sort
431 * the alignment we are mapping to
433 * the mappings available
436 public static CommandI mapOrderCommand(OrderCommand command, boolean undo,
437 AlignmentI mapTo, List<AlignedCodonFrame> mappings)
439 SequenceI[] sortOrder = command.getSequenceOrder(undo);
440 List<SequenceI> mappedOrder = new ArrayList<>();
444 * Assumption: we are only interested in a cDNA/protein mapping; refactor in
445 * future if we want to support sorting (c)dna as (c)dna or protein as
448 boolean mappingToNucleotide = mapTo.isNucleotide();
449 for (SequenceI seq : sortOrder)
451 for (AlignedCodonFrame acf : mappings)
453 SequenceI mappedSeq = mappingToNucleotide ? acf.getDnaForAaSeq(seq)
454 : acf.getAaForDnaSeq(seq);
455 if (mappedSeq != null)
457 for (SequenceI seq2 : mapTo.getSequences())
459 if (seq2.getDatasetSequence() == mappedSeq)
461 mappedOrder.add(seq2);
471 * Return null if no mappings made.
479 * Add any unmapped sequences on the end of the sort in their original
482 if (j < mapTo.getHeight())
484 for (SequenceI seq : mapTo.getSequences())
486 if (!mappedOrder.contains(seq))
488 mappedOrder.add(seq);
494 * Have to sort the sequences before constructing the OrderCommand - which
495 * then resorts them?!?
497 final SequenceI[] mappedOrderArray = mappedOrder
498 .toArray(new SequenceI[mappedOrder.size()]);
499 SequenceI[] oldOrder = mapTo.getSequencesArray();
500 AlignmentSorter.sortBy(mapTo, new AlignmentOrder(mappedOrderArray));
501 final OrderCommand result = new OrderCommand(command.getDescription(),
507 * Returns a ColumnSelection in the 'mapTo' view which corresponds to the
508 * given selection in the 'mapFrom' view. We assume one is nucleotide, the
509 * other is protein (and holds the mappings from codons to protein residues).
516 public static void mapColumnSelection(ColumnSelection colsel,
517 HiddenColumns hiddencols, AlignViewportI mapFrom,
518 AlignViewportI mapTo, ColumnSelection newColSel,
519 HiddenColumns newHidden)
521 boolean targetIsNucleotide = mapTo.isNucleotide();
522 AlignViewportI protein = targetIsNucleotide ? mapFrom : mapTo;
523 List<AlignedCodonFrame> codonFrames = protein.getAlignment()
528 return; // mappedColumns;
531 char fromGapChar = mapFrom.getAlignment().getGapCharacter();
534 * For each mapped column, find the range of columns that residues in that
537 List<SequenceI> fromSequences = mapFrom.getAlignment().getSequences();
538 List<SequenceI> toSequences = mapTo.getAlignment().getSequences();
540 for (Integer sel : colsel.getSelected())
542 mapColumn(sel.intValue(), codonFrames, newColSel, fromSequences,
543 toSequences, fromGapChar);
546 Iterator<int[]> regions = hiddencols.iterator();
547 while (regions.hasNext())
549 mapHiddenColumns(regions.next(), codonFrames, newHidden,
550 fromSequences, toSequences, fromGapChar);
552 return; // mappedColumns;
556 * Helper method that maps a [start, end] hidden column range to its mapped
561 * @param mappedColumns
562 * @param fromSequences
566 protected static void mapHiddenColumns(int[] hidden,
567 List<AlignedCodonFrame> mappings, HiddenColumns mappedColumns,
568 List<SequenceI> fromSequences, List<SequenceI> toSequences,
571 for (int col = hidden[0]; col <= hidden[1]; col++)
573 int[] mappedTo = findMappedColumns(col, mappings, fromSequences,
574 toSequences, fromGapChar);
577 * Add the range of hidden columns to the mapped selection (converting
580 if (mappedTo != null)
582 mappedColumns.hideColumns(mappedTo[0] - 1, mappedTo[1] - 1);
588 * Helper method to map one column selection
591 * the column number (base 0)
593 * the sequence mappings
594 * @param mappedColumns
595 * the mapped column selections to add to
596 * @param fromSequences
600 protected static void mapColumn(int col, List<AlignedCodonFrame> mappings,
601 ColumnSelection mappedColumns, List<SequenceI> fromSequences,
602 List<SequenceI> toSequences, char fromGapChar)
604 int[] mappedTo = findMappedColumns(col, mappings, fromSequences,
605 toSequences, fromGapChar);
608 * Add the range of mapped columns to the mapped selection (converting
609 * base 1 to base 0). Note that this may include intron-only regions which
610 * lie between the start and end ranges of the selection.
612 if (mappedTo != null)
614 for (int i = mappedTo[0]; i <= mappedTo[1]; i++)
616 mappedColumns.addElement(i - 1);
622 * Helper method to find the range of columns mapped to from one column.
623 * Returns the maximal range of columns mapped to from all sequences in the
624 * source column, or null if no mappings were found.
628 * @param fromSequences
633 protected static int[] findMappedColumns(int col,
634 List<AlignedCodonFrame> mappings, List<SequenceI> fromSequences,
635 List<SequenceI> toSequences, char fromGapChar)
637 int[] mappedTo = new int[] { Integer.MAX_VALUE, Integer.MIN_VALUE };
638 boolean found = false;
641 * For each sequence in the 'from' alignment
643 for (SequenceI fromSeq : fromSequences)
646 * Ignore gaps (unmapped anyway)
648 if (fromSeq.getCharAt(col) == fromGapChar)
654 * Get the residue position and find the mapped position.
656 int residuePos = fromSeq.findPosition(col);
657 SearchResultsI sr = buildSearchResults(fromSeq, residuePos, mappings);
658 for (SearchResultMatchI m : sr.getResults())
660 int mappedStartResidue = m.getStart();
661 int mappedEndResidue = m.getEnd();
662 SequenceI mappedSeq = m.getSequence();
665 * Locate the aligned sequence whose dataset is mappedSeq. TODO a
666 * datamodel that can do this efficiently.
668 for (SequenceI toSeq : toSequences)
670 if (toSeq.getDatasetSequence() == mappedSeq)
672 int mappedStartCol = toSeq.findIndex(mappedStartResidue);
673 int mappedEndCol = toSeq.findIndex(mappedEndResidue);
674 mappedTo[0] = Math.min(mappedTo[0], mappedStartCol);
675 mappedTo[1] = Math.max(mappedTo[1], mappedEndCol);
678 // note: remove break if we ever want to map one to many sequences
683 return found ? mappedTo : null;
687 * Returns the mapped codon or codons for a given aligned sequence column
691 * an aligned peptide sequence
693 * an aligned column position (base 0)
695 * a set of codon mappings
696 * @return the bases of the mapped codon(s) in the cDNA dataset sequence(s),
697 * or an empty list if none found
699 public static List<char[]> findCodonsFor(SequenceI seq, int col,
700 List<AlignedCodonFrame> mappings)
702 List<char[]> result = new ArrayList<>();
703 int dsPos = seq.findPosition(col);
704 for (AlignedCodonFrame mapping : mappings)
706 if (mapping.involvesSequence(seq))
708 List<char[]> codons = mapping
709 .getMappedCodons(seq.getDatasetSequence(), dsPos);
712 result.addAll(codons);
720 * Converts a series of [start, end] range pairs into an array of individual
721 * positions. This also caters for 'reverse strand' (start > end) cases.
726 public static int[] flattenRanges(int[] ranges)
729 * Count how many positions altogether
732 for (int i = 0; i < ranges.length - 1; i += 2)
734 count += Math.abs(ranges[i + 1] - ranges[i]) + 1;
737 int[] result = new int[count];
739 for (int i = 0; i < ranges.length - 1; i += 2)
741 int from = ranges[i];
742 final int to = ranges[i + 1];
743 int step = from <= to ? 1 : -1;
748 } while (from != to + step);
754 * Returns a list of any mappings that are from or to the given (aligned or
761 public static List<AlignedCodonFrame> findMappingsForSequence(
762 SequenceI sequence, List<AlignedCodonFrame> mappings)
764 return findMappingsForSequenceAndOthers(sequence, mappings, null);
768 * Returns a list of any mappings that are from or to the given (aligned or
769 * dataset) sequence, optionally limited to mappings involving one of a given
777 public static List<AlignedCodonFrame> findMappingsForSequenceAndOthers(
778 SequenceI sequence, List<AlignedCodonFrame> mappings,
779 List<SequenceI> filterList)
781 List<AlignedCodonFrame> result = new ArrayList<>();
782 if (sequence == null || mappings == null)
786 for (AlignedCodonFrame mapping : mappings)
788 if (mapping.involvesSequence(sequence))
790 if (filterList != null)
792 for (SequenceI otherseq : filterList)
794 SequenceI otherDataset = otherseq.getDatasetSequence();
795 if (otherseq == sequence
796 || otherseq == sequence.getDatasetSequence()
797 || (otherDataset != null && (otherDataset == sequence
798 || otherDataset == sequence
799 .getDatasetSequence())))
801 // skip sequences in subset which directly relate to sequence
804 if (mapping.involvesSequence(otherseq))
806 // selected a mapping contained in subselect alignment
822 * Returns the total length of the supplied ranges, which may be as single
823 * [start, end] or multiple [start, end, start, end ...]
828 public static int getLength(List<int[]> ranges)
835 for (int[] range : ranges)
837 if (range.length % 2 != 0)
840 "Error unbalance start/end ranges: " + ranges.toString());
843 for (int i = 0; i < range.length - 1; i += 2)
845 length += Math.abs(range[i + 1] - range[i]) + 1;
852 * Answers true if any range includes the given value
858 public static boolean contains(List<int[]> ranges, int value)
864 for (int[] range : ranges)
866 if (range[1] >= range[0] && value >= range[0] && value <= range[1])
869 * value within ascending range
873 if (range[1] < range[0] && value <= range[0] && value >= range[1])
876 * value within descending range
885 * Removes a specified number of positions from the start of a ranges list.
886 * For example, could be used to adjust cds ranges to allow for an incomplete
887 * start codon. Subranges are removed completely, or their start positions
888 * adjusted, until the required number of positions has been removed from the
889 * range. Reverse strand ranges are supported. The input array is not
894 * an array of [start, end, start, end...] positions
895 * @return a new array with the first removeCount positions removed
897 public static int[] removeStartPositions(int removeCount,
900 if (removeCount <= 0)
905 int[] copy = Arrays.copyOf(ranges, ranges.length);
908 for (int x = 0; x < copy.length && sxpos == -1; x += 2)
910 cdspos += Math.abs(copy[x + 1] - copy[x]) + 1;
911 if (removeCount < cdspos)
914 * we have removed enough, time to finish
919 * increment start of first exon, or decrement if reverse strand
921 if (copy[x] <= copy[x + 1])
923 copy[x] = copy[x + 1] - cdspos + removeCount + 1;
927 copy[x] = copy[x + 1] + cdspos - removeCount - 1;
936 * we dropped at least one entire sub-range - compact the array
938 int[] nxon = new int[copy.length - sxpos];
939 System.arraycopy(copy, sxpos, nxon, 0, copy.length - sxpos);
946 * Answers true if range's start-end positions include those of queryRange,
947 * where either range might be in reverse direction, else false
952 * a candidate subrange of range (start2-end2)
955 public static boolean rangeContains(int[] range, int[] queryRange)
957 if (range == null || queryRange == null || range.length != 2
958 || queryRange.length != 2)
966 int min = Math.min(range[0], range[1]);
967 int max = Math.max(range[0], range[1]);
969 return (min <= queryRange[0] && max >= queryRange[0]
970 && min <= queryRange[1] && max >= queryRange[1]);
974 * Removes the specified number of positions from the given ranges. Provided
975 * to allow a stop codon to be stripped from a CDS sequence so that it matches
976 * the peptide translation length.
980 * a list of (single) [start, end] ranges
983 public static void removeEndPositions(int positions, List<int[]> ranges)
985 int toRemove = positions;
986 Iterator<int[]> it = new ReverseListIterator<>(ranges);
989 int[] endRange = it.next();
990 if (endRange.length != 2)
993 * not coded for [start1, end1, start2, end2, ...]
996 "MappingUtils.removeEndPositions doesn't handle multiple ranges");
1000 int length = endRange[1] - endRange[0] + 1;
1004 * not coded for a reverse strand range (end < start)
1007 "MappingUtils.removeEndPositions doesn't handle reverse strand");
1010 if (length > toRemove)
1012 endRange[1] -= toRemove;
1024 * Converts a list of {@code start-end} ranges to a single array of
1025 * {@code start1, end1, start2, ... } ranges
1030 public static int[] rangeListToArray(List<int[]> ranges)
1032 int rangeCount = ranges.size();
1033 int[] result = new int[rangeCount * 2];
1035 for (int i = 0; i < rangeCount; i++)
1037 int[] range = ranges.get(i);
1038 result[j++] = range[0];
1039 result[j++] = range[1];
1045 * Returns the maximal start-end positions in the given (ordered) list of
1046 * ranges which is overlapped by the given begin-end range, or null if there
1051 * if ranges is {[4, 8], [10, 12], [16, 19]}
1053 * findOverlap(ranges, 1, 20) == [4, 19]
1054 * findOverlap(ranges, 6, 11) == [6, 11]
1055 * findOverlap(ranges, 9, 15) == [10, 12]
1056 * findOverlap(ranges, 13, 15) == null
1064 protected static int[] findOverlap(List<int[]> ranges, final int begin,
1067 boolean foundStart = false;
1072 * traverse the ranges to find the first position (if any) >= begin,
1073 * and the last position (if any) <= end
1075 for (int[] range : ranges)
1079 if (range[0] >= begin)
1082 * first range that starts with, or follows, begin
1085 from = Math.max(range[0], begin);
1087 else if (range[1] >= begin)
1090 * first range that contains begin
1097 if (range[0] <= end)
1099 to = Math.min(end, range[1]);
1103 return foundStart && to >= from ? new int[] { from, to } : null;