@@ -32,6 +32,7 @@ mod find_map;
32
32
mod fold;
33
33
mod for_each;
34
34
mod fuse;
35
+ mod gt;
35
36
mod inspect;
36
37
mod map;
37
38
mod min_by;
@@ -55,6 +56,7 @@ use find::FindFuture;
55
56
use find_map:: FindMapFuture ;
56
57
use fold:: FoldFuture ;
57
58
use for_each:: ForEachFuture ;
59
+ use gt:: GtFuture ;
58
60
use min_by:: MinByFuture ;
59
61
use next:: NextFuture ;
60
62
use nth:: NthFuture ;
@@ -1231,6 +1233,7 @@ extension_trait! {
1231
1233
#
1232
1234
use async_std::prelude::*;
1233
1235
use std::collections::VecDeque;
1236
+
1234
1237
use std::cmp::Ordering;
1235
1238
let s1 = VecDeque::from(vec![1]);
1236
1239
let s2 = VecDeque::from(vec![1, 2]);
@@ -1256,6 +1259,43 @@ extension_trait! {
1256
1259
{
1257
1260
PartialCmpFuture :: new( self , other)
1258
1261
}
1262
+
1263
+ #[ doc = r#"
1264
+ Determines if the elements of this `Stream` are lexicographically
1265
+ greater than those of another.
1266
+
1267
+ # Examples
1268
+ ```
1269
+ # fn main() { async_std::task::block_on(async {
1270
+ #
1271
+ use async_std::prelude::*;
1272
+ use std::collections::VecDeque;
1273
+
1274
+ let single = VecDeque::from(vec![1]);
1275
+ let single_gt = VecDeque::from(vec![10]);
1276
+ let multi = VecDeque::from(vec![1,2]);
1277
+ let multi_gt = VecDeque::from(vec![1,5]);
1278
+
1279
+ assert_eq!(single.clone().gt(single.clone()).await, false);
1280
+ assert_eq!(single_gt.clone().gt(single.clone()).await, true);
1281
+ assert_eq!(multi.clone().gt(single_gt.clone()).await, false);
1282
+ assert_eq!(multi_gt.clone().gt(multi.clone()).await, true);
1283
+
1284
+ #
1285
+ # }) }
1286
+ ```
1287
+ "# ]
1288
+ fn gt<S >(
1289
+ self ,
1290
+ other: S
1291
+ ) -> impl Future <Output = bool > + ' _ [ GtFuture <Self , S >]
1292
+ where
1293
+ Self : Sized + Stream ,
1294
+ S : Stream ,
1295
+ Self :: Item : PartialOrd <S :: Item >,
1296
+ {
1297
+ GtFuture :: new( self , other)
1298
+ }
1259
1299
}
1260
1300
1261
1301
impl <S : Stream + Unpin + ?Sized > Stream for Box <S > {
0 commit comments