1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
use std::collections::hash_map::HashMap; use std::collections::hash_set::HashSet; use super::*; pub trait NotEmpty: Sized { fn _is_empty(&self) -> bool; #[inline] fn not_empty(self) -> Option<Self> { self._is_empty().map(|| self) } } impl<T> NotEmpty for &Vec<T> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<T> NotEmpty for &mut Vec<T> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<T> NotEmpty for Vec<T> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl NotEmpty for &str { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl NotEmpty for &mut str { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl NotEmpty for &String { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl NotEmpty for &mut String { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl NotEmpty for String { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<T> NotEmpty for &HashSet<T> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<T> NotEmpty for &mut HashSet<T> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<T> NotEmpty for HashSet<T> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<K,V> NotEmpty for &HashMap<K,V> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<K,V> NotEmpty for &mut HashMap<K,V> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } } impl<K,V> NotEmpty for HashMap<K,V> { #[inline] fn _is_empty(&self) -> bool { self.is_empty() } }