1221 av.with(0, (byte)4).intoArray(r, i);
1222 }
1223 }
1224
1225 assertInsertArraysEquals(a, r, (byte)4, 0);
1226 }
1227
1228 @Test(dataProvider = "byteCompareOpProvider")
1229 static void lessThanByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1230 byte[] a = fa.apply(SPECIES.length());
1231 byte[] b = fb.apply(SPECIES.length());
1232
1233 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1234 for (int i = 0; i < a.length; i += SPECIES.length()) {
1235 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1236 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1237 VectorMask<Byte> mv = av.lessThan(bv);
1238
1239 // Check results as part of computation.
1240 for (int j = 0; j < SPECIES.length(); j++) {
1241 Assert.assertEquals(mv.getElement(j), a[i + j] < b[i + j]);
1242 }
1243 }
1244 }
1245 }
1246
1247
1248 @Test(dataProvider = "byteCompareOpProvider")
1249 static void greaterThanByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1250 byte[] a = fa.apply(SPECIES.length());
1251 byte[] b = fb.apply(SPECIES.length());
1252
1253 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1254 for (int i = 0; i < a.length; i += SPECIES.length()) {
1255 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1256 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1257 VectorMask<Byte> mv = av.greaterThan(bv);
1258
1259 // Check results as part of computation.
1260 for (int j = 0; j < SPECIES.length(); j++) {
1261 Assert.assertEquals(mv.getElement(j), a[i + j] > b[i + j]);
1262 }
1263 }
1264 }
1265 }
1266
1267
1268 @Test(dataProvider = "byteCompareOpProvider")
1269 static void equalByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1270 byte[] a = fa.apply(SPECIES.length());
1271 byte[] b = fb.apply(SPECIES.length());
1272
1273 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1274 for (int i = 0; i < a.length; i += SPECIES.length()) {
1275 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1276 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1277 VectorMask<Byte> mv = av.equal(bv);
1278
1279 // Check results as part of computation.
1280 for (int j = 0; j < SPECIES.length(); j++) {
1281 Assert.assertEquals(mv.getElement(j), a[i + j] == b[i + j]);
1282 }
1283 }
1284 }
1285 }
1286
1287
1288 @Test(dataProvider = "byteCompareOpProvider")
1289 static void notEqualByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1290 byte[] a = fa.apply(SPECIES.length());
1291 byte[] b = fb.apply(SPECIES.length());
1292
1293 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1294 for (int i = 0; i < a.length; i += SPECIES.length()) {
1295 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1296 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1297 VectorMask<Byte> mv = av.notEqual(bv);
1298
1299 // Check results as part of computation.
1300 for (int j = 0; j < SPECIES.length(); j++) {
1301 Assert.assertEquals(mv.getElement(j), a[i + j] != b[i + j]);
1302 }
1303 }
1304 }
1305 }
1306
1307
1308 @Test(dataProvider = "byteCompareOpProvider")
1309 static void lessThanEqByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1310 byte[] a = fa.apply(SPECIES.length());
1311 byte[] b = fb.apply(SPECIES.length());
1312
1313 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1314 for (int i = 0; i < a.length; i += SPECIES.length()) {
1315 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1316 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1317 VectorMask<Byte> mv = av.lessThanEq(bv);
1318
1319 // Check results as part of computation.
1320 for (int j = 0; j < SPECIES.length(); j++) {
1321 Assert.assertEquals(mv.getElement(j), a[i + j] <= b[i + j]);
1322 }
1323 }
1324 }
1325 }
1326
1327
1328 @Test(dataProvider = "byteCompareOpProvider")
1329 static void greaterThanEqByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1330 byte[] a = fa.apply(SPECIES.length());
1331 byte[] b = fb.apply(SPECIES.length());
1332
1333 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1334 for (int i = 0; i < a.length; i += SPECIES.length()) {
1335 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1336 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1337 VectorMask<Byte> mv = av.greaterThanEq(bv);
1338
1339 // Check results as part of computation.
1340 for (int j = 0; j < SPECIES.length(); j++) {
1341 Assert.assertEquals(mv.getElement(j), a[i + j] >= b[i + j]);
1342 }
1343 }
1344 }
1345 }
1346
1347
1348 static byte blend(byte a, byte b, boolean mask) {
1349 return mask ? b : a;
1350 }
1351
1352 @Test(dataProvider = "byteBinaryOpMaskProvider")
1353 static void blendByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb,
1354 IntFunction<boolean[]> fm) {
1355 byte[] a = fa.apply(SPECIES.length());
1356 byte[] b = fb.apply(SPECIES.length());
1357 byte[] r = fr.apply(SPECIES.length());
1358 boolean[] mask = fm.apply(SPECIES.length());
1359 VectorMask<Byte> vmask = VectorMask.fromValues(SPECIES, mask);
1360
1361 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1384 }
1385
1386 assertRearrangeArraysEquals(a, r, order, SPECIES.length());
1387 }
1388
1389
1390
1391
1392 @Test(dataProvider = "byteUnaryOpProvider")
1393 static void getByteMaxVectorTests(IntFunction<byte[]> fa) {
1394 byte[] a = fa.apply(SPECIES.length());
1395 byte[] r = fr.apply(SPECIES.length());
1396
1397 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1398 for (int i = 0; i < a.length; i += SPECIES.length()) {
1399 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1400 int num_lanes = SPECIES.length();
1401 // Manually unroll because full unroll happens after intrinsification.
1402 // Unroll is needed because get intrinsic requires for index to be a known constant.
1403 if (num_lanes == 1) {
1404 r[i]=av.get(0);
1405 } else if (num_lanes == 2) {
1406 r[i]=av.get(0);
1407 r[i+1]=av.get(1);
1408 } else if (num_lanes == 4) {
1409 r[i]=av.get(0);
1410 r[i+1]=av.get(1);
1411 r[i+2]=av.get(2);
1412 r[i+3]=av.get(3);
1413 } else if (num_lanes == 8) {
1414 r[i]=av.get(0);
1415 r[i+1]=av.get(1);
1416 r[i+2]=av.get(2);
1417 r[i+3]=av.get(3);
1418 r[i+4]=av.get(4);
1419 r[i+5]=av.get(5);
1420 r[i+6]=av.get(6);
1421 r[i+7]=av.get(7);
1422 } else if (num_lanes == 16) {
1423 r[i]=av.get(0);
1424 r[i+1]=av.get(1);
1425 r[i+2]=av.get(2);
1426 r[i+3]=av.get(3);
1427 r[i+4]=av.get(4);
1428 r[i+5]=av.get(5);
1429 r[i+6]=av.get(6);
1430 r[i+7]=av.get(7);
1431 r[i+8]=av.get(8);
1432 r[i+9]=av.get(9);
1433 r[i+10]=av.get(10);
1434 r[i+11]=av.get(11);
1435 r[i+12]=av.get(12);
1436 r[i+13]=av.get(13);
1437 r[i+14]=av.get(14);
1438 r[i+15]=av.get(15);
1439 } else if (num_lanes == 32) {
1440 r[i]=av.get(0);
1441 r[i+1]=av.get(1);
1442 r[i+2]=av.get(2);
1443 r[i+3]=av.get(3);
1444 r[i+4]=av.get(4);
1445 r[i+5]=av.get(5);
1446 r[i+6]=av.get(6);
1447 r[i+7]=av.get(7);
1448 r[i+8]=av.get(8);
1449 r[i+9]=av.get(9);
1450 r[i+10]=av.get(10);
1451 r[i+11]=av.get(11);
1452 r[i+12]=av.get(12);
1453 r[i+13]=av.get(13);
1454 r[i+14]=av.get(14);
1455 r[i+15]=av.get(15);
1456 r[i+16]=av.get(16);
1457 r[i+17]=av.get(17);
1458 r[i+18]=av.get(18);
1459 r[i+19]=av.get(19);
1460 r[i+20]=av.get(20);
1461 r[i+21]=av.get(21);
1462 r[i+22]=av.get(22);
1463 r[i+23]=av.get(23);
1464 r[i+24]=av.get(24);
1465 r[i+25]=av.get(25);
1466 r[i+26]=av.get(26);
1467 r[i+27]=av.get(27);
1468 r[i+28]=av.get(28);
1469 r[i+29]=av.get(29);
1470 r[i+30]=av.get(30);
1471 r[i+31]=av.get(31);
1472 } else if (num_lanes == 64) {
1473 r[i]=av.get(0);
1474 r[i+1]=av.get(1);
1475 r[i+2]=av.get(2);
1476 r[i+3]=av.get(3);
1477 r[i+4]=av.get(4);
1478 r[i+5]=av.get(5);
1479 r[i+6]=av.get(6);
1480 r[i+7]=av.get(7);
1481 r[i+8]=av.get(8);
1482 r[i+9]=av.get(9);
1483 r[i+10]=av.get(10);
1484 r[i+11]=av.get(11);
1485 r[i+12]=av.get(12);
1486 r[i+13]=av.get(13);
1487 r[i+14]=av.get(14);
1488 r[i+15]=av.get(15);
1489 r[i+16]=av.get(16);
1490 r[i+17]=av.get(17);
1491 r[i+18]=av.get(18);
1492 r[i+19]=av.get(19);
1493 r[i+20]=av.get(20);
1494 r[i+21]=av.get(21);
1495 r[i+22]=av.get(22);
1496 r[i+23]=av.get(23);
1497 r[i+24]=av.get(24);
1498 r[i+25]=av.get(25);
1499 r[i+26]=av.get(26);
1500 r[i+27]=av.get(27);
1501 r[i+28]=av.get(28);
1502 r[i+29]=av.get(29);
1503 r[i+30]=av.get(30);
1504 r[i+31]=av.get(31);
1505 r[i+32]=av.get(32);
1506 r[i+33]=av.get(33);
1507 r[i+34]=av.get(34);
1508 r[i+35]=av.get(35);
1509 r[i+36]=av.get(36);
1510 r[i+37]=av.get(37);
1511 r[i+38]=av.get(38);
1512 r[i+39]=av.get(39);
1513 r[i+40]=av.get(40);
1514 r[i+41]=av.get(41);
1515 r[i+42]=av.get(42);
1516 r[i+43]=av.get(43);
1517 r[i+44]=av.get(44);
1518 r[i+45]=av.get(45);
1519 r[i+46]=av.get(46);
1520 r[i+47]=av.get(47);
1521 r[i+48]=av.get(48);
1522 r[i+49]=av.get(49);
1523 r[i+50]=av.get(50);
1524 r[i+51]=av.get(51);
1525 r[i+52]=av.get(52);
1526 r[i+53]=av.get(53);
1527 r[i+54]=av.get(54);
1528 r[i+55]=av.get(55);
1529 r[i+56]=av.get(56);
1530 r[i+57]=av.get(57);
1531 r[i+58]=av.get(58);
1532 r[i+59]=av.get(59);
1533 r[i+60]=av.get(60);
1534 r[i+61]=av.get(61);
1535 r[i+62]=av.get(62);
1536 r[i+63]=av.get(63);
1537 } else {
1538 for (int j = 0; j < SPECIES.length(); j++) {
1539 r[i+j]=av.get(j);
1540 }
1541 }
1542 }
1543 }
1544
1545 assertArraysEquals(a, r, ByteMaxVectorTests::get);
1546 }
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
|
1221 av.with(0, (byte)4).intoArray(r, i);
1222 }
1223 }
1224
1225 assertInsertArraysEquals(a, r, (byte)4, 0);
1226 }
1227
1228 @Test(dataProvider = "byteCompareOpProvider")
1229 static void lessThanByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1230 byte[] a = fa.apply(SPECIES.length());
1231 byte[] b = fb.apply(SPECIES.length());
1232
1233 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1234 for (int i = 0; i < a.length; i += SPECIES.length()) {
1235 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1236 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1237 VectorMask<Byte> mv = av.lessThan(bv);
1238
1239 // Check results as part of computation.
1240 for (int j = 0; j < SPECIES.length(); j++) {
1241 Assert.assertEquals(mv.lane(j), a[i + j] < b[i + j]);
1242 }
1243 }
1244 }
1245 }
1246
1247
1248 @Test(dataProvider = "byteCompareOpProvider")
1249 static void greaterThanByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1250 byte[] a = fa.apply(SPECIES.length());
1251 byte[] b = fb.apply(SPECIES.length());
1252
1253 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1254 for (int i = 0; i < a.length; i += SPECIES.length()) {
1255 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1256 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1257 VectorMask<Byte> mv = av.greaterThan(bv);
1258
1259 // Check results as part of computation.
1260 for (int j = 0; j < SPECIES.length(); j++) {
1261 Assert.assertEquals(mv.lane(j), a[i + j] > b[i + j]);
1262 }
1263 }
1264 }
1265 }
1266
1267
1268 @Test(dataProvider = "byteCompareOpProvider")
1269 static void equalByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1270 byte[] a = fa.apply(SPECIES.length());
1271 byte[] b = fb.apply(SPECIES.length());
1272
1273 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1274 for (int i = 0; i < a.length; i += SPECIES.length()) {
1275 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1276 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1277 VectorMask<Byte> mv = av.equal(bv);
1278
1279 // Check results as part of computation.
1280 for (int j = 0; j < SPECIES.length(); j++) {
1281 Assert.assertEquals(mv.lane(j), a[i + j] == b[i + j]);
1282 }
1283 }
1284 }
1285 }
1286
1287
1288 @Test(dataProvider = "byteCompareOpProvider")
1289 static void notEqualByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1290 byte[] a = fa.apply(SPECIES.length());
1291 byte[] b = fb.apply(SPECIES.length());
1292
1293 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1294 for (int i = 0; i < a.length; i += SPECIES.length()) {
1295 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1296 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1297 VectorMask<Byte> mv = av.notEqual(bv);
1298
1299 // Check results as part of computation.
1300 for (int j = 0; j < SPECIES.length(); j++) {
1301 Assert.assertEquals(mv.lane(j), a[i + j] != b[i + j]);
1302 }
1303 }
1304 }
1305 }
1306
1307
1308 @Test(dataProvider = "byteCompareOpProvider")
1309 static void lessThanEqByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1310 byte[] a = fa.apply(SPECIES.length());
1311 byte[] b = fb.apply(SPECIES.length());
1312
1313 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1314 for (int i = 0; i < a.length; i += SPECIES.length()) {
1315 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1316 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1317 VectorMask<Byte> mv = av.lessThanEq(bv);
1318
1319 // Check results as part of computation.
1320 for (int j = 0; j < SPECIES.length(); j++) {
1321 Assert.assertEquals(mv.lane(j), a[i + j] <= b[i + j]);
1322 }
1323 }
1324 }
1325 }
1326
1327
1328 @Test(dataProvider = "byteCompareOpProvider")
1329 static void greaterThanEqByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb) {
1330 byte[] a = fa.apply(SPECIES.length());
1331 byte[] b = fb.apply(SPECIES.length());
1332
1333 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1334 for (int i = 0; i < a.length; i += SPECIES.length()) {
1335 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1336 ByteVector bv = ByteVector.fromArray(SPECIES, b, i);
1337 VectorMask<Byte> mv = av.greaterThanEq(bv);
1338
1339 // Check results as part of computation.
1340 for (int j = 0; j < SPECIES.length(); j++) {
1341 Assert.assertEquals(mv.lane(j), a[i + j] >= b[i + j]);
1342 }
1343 }
1344 }
1345 }
1346
1347
1348 static byte blend(byte a, byte b, boolean mask) {
1349 return mask ? b : a;
1350 }
1351
1352 @Test(dataProvider = "byteBinaryOpMaskProvider")
1353 static void blendByteMaxVectorTests(IntFunction<byte[]> fa, IntFunction<byte[]> fb,
1354 IntFunction<boolean[]> fm) {
1355 byte[] a = fa.apply(SPECIES.length());
1356 byte[] b = fb.apply(SPECIES.length());
1357 byte[] r = fr.apply(SPECIES.length());
1358 boolean[] mask = fm.apply(SPECIES.length());
1359 VectorMask<Byte> vmask = VectorMask.fromValues(SPECIES, mask);
1360
1361 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1384 }
1385
1386 assertRearrangeArraysEquals(a, r, order, SPECIES.length());
1387 }
1388
1389
1390
1391
1392 @Test(dataProvider = "byteUnaryOpProvider")
1393 static void getByteMaxVectorTests(IntFunction<byte[]> fa) {
1394 byte[] a = fa.apply(SPECIES.length());
1395 byte[] r = fr.apply(SPECIES.length());
1396
1397 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1398 for (int i = 0; i < a.length; i += SPECIES.length()) {
1399 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
1400 int num_lanes = SPECIES.length();
1401 // Manually unroll because full unroll happens after intrinsification.
1402 // Unroll is needed because get intrinsic requires for index to be a known constant.
1403 if (num_lanes == 1) {
1404 r[i]=av.lane(0);
1405 } else if (num_lanes == 2) {
1406 r[i]=av.lane(0);
1407 r[i+1]=av.lane(1);
1408 } else if (num_lanes == 4) {
1409 r[i]=av.lane(0);
1410 r[i+1]=av.lane(1);
1411 r[i+2]=av.lane(2);
1412 r[i+3]=av.lane(3);
1413 } else if (num_lanes == 8) {
1414 r[i]=av.lane(0);
1415 r[i+1]=av.lane(1);
1416 r[i+2]=av.lane(2);
1417 r[i+3]=av.lane(3);
1418 r[i+4]=av.lane(4);
1419 r[i+5]=av.lane(5);
1420 r[i+6]=av.lane(6);
1421 r[i+7]=av.lane(7);
1422 } else if (num_lanes == 16) {
1423 r[i]=av.lane(0);
1424 r[i+1]=av.lane(1);
1425 r[i+2]=av.lane(2);
1426 r[i+3]=av.lane(3);
1427 r[i+4]=av.lane(4);
1428 r[i+5]=av.lane(5);
1429 r[i+6]=av.lane(6);
1430 r[i+7]=av.lane(7);
1431 r[i+8]=av.lane(8);
1432 r[i+9]=av.lane(9);
1433 r[i+10]=av.lane(10);
1434 r[i+11]=av.lane(11);
1435 r[i+12]=av.lane(12);
1436 r[i+13]=av.lane(13);
1437 r[i+14]=av.lane(14);
1438 r[i+15]=av.lane(15);
1439 } else if (num_lanes == 32) {
1440 r[i]=av.lane(0);
1441 r[i+1]=av.lane(1);
1442 r[i+2]=av.lane(2);
1443 r[i+3]=av.lane(3);
1444 r[i+4]=av.lane(4);
1445 r[i+5]=av.lane(5);
1446 r[i+6]=av.lane(6);
1447 r[i+7]=av.lane(7);
1448 r[i+8]=av.lane(8);
1449 r[i+9]=av.lane(9);
1450 r[i+10]=av.lane(10);
1451 r[i+11]=av.lane(11);
1452 r[i+12]=av.lane(12);
1453 r[i+13]=av.lane(13);
1454 r[i+14]=av.lane(14);
1455 r[i+15]=av.lane(15);
1456 r[i+16]=av.lane(16);
1457 r[i+17]=av.lane(17);
1458 r[i+18]=av.lane(18);
1459 r[i+19]=av.lane(19);
1460 r[i+20]=av.lane(20);
1461 r[i+21]=av.lane(21);
1462 r[i+22]=av.lane(22);
1463 r[i+23]=av.lane(23);
1464 r[i+24]=av.lane(24);
1465 r[i+25]=av.lane(25);
1466 r[i+26]=av.lane(26);
1467 r[i+27]=av.lane(27);
1468 r[i+28]=av.lane(28);
1469 r[i+29]=av.lane(29);
1470 r[i+30]=av.lane(30);
1471 r[i+31]=av.lane(31);
1472 } else if (num_lanes == 64) {
1473 r[i]=av.lane(0);
1474 r[i+1]=av.lane(1);
1475 r[i+2]=av.lane(2);
1476 r[i+3]=av.lane(3);
1477 r[i+4]=av.lane(4);
1478 r[i+5]=av.lane(5);
1479 r[i+6]=av.lane(6);
1480 r[i+7]=av.lane(7);
1481 r[i+8]=av.lane(8);
1482 r[i+9]=av.lane(9);
1483 r[i+10]=av.lane(10);
1484 r[i+11]=av.lane(11);
1485 r[i+12]=av.lane(12);
1486 r[i+13]=av.lane(13);
1487 r[i+14]=av.lane(14);
1488 r[i+15]=av.lane(15);
1489 r[i+16]=av.lane(16);
1490 r[i+17]=av.lane(17);
1491 r[i+18]=av.lane(18);
1492 r[i+19]=av.lane(19);
1493 r[i+20]=av.lane(20);
1494 r[i+21]=av.lane(21);
1495 r[i+22]=av.lane(22);
1496 r[i+23]=av.lane(23);
1497 r[i+24]=av.lane(24);
1498 r[i+25]=av.lane(25);
1499 r[i+26]=av.lane(26);
1500 r[i+27]=av.lane(27);
1501 r[i+28]=av.lane(28);
1502 r[i+29]=av.lane(29);
1503 r[i+30]=av.lane(30);
1504 r[i+31]=av.lane(31);
1505 r[i+32]=av.lane(32);
1506 r[i+33]=av.lane(33);
1507 r[i+34]=av.lane(34);
1508 r[i+35]=av.lane(35);
1509 r[i+36]=av.lane(36);
1510 r[i+37]=av.lane(37);
1511 r[i+38]=av.lane(38);
1512 r[i+39]=av.lane(39);
1513 r[i+40]=av.lane(40);
1514 r[i+41]=av.lane(41);
1515 r[i+42]=av.lane(42);
1516 r[i+43]=av.lane(43);
1517 r[i+44]=av.lane(44);
1518 r[i+45]=av.lane(45);
1519 r[i+46]=av.lane(46);
1520 r[i+47]=av.lane(47);
1521 r[i+48]=av.lane(48);
1522 r[i+49]=av.lane(49);
1523 r[i+50]=av.lane(50);
1524 r[i+51]=av.lane(51);
1525 r[i+52]=av.lane(52);
1526 r[i+53]=av.lane(53);
1527 r[i+54]=av.lane(54);
1528 r[i+55]=av.lane(55);
1529 r[i+56]=av.lane(56);
1530 r[i+57]=av.lane(57);
1531 r[i+58]=av.lane(58);
1532 r[i+59]=av.lane(59);
1533 r[i+60]=av.lane(60);
1534 r[i+61]=av.lane(61);
1535 r[i+62]=av.lane(62);
1536 r[i+63]=av.lane(63);
1537 } else {
1538 for (int j = 0; j < SPECIES.length(); j++) {
1539 r[i+j]=av.lane(j);
1540 }
1541 }
1542 }
1543 }
1544
1545 assertArraysEquals(a, r, ByteMaxVectorTests::get);
1546 }
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
|