| 1282 | } |
| 1283 | |
| 1284 | private static class AtableByte extends AtableBase implements Atable<Byte> { |
| 1285 | |
| 1286 | public AtableByte(Mat mat, int row, int col) { |
| 1287 | super(mat, row, col); |
| 1288 | } |
| 1289 | |
| 1290 | public AtableByte(Mat mat, int[] indices) { |
| 1291 | super(mat, indices); |
| 1292 | } |
| 1293 | |
| 1294 | @Override |
| 1295 | public Byte getV() { |
| 1296 | byte[] data = new byte[1]; |
| 1297 | mat.get(indices, data); |
| 1298 | return data[0]; |
| 1299 | } |
| 1300 | |
| 1301 | @Override |
| 1302 | public void setV(Byte v) { |
| 1303 | byte[] data = new byte[] { v }; |
| 1304 | mat.put(indices, data); |
| 1305 | } |
| 1306 | |
| 1307 | @Override |
| 1308 | public Tuple2<Byte> getV2c() { |
| 1309 | byte[] data = new byte[2]; |
| 1310 | mat.get(indices, data); |
| 1311 | return new Tuple2<Byte>(data[0], data[1]); |
| 1312 | } |
| 1313 | |
| 1314 | @Override |
| 1315 | public void setV2c(Tuple2<Byte> v) { |
| 1316 | byte[] data = new byte[] { v._0, v._1 }; |
| 1317 | mat.put(indices, data); |
| 1318 | } |
| 1319 | |
| 1320 | @Override |
| 1321 | public Tuple3<Byte> getV3c() { |
| 1322 | byte[] data = new byte[3]; |
| 1323 | mat.get(indices, data); |
| 1324 | return new Tuple3<Byte>(data[0], data[1], data[2]); |
| 1325 | } |
| 1326 | |
| 1327 | @Override |
| 1328 | public void setV3c(Tuple3<Byte> v) { |
| 1329 | byte[] data = new byte[] { v._0, v._1, v._2 }; |
| 1330 | mat.put(indices, data); |
| 1331 | } |
| 1332 | |
| 1333 | @Override |
| 1334 | public Tuple4<Byte> getV4c() { |
| 1335 | byte[] data = new byte[4]; |
| 1336 | mat.get(indices, data); |
| 1337 | return new Tuple4<Byte>(data[0], data[1], data[2], data[3]); |
| 1338 | } |
| 1339 | |
| 1340 | @Override |
| 1341 | public void setV4c(Tuple4<Byte> v) { |
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…