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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299
//!
//! Quantifiers like Pair and Many.
//!
/// Internal namespace.
mod private
{
use crate::*;
///
/// Marker saying how to parse several elements of such type in a row.
///
pub trait AsMuchAsPossibleNoDelimiter {}
/// Element of parsing.
pub trait Element
where
// Self : syn::parse::Parse + quote::ToTokens,
Self : quote::ToTokens,
{
}
impl< T > Element for T
where
// Self : syn::parse::Parse + quote::ToTokens,
Self : quote::ToTokens,
{
}
/// Pair of two elements of parsing.
#[ derive( Debug, PartialEq, Eq, Clone, Default ) ]
pub struct Pair
< T1 : Element, T2 : Element >
( pub T1, pub T2 );
impl< T1, T2 > Pair< T1, T2 >
where
T1 : Element,
T2 : Element,
{
/// Constructor.
pub fn new( src1 : T1, src2 : T2 ) -> Self
{
Self( src1, src2 )
}
}
impl< T1, T2 > From< ( T1, T2 ) > for Pair< T1, T2 >
where
T1 : Element,
T2 : Element,
{
#[ inline( always ) ]
fn from( src : ( T1, T2 ) ) -> Self
{
Self( src.0, src.1 )
}
}
impl< T1, T2 > From< Pair< T1, T2 > > for ( T1, T2 )
where
T1 : Element,
T2 : Element,
{
#[ inline( always ) ]
fn from( src : Pair< T1, T2 > ) -> Self
{
( src.0, src.1 )
}
}
impl< T1, T2 > syn::parse::Parse for Pair< T1, T2 >
where
T1 : Element + syn::parse::Parse,
T2 : Element + syn::parse::Parse,
{
fn parse( input : ParseStream< '_ > ) -> syn::Result< Self >
{
Ok( Self( input.parse()?, input.parse()? ) )
}
}
impl< T1, T2 > quote::ToTokens for Pair< T1, T2 >
where
T1 : Element + quote::ToTokens,
T2 : Element + quote::ToTokens,
{
fn to_tokens( &self, tokens : &mut proc_macro2::TokenStream )
{
self.0.to_tokens( tokens );
self.1.to_tokens( tokens );
}
}
///
/// Parse as much elements as possible.
///
#[ derive( Debug, PartialEq, Eq, Clone, Default ) ]
pub struct Many< T : quote::ToTokens >( pub Vec< T > );
impl< T > Many< T >
where
T : Element,
{
/// Constructor.
pub fn new() -> Self
{
Self( Vec::new() )
}
/// Constructor.
pub fn new_with( src : Vec< T > ) -> Self
{
Self( src )
}
/// Iterator
pub fn iter( &self ) -> core::slice::Iter< '_, T >
{
self.0.iter()
}
}
impl< T > From< Vec< T > > for Many< T >
where
T : quote::ToTokens,
{
#[ inline( always ) ]
fn from( src : Vec< T > ) -> Self
{
Self( src )
}
}
impl< T > From< Many< T > > for Vec< T >
where
T : quote::ToTokens,
{
#[ inline( always ) ]
fn from( src : Many< T > ) -> Self
{
src.0
}
}
impl< T > IntoIterator for Many< T >
where
T : quote::ToTokens,
{
type Item = T;
type IntoIter = std::vec::IntoIter< Self::Item >;
fn into_iter( self ) -> Self::IntoIter
{
self.0.into_iter()
}
}
impl< 'a, T > IntoIterator for &'a Many< T >
where
T : quote::ToTokens,
{
type Item = &'a T;
type IntoIter = core::slice::Iter< 'a, T >;
fn into_iter( self ) -> Self::IntoIter
{
// let x = vec![ 1, 2, 3 ].iter();
( self.0 ).iter()
}
}
// impl< T > From< Many< T > > for Vec< T >
// where
// T : Element,
// {
// fn from( src : Many< T > ) -> Self
// {
// src.0
// }
// }
impl< T > quote::ToTokens
for Many< T >
where
T : Element + quote::ToTokens,
{
fn to_tokens( &self, tokens : &mut proc_macro2::TokenStream )
{
use crate::quote::TokenStreamExt;
tokens.append_all( self.0.iter() );
}
}
impl< T > syn::parse::Parse
for Many< T >
where
T : Element + syn::parse::Parse + AsMuchAsPossibleNoDelimiter,
{
fn parse( input : syn::parse::ParseStream< '_ > ) -> syn::Result< Self >
{
let mut items = vec![];
while !input.is_empty()
{
let item : T = input.parse()?;
items.push( item );
}
Ok( Self( items ) )
}
}
// qqq : zzz : make that working
//
// impl< T > syn::parse::Parse
// for Many< T >
// where
// T : Element + WhileDelimiter,
// {
// fn parse( input : syn::parse::ParseStream< '_ > ) -> syn::Result< Self >
// {
// let mut result = Self::new();
// loop
// {
// let lookahead = input.lookahead1();
// let token = < T as WhileDelimiter >::Delimiter::default().into();
// if !lookahead.peek( token )
// {
// break;
// }
// result.0.push( input.parse()? );
// }
// Ok( result )
// }
// }
//
// impl WhileDelimiter for AttributesInner
// {
// type Peek = syn::token::Pound;
// type Delimiter = syn::token::Pound;
// }
// impl WhileDelimiter for AttributesOuter
// {
// type Peek = syn::token::Pound;
// type Delimiter = syn::token::Pound;
// }
}
#[ doc( inline ) ]
#[ allow( unused_imports ) ]
pub use own::*;
/// Own namespace of the module.
#[ allow( unused_imports ) ]
pub mod own
{
use super::*;
#[ doc( inline ) ]
pub use orphan::*;
}
/// Orphan namespace of the module.
#[ allow( unused_imports ) ]
pub mod orphan
{
use super::*;
#[ doc( inline ) ]
pub use exposed::*;
}
/// Exposed namespace of the module.
#[ allow( unused_imports ) ]
pub mod exposed
{
use super::*;
pub use super::super::quantifier;
// pub use super::own as quantifier;
#[ doc( inline ) ]
pub use prelude::*;
#[ doc( inline ) ]
pub use private::
{
AsMuchAsPossibleNoDelimiter,
Pair,
Many,
};
}
/// Prelude to use essentials: `use my_module::prelude::*`.
#[ allow( unused_imports ) ]
pub mod prelude
{
use super::*;
#[ doc( inline ) ]
pub use private::
{
};
}