@@ -47,15 +47,15 @@ export all2;
47
47
export contains;
48
48
export count;
49
49
export find;
50
- export find_from ;
50
+ export find_between ;
51
51
export rfind;
52
- export rfind_from ;
52
+ export rfind_between ;
53
53
export position_elem;
54
54
export position;
55
- export position_from ;
55
+ export position_between ;
56
56
export position_elem;
57
57
export rposition;
58
- export rposition_from ;
58
+ export rposition_between ;
59
59
export unzip;
60
60
export zip;
61
61
export swap;
@@ -225,7 +225,7 @@ fn split<T: copy>(v: [const T], f: fn(T) -> bool) -> [[T]] {
225
225
let mut start = 0 u;
226
226
let mut result = [ ] ;
227
227
while start < ln {
228
- alt position_from ( v, start, ln, f) {
228
+ alt position_between ( v, start, ln, f) {
229
229
none { break }
230
230
some( i) {
231
231
push ( result, slice ( v, start, i) ) ;
@@ -249,7 +249,7 @@ fn splitn<T: copy>(v: [const T], n: uint, f: fn(T) -> bool) -> [[T]] {
249
249
let mut count = n;
250
250
let mut result = [ ] ;
251
251
while start < ln && count > 0 u {
252
- alt position_from ( v, start, ln, f) {
252
+ alt position_between ( v, start, ln, f) {
253
253
none { break }
254
254
some( i) {
255
255
push ( result, slice ( v, start, i) ) ;
@@ -274,7 +274,7 @@ fn rsplit<T: copy>(v: [const T], f: fn(T) -> bool) -> [[T]] {
274
274
let mut end = ln;
275
275
let mut result = [ ] ;
276
276
while end > 0 u {
277
- alt rposition_from ( v, 0 u, end, f) {
277
+ alt rposition_between ( v, 0 u, end, f) {
278
278
none { break }
279
279
some( i) {
280
280
push ( result, slice ( v, i + 1 u, end) ) ;
@@ -298,7 +298,7 @@ fn rsplitn<T: copy>(v: [const T], n: uint, f: fn(T) -> bool) -> [[T]] {
298
298
let mut count = n;
299
299
let mut result = [ ] ;
300
300
while end > 0 u && count > 0 u {
301
- alt rposition_from ( v, 0 u, end, f) {
301
+ alt rposition_between ( v, 0 u, end, f) {
302
302
none { break }
303
303
some( i) {
304
304
push ( result, slice ( v, i + 1 u, end) ) ;
@@ -574,7 +574,7 @@ When function `f` returns true then an option containing the element
574
574
is returned. If `f` matches no elements then none is returned.
575
575
" ]
576
576
fn find < T : copy > ( v : [ const T ] , f : fn ( T ) -> bool ) -> option < T > {
577
- find_from ( v, 0 u, len ( v) , f)
577
+ find_between ( v, 0 u, len ( v) , f)
578
578
}
579
579
580
580
#[ doc = "
@@ -584,9 +584,9 @@ Apply function `f` to each element of `v` within the range [`start`, `end`).
584
584
When function `f` returns true then an option containing the element
585
585
is returned. If `f` matches no elements then none is returned.
586
586
" ]
587
- fn find_from < T : copy > ( v : [ const T ] , start : uint , end : uint ,
587
+ fn find_between < T : copy > ( v : [ const T ] , start : uint , end : uint ,
588
588
f : fn ( T ) -> bool ) -> option < T > {
589
- option:: map ( position_from ( v, start, end, f) ) { |i| v[ i] }
589
+ option:: map ( position_between ( v, start, end, f) ) { |i| v[ i] }
590
590
}
591
591
592
592
#[ doc = "
@@ -597,7 +597,7 @@ returns true then an option containing the element is returned. If `f`
597
597
matches no elements then none is returned.
598
598
" ]
599
599
fn rfind < T : copy > ( v : [ const T ] , f : fn ( T ) -> bool ) -> option < T > {
600
- rfind_from ( v, 0 u, len ( v) , f)
600
+ rfind_between ( v, 0 u, len ( v) , f)
601
601
}
602
602
603
603
#[ doc = "
@@ -607,9 +607,9 @@ Apply function `f` to each element of `v` in reverse order within the range
607
607
[`start`, `end`). When function `f` returns true then an option containing
608
608
the element is returned. If `f` matches no elements then none is returned.
609
609
" ]
610
- fn rfind_from < T : copy > ( v : [ const T ] , start : uint , end : uint ,
610
+ fn rfind_between < T : copy > ( v : [ const T ] , start : uint , end : uint ,
611
611
f : fn ( T ) -> bool ) -> option < T > {
612
- option:: map ( rposition_from ( v, start, end, f) ) { |i| v[ i] }
612
+ option:: map ( rposition_between ( v, start, end, f) ) { |i| v[ i] }
613
613
}
614
614
615
615
#[ doc = "Find the first index containing a matching value" ]
@@ -625,7 +625,7 @@ then an option containing the index is returned. If `f` matches no elements
625
625
then none is returned.
626
626
" ]
627
627
fn position < T > ( v : [ const T ] , f : fn ( T ) -> bool ) -> option < uint > {
628
- position_from ( v, 0 u, len ( v) , f)
628
+ position_between ( v, 0 u, len ( v) , f)
629
629
}
630
630
631
631
#[ doc = "
@@ -635,7 +635,7 @@ Apply function `f` to each element of `v` between the range [`start`, `end`).
635
635
When function `f` returns true then an option containing the index is
636
636
returned. If `f` matches no elements then none is returned.
637
637
" ]
638
- fn position_from < T > ( v : [ const T ] , start : uint , end : uint ,
638
+ fn position_between < T > ( v : [ const T ] , start : uint , end : uint ,
639
639
f : fn ( T ) -> bool ) -> option < uint > {
640
640
assert start <= end;
641
641
assert end <= len ( v) ;
@@ -657,7 +657,7 @@ Apply function `f` to each element of `v` in reverse order. When function
657
657
matches no elements then none is returned.
658
658
" ]
659
659
fn rposition < T > ( v : [ const T ] , f : fn ( T ) -> bool ) -> option < uint > {
660
- rposition_from ( v, 0 u, len ( v) , f)
660
+ rposition_between ( v, 0 u, len ( v) , f)
661
661
}
662
662
663
663
#[ doc = "
@@ -667,7 +667,7 @@ Apply function `f` to each element of `v` in reverse order between the range
667
667
[`start`, `end`). When function `f` returns true then an option containing
668
668
the index is returned. If `f` matches no elements then none is returned.
669
669
" ]
670
- fn rposition_from < T > ( v : [ const T ] , start : uint , end : uint ,
670
+ fn rposition_between < T > ( v : [ const T ] , start : uint , end : uint ,
671
671
f : fn ( T ) -> bool ) -> option < uint > {
672
672
assert start <= end;
673
673
assert end <= len ( v) ;
@@ -1462,31 +1462,31 @@ mod tests {
1462
1462
}
1463
1463
1464
1464
#[ test]
1465
- fn test_position_from ( ) {
1466
- assert position_from ( [ ] , 0 u, 0 u, f) == none;
1465
+ fn test_position_between ( ) {
1466
+ assert position_between ( [ ] , 0 u, 0 u, f) == none;
1467
1467
1468
1468
fn f ( xy : ( int , char ) ) -> bool { let ( _x, y) = xy; y == 'b' }
1469
1469
let v = [ ( 0 , 'a' ) , ( 1 , 'b' ) , ( 2 , 'c' ) , ( 3 , 'b' ) ] ;
1470
1470
1471
- assert position_from ( v, 0 u, 0 u, f) == none;
1472
- assert position_from ( v, 0 u, 1 u, f) == none;
1473
- assert position_from ( v, 0 u, 2 u, f) == some ( 1 u) ;
1474
- assert position_from ( v, 0 u, 3 u, f) == some ( 1 u) ;
1475
- assert position_from ( v, 0 u, 4 u, f) == some ( 1 u) ;
1471
+ assert position_between ( v, 0 u, 0 u, f) == none;
1472
+ assert position_between ( v, 0 u, 1 u, f) == none;
1473
+ assert position_between ( v, 0 u, 2 u, f) == some ( 1 u) ;
1474
+ assert position_between ( v, 0 u, 3 u, f) == some ( 1 u) ;
1475
+ assert position_between ( v, 0 u, 4 u, f) == some ( 1 u) ;
1476
1476
1477
- assert position_from ( v, 1 u, 1 u, f) == none;
1478
- assert position_from ( v, 1 u, 2 u, f) == some ( 1 u) ;
1479
- assert position_from ( v, 1 u, 3 u, f) == some ( 1 u) ;
1480
- assert position_from ( v, 1 u, 4 u, f) == some ( 1 u) ;
1477
+ assert position_between ( v, 1 u, 1 u, f) == none;
1478
+ assert position_between ( v, 1 u, 2 u, f) == some ( 1 u) ;
1479
+ assert position_between ( v, 1 u, 3 u, f) == some ( 1 u) ;
1480
+ assert position_between ( v, 1 u, 4 u, f) == some ( 1 u) ;
1481
1481
1482
- assert position_from ( v, 2 u, 2 u, f) == none;
1483
- assert position_from ( v, 2 u, 3 u, f) == none;
1484
- assert position_from ( v, 2 u, 4 u, f) == some ( 3 u) ;
1482
+ assert position_between ( v, 2 u, 2 u, f) == none;
1483
+ assert position_between ( v, 2 u, 3 u, f) == none;
1484
+ assert position_between ( v, 2 u, 4 u, f) == some ( 3 u) ;
1485
1485
1486
- assert position_from ( v, 3 u, 3 u, f) == none;
1487
- assert position_from ( v, 3 u, 4 u, f) == some ( 3 u) ;
1486
+ assert position_between ( v, 3 u, 3 u, f) == none;
1487
+ assert position_between ( v, 3 u, 4 u, f) == some ( 3 u) ;
1488
1488
1489
- assert position_from ( v, 4 u, 4 u, f) == none;
1489
+ assert position_between ( v, 4 u, 4 u, f) == none;
1490
1490
}
1491
1491
1492
1492
#[ test]
@@ -1502,31 +1502,31 @@ mod tests {
1502
1502
}
1503
1503
1504
1504
#[ test]
1505
- fn test_find_from ( ) {
1506
- assert find_from ( [ ] , 0 u, 0 u, f) == none;
1505
+ fn test_find_between ( ) {
1506
+ assert find_between ( [ ] , 0 u, 0 u, f) == none;
1507
1507
1508
1508
fn f ( xy : ( int , char ) ) -> bool { let ( _x, y) = xy; y == 'b' }
1509
1509
let v = [ ( 0 , 'a' ) , ( 1 , 'b' ) , ( 2 , 'c' ) , ( 3 , 'b' ) ] ;
1510
1510
1511
- assert find_from ( v, 0 u, 0 u, f) == none;
1512
- assert find_from ( v, 0 u, 1 u, f) == none;
1513
- assert find_from ( v, 0 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1514
- assert find_from ( v, 0 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1515
- assert find_from ( v, 0 u, 4 u, f) == some ( ( 1 , 'b' ) ) ;
1511
+ assert find_between ( v, 0 u, 0 u, f) == none;
1512
+ assert find_between ( v, 0 u, 1 u, f) == none;
1513
+ assert find_between ( v, 0 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1514
+ assert find_between ( v, 0 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1515
+ assert find_between ( v, 0 u, 4 u, f) == some ( ( 1 , 'b' ) ) ;
1516
1516
1517
- assert find_from ( v, 1 u, 1 u, f) == none;
1518
- assert find_from ( v, 1 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1519
- assert find_from ( v, 1 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1520
- assert find_from ( v, 1 u, 4 u, f) == some ( ( 1 , 'b' ) ) ;
1517
+ assert find_between ( v, 1 u, 1 u, f) == none;
1518
+ assert find_between ( v, 1 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1519
+ assert find_between ( v, 1 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1520
+ assert find_between ( v, 1 u, 4 u, f) == some ( ( 1 , 'b' ) ) ;
1521
1521
1522
- assert find_from ( v, 2 u, 2 u, f) == none;
1523
- assert find_from ( v, 2 u, 3 u, f) == none;
1524
- assert find_from ( v, 2 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1522
+ assert find_between ( v, 2 u, 2 u, f) == none;
1523
+ assert find_between ( v, 2 u, 3 u, f) == none;
1524
+ assert find_between ( v, 2 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1525
1525
1526
- assert find_from ( v, 3 u, 3 u, f) == none;
1527
- assert find_from ( v, 3 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1526
+ assert find_between ( v, 3 u, 3 u, f) == none;
1527
+ assert find_between ( v, 3 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1528
1528
1529
- assert find_from ( v, 4 u, 4 u, f) == none;
1529
+ assert find_between ( v, 4 u, 4 u, f) == none;
1530
1530
}
1531
1531
1532
1532
#[ test]
@@ -1542,31 +1542,31 @@ mod tests {
1542
1542
}
1543
1543
1544
1544
#[ test]
1545
- fn test_rposition_from ( ) {
1546
- assert rposition_from ( [ ] , 0 u, 0 u, f) == none;
1545
+ fn test_rposition_between ( ) {
1546
+ assert rposition_between ( [ ] , 0 u, 0 u, f) == none;
1547
1547
1548
1548
fn f ( xy : ( int , char ) ) -> bool { let ( _x, y) = xy; y == 'b' }
1549
1549
let v = [ ( 0 , 'a' ) , ( 1 , 'b' ) , ( 2 , 'c' ) , ( 3 , 'b' ) ] ;
1550
1550
1551
- assert rposition_from ( v, 0 u, 0 u, f) == none;
1552
- assert rposition_from ( v, 0 u, 1 u, f) == none;
1553
- assert rposition_from ( v, 0 u, 2 u, f) == some ( 1 u) ;
1554
- assert rposition_from ( v, 0 u, 3 u, f) == some ( 1 u) ;
1555
- assert rposition_from ( v, 0 u, 4 u, f) == some ( 3 u) ;
1551
+ assert rposition_between ( v, 0 u, 0 u, f) == none;
1552
+ assert rposition_between ( v, 0 u, 1 u, f) == none;
1553
+ assert rposition_between ( v, 0 u, 2 u, f) == some ( 1 u) ;
1554
+ assert rposition_between ( v, 0 u, 3 u, f) == some ( 1 u) ;
1555
+ assert rposition_between ( v, 0 u, 4 u, f) == some ( 3 u) ;
1556
1556
1557
- assert rposition_from ( v, 1 u, 1 u, f) == none;
1558
- assert rposition_from ( v, 1 u, 2 u, f) == some ( 1 u) ;
1559
- assert rposition_from ( v, 1 u, 3 u, f) == some ( 1 u) ;
1560
- assert rposition_from ( v, 1 u, 4 u, f) == some ( 3 u) ;
1557
+ assert rposition_between ( v, 1 u, 1 u, f) == none;
1558
+ assert rposition_between ( v, 1 u, 2 u, f) == some ( 1 u) ;
1559
+ assert rposition_between ( v, 1 u, 3 u, f) == some ( 1 u) ;
1560
+ assert rposition_between ( v, 1 u, 4 u, f) == some ( 3 u) ;
1561
1561
1562
- assert rposition_from ( v, 2 u, 2 u, f) == none;
1563
- assert rposition_from ( v, 2 u, 3 u, f) == none;
1564
- assert rposition_from ( v, 2 u, 4 u, f) == some ( 3 u) ;
1562
+ assert rposition_between ( v, 2 u, 2 u, f) == none;
1563
+ assert rposition_between ( v, 2 u, 3 u, f) == none;
1564
+ assert rposition_between ( v, 2 u, 4 u, f) == some ( 3 u) ;
1565
1565
1566
- assert rposition_from ( v, 3 u, 3 u, f) == none;
1567
- assert rposition_from ( v, 3 u, 4 u, f) == some ( 3 u) ;
1566
+ assert rposition_between ( v, 3 u, 3 u, f) == none;
1567
+ assert rposition_between ( v, 3 u, 4 u, f) == some ( 3 u) ;
1568
1568
1569
- assert rposition_from ( v, 4 u, 4 u, f) == none;
1569
+ assert rposition_between ( v, 4 u, 4 u, f) == none;
1570
1570
}
1571
1571
1572
1572
#[ test]
@@ -1582,31 +1582,31 @@ mod tests {
1582
1582
}
1583
1583
1584
1584
#[ test]
1585
- fn test_rfind_from ( ) {
1586
- assert rfind_from ( [ ] , 0 u, 0 u, f) == none;
1585
+ fn test_rfind_between ( ) {
1586
+ assert rfind_between ( [ ] , 0 u, 0 u, f) == none;
1587
1587
1588
1588
fn f ( xy : ( int , char ) ) -> bool { let ( _x, y) = xy; y == 'b' }
1589
1589
let v = [ ( 0 , 'a' ) , ( 1 , 'b' ) , ( 2 , 'c' ) , ( 3 , 'b' ) ] ;
1590
1590
1591
- assert rfind_from ( v, 0 u, 0 u, f) == none;
1592
- assert rfind_from ( v, 0 u, 1 u, f) == none;
1593
- assert rfind_from ( v, 0 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1594
- assert rfind_from ( v, 0 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1595
- assert rfind_from ( v, 0 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1591
+ assert rfind_between ( v, 0 u, 0 u, f) == none;
1592
+ assert rfind_between ( v, 0 u, 1 u, f) == none;
1593
+ assert rfind_between ( v, 0 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1594
+ assert rfind_between ( v, 0 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1595
+ assert rfind_between ( v, 0 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1596
1596
1597
- assert rfind_from ( v, 1 u, 1 u, f) == none;
1598
- assert rfind_from ( v, 1 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1599
- assert rfind_from ( v, 1 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1600
- assert rfind_from ( v, 1 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1597
+ assert rfind_between ( v, 1 u, 1 u, f) == none;
1598
+ assert rfind_between ( v, 1 u, 2 u, f) == some ( ( 1 , 'b' ) ) ;
1599
+ assert rfind_between ( v, 1 u, 3 u, f) == some ( ( 1 , 'b' ) ) ;
1600
+ assert rfind_between ( v, 1 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1601
1601
1602
- assert rfind_from ( v, 2 u, 2 u, f) == none;
1603
- assert rfind_from ( v, 2 u, 3 u, f) == none;
1604
- assert rfind_from ( v, 2 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1602
+ assert rfind_between ( v, 2 u, 2 u, f) == none;
1603
+ assert rfind_between ( v, 2 u, 3 u, f) == none;
1604
+ assert rfind_between ( v, 2 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1605
1605
1606
- assert rfind_from ( v, 3 u, 3 u, f) == none;
1607
- assert rfind_from ( v, 3 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1606
+ assert rfind_between ( v, 3 u, 3 u, f) == none;
1607
+ assert rfind_between ( v, 3 u, 4 u, f) == some ( ( 3 , 'b' ) ) ;
1608
1608
1609
- assert rfind_from ( v, 4 u, 4 u, f) == none;
1609
+ assert rfind_between ( v, 4 u, 4 u, f) == none;
1610
1610
}
1611
1611
1612
1612
#[ test]
0 commit comments