| 1 | //! Opaque implementations of [`Parser`] |
| 2 | |
| 3 | use crate::combinator::trace; |
| 4 | use crate::combinator::trace_result; |
| 5 | use crate::combinator::DisplayDebug; |
| 6 | #[cfg (feature = "unstable-recover" )] |
| 7 | #[cfg (feature = "std" )] |
| 8 | use crate::error::FromRecoverableError; |
| 9 | use crate::error::{AddContext, FromExternalError, ParserError}; |
| 10 | use crate::lib::std::borrow::Borrow; |
| 11 | use crate::lib::std::ops::Range; |
| 12 | #[cfg (feature = "unstable-recover" )] |
| 13 | #[cfg (feature = "std" )] |
| 14 | use crate::stream::Recover; |
| 15 | use crate::stream::StreamIsPartial; |
| 16 | use crate::stream::{Location, Stream}; |
| 17 | use crate::*; |
| 18 | |
| 19 | /// [`Parser`] implementation for [`Parser::by_ref`] |
| 20 | pub struct ByRef<'p, P, I, O, E> { |
| 21 | pub(crate) p: &'p mut P, |
| 22 | pub(crate) i: core::marker::PhantomData<I>, |
| 23 | pub(crate) o: core::marker::PhantomData<O>, |
| 24 | pub(crate) e: core::marker::PhantomData<E>, |
| 25 | } |
| 26 | |
| 27 | impl<I, O, E, P> Parser<I, O, E> for ByRef<'_, P, I, O, E> |
| 28 | where |
| 29 | P: Parser<I, O, E>, |
| 30 | { |
| 31 | #[inline (always)] |
| 32 | fn parse_next(&mut self, i: &mut I) -> Result<O, E> { |
| 33 | self.p.parse_next(input:i) |
| 34 | } |
| 35 | } |
| 36 | |
| 37 | /// [`Parser`] implementation for [`Parser::map`] |
| 38 | pub struct Map<F, G, I, O, O2, E> |
| 39 | where |
| 40 | F: Parser<I, O, E>, |
| 41 | G: FnMut(O) -> O2, |
| 42 | { |
| 43 | pub(crate) parser: F, |
| 44 | pub(crate) map: G, |
| 45 | pub(crate) i: core::marker::PhantomData<I>, |
| 46 | pub(crate) o: core::marker::PhantomData<O>, |
| 47 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 48 | pub(crate) e: core::marker::PhantomData<E>, |
| 49 | } |
| 50 | |
| 51 | impl<F, G, I, O, O2, E> Parser<I, O2, E> for Map<F, G, I, O, O2, E> |
| 52 | where |
| 53 | F: Parser<I, O, E>, |
| 54 | G: FnMut(O) -> O2, |
| 55 | { |
| 56 | #[inline ] |
| 57 | fn parse_next(&mut self, i: &mut I) -> Result<O2, E> { |
| 58 | match self.parser.parse_next(input:i) { |
| 59 | Err(e: E) => Err(e), |
| 60 | Ok(o: O) => Ok((self.map)(o)), |
| 61 | } |
| 62 | } |
| 63 | } |
| 64 | |
| 65 | /// [`Parser`] implementation for [`Parser::try_map`] |
| 66 | pub struct TryMap<F, G, I, O, O2, E, E2> |
| 67 | where |
| 68 | F: Parser<I, O, E>, |
| 69 | G: FnMut(O) -> Result<O2, E2>, |
| 70 | I: Stream, |
| 71 | E: FromExternalError<I, E2>, |
| 72 | E: ParserError<I>, |
| 73 | { |
| 74 | pub(crate) parser: F, |
| 75 | pub(crate) map: G, |
| 76 | pub(crate) i: core::marker::PhantomData<I>, |
| 77 | pub(crate) o: core::marker::PhantomData<O>, |
| 78 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 79 | pub(crate) e: core::marker::PhantomData<E>, |
| 80 | pub(crate) e2: core::marker::PhantomData<E2>, |
| 81 | } |
| 82 | |
| 83 | impl<F, G, I, O, O2, E, E2> Parser<I, O2, E> for TryMap<F, G, I, O, O2, E, E2> |
| 84 | where |
| 85 | F: Parser<I, O, E>, |
| 86 | G: FnMut(O) -> Result<O2, E2>, |
| 87 | I: Stream, |
| 88 | E: FromExternalError<I, E2>, |
| 89 | E: ParserError<I>, |
| 90 | { |
| 91 | #[inline ] |
| 92 | fn parse_next(&mut self, input: &mut I) -> Result<O2, E> { |
| 93 | let start: ::Checkpoint = input.checkpoint(); |
| 94 | let o: O = self.parser.parse_next(input)?; |
| 95 | let res: Result = (self.map)(o).map_err(|err: E2| { |
| 96 | input.reset(&start); |
| 97 | E::from_external_error(input, e:err) |
| 98 | }); |
| 99 | trace_result(name:"verify" , &res); |
| 100 | res |
| 101 | } |
| 102 | } |
| 103 | |
| 104 | /// [`Parser`] implementation for [`Parser::verify_map`] |
| 105 | pub struct VerifyMap<F, G, I, O, O2, E> |
| 106 | where |
| 107 | F: Parser<I, O, E>, |
| 108 | G: FnMut(O) -> Option<O2>, |
| 109 | I: Stream, |
| 110 | E: ParserError<I>, |
| 111 | { |
| 112 | pub(crate) parser: F, |
| 113 | pub(crate) map: G, |
| 114 | pub(crate) i: core::marker::PhantomData<I>, |
| 115 | pub(crate) o: core::marker::PhantomData<O>, |
| 116 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 117 | pub(crate) e: core::marker::PhantomData<E>, |
| 118 | } |
| 119 | |
| 120 | impl<F, G, I, O, O2, E> Parser<I, O2, E> for VerifyMap<F, G, I, O, O2, E> |
| 121 | where |
| 122 | F: Parser<I, O, E>, |
| 123 | G: FnMut(O) -> Option<O2>, |
| 124 | I: Stream, |
| 125 | E: ParserError<I>, |
| 126 | { |
| 127 | #[inline ] |
| 128 | fn parse_next(&mut self, input: &mut I) -> Result<O2, E> { |
| 129 | let start: ::Checkpoint = input.checkpoint(); |
| 130 | let o: O = self.parser.parse_next(input)?; |
| 131 | let res: Result = (self.map)(o).ok_or_else(|| { |
| 132 | input.reset(&start); |
| 133 | ParserError::from_input(input) |
| 134 | }); |
| 135 | trace_result(name:"verify" , &res); |
| 136 | res |
| 137 | } |
| 138 | } |
| 139 | |
| 140 | /// [`Parser`] implementation for [`Parser::and_then`] |
| 141 | pub struct AndThen<F, G, I, O, O2, E> |
| 142 | where |
| 143 | F: Parser<I, O, E>, |
| 144 | G: Parser<O, O2, E>, |
| 145 | O: StreamIsPartial, |
| 146 | I: Stream, |
| 147 | { |
| 148 | pub(crate) outer: F, |
| 149 | pub(crate) inner: G, |
| 150 | pub(crate) i: core::marker::PhantomData<I>, |
| 151 | pub(crate) o: core::marker::PhantomData<O>, |
| 152 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 153 | pub(crate) e: core::marker::PhantomData<E>, |
| 154 | } |
| 155 | |
| 156 | impl<F, G, I, O, O2, E> Parser<I, O2, E> for AndThen<F, G, I, O, O2, E> |
| 157 | where |
| 158 | F: Parser<I, O, E>, |
| 159 | G: Parser<O, O2, E>, |
| 160 | O: StreamIsPartial, |
| 161 | I: Stream, |
| 162 | { |
| 163 | #[inline (always)] |
| 164 | fn parse_next(&mut self, i: &mut I) -> Result<O2, E> { |
| 165 | let start: ::Checkpoint = i.checkpoint(); |
| 166 | let mut o: O = self.outer.parse_next(input:i)?; |
| 167 | let _ = o.complete(); |
| 168 | let o2: O2 = self.inner.parse_next(&mut o).map_err(|err: E| { |
| 169 | i.reset(&start); |
| 170 | err |
| 171 | })?; |
| 172 | Ok(o2) |
| 173 | } |
| 174 | } |
| 175 | |
| 176 | /// [`Parser`] implementation for [`Parser::parse_to`] |
| 177 | pub struct ParseTo<P, I, O, O2, E> |
| 178 | where |
| 179 | P: Parser<I, O, E>, |
| 180 | I: Stream, |
| 181 | O: crate::stream::ParseSlice<O2>, |
| 182 | E: ParserError<I>, |
| 183 | { |
| 184 | pub(crate) p: P, |
| 185 | pub(crate) i: core::marker::PhantomData<I>, |
| 186 | pub(crate) o: core::marker::PhantomData<O>, |
| 187 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 188 | pub(crate) e: core::marker::PhantomData<E>, |
| 189 | } |
| 190 | |
| 191 | impl<P, I, O, O2, E> Parser<I, O2, E> for ParseTo<P, I, O, O2, E> |
| 192 | where |
| 193 | P: Parser<I, O, E>, |
| 194 | I: Stream, |
| 195 | O: crate::stream::ParseSlice<O2>, |
| 196 | E: ParserError<I>, |
| 197 | { |
| 198 | #[inline ] |
| 199 | fn parse_next(&mut self, i: &mut I) -> Result<O2, E> { |
| 200 | let start: ::Checkpoint = i.checkpoint(); |
| 201 | let o: O = self.p.parse_next(input:i)?; |
| 202 | let res: Result = o.parse_slice().ok_or_else(|| { |
| 203 | i.reset(&start); |
| 204 | ParserError::from_input(i) |
| 205 | }); |
| 206 | trace_result(name:"verify" , &res); |
| 207 | res |
| 208 | } |
| 209 | } |
| 210 | |
| 211 | /// [`Parser`] implementation for [`Parser::flat_map`] |
| 212 | pub struct FlatMap<F, G, H, I, O, O2, E> |
| 213 | where |
| 214 | F: Parser<I, O, E>, |
| 215 | G: FnMut(O) -> H, |
| 216 | H: Parser<I, O2, E>, |
| 217 | { |
| 218 | pub(crate) f: F, |
| 219 | pub(crate) g: G, |
| 220 | pub(crate) h: core::marker::PhantomData<H>, |
| 221 | pub(crate) i: core::marker::PhantomData<I>, |
| 222 | pub(crate) o: core::marker::PhantomData<O>, |
| 223 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 224 | pub(crate) e: core::marker::PhantomData<E>, |
| 225 | } |
| 226 | |
| 227 | impl<F, G, H, I, O, O2, E> Parser<I, O2, E> for FlatMap<F, G, H, I, O, O2, E> |
| 228 | where |
| 229 | F: Parser<I, O, E>, |
| 230 | G: FnMut(O) -> H, |
| 231 | H: Parser<I, O2, E>, |
| 232 | { |
| 233 | #[inline (always)] |
| 234 | fn parse_next(&mut self, i: &mut I) -> Result<O2, E> { |
| 235 | let o: O = self.f.parse_next(input:i)?; |
| 236 | (self.g)(o).parse_next(input:i) |
| 237 | } |
| 238 | } |
| 239 | |
| 240 | /// [`Parser`] implementation for [`Parser::complete_err`] |
| 241 | pub struct CompleteErr<P, I, O, E> { |
| 242 | pub(crate) p: P, |
| 243 | pub(crate) i: core::marker::PhantomData<I>, |
| 244 | pub(crate) o: core::marker::PhantomData<O>, |
| 245 | pub(crate) e: core::marker::PhantomData<E>, |
| 246 | } |
| 247 | |
| 248 | impl<P, I, O, E> Parser<I, O, E> for CompleteErr<P, I, O, E> |
| 249 | where |
| 250 | P: Parser<I, O, E>, |
| 251 | I: Stream, |
| 252 | E: ParserError<I>, |
| 253 | { |
| 254 | #[inline ] |
| 255 | fn parse_next(&mut self, input: &mut I) -> Result<O, E> { |
| 256 | traceimpl Parser(name:"complete_err" , |input: &mut I| { |
| 257 | match (self.p).parse_next(input) { |
| 258 | Err(err: E) => match err.needed() { |
| 259 | Some(_) => Err(ParserError::from_input(input)), |
| 260 | None => Err(err), |
| 261 | }, |
| 262 | rest: Result => rest, |
| 263 | } |
| 264 | }) |
| 265 | .parse_next(input) |
| 266 | } |
| 267 | } |
| 268 | |
| 269 | /// [`Parser`] implementation for [`Parser::verify`] |
| 270 | pub struct Verify<F, G, I, O, O2, E> |
| 271 | where |
| 272 | F: Parser<I, O, E>, |
| 273 | G: FnMut(&O2) -> bool, |
| 274 | I: Stream, |
| 275 | O: Borrow<O2>, |
| 276 | O2: ?Sized, |
| 277 | E: ParserError<I>, |
| 278 | { |
| 279 | pub(crate) parser: F, |
| 280 | pub(crate) filter: G, |
| 281 | pub(crate) i: core::marker::PhantomData<I>, |
| 282 | pub(crate) o: core::marker::PhantomData<O>, |
| 283 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 284 | pub(crate) e: core::marker::PhantomData<E>, |
| 285 | } |
| 286 | |
| 287 | impl<F, G, I, O, O2, E> Parser<I, O, E> for Verify<F, G, I, O, O2, E> |
| 288 | where |
| 289 | F: Parser<I, O, E>, |
| 290 | G: FnMut(&O2) -> bool, |
| 291 | I: Stream, |
| 292 | O: Borrow<O2>, |
| 293 | O2: ?Sized, |
| 294 | E: ParserError<I>, |
| 295 | { |
| 296 | #[inline ] |
| 297 | fn parse_next(&mut self, input: &mut I) -> Result<O, E> { |
| 298 | let start: ::Checkpoint = input.checkpoint(); |
| 299 | let o: O = self.parser.parse_next(input)?; |
| 300 | let res: Result = (self.filter)(o.borrow()).then_some(o).ok_or_else(|| { |
| 301 | input.reset(&start); |
| 302 | ParserError::from_input(input) |
| 303 | }); |
| 304 | trace_result(name:"verify" , &res); |
| 305 | res |
| 306 | } |
| 307 | } |
| 308 | |
| 309 | /// [`Parser`] implementation for [`Parser::value`] |
| 310 | pub struct Value<F, I, O, O2, E> |
| 311 | where |
| 312 | F: Parser<I, O, E>, |
| 313 | O2: Clone, |
| 314 | { |
| 315 | pub(crate) parser: F, |
| 316 | pub(crate) val: O2, |
| 317 | pub(crate) i: core::marker::PhantomData<I>, |
| 318 | pub(crate) o: core::marker::PhantomData<O>, |
| 319 | pub(crate) e: core::marker::PhantomData<E>, |
| 320 | } |
| 321 | |
| 322 | impl<F, I, O, O2, E> Parser<I, O2, E> for Value<F, I, O, O2, E> |
| 323 | where |
| 324 | F: Parser<I, O, E>, |
| 325 | O2: Clone, |
| 326 | { |
| 327 | #[inline ] |
| 328 | fn parse_next(&mut self, input: &mut I) -> Result<O2, E> { |
| 329 | (self.parser).parse_next(input).map(|_| self.val.clone()) |
| 330 | } |
| 331 | } |
| 332 | |
| 333 | /// [`Parser`] implementation for [`Parser::default_value`] |
| 334 | pub struct DefaultValue<F, I, O, O2, E> |
| 335 | where |
| 336 | F: Parser<I, O, E>, |
| 337 | O2: core::default::Default, |
| 338 | { |
| 339 | pub(crate) parser: F, |
| 340 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 341 | pub(crate) i: core::marker::PhantomData<I>, |
| 342 | pub(crate) o: core::marker::PhantomData<O>, |
| 343 | pub(crate) e: core::marker::PhantomData<E>, |
| 344 | } |
| 345 | |
| 346 | impl<F, I, O, O2, E> Parser<I, O2, E> for DefaultValue<F, I, O, O2, E> |
| 347 | where |
| 348 | F: Parser<I, O, E>, |
| 349 | O2: core::default::Default, |
| 350 | { |
| 351 | #[inline ] |
| 352 | fn parse_next(&mut self, input: &mut I) -> Result<O2, E> { |
| 353 | (self.parser).parse_next(input).map(|_| O2::default()) |
| 354 | } |
| 355 | } |
| 356 | |
| 357 | /// [`Parser`] implementation for [`Parser::void`] |
| 358 | pub struct Void<F, I, O, E> |
| 359 | where |
| 360 | F: Parser<I, O, E>, |
| 361 | { |
| 362 | pub(crate) parser: F, |
| 363 | pub(crate) i: core::marker::PhantomData<I>, |
| 364 | pub(crate) o: core::marker::PhantomData<O>, |
| 365 | pub(crate) e: core::marker::PhantomData<E>, |
| 366 | } |
| 367 | |
| 368 | impl<F, I, O, E> Parser<I, (), E> for Void<F, I, O, E> |
| 369 | where |
| 370 | F: Parser<I, O, E>, |
| 371 | { |
| 372 | #[inline (always)] |
| 373 | fn parse_next(&mut self, input: &mut I) -> Result<(), E> { |
| 374 | (self.parser).parse_next(input).map(|_| ()) |
| 375 | } |
| 376 | } |
| 377 | |
| 378 | /// [`Parser`] implementation for [`Parser::take`] |
| 379 | pub struct Take<F, I, O, E> |
| 380 | where |
| 381 | F: Parser<I, O, E>, |
| 382 | I: Stream, |
| 383 | { |
| 384 | pub(crate) parser: F, |
| 385 | pub(crate) i: core::marker::PhantomData<I>, |
| 386 | pub(crate) o: core::marker::PhantomData<O>, |
| 387 | pub(crate) e: core::marker::PhantomData<E>, |
| 388 | } |
| 389 | |
| 390 | impl<I, O, E, F> Parser<I, <I as Stream>::Slice, E> for Take<F, I, O, E> |
| 391 | where |
| 392 | F: Parser<I, O, E>, |
| 393 | I: Stream, |
| 394 | { |
| 395 | #[inline ] |
| 396 | fn parse_next(&mut self, input: &mut I) -> Result<<I as Stream>::Slice, E> { |
| 397 | let checkpoint: ::Checkpoint = input.checkpoint(); |
| 398 | match (self.parser).parse_next(input) { |
| 399 | Ok(_) => { |
| 400 | let offset: usize = input.offset_from(&checkpoint); |
| 401 | input.reset(&checkpoint); |
| 402 | let taken: ::Slice = input.next_slice(offset); |
| 403 | Ok(taken) |
| 404 | } |
| 405 | Err(e: E) => Err(e), |
| 406 | } |
| 407 | } |
| 408 | } |
| 409 | |
| 410 | /// [`Parser`] implementation for [`Parser::with_taken`] |
| 411 | pub struct WithTaken<F, I, O, E> |
| 412 | where |
| 413 | F: Parser<I, O, E>, |
| 414 | I: Stream, |
| 415 | { |
| 416 | pub(crate) parser: F, |
| 417 | pub(crate) i: core::marker::PhantomData<I>, |
| 418 | pub(crate) o: core::marker::PhantomData<O>, |
| 419 | pub(crate) e: core::marker::PhantomData<E>, |
| 420 | } |
| 421 | |
| 422 | impl<F, I, O, E> Parser<I, (O, <I as Stream>::Slice), E> for WithTaken<F, I, O, E> |
| 423 | where |
| 424 | F: Parser<I, O, E>, |
| 425 | I: Stream, |
| 426 | { |
| 427 | #[inline ] |
| 428 | fn parse_next(&mut self, input: &mut I) -> Result<(O, <I as Stream>::Slice), E> { |
| 429 | let checkpoint: ::Checkpoint = input.checkpoint(); |
| 430 | match (self.parser).parse_next(input) { |
| 431 | Ok(result: O) => { |
| 432 | let offset: usize = input.offset_from(&checkpoint); |
| 433 | input.reset(&checkpoint); |
| 434 | let taken: ::Slice = input.next_slice(offset); |
| 435 | Ok((result, taken)) |
| 436 | } |
| 437 | Err(e: E) => Err(e), |
| 438 | } |
| 439 | } |
| 440 | } |
| 441 | |
| 442 | /// [`Parser`] implementation for [`Parser::span`] |
| 443 | pub struct Span<F, I, O, E> |
| 444 | where |
| 445 | F: Parser<I, O, E>, |
| 446 | I: Stream + Location, |
| 447 | { |
| 448 | pub(crate) parser: F, |
| 449 | pub(crate) i: core::marker::PhantomData<I>, |
| 450 | pub(crate) o: core::marker::PhantomData<O>, |
| 451 | pub(crate) e: core::marker::PhantomData<E>, |
| 452 | } |
| 453 | |
| 454 | impl<I, O, E, F> Parser<I, Range<usize>, E> for Span<F, I, O, E> |
| 455 | where |
| 456 | F: Parser<I, O, E>, |
| 457 | I: Stream + Location, |
| 458 | { |
| 459 | #[inline ] |
| 460 | fn parse_next(&mut self, input: &mut I) -> Result<Range<usize>, E> { |
| 461 | let start: usize = input.current_token_start(); |
| 462 | self.parser.parse_next(input).map(op:move |_| { |
| 463 | let end: usize = input.previous_token_end(); |
| 464 | start..end |
| 465 | }) |
| 466 | } |
| 467 | } |
| 468 | |
| 469 | /// [`Parser`] implementation for [`Parser::with_span`] |
| 470 | pub struct WithSpan<F, I, O, E> |
| 471 | where |
| 472 | F: Parser<I, O, E>, |
| 473 | I: Stream + Location, |
| 474 | { |
| 475 | pub(crate) parser: F, |
| 476 | pub(crate) i: core::marker::PhantomData<I>, |
| 477 | pub(crate) o: core::marker::PhantomData<O>, |
| 478 | pub(crate) e: core::marker::PhantomData<E>, |
| 479 | } |
| 480 | |
| 481 | impl<F, I, O, E> Parser<I, (O, Range<usize>), E> for WithSpan<F, I, O, E> |
| 482 | where |
| 483 | F: Parser<I, O, E>, |
| 484 | I: Stream + Location, |
| 485 | { |
| 486 | #[inline ] |
| 487 | fn parse_next(&mut self, input: &mut I) -> Result<(O, Range<usize>), E> { |
| 488 | let start: usize = input.current_token_start(); |
| 489 | self.parser.parse_next(input).map(op:move |output: O| { |
| 490 | let end: usize = input.previous_token_end(); |
| 491 | (output, (start..end)) |
| 492 | }) |
| 493 | } |
| 494 | } |
| 495 | |
| 496 | /// [`Parser`] implementation for [`Parser::output_into`] |
| 497 | pub struct OutputInto<F, I, O, O2, E> |
| 498 | where |
| 499 | F: Parser<I, O, E>, |
| 500 | O: Into<O2>, |
| 501 | { |
| 502 | pub(crate) parser: F, |
| 503 | pub(crate) i: core::marker::PhantomData<I>, |
| 504 | pub(crate) o: core::marker::PhantomData<O>, |
| 505 | pub(crate) o2: core::marker::PhantomData<O2>, |
| 506 | pub(crate) e: core::marker::PhantomData<E>, |
| 507 | } |
| 508 | |
| 509 | impl<F, I, O, O2, E> Parser<I, O2, E> for OutputInto<F, I, O, O2, E> |
| 510 | where |
| 511 | F: Parser<I, O, E>, |
| 512 | O: Into<O2>, |
| 513 | { |
| 514 | #[inline ] |
| 515 | fn parse_next(&mut self, i: &mut I) -> Result<O2, E> { |
| 516 | self.parser.parse_next(i).map(|o: O| o.into()) |
| 517 | } |
| 518 | } |
| 519 | |
| 520 | /// [`Parser`] implementation for [`Parser::err_into`] |
| 521 | pub struct ErrInto<F, I, O, E, E2> |
| 522 | where |
| 523 | F: Parser<I, O, E>, |
| 524 | E: Into<E2>, |
| 525 | { |
| 526 | pub(crate) parser: F, |
| 527 | pub(crate) i: core::marker::PhantomData<I>, |
| 528 | pub(crate) o: core::marker::PhantomData<O>, |
| 529 | pub(crate) e: core::marker::PhantomData<E>, |
| 530 | pub(crate) e2: core::marker::PhantomData<E2>, |
| 531 | } |
| 532 | |
| 533 | impl<F, I, O, E, E2> Parser<I, O, E2> for ErrInto<F, I, O, E, E2> |
| 534 | where |
| 535 | F: Parser<I, O, E>, |
| 536 | E: Into<E2>, |
| 537 | { |
| 538 | #[inline ] |
| 539 | fn parse_next(&mut self, i: &mut I) -> Result<O, E2> { |
| 540 | self.parser.parse_next(i).map_err(|err: E| err.into()) |
| 541 | } |
| 542 | } |
| 543 | |
| 544 | /// [`Parser`] implementation for [`Parser::context`] |
| 545 | pub struct Context<F, I, O, E, C> |
| 546 | where |
| 547 | F: Parser<I, O, E>, |
| 548 | I: Stream, |
| 549 | E: AddContext<I, C>, |
| 550 | E: ParserError<I>, |
| 551 | C: Clone + crate::lib::std::fmt::Debug, |
| 552 | { |
| 553 | pub(crate) parser: F, |
| 554 | pub(crate) context: C, |
| 555 | pub(crate) i: core::marker::PhantomData<I>, |
| 556 | pub(crate) o: core::marker::PhantomData<O>, |
| 557 | pub(crate) e: core::marker::PhantomData<E>, |
| 558 | } |
| 559 | |
| 560 | impl<F, I, O, E, C> Parser<I, O, E> for Context<F, I, O, E, C> |
| 561 | where |
| 562 | F: Parser<I, O, E>, |
| 563 | I: Stream, |
| 564 | E: AddContext<I, C>, |
| 565 | E: ParserError<I>, |
| 566 | C: Clone + crate::lib::std::fmt::Debug, |
| 567 | { |
| 568 | #[inline ] |
| 569 | fn parse_next(&mut self, i: &mut I) -> Result<O, E> { |
| 570 | let context: C = self.context.clone(); |
| 571 | trace(DisplayDebug(self.context.clone()), move |i: &mut I| { |
| 572 | let start = i.checkpoint(); |
| 573 | (self.parser) |
| 574 | .parse_next(i) |
| 575 | .map_err(|err| err.add_context(i, &start, context.clone())) |
| 576 | }) |
| 577 | .parse_next(input:i) |
| 578 | } |
| 579 | } |
| 580 | |
| 581 | /// [`Parser`] implementation for [`Parser::retry_after`] |
| 582 | #[cfg (feature = "unstable-recover" )] |
| 583 | #[cfg (feature = "std" )] |
| 584 | pub struct RetryAfter<P, R, I, O, E> |
| 585 | where |
| 586 | P: Parser<I, O, E>, |
| 587 | R: Parser<I, (), E>, |
| 588 | I: Stream, |
| 589 | I: Recover<E>, |
| 590 | E: ParserError<I> + FromRecoverableError<I, E>, |
| 591 | { |
| 592 | pub(crate) parser: P, |
| 593 | pub(crate) recover: R, |
| 594 | pub(crate) i: core::marker::PhantomData<I>, |
| 595 | pub(crate) o: core::marker::PhantomData<O>, |
| 596 | pub(crate) e: core::marker::PhantomData<E>, |
| 597 | } |
| 598 | |
| 599 | #[cfg (feature = "unstable-recover" )] |
| 600 | #[cfg (feature = "std" )] |
| 601 | impl<P, R, I, O, E> Parser<I, O, E> for RetryAfter<P, R, I, O, E> |
| 602 | where |
| 603 | P: Parser<I, O, E>, |
| 604 | R: Parser<I, (), E>, |
| 605 | I: Stream, |
| 606 | I: Recover<E>, |
| 607 | E: ParserError<I> + FromRecoverableError<I, E>, |
| 608 | { |
| 609 | #[inline (always)] |
| 610 | fn parse_next(&mut self, i: &mut I) -> Result<O, E> { |
| 611 | if I::is_recovery_supported() { |
| 612 | retry_after_inner(&mut self.parser, &mut self.recover, i) |
| 613 | } else { |
| 614 | self.parser.parse_next(i) |
| 615 | } |
| 616 | } |
| 617 | } |
| 618 | |
| 619 | #[cfg (feature = "unstable-recover" )] |
| 620 | #[cfg (feature = "std" )] |
| 621 | fn retry_after_inner<P, R, I, O, E>(parser: &mut P, recover: &mut R, i: &mut I) -> Result<O, E> |
| 622 | where |
| 623 | P: Parser<I, O, E>, |
| 624 | R: Parser<I, (), E>, |
| 625 | I: Stream, |
| 626 | I: Recover<E>, |
| 627 | E: ParserError<I> + FromRecoverableError<I, E>, |
| 628 | { |
| 629 | loop { |
| 630 | let token_start = i.checkpoint(); |
| 631 | let mut err = match parser.parse_next(i) { |
| 632 | Ok(o) => { |
| 633 | return Ok(o); |
| 634 | } |
| 635 | Err(e) if e.is_incomplete() => return Err(e), |
| 636 | Err(err) => err, |
| 637 | }; |
| 638 | let err_start = i.checkpoint(); |
| 639 | let err_start_eof_offset = i.eof_offset(); |
| 640 | if recover.parse_next(i).is_ok() { |
| 641 | let i_eof_offset = i.eof_offset(); |
| 642 | if err_start_eof_offset == i_eof_offset { |
| 643 | // Didn't advance so bubble the error up |
| 644 | } else if let Err(err_) = i.record_err(&token_start, &err_start, err) { |
| 645 | err = err_; |
| 646 | } else { |
| 647 | continue; |
| 648 | } |
| 649 | } |
| 650 | |
| 651 | i.reset(&err_start); |
| 652 | err = E::from_recoverable_error(&token_start, &err_start, i, err); |
| 653 | return Err(err); |
| 654 | } |
| 655 | } |
| 656 | |
| 657 | /// [`Parser`] implementation for [`Parser::resume_after`] |
| 658 | #[cfg (feature = "unstable-recover" )] |
| 659 | #[cfg (feature = "std" )] |
| 660 | pub struct ResumeAfter<P, R, I, O, E> |
| 661 | where |
| 662 | P: Parser<I, O, E>, |
| 663 | R: Parser<I, (), E>, |
| 664 | I: Stream, |
| 665 | I: Recover<E>, |
| 666 | E: ParserError<I> + FromRecoverableError<I, E>, |
| 667 | { |
| 668 | pub(crate) parser: P, |
| 669 | pub(crate) recover: R, |
| 670 | pub(crate) i: core::marker::PhantomData<I>, |
| 671 | pub(crate) o: core::marker::PhantomData<O>, |
| 672 | pub(crate) e: core::marker::PhantomData<E>, |
| 673 | } |
| 674 | |
| 675 | #[cfg (feature = "unstable-recover" )] |
| 676 | #[cfg (feature = "std" )] |
| 677 | impl<P, R, I, O, E> Parser<I, Option<O>, E> for ResumeAfter<P, R, I, O, E> |
| 678 | where |
| 679 | P: Parser<I, O, E>, |
| 680 | R: Parser<I, (), E>, |
| 681 | I: Stream, |
| 682 | I: Recover<E>, |
| 683 | E: ParserError<I> + FromRecoverableError<I, E>, |
| 684 | { |
| 685 | #[inline (always)] |
| 686 | fn parse_next(&mut self, i: &mut I) -> Result<Option<O>, E> { |
| 687 | if I::is_recovery_supported() { |
| 688 | resume_after_inner(&mut self.parser, &mut self.recover, i) |
| 689 | } else { |
| 690 | self.parser.parse_next(i).map(Some) |
| 691 | } |
| 692 | } |
| 693 | } |
| 694 | |
| 695 | #[cfg (feature = "unstable-recover" )] |
| 696 | #[cfg (feature = "std" )] |
| 697 | fn resume_after_inner<P, R, I, O, E>( |
| 698 | parser: &mut P, |
| 699 | recover: &mut R, |
| 700 | i: &mut I, |
| 701 | ) -> Result<Option<O>, E> |
| 702 | where |
| 703 | P: Parser<I, O, E>, |
| 704 | R: Parser<I, (), E>, |
| 705 | I: Stream, |
| 706 | I: Recover<E>, |
| 707 | E: ParserError<I> + FromRecoverableError<I, E>, |
| 708 | { |
| 709 | let token_start = i.checkpoint(); |
| 710 | let mut err = match parser.parse_next(i) { |
| 711 | Ok(o) => { |
| 712 | return Ok(Some(o)); |
| 713 | } |
| 714 | Err(e) if e.is_incomplete() => return Err(e), |
| 715 | Err(err) => err, |
| 716 | }; |
| 717 | let err_start = i.checkpoint(); |
| 718 | if recover.parse_next(i).is_ok() { |
| 719 | if let Err(err_) = i.record_err(&token_start, &err_start, err) { |
| 720 | err = err_; |
| 721 | } else { |
| 722 | return Ok(None); |
| 723 | } |
| 724 | } |
| 725 | |
| 726 | i.reset(&err_start); |
| 727 | err = FromRecoverableError::from_recoverable_error(&token_start, &err_start, i, err); |
| 728 | Err(err) |
| 729 | } |
| 730 | |