1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286
|
/*
* Copyright (C) 2014-2021 Brian L. Browning
*
* This file is part of Beagle
*
* Beagle is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Beagle is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package vcf;
import blbutil.Const;
import blbutil.SampleFileIt;
import java.io.Closeable;
import java.io.File;
import java.util.ArrayList;
import java.util.List;
/**
* <p>Class {@code RestrictedVcfWindow} represents a sliding window of VCF
* records.
* </p>
* <p>Instances of class {@code RestrictedVcfWindow} are not thread.safe.
* </p>
*
* @author Brian L. Browning {@code <browning@uw.edu>}
*/
public class RestrictedVcfWindow implements Closeable {
private final SampleFileIt<? extends GTRec> it;
private final List<GTRec> window;
private Markers markers;
private int overlap = 0;
private int cumMarkerCnt;
private GTRec next;
/**
* Construct a new {@code RestrictedVcfWindow} instance.
* @param it an iterator that returns VCF records.
* @throws IllegalArgumentException if {@code it.hasNext() == false}
* @throws IllegalArgumentException if a format error is detected in
* a VCF record
* @throws NullPointerException if {@code it == null}
*/
public RestrictedVcfWindow(SampleFileIt<? extends GTRec> it) {
if (it.hasNext()==false) {
throw new IllegalArgumentException("it.hasNext()==false");
}
this.it = it;
this.window = new ArrayList<>();
this.markers = null;
this.overlap = 0;
this.cumMarkerCnt = 0;
this.next = it.next();
}
/**
* Advances the sliding marker window, and returns the advanced window
* as a {@code GTRec[]} object.
* The returned array will have length {@code markers.nMarkers()}.
* Markers not found in the data source will have {@code null}
* entries in the returned array.
*
* @param nextMarkers the set of markers in the advanced window
* @return the advanced marker window
*
* @throws IllegalArgumentException if {@code markers.nMarkers() == 0}
* @throws IllegalArgumentException if any two of the specified markers
* are on different chromosomes
* @throws IllegalArgumentException if specified markers are
* inconsistent with a sliding marker window
* @throws IllegalArgumentException if the specified markers do not
* advance the current marker window
* @throws IllegalArgumentException if a format error is detected in a
* VCF record
* @throws IllegalArgumentException if the input data does not contain
* any of the specified markers
* @throws NullPointerException if {@code nextMarkers == null}
*/
public GTRec[] advanceWindow(Markers nextMarkers) {
checkMarkers(nextMarkers);
advanceToCurrentChrom(nextMarkers);
int fullOverlap = overlap(markers, nextMarkers);
List<GTRec> newWindow = new ArrayList<>(nextMarkers.size());
newWindow.addAll(window.subList(window.size() - fullOverlap, window.size()));
this.overlap = countNonNull(newWindow);
for (int j = fullOverlap, n=nextMarkers.size(); j<n; ++j) {
Marker m = nextMarkers.marker(j);
if (next!=null && next.marker().chromIndex()==m.chromIndex()) {
while (next != null && next.marker().chromIndex()==m.chromIndex()
&& next.marker().pos()<m.pos()) {
next = it.hasNext() ? it.next() : null;
}
while (next != null && next.marker().chromIndex()==m.chromIndex()
&& next.marker().pos()==m.pos()
&& next.marker().equals(m)==false) {
next = it.hasNext() ? it.next() : null;
}
}
if (next != null && next.marker().equals(m)) {
++cumMarkerCnt;
newWindow.add(next);
next = it.hasNext() ? it.next() : null;
}
else {
newWindow.add(null);
}
}
this.markers = nextMarkers;
this.window.clear();
this.window.addAll(newWindow);
if (countNonNull(newWindow) == 0) {
missingMarkersErr(nextMarkers);
}
return window.toArray(new GTRec[0]);
}
private void checkMarkers(Markers mkrs) {
if (mkrs.size()==0) {
throw new IllegalArgumentException("markers do not advance window");
}
Marker start = mkrs.marker(0);
Marker end = mkrs.marker(mkrs.size()-1);
if (this.markers != null) {
Marker m = this.markers.marker(this.markers.size()-1);
if (m.chromIndex()==end.chromIndex() && m.pos()>=end.pos()) {
String s = "markers do not advance window";
throw new IllegalArgumentException(s);
}
}
if (start.chromIndex() != end.chromIndex()) {
String s = "inconsistent chromosomes:" + Const.nl
+ start + Const.nl + end;
throw new IllegalArgumentException(s);
}
}
private void advanceToCurrentChrom(Markers markers) {
int chromIndex = markers.marker(0).chromIndex();
while (next!=null && next.marker().chromIndex()!=chromIndex) {
next = it.hasNext() ? it.next() : null;
}
}
private static int overlap(Markers prev, Markers next) {
if (prev==null
|| prev.marker(0).chromIndex() != next.marker(0).chromIndex()) {
return 0;
}
Marker startMarker = next.marker(0);
int startPos = startMarker.pos();
int index = prev.size() - 1; // index of first overlap marker
while (index >= 0 && prev.marker(index).pos() > startPos) {
--index;
}
while (index >= 0 && prev.marker(index).equals(startMarker)==false) {
--index;
}
if (index < 0) {
throw new IllegalArgumentException("inconsistent markers");
}
int overlap = prev.size() - index;
for (int j = 1; j < overlap; ++j) {
if (prev.marker(index + j).equals(next.marker(j))==false) {
throw new IllegalArgumentException("inconsistent markers");
}
}
return overlap;
}
private static <E> int countNonNull(List<E> list) {
int cnt = 0;
for (int j=0, n=list.size(); j<n; ++j) {
if (list.get(j)!=null) {
++cnt;
}
}
return cnt;
}
private static void missingMarkersErr(Markers markers) {
StringBuilder sb = new StringBuilder(500);
sb.append(Const.nl);
sb.append("ERROR: Reference and target files have no markers in common"
+ " in interval: ");
sb.append(Const.nl);
sb.append(" ");
sb.append(interval(markers));
sb.append(Const.nl);
sb.append(Const.nl);
sb.append("Common markers must have identical CHROM, POS, REF, and ALT"
+ " fields.");
sb.append(Const.nl);
sb.append("Exiting program.");
sb.append(Const.nl);
blbutil.Utilities.exit(sb.toString());
}
private static String interval(Markers markers) {
Marker a = markers.marker(0);
Marker b = markers.marker(markers.size()-1);
assert a.chromIndex() == b.chromIndex();
return a.chrom() + Const.colon + a.pos() + Const.hyphen + b.pos();
}
/**
* Returns the file from which VCF records are read, or returns
* {@code null} if the source is standard input.
* @return the file from which VCF records are read, or
* {@code null} if the source is standard input
*/
public File file() {
return it.file();
}
/**
* Returns the list of samples.
* @return the list of samples
*/
public Samples samples() {
return it.samples();
}
/**
* Returns the number of samples.
* @return the number of samples
*/
public int nSamples() {
return it.samples().size();
}
/**
* Returns the number of VCF records in the overlap between the current
* window and the previous window. Returns 0 if the current window
* is the first window.
*
* @return the number of VCF records in the overlap between the current
* window and the previous window
*/
public int overlap() {
return overlap;
}
/**
* Returns the number of VCF records in the union of the current window
* and all previous windows.
*
* @return the number of VCF records in the union of the current window
* and all previous windows
*/
public int cumMarkerCnt() {
return cumMarkerCnt;
}
/**
* Releases any I/O resources controlled by this object.
*/
@Override
public void close() {
it.close();
}
/**
* Returns a string representation of {@code this}. The exact
* details of the representation are unspecified and subject to change.
* @return a string representation of {@code this}
*/
@Override
public String toString() {
StringBuilder sb = new StringBuilder(100);
sb.append(this.getClass().toString());
sb.append(" - next:");
sb.append(next);
return sb.toString();
}
}
|