@@ -1275,21 +1275,21 @@ mod impls {
1275
1275
( $( $t: ty) * ) => ( $(
1276
1276
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
1277
1277
impl PartialEq for $t {
1278
- #[ inline]
1278
+ #[ inline( always ) ]
1279
1279
fn eq( & self , other: & $t) -> bool { ( * self ) == ( * other) }
1280
- #[ inline]
1280
+ #[ inline( always ) ]
1281
1281
fn ne( & self , other: & $t) -> bool { ( * self ) != ( * other) }
1282
1282
}
1283
1283
) * )
1284
1284
}
1285
1285
1286
1286
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
1287
1287
impl PartialEq for ( ) {
1288
- #[ inline]
1288
+ #[ inline( always ) ]
1289
1289
fn eq ( & self , _other : & ( ) ) -> bool {
1290
1290
true
1291
1291
}
1292
- #[ inline]
1292
+ #[ inline( always ) ]
1293
1293
fn ne ( & self , _other : & ( ) ) -> bool {
1294
1294
false
1295
1295
}
@@ -1335,15 +1335,15 @@ mod impls {
1335
1335
1336
1336
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
1337
1337
impl PartialOrd for ( ) {
1338
- #[ inline]
1338
+ #[ inline( always ) ]
1339
1339
fn partial_cmp ( & self , _: & ( ) ) -> Option < Ordering > {
1340
1340
Some ( Equal )
1341
1341
}
1342
1342
}
1343
1343
1344
1344
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
1345
1345
impl PartialOrd for bool {
1346
- #[ inline]
1346
+ #[ inline( always ) ]
1347
1347
fn partial_cmp ( & self , other : & bool ) -> Option < Ordering > {
1348
1348
Some ( self . cmp ( other) )
1349
1349
}
@@ -1355,7 +1355,7 @@ mod impls {
1355
1355
( $( $t: ty) * ) => ( $(
1356
1356
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
1357
1357
impl PartialOrd for $t {
1358
- #[ inline]
1358
+ #[ inline( always ) ]
1359
1359
fn partial_cmp( & self , other: & $t) -> Option <Ordering > {
1360
1360
Some ( self . cmp( other) )
1361
1361
}
@@ -1385,7 +1385,7 @@ mod impls {
1385
1385
1386
1386
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
1387
1387
impl Ord for ( ) {
1388
- #[ inline]
1388
+ #[ inline( always ) ]
1389
1389
fn cmp ( & self , _other : & ( ) ) -> Ordering {
1390
1390
Equal
1391
1391
}
@@ -1412,7 +1412,7 @@ mod impls {
1412
1412
1413
1413
#[ unstable( feature = "never_type" , issue = "35121" ) ]
1414
1414
impl PartialEq for ! {
1415
- #[ inline]
1415
+ #[ inline( always ) ]
1416
1416
fn eq ( & self , _: & !) -> bool {
1417
1417
* self
1418
1418
}
@@ -1423,15 +1423,15 @@ mod impls {
1423
1423
1424
1424
#[ unstable( feature = "never_type" , issue = "35121" ) ]
1425
1425
impl PartialOrd for ! {
1426
- #[ inline]
1426
+ #[ inline( always ) ]
1427
1427
fn partial_cmp ( & self , _: & !) -> Option < Ordering > {
1428
1428
* self
1429
1429
}
1430
1430
}
1431
1431
1432
1432
#[ unstable( feature = "never_type" , issue = "35121" ) ]
1433
1433
impl Ord for ! {
1434
- #[ inline]
1434
+ #[ inline( always ) ]
1435
1435
fn cmp ( & self , _: & !) -> Ordering {
1436
1436
* self
1437
1437
}
@@ -1444,11 +1444,11 @@ mod impls {
1444
1444
where
1445
1445
A : PartialEq < B > ,
1446
1446
{
1447
- #[ inline]
1447
+ #[ inline( always ) ]
1448
1448
fn eq ( & self , other : & & B ) -> bool {
1449
1449
PartialEq :: eq ( * self , * other)
1450
1450
}
1451
- #[ inline]
1451
+ #[ inline( always ) ]
1452
1452
fn ne ( & self , other : & & B ) -> bool {
1453
1453
PartialEq :: ne ( * self , * other)
1454
1454
}
@@ -1458,23 +1458,23 @@ mod impls {
1458
1458
where
1459
1459
A : PartialOrd < B > ,
1460
1460
{
1461
- #[ inline]
1461
+ #[ inline( always ) ]
1462
1462
fn partial_cmp ( & self , other : & & B ) -> Option < Ordering > {
1463
1463
PartialOrd :: partial_cmp ( * self , * other)
1464
1464
}
1465
- #[ inline]
1465
+ #[ inline( always ) ]
1466
1466
fn lt ( & self , other : & & B ) -> bool {
1467
1467
PartialOrd :: lt ( * self , * other)
1468
1468
}
1469
- #[ inline]
1469
+ #[ inline( always ) ]
1470
1470
fn le ( & self , other : & & B ) -> bool {
1471
1471
PartialOrd :: le ( * self , * other)
1472
1472
}
1473
- #[ inline]
1473
+ #[ inline( always ) ]
1474
1474
fn gt ( & self , other : & & B ) -> bool {
1475
1475
PartialOrd :: gt ( * self , * other)
1476
1476
}
1477
- #[ inline]
1477
+ #[ inline( always ) ]
1478
1478
fn ge ( & self , other : & & B ) -> bool {
1479
1479
PartialOrd :: ge ( * self , * other)
1480
1480
}
@@ -1484,7 +1484,7 @@ mod impls {
1484
1484
where
1485
1485
A : Ord ,
1486
1486
{
1487
- #[ inline]
1487
+ #[ inline( always ) ]
1488
1488
fn cmp ( & self , other : & Self ) -> Ordering {
1489
1489
Ord :: cmp ( * self , * other)
1490
1490
}
@@ -1499,11 +1499,11 @@ mod impls {
1499
1499
where
1500
1500
A : PartialEq < B > ,
1501
1501
{
1502
- #[ inline]
1502
+ #[ inline( always ) ]
1503
1503
fn eq ( & self , other : & & mut B ) -> bool {
1504
1504
PartialEq :: eq ( * self , * other)
1505
1505
}
1506
- #[ inline]
1506
+ #[ inline( always ) ]
1507
1507
fn ne ( & self , other : & & mut B ) -> bool {
1508
1508
PartialEq :: ne ( * self , * other)
1509
1509
}
@@ -1513,23 +1513,23 @@ mod impls {
1513
1513
where
1514
1514
A : PartialOrd < B > ,
1515
1515
{
1516
- #[ inline]
1516
+ #[ inline( always ) ]
1517
1517
fn partial_cmp ( & self , other : & & mut B ) -> Option < Ordering > {
1518
1518
PartialOrd :: partial_cmp ( * self , * other)
1519
1519
}
1520
- #[ inline]
1520
+ #[ inline( always ) ]
1521
1521
fn lt ( & self , other : & & mut B ) -> bool {
1522
1522
PartialOrd :: lt ( * self , * other)
1523
1523
}
1524
- #[ inline]
1524
+ #[ inline( always ) ]
1525
1525
fn le ( & self , other : & & mut B ) -> bool {
1526
1526
PartialOrd :: le ( * self , * other)
1527
1527
}
1528
- #[ inline]
1528
+ #[ inline( always ) ]
1529
1529
fn gt ( & self , other : & & mut B ) -> bool {
1530
1530
PartialOrd :: gt ( * self , * other)
1531
1531
}
1532
- #[ inline]
1532
+ #[ inline( always ) ]
1533
1533
fn ge ( & self , other : & & mut B ) -> bool {
1534
1534
PartialOrd :: ge ( * self , * other)
1535
1535
}
@@ -1539,7 +1539,7 @@ mod impls {
1539
1539
where
1540
1540
A : Ord ,
1541
1541
{
1542
- #[ inline]
1542
+ #[ inline( always ) ]
1543
1543
fn cmp ( & self , other : & Self ) -> Ordering {
1544
1544
Ord :: cmp ( * self , * other)
1545
1545
}
@@ -1552,11 +1552,11 @@ mod impls {
1552
1552
where
1553
1553
A : PartialEq < B > ,
1554
1554
{
1555
- #[ inline]
1555
+ #[ inline( always ) ]
1556
1556
fn eq ( & self , other : & & mut B ) -> bool {
1557
1557
PartialEq :: eq ( * self , * other)
1558
1558
}
1559
- #[ inline]
1559
+ #[ inline( always ) ]
1560
1560
fn ne ( & self , other : & & mut B ) -> bool {
1561
1561
PartialEq :: ne ( * self , * other)
1562
1562
}
@@ -1567,11 +1567,11 @@ mod impls {
1567
1567
where
1568
1568
A : PartialEq < B > ,
1569
1569
{
1570
- #[ inline]
1570
+ #[ inline( always ) ]
1571
1571
fn eq ( & self , other : & & B ) -> bool {
1572
1572
PartialEq :: eq ( * self , * other)
1573
1573
}
1574
- #[ inline]
1574
+ #[ inline( always ) ]
1575
1575
fn ne ( & self , other : & & B ) -> bool {
1576
1576
PartialEq :: ne ( * self , * other)
1577
1577
}
0 commit comments