File: BasicGT.java

package info (click to toggle)
beagle 220722-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 9,644 kB
  • sloc: java: 17,045; sh: 55; makefile: 11
file content (287 lines) | stat: -rw-r--r-- 10,114 bytes parent folder | download
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
287
/*
 * 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 java.util.stream.IntStream;

/**
 * <p>Class {@code BasicGT} represents genotypes for a list of markers and
 * samples.</p>
 *
 * <p>Instances of class {@code BasicGT} are immutable</p>
 *
 * @author Brian L. Browning {@code <browning@uw.edu>}
 */
public final class BasicGT implements GT {

    private final Samples samples;
    private final Markers markers;
    private final GTRec[] recs;
    private final boolean isRefData;

    /**
     * Returns the genotype index corresponding to the specified unordered
     * alleles.
     * @param a1 the first allele index of an unordered genotype
     * @param a2 the second allele index of an unordered genotype
     * @return the genotype index corresponding to the specified unordered
     * alleles
     * @throws IllegalArgumentException if {@code a1 < 0 || a2 < 0}
     */
    public static int genotype(int a1, int a2) {
        if (a1<=a2) {
            if (a1 < 0) {
                String s = "allele < 0: " + a1 + " " + a2;
                throw new IllegalArgumentException(s);
            }
            return (a2*(a2+1))/2 + a1;
        }
        else {
            if (a2<0) {
                String s = "allele < 0: " + a1 + " " + a2;
                throw new IllegalArgumentException(s);
            }
            return (a1*(a1+1))/2 + a2;
        }
    }

    /**
     * Constructs a {@code BasicGT} instance from the specified data
     * @param recs genotype records for a list of markers
     * @throws IllegalArgumentException
     * if elements of {@code recs} corresponding to the same chromosome
     * are not contiguous and sorted in chromosome position order
     * @throws IllegalArgumentException if {@code recs.length == 0}
     * @throws IllegalArgumentException if any two elements of
     * {@code recs} correspond to the same genetic marker
     * @throws IllegalArgumentException if
     * {@code (recs[j].samples().equals(recs[k].samples()) == false)} for any
     * {@code j, k} satisfying {@code (0 <= j && j < k && j < recs.length)}
     * @throws NullPointerException if {@code recs == null}
     * @throws NullPointerException if {@code (recs[j] == null)} any {@code j}
     * satisfying {@code (0 <= j && j < recs.length)}
     */
    public BasicGT(GTRec[] recs) {
        this(recs[0].samples(), recs);
    }

    /**
     * Constructs a {@code BasicGT} instance from the specified data
     * @param samples the list of samples with genotype data
     * @param recs genotype records for a list of markers
     * @throws IllegalArgumentException
     * if elements of {@code recs} corresponding to the same chromosome
     * are not contiguous and sorted in chromosome position order
     * @throws IllegalArgumentException if any two elements of
     * {@code recs} correspond to the same genetic marker
     * @throws IllegalArgumentException if
     * {@code (recs[j].samples().equals(samples) == false)} for any {@code j}
     * satisfying {@code (0 <= j && j < recs.length)}
     * @throws NullPointerException if {@code samples == null || recs == null}
     * @throws NullPointerException if {@code (recs[j] == null)} any {@code j}
     * satisfying {@code (0 <= j && j < recs.length)}
     */
    public BasicGT(Samples samples, GTRec[] recs) {
        checkSamples(samples, recs);
        this.markers = markers(recs);
        this.samples = samples;
        this.recs = recs.clone();
        this.isRefData = isRefData(recs);
    }

    /**
     * Constructs a {@code BasicGT} instance from the specified data.
     * @param markers the list of markers with genotype data
     * @param samples the list of samples with genotype data
     * @param recs the genotype data for each marker
     * @throws IllegalArgumentException if
     * {@code (recs[j].marker().equals(markers.marker(j)) == false)} for any
     * {@code j} satisfying {@code (0 <= j && j < recs.length)}
     * @throws IllegalArgumentException if
     * {@code (recs[j].samples().equals(samples) == false)} for any {@code j}
     * satisfying {@code (0 <= j && j < recs.length)}
     * @throws NullPointerException if
     * {@code (markers == null || samples == null || recs == null)}
     * @throws NullPointerException if {@code (recs[j] == null)} any {@code j}
     * satisfying {@code (0 <= j && j < recs.length)}
     */
    public BasicGT(Markers markers, Samples samples, GTRec[] recs) {
        checkMarkersAndSamples(markers, samples, recs);
        this.markers = markers;
        this.samples = samples;
        this.recs = recs.clone();
        this.isRefData = isRefData(recs);
    }

    private static void checkSamples(Samples samples, GTRec[] recs) {
        for (int j=0; j<recs.length; ++j) {
            if (recs[j].samples().equals(samples)==false) {
                throw new IllegalArgumentException("inconsistent samples");
            }
        }
    }

    private static void checkMarkersAndSamples(Markers markers, Samples samples,
            GTRec[] recs) {
        for (int j=0; j<recs.length; ++j) {
            if (recs[j].marker().equals(markers.marker(j))==false) {
                throw new IllegalArgumentException("inconsistent markers");
            }
            if (recs[j].samples().equals(samples)==false) {
                throw new IllegalArgumentException("inconsistent samples");
            }
        }
    }

    private static Markers markers(GTRec[] recs) {
        Marker[] markers = new Marker[recs.length];
        for (int j=0; j<markers.length; ++j) {
            markers[j] = recs[j].marker();
        }
        return Markers.create(markers);
    }

    private static boolean isRefData(GTRec[] recs) {
        boolean isRefData = true;
        for (int j=0; j<recs.length && isRefData==true; ++j) {
            if (recs[j].isPhased()==false) {
                isRefData = false;
            }
        }
        return isRefData;
    }

    @Override
    public boolean isReversed() {
        return false;
    }

    @Override
    public int nMarkers() {
        return recs.length;
    }

    @Override
    public Marker marker(int markerIndex) {
        return markers.marker(markerIndex);
    }

    @Override
    public Markers markers() {
        return markers;
    }

    @Override
    public int nHaps() {
        return 2*samples.size();
    }

    @Override
    public int nSamples() {
        return samples.size();
    }

    @Override
    public Samples samples() {
        return samples;
    }

    @Override
    public boolean isPhased() {
        return isRefData;
    }

    @Override
    public int allele1(int marker, int sample) {
        return recs[marker].allele1(sample);
    }

    @Override
    public int allele2(int marker, int sample) {
        return recs[marker].allele2(sample);
    }

    @Override
    public int allele(int marker, int hap) {
        return recs[marker].get(hap);
    }

    /**
     * Returns a {@code BasicGT} instance restricted to genotype data for
     * the specified markers.
     * @param gt the {@code BasicGT} instance to be restricted
     * @param indices a list of distinct marker indices (from
     * {@code this.markers())} in increasing order
     * @return a {@code GT} instance restricted to genotype data for
     * the specified markers
     *
     * @throws IndexOutOfBoundsException if there exists {@code j} such that
     * {@code (0 <= j && j < indices.length)} such that
     * {@code (indices[j] < 0 || indices[j] >= gt.nMarkers())}
     * @throws IllegalArgumentException if there exists {@code j} such that
     * {@code (1 <= j && j < indices.length)} such that
     * {@code (indices[j] <= indice[j - 1])}
     * @throws NullPointerException if {@code gt == null || indices == null}
     */
    public static BasicGT restrict(BasicGT gt, int[] indices) {
        Markers restrictMarkers = gt.markers.restrict(indices);
        GTRec[] restrictedRecs = IntStream.range(0, indices.length)
                .mapToObj(j -> gt.recs[indices[j]])
                .toArray(GTRec[]::new);
        return new BasicGT(restrictMarkers, gt.samples, restrictedRecs);
    }

    @Override
    public BasicGT restrict(Markers restrictedMarkers, int[] indices) {
        GTRec[] restrictedRecs = IntStream.range(0, indices.length)
                .mapToObj(j -> recs[indices[j]])
                .toArray(GTRec[]::new);
        return new BasicGT(restrictedMarkers, samples, restrictedRecs);
    }

    @Override
    public BasicGT restrict(int start, int end) {
        Markers restrictMarkers = markers.restrict(start, end);
        GTRec[] restrictRecs = IntStream.range(start, end)
                .mapToObj(j -> recs[j])
                .toArray(GTRec[]::new);
        return new BasicGT(restrictMarkers, samples, restrictRecs);
    }

    /**
     * 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();
        sb.append("[BasicGT: nMarkers=");
        sb.append(nMarkers());
        sb.append(" nSamples=");
        sb.append(nSamples());
        for (GTRec rec : recs) {
            sb.append(Const.nl);
            sb.append(rec);
        }
        sb.append(']');
        return sb.toString();
    }
}