1 // Copyright 2016 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
13 use rustc::middle::const_val::{ConstEvalErr, ConstVal};
14 use rustc::mir::{Field, BorrowKind, Mutability};
15 use rustc::ty::{self, TyCtxt, AdtDef, Ty, Region};
16 use rustc::ty::subst::{Substs, Kind};
17 use rustc::hir::{self, PatKind, RangeEnd};
18 use rustc::hir::def::{Def, CtorKind};
19 use rustc::hir::pat_util::EnumerateAndAdjustIterator;
21 use rustc_data_structures::indexed_vec::Idx;
28 #[derive(Clone, Debug)]
29 pub enum PatternError<'tcx> {
30 StaticInPattern(Span),
31 ConstEval(ConstEvalErr<'tcx>),
34 #[derive(Copy, Clone, Debug)]
35 pub enum BindingMode<'tcx> {
37 ByRef(Region<'tcx>, BorrowKind),
40 #[derive(Clone, Debug)]
41 pub struct FieldPattern<'tcx> {
43 pub pattern: Pattern<'tcx>,
46 #[derive(Clone, Debug)]
47 pub struct Pattern<'tcx> {
50 pub kind: Box<PatternKind<'tcx>>,
53 #[derive(Clone, Debug)]
54 pub enum PatternKind<'tcx> {
57 /// x, ref x, x @ P, etc
59 mutability: Mutability,
61 mode: BindingMode<'tcx>,
64 subpattern: Option<Pattern<'tcx>>,
67 /// Foo(...) or Foo{...} or Foo, where `Foo` is a variant name from an adt with >1 variants
69 adt_def: &'tcx AdtDef,
70 substs: &'tcx Substs<'tcx>,
72 subpatterns: Vec<FieldPattern<'tcx>>,
75 /// (...), Foo(...), Foo{...}, or Foo, where `Foo` is a variant name from an adt with 1 variant
77 subpatterns: Vec<FieldPattern<'tcx>>,
80 /// box P, &P, &mut P, etc
82 subpattern: Pattern<'tcx>,
86 value: ConstVal<'tcx>,
95 /// matches against a slice, checking the length and extracting elements
97 prefix: Vec<Pattern<'tcx>>,
98 slice: Option<Pattern<'tcx>>,
99 suffix: Vec<Pattern<'tcx>>,
102 /// fixed match against an array, irrefutable
104 prefix: Vec<Pattern<'tcx>>,
105 slice: Option<Pattern<'tcx>>,
106 suffix: Vec<Pattern<'tcx>>,
110 fn print_const_val(value: &ConstVal, f: &mut fmt::Formatter) -> fmt::Result {
112 ConstVal::Float(ref x) => write!(f, "{}", x),
113 ConstVal::Integral(ref i) => write!(f, "{}", i),
114 ConstVal::Str(ref s) => write!(f, "{:?}", &s[..]),
115 ConstVal::ByteStr(ref b) => write!(f, "{:?}", &b[..]),
116 ConstVal::Bool(b) => write!(f, "{:?}", b),
117 ConstVal::Char(c) => write!(f, "{:?}", c),
118 ConstVal::Variant(_) |
119 ConstVal::Struct(_) |
121 ConstVal::Function(..) |
122 ConstVal::Array(..) |
123 ConstVal::Repeat(..) => bug!("{:?} not printable in a pattern", value)
127 impl<'tcx> fmt::Display for Pattern<'tcx> {
128 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
130 PatternKind::Wild => write!(f, "_"),
131 PatternKind::Binding { mutability, name, mode, ref subpattern, .. } => {
132 let is_mut = match mode {
133 BindingMode::ByValue => mutability == Mutability::Mut,
134 BindingMode::ByRef(_, bk) => {
136 bk == BorrowKind::Mut
142 write!(f, "{}", name)?;
143 if let Some(ref subpattern) = *subpattern {
144 write!(f, " @ {}", subpattern)?;
148 PatternKind::Variant { ref subpatterns, .. } |
149 PatternKind::Leaf { ref subpatterns } => {
150 let variant = match *self.kind {
151 PatternKind::Variant { adt_def, variant_index, .. } => {
152 Some(&adt_def.variants[variant_index])
154 _ => if let ty::TyAdt(adt, _) = self.ty.sty {
155 if adt.is_univariant() {
156 Some(&adt.variants[0])
165 let mut first = true;
166 let mut start_or_continue = || if first { first = false; "" } else { ", " };
168 if let Some(variant) = variant {
169 write!(f, "{}", variant.name)?;
171 // Only for TyAdt we can have `S {...}`,
172 // which we handle separately here.
173 if variant.ctor_kind == CtorKind::Fictive {
177 for p in subpatterns {
178 if let PatternKind::Wild = *p.pattern.kind {
181 let name = variant.fields[p.field.index()].name;
182 write!(f, "{}{}: {}", start_or_continue(), name, p.pattern)?;
186 if printed < variant.fields.len() {
187 write!(f, "{}..", start_or_continue())?;
190 return write!(f, " }}");
194 let num_fields = variant.map_or(subpatterns.len(), |v| v.fields.len());
195 if num_fields != 0 || variant.is_none() {
197 for i in 0..num_fields {
198 write!(f, "{}", start_or_continue())?;
200 // Common case: the field is where we expect it.
201 if let Some(p) = subpatterns.get(i) {
202 if p.field.index() == i {
203 write!(f, "{}", p.pattern)?;
208 // Otherwise, we have to go looking for it.
209 if let Some(p) = subpatterns.iter().find(|p| p.field.index() == i) {
210 write!(f, "{}", p.pattern)?;
220 PatternKind::Deref { ref subpattern } => {
222 ty::TyAdt(def, _) if def.is_box() => write!(f, "box ")?,
223 ty::TyRef(_, mt) => {
225 if mt.mutbl == hir::MutMutable {
229 _ => bug!("{} is a bad Deref pattern type", self.ty)
231 write!(f, "{}", subpattern)
233 PatternKind::Constant { ref value } => {
234 print_const_val(value, f)
236 PatternKind::Range { ref lo, ref hi, ref end } => {
237 print_const_val(lo, f)?;
239 RangeEnd::Included => write!(f, "...")?,
240 RangeEnd::Excluded => write!(f, "..")?,
242 print_const_val(hi, f)
244 PatternKind::Slice { ref prefix, ref slice, ref suffix } |
245 PatternKind::Array { ref prefix, ref slice, ref suffix } => {
246 let mut first = true;
247 let mut start_or_continue = || if first { first = false; "" } else { ", " };
250 write!(f, "{}{}", start_or_continue(), p)?;
252 if let Some(ref slice) = *slice {
253 write!(f, "{}", start_or_continue())?;
255 PatternKind::Wild => {}
256 _ => write!(f, "{}", slice)?
261 write!(f, "{}{}", start_or_continue(), p)?;
269 pub struct PatternContext<'a, 'tcx: 'a> {
270 pub tcx: TyCtxt<'a, 'tcx, 'tcx>,
271 pub param_env: ty::ParamEnv<'tcx>,
272 pub tables: &'a ty::TypeckTables<'tcx>,
273 pub substs: &'tcx Substs<'tcx>,
274 pub errors: Vec<PatternError<'tcx>>,
277 impl<'a, 'tcx> Pattern<'tcx> {
278 pub fn from_hir(tcx: TyCtxt<'a, 'tcx, 'tcx>,
279 param_env_and_substs: ty::ParamEnvAnd<'tcx, &'tcx Substs<'tcx>>,
280 tables: &'a ty::TypeckTables<'tcx>,
281 pat: &hir::Pat) -> Self {
282 let mut pcx = PatternContext::new(tcx, param_env_and_substs, tables);
283 let result = pcx.lower_pattern(pat);
284 if !pcx.errors.is_empty() {
285 span_bug!(pat.span, "encountered errors lowering pattern: {:?}", pcx.errors)
287 debug!("Pattern::from_hir({:?}) = {:?}", pat, result);
292 impl<'a, 'tcx> PatternContext<'a, 'tcx> {
293 pub fn new(tcx: TyCtxt<'a, 'tcx, 'tcx>,
294 param_env_and_substs: ty::ParamEnvAnd<'tcx, &'tcx Substs<'tcx>>,
295 tables: &'a ty::TypeckTables<'tcx>) -> Self {
298 param_env: param_env_and_substs.param_env,
300 substs: param_env_and_substs.value,
305 pub fn lower_pattern(&mut self, pat: &hir::Pat) -> Pattern<'tcx> {
306 let mut ty = self.tables.node_id_to_type(pat.id);
308 let kind = match pat.node {
309 PatKind::Wild => PatternKind::Wild,
311 PatKind::Lit(ref value) => self.lower_lit(value),
313 PatKind::Range(ref lo, ref hi, ref end) => {
314 match (self.lower_lit(lo), self.lower_lit(hi)) {
315 (PatternKind::Constant { value: lo },
316 PatternKind::Constant { value: hi }) => {
317 PatternKind::Range { lo: lo, hi: hi, end: end.clone() }
319 _ => PatternKind::Wild
323 PatKind::Path(ref qpath) => {
324 return self.lower_path(qpath, pat.id, pat.id, pat.span);
327 PatKind::Ref(ref subpattern, _) |
328 PatKind::Box(ref subpattern) => {
329 PatternKind::Deref { subpattern: self.lower_pattern(subpattern) }
332 PatKind::Slice(ref prefix, ref slice, ref suffix) => {
333 let ty = self.tables.node_id_to_type(pat.id);
337 subpattern: Pattern {
340 kind: Box::new(self.slice_or_array_pattern(
341 pat.span, mt.ty, prefix, slice, suffix))
347 self.slice_or_array_pattern(pat.span, ty, prefix, slice, suffix),
352 "unexpanded type for vector pattern: {:?}",
357 PatKind::Tuple(ref subpatterns, ddpos) => {
358 let ty = self.tables.node_id_to_type(pat.id);
360 ty::TyTuple(ref tys, _) => {
363 .enumerate_and_adjust(tys.len(), ddpos)
364 .map(|(i, subpattern)| FieldPattern {
365 field: Field::new(i),
366 pattern: self.lower_pattern(subpattern)
370 PatternKind::Leaf { subpatterns: subpatterns }
373 ref sty => span_bug!(pat.span, "unexpected type for tuple pattern: {:?}", sty),
377 PatKind::Binding(bm, def_id, ref ident, ref sub) => {
378 let id = self.tcx.hir.as_local_node_id(def_id).unwrap();
379 let var_ty = self.tables.node_id_to_type(pat.id);
380 let region = match var_ty.sty {
381 ty::TyRef(r, _) => Some(r),
384 let (mutability, mode) = match bm {
385 hir::BindByValue(hir::MutMutable) =>
386 (Mutability::Mut, BindingMode::ByValue),
387 hir::BindByValue(hir::MutImmutable) =>
388 (Mutability::Not, BindingMode::ByValue),
389 hir::BindByRef(hir::MutMutable) =>
390 (Mutability::Not, BindingMode::ByRef(region.unwrap(), BorrowKind::Mut)),
391 hir::BindByRef(hir::MutImmutable) =>
392 (Mutability::Not, BindingMode::ByRef(region.unwrap(), BorrowKind::Shared)),
395 // A ref x pattern is the same node used for x, and as such it has
396 // x's type, which is &T, where we want T (the type being matched).
397 if let hir::BindByRef(_) = bm {
398 if let ty::TyRef(_, mt) = ty.sty {
401 bug!("`ref {}` has wrong type {}", ident.node, ty);
405 PatternKind::Binding {
406 mutability: mutability,
411 subpattern: self.lower_opt_pattern(sub),
415 PatKind::TupleStruct(ref qpath, ref subpatterns, ddpos) => {
416 let def = self.tables.qpath_def(qpath, pat.id);
417 let adt_def = match ty.sty {
418 ty::TyAdt(adt_def, _) => adt_def,
419 _ => span_bug!(pat.span, "tuple struct pattern not applied to an ADT"),
421 let variant_def = adt_def.variant_of_def(def);
425 .enumerate_and_adjust(variant_def.fields.len(), ddpos)
426 .map(|(i, field)| FieldPattern {
427 field: Field::new(i),
428 pattern: self.lower_pattern(field),
431 self.lower_variant_or_leaf(def, ty, subpatterns)
434 PatKind::Struct(ref qpath, ref fields, _) => {
435 let def = self.tables.qpath_def(qpath, pat.id);
436 let adt_def = match ty.sty {
437 ty::TyAdt(adt_def, _) => adt_def,
441 "struct pattern not applied to an ADT");
444 let variant_def = adt_def.variant_of_def(def);
449 let index = variant_def.index_of_field_named(field.node.name);
450 let index = index.unwrap_or_else(|| {
453 "no field with name {:?}",
457 field: Field::new(index),
458 pattern: self.lower_pattern(&field.node.pat),
463 self.lower_variant_or_leaf(def, ty, subpatterns)
470 kind: Box::new(kind),
474 fn lower_patterns(&mut self, pats: &[P<hir::Pat>]) -> Vec<Pattern<'tcx>> {
475 pats.iter().map(|p| self.lower_pattern(p)).collect()
478 fn lower_opt_pattern(&mut self, pat: &Option<P<hir::Pat>>) -> Option<Pattern<'tcx>>
480 pat.as_ref().map(|p| self.lower_pattern(p))
483 fn flatten_nested_slice_patterns(
485 prefix: Vec<Pattern<'tcx>>,
486 slice: Option<Pattern<'tcx>>,
487 suffix: Vec<Pattern<'tcx>>)
488 -> (Vec<Pattern<'tcx>>, Option<Pattern<'tcx>>, Vec<Pattern<'tcx>>)
490 let orig_slice = match slice {
491 Some(orig_slice) => orig_slice,
492 None => return (prefix, slice, suffix)
494 let orig_prefix = prefix;
495 let orig_suffix = suffix;
497 // dance because of intentional borrow-checker stupidity.
498 let kind = *orig_slice.kind;
500 PatternKind::Slice { prefix, slice, mut suffix } |
501 PatternKind::Array { prefix, slice, mut suffix } => {
502 let mut orig_prefix = orig_prefix;
504 orig_prefix.extend(prefix);
505 suffix.extend(orig_suffix);
507 (orig_prefix, slice, suffix)
510 (orig_prefix, Some(Pattern {
511 kind: box kind, ..orig_slice
517 fn slice_or_array_pattern(
521 prefix: &[P<hir::Pat>],
522 slice: &Option<P<hir::Pat>>,
523 suffix: &[P<hir::Pat>])
526 let prefix = self.lower_patterns(prefix);
527 let slice = self.lower_opt_pattern(slice);
528 let suffix = self.lower_patterns(suffix);
529 let (prefix, slice, suffix) =
530 self.flatten_nested_slice_patterns(prefix, slice, suffix);
534 // matching a slice or fixed-length array
535 PatternKind::Slice { prefix: prefix, slice: slice, suffix: suffix }
538 ty::TyArray(_, len) => {
539 // fixed-length array
540 assert!(len >= prefix.len() + suffix.len());
541 PatternKind::Array { prefix: prefix, slice: slice, suffix: suffix }
545 span_bug!(span, "bad slice pattern type {:?}", ty);
550 fn lower_variant_or_leaf(
554 subpatterns: Vec<FieldPattern<'tcx>>)
558 Def::Variant(variant_id) | Def::VariantCtor(variant_id, ..) => {
559 let enum_id = self.tcx.parent_def_id(variant_id).unwrap();
560 let adt_def = self.tcx.adt_def(enum_id);
561 if adt_def.variants.len() > 1 {
562 let substs = match ty.sty {
563 ty::TyAdt(_, substs) |
564 ty::TyFnDef(_, substs) => substs,
565 _ => bug!("inappropriate type for def: {:?}", ty.sty),
567 PatternKind::Variant {
570 variant_index: adt_def.variant_index_with_id(variant_id),
571 subpatterns: subpatterns,
574 PatternKind::Leaf { subpatterns: subpatterns }
578 Def::Struct(..) | Def::StructCtor(..) | Def::Union(..) |
579 Def::TyAlias(..) | Def::AssociatedTy(..) | Def::SelfTy(..) => {
580 PatternKind::Leaf { subpatterns: subpatterns }
587 fn lower_path(&mut self,
593 let ty = self.tables.node_id_to_type(id);
594 let def = self.tables.qpath_def(qpath, id);
595 let kind = match def {
596 Def::Const(def_id) | Def::AssociatedConst(def_id) => {
597 let substs = self.tables.node_substs(id);
598 match eval::lookup_const_by_id(self.tcx, self.param_env.and((def_id, substs))) {
599 Some((def_id, substs)) => {
600 // Enter the inlined constant's tables&substs temporarily.
601 let old_tables = self.tables;
602 let old_substs = self.substs;
603 self.tables = self.tcx.typeck_tables_of(def_id);
604 self.substs = substs;
605 let body = if let Some(id) = self.tcx.hir.as_local_node_id(def_id) {
606 self.tcx.hir.body(self.tcx.hir.body_owned_by(id))
608 self.tcx.sess.cstore.item_body(self.tcx, def_id)
610 let pat = self.lower_const_expr(&body.value, pat_id, span);
611 self.tables = old_tables;
612 self.substs = old_substs;
616 self.errors.push(PatternError::StaticInPattern(span));
621 _ => self.lower_variant_or_leaf(def, ty, vec![]),
627 kind: Box::new(kind),
631 fn lower_lit(&mut self, expr: &hir::Expr) -> PatternKind<'tcx> {
632 let const_cx = eval::ConstContext::new(self.tcx,
633 self.param_env.and(self.substs),
635 match const_cx.eval(expr) {
637 if let ConstVal::Variant(def_id) = value {
638 let ty = self.tables.expr_ty(expr);
639 self.lower_variant_or_leaf(Def::Variant(def_id), ty, vec![])
641 PatternKind::Constant { value: value }
645 self.errors.push(PatternError::ConstEval(e));
651 fn lower_const_expr(&mut self,
656 let pat_ty = self.tables.expr_ty(expr);
657 debug!("expr={:?} pat_ty={:?} pat_id={}", expr, pat_ty, pat_id);
660 self.tcx.sess.span_err(span, "floating point constants cannot be used in patterns");
662 ty::TyAdt(adt_def, _) if adt_def.is_union() => {
663 // Matching on union fields is unsafe, we can't hide it in constants
664 self.tcx.sess.span_err(span, "cannot use unions in constant patterns");
666 ty::TyAdt(adt_def, _) => {
667 if !self.tcx.has_attr(adt_def.did, "structural_match") {
668 let msg = format!("to use a constant of type `{}` in a pattern, \
669 `{}` must be annotated with `#[derive(PartialEq, Eq)]`",
670 self.tcx.item_path_str(adt_def.did),
671 self.tcx.item_path_str(adt_def.did));
672 self.tcx.sess.span_err(span, &msg);
677 let kind = match expr.node {
678 hir::ExprTup(ref exprs) => {
680 subpatterns: exprs.iter().enumerate().map(|(i, expr)| {
682 field: Field::new(i),
683 pattern: self.lower_const_expr(expr, pat_id, span)
689 hir::ExprCall(ref callee, ref args) => {
690 let qpath = match callee.node {
691 hir::ExprPath(ref qpath) => qpath,
694 let ty = self.tables.node_id_to_type(callee.id);
695 let def = self.tables.qpath_def(qpath, callee.id);
697 Def::Fn(..) | Def::Method(..) => self.lower_lit(expr),
699 let subpatterns = args.iter().enumerate().map(|(i, expr)| {
701 field: Field::new(i),
702 pattern: self.lower_const_expr(expr, pat_id, span)
705 self.lower_variant_or_leaf(def, ty, subpatterns)
710 hir::ExprStruct(ref qpath, ref fields, None) => {
711 let def = self.tables.qpath_def(qpath, expr.id);
712 let adt_def = match pat_ty.sty {
713 ty::TyAdt(adt_def, _) => adt_def,
717 "struct expr without ADT type");
720 let variant_def = adt_def.variant_of_def(def);
725 let index = variant_def.index_of_field_named(field.name.node);
726 let index = index.unwrap_or_else(|| {
729 "no field with name {:?}",
733 field: Field::new(index),
734 pattern: self.lower_const_expr(&field.expr, pat_id, span),
739 self.lower_variant_or_leaf(def, pat_ty, subpatterns)
742 hir::ExprArray(ref exprs) => {
743 let pats = exprs.iter()
744 .map(|expr| self.lower_const_expr(expr, pat_id, span))
753 hir::ExprPath(ref qpath) => {
754 return self.lower_path(qpath, expr.id, pat_id, span);
757 _ => self.lower_lit(expr)
763 kind: Box::new(kind),
768 pub trait PatternFoldable<'tcx> : Sized {
769 fn fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
770 self.super_fold_with(folder)
773 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self;
776 pub trait PatternFolder<'tcx> : Sized {
777 fn fold_pattern(&mut self, pattern: &Pattern<'tcx>) -> Pattern<'tcx> {
778 pattern.super_fold_with(self)
781 fn fold_pattern_kind(&mut self, kind: &PatternKind<'tcx>) -> PatternKind<'tcx> {
782 kind.super_fold_with(self)
787 impl<'tcx, T: PatternFoldable<'tcx>> PatternFoldable<'tcx> for Box<T> {
788 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
789 let content: T = (**self).fold_with(folder);
794 impl<'tcx, T: PatternFoldable<'tcx>> PatternFoldable<'tcx> for Vec<T> {
795 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
796 self.iter().map(|t| t.fold_with(folder)).collect()
800 impl<'tcx, T: PatternFoldable<'tcx>> PatternFoldable<'tcx> for Option<T> {
801 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self{
802 self.as_ref().map(|t| t.fold_with(folder))
806 macro_rules! CloneImpls {
807 (<$lt_tcx:tt> $($ty:ty),+) => {
809 impl<$lt_tcx> PatternFoldable<$lt_tcx> for $ty {
810 fn super_fold_with<F: PatternFolder<$lt_tcx>>(&self, _: &mut F) -> Self {
819 Span, Field, Mutability, ast::Name, ast::NodeId, usize, ConstVal<'tcx>, Region<'tcx>,
820 Ty<'tcx>, BindingMode<'tcx>, &'tcx AdtDef,
821 &'tcx Substs<'tcx>, &'tcx Kind<'tcx>
824 impl<'tcx> PatternFoldable<'tcx> for FieldPattern<'tcx> {
825 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
827 field: self.field.fold_with(folder),
828 pattern: self.pattern.fold_with(folder)
833 impl<'tcx> PatternFoldable<'tcx> for Pattern<'tcx> {
834 fn fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
835 folder.fold_pattern(self)
838 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
840 ty: self.ty.fold_with(folder),
841 span: self.span.fold_with(folder),
842 kind: self.kind.fold_with(folder)
847 impl<'tcx> PatternFoldable<'tcx> for PatternKind<'tcx> {
848 fn fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
849 folder.fold_pattern_kind(self)
852 fn super_fold_with<F: PatternFolder<'tcx>>(&self, folder: &mut F) -> Self {
854 PatternKind::Wild => PatternKind::Wild,
855 PatternKind::Binding {
862 } => PatternKind::Binding {
863 mutability: mutability.fold_with(folder),
864 name: name.fold_with(folder),
865 mode: mode.fold_with(folder),
866 var: var.fold_with(folder),
867 ty: ty.fold_with(folder),
868 subpattern: subpattern.fold_with(folder),
870 PatternKind::Variant {
875 } => PatternKind::Variant {
876 adt_def: adt_def.fold_with(folder),
877 substs: substs.fold_with(folder),
878 variant_index: variant_index.fold_with(folder),
879 subpatterns: subpatterns.fold_with(folder)
883 } => PatternKind::Leaf {
884 subpatterns: subpatterns.fold_with(folder),
888 } => PatternKind::Deref {
889 subpattern: subpattern.fold_with(folder),
891 PatternKind::Constant {
893 } => PatternKind::Constant {
894 value: value.fold_with(folder)
900 } => PatternKind::Range {
901 lo: lo.fold_with(folder),
902 hi: hi.fold_with(folder),
909 } => PatternKind::Slice {
910 prefix: prefix.fold_with(folder),
911 slice: slice.fold_with(folder),
912 suffix: suffix.fold_with(folder)
918 } => PatternKind::Array {
919 prefix: prefix.fold_with(folder),
920 slice: slice.fold_with(folder),
921 suffix: suffix.fold_with(folder)