]>
Commit | Line | Data |
---|---|---|
f20569fa XL |
1 | fn reflow_list_node_with_rule(node: &CompoundNode, rule: &Rule, args: &[Arg], shape: &Shape) where T: FOo, U: Bar { |
2 | let mut effects = HashMap::new(); | |
3 | } | |
4 | ||
5 | fn reflow_list_node_with_rule(node: &CompoundNode, rule: &Rule, args: &[Arg], shape: &Shape) where T: FOo { | |
6 | let mut effects = HashMap::new(); | |
7 | } | |
8 | ||
9 | fn reflow_list_node_with_rule(node: &CompoundNode, rule: &Rule, args: &[Arg], shape: &Shape, shape: &Shape) where T: FOo, U: Bar { | |
10 | let mut effects = HashMap::new(); | |
11 | } | |
12 | ||
13 | fn reflow_list_node_with_rule(node: &CompoundNode, rule: &Rule, args: &[Arg], shape: &Shape, shape: &Shape) where T: FOo { | |
14 | let mut effects = HashMap::new(); | |
15 | } | |
16 | ||
17 | fn reflow_list_node_with_rule(node: &CompoundNode, rule: &Rule, args: &[Arg], shape: &Shape) -> Option<String> where T: FOo, U: Bar { | |
18 | let mut effects = HashMap::new(); | |
19 | } | |
20 | ||
21 | fn reflow_list_node_with_rule(node: &CompoundNode, rule: &Rule, args: &[Arg], shape: &Shape) -> Option<String> where T: FOo { | |
22 | let mut effects = HashMap::new(); | |
23 | } | |
24 | ||
25 | pub trait Test { | |
26 | fn very_long_method_name<F>(self, f: F) -> MyVeryLongReturnType where F: FnMut(Self::Item) -> bool; | |
27 | ||
28 | fn exactly_100_chars1<F>(self, f: F) -> MyVeryLongReturnType where F: FnMut(Self::Item) -> bool; | |
29 | } | |
30 | ||
31 | fn very_long_function_name<F>(very_long_argument: F) -> MyVeryLongReturnType where F: FnMut(Self::Item) -> bool { } | |
32 | ||
33 | struct VeryLongTupleStructName<A, B, C, D, E>(LongLongTypename, LongLongTypename, i32, i32) where A: LongTrait; | |
34 | ||
35 | struct Exactly100CharsToSemicolon<A, B, C, D, E> | |
36 | (LongLongTypename, i32, i32) | |
37 | where A: LongTrait1234; | |
38 | ||
39 | struct AlwaysOnNextLine<LongLongTypename, LongTypename, A, B, C, D, E, F> where A: LongTrait { | |
40 | x: i32 | |
41 | } | |
42 | ||
43 | pub trait SomeTrait<T> | |
44 | where | |
45 | T: Something + Sync + Send + Display + Debug + Copy + Hash + Debug + Display + Write + Read + FromStr | |
46 | { | |
47 | } | |
48 | ||
49 | // #2020 | |
50 | impl<'a, 'gcx, 'tcx> ProbeContext<'a, 'gcx, 'tcx> { | |
51 | fn elaborate_bounds<F>(&mut self, bounds: &[ty::PolyTraitRef<'tcx>], mut mk_cand: F) | |
52 | where F: for<'b> FnMut(&mut ProbeContext<'b, 'gcx, 'tcx>, ty::PolyTraitRef<'tcx>, ty::AssociatedItem), | |
53 | { | |
54 | // ... | |
55 | } | |
56 | } | |
57 | ||
58 | // #2497 | |
59 | fn handle_update<'a, Tab, Conn, R, C>(executor: &Executor<PooledConnection<ConnectionManager<Conn>>>, change_set: &'a C) -> ExecutionResult | |
60 | where &'a C: Identifiable + AsChangeset<Target = Tab> + HasTable<Table = Tab>, | |
61 | <&'a C as AsChangeset>::Changeset: QueryFragment<Conn::Backend>, | |
62 | Tab: Table + HasTable<Table = Tab>, | |
63 | Tab::PrimaryKey: EqAll<<&'a C as Identifiable>::Id>, | |
64 | Tab::FromClause: QueryFragment<Conn::Backend>, | |
65 | Tab: FindDsl<<&'a C as Identifiable>::Id>, | |
66 | Find<Tab, <&'a C as Identifiable>::Id>: IntoUpdateTarget<Table = Tab>, | |
67 | <Find<Tab, <&'a C as Identifiable>::Id> as IntoUpdateTarget>::WhereClause: QueryFragment<Conn::Backend>, | |
68 | Tab::Query: FilterDsl<<Tab::PrimaryKey as EqAll<<&'a C as Identifiable>::Id>>::Output>, | |
69 | Filter<Tab::Query, <Tab::PrimaryKey as EqAll<<&'a C as Identifiable>::Id>>::Output>: LimitDsl, | |
70 | Limit<Filter<Tab::Query, <Tab::PrimaryKey as EqAll<<&'a C as Identifiable>::Id>>::Output>>: QueryDsl + BoxedDsl< 'a, Conn::Backend, Output = BoxedSelectStatement<'a, R::SqlType, Tab, Conn::Backend>>, | |
71 | R: LoadingHandler<Conn, Table = Tab, SqlType = Tab::SqlType> + GraphQLType<TypeInfo = (), Context = ()>, { | |
72 | unimplemented!() | |
73 | } |