1 // rustfmt-normalize_comments: true
5 let square = (|i: i32| i * i);
11 b: WithType, // argument
13 _| (aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa, bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb);
15 let block_body = move |xxxxxxxxxxxxxxxxxxxxxxxxxxxxx,
16 ref yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy| {
17 xxxxxxxxxxxxxxxxxxxxxxxxxxxxx + yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy
20 let loooooooooooooong_name = |field| {
22 if field.node.attrs.len() > 0 {
23 field.node.attrs[0].span.lo
29 let unblock_me = |trivial| closure();
44 |big_argument_name, test123| looooooooooooooooooong_function_naaaaaaaaaaaaaaaaame();
47 |big_argument_name, test123| looooooooooooooooooong_function_naaaaaaaaaaaaaaaaame();
49 let simple_closure = move || -> () {};
51 let closure = |input: Ty| -> Option<String> { foo() };
53 let closure_with_return_type =
54 |aaaaaaaaaaaaaaaaaaaaaaarg1, aaaaaaaaaaaaaaaaaaaaaaarg2| -> Strong { "sup".to_owned() };
56 |arg1, arg2, _, _, arg3, arg4| {
57 let temp = arg4 + arg3;
63 let func = |x| println!("{}", x);
69 let closure = |x| match x {
76 let hash: &Fn(&&Block) -> u64 = &|block| -> u64 {
77 let mut h = SpanlessHash::new(cx);
82 let hash: &Fn(&&Block) -> u64 = &|block| -> u64 {
83 let mut h = SpanlessHash::new(cx);
89 impl<'a, 'tcx: 'a> SpanlessEq<'a, 'tcx> {
90 pub fn eq_expr(&self, left: &Expr, right: &Expr) -> bool {
91 match (&left.node, &right.node) {
92 (&ExprBinary(l_op, ref ll, ref lr), &ExprBinary(r_op, ref rl, ref rr)) => {
93 l_op.node == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr) ||
94 swap_binop(l_op.node, ll, lr).map_or(false, |(l_op, ll, lr)| {
95 l_op == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
103 lifetimes_iter___map(|lasdfasfd| {
104 let hi = if l.bounds.is_empty() {
111 open_raw_fd(fd, b'r').and_then(|file| {
112 Capture::new_raw(None, |_, err| unsafe { raw::pcap_fopen_offline(file, err) })
117 let vertex_buffer = frame.scope(|ctx| {
118 let buffer = ctx.create_host_visible_buffer::<VertexBuffer<Vertex>>(&vertices);
119 ctx.create_device_local_buffer(buffer)