2023-01-05 03:02:10 +00:00
|
|
|
error[E0061]: this method takes 0 arguments but 1 argument was supplied
|
2020-02-06 05:08:07 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:13:7
|
2017-10-09 01:13:37 +00:00
|
|
|
|
|
2019-03-09 12:03:44 +00:00
|
|
|
LL | x.zero(0)
|
2023-02-01 17:44:48 +00:00
|
|
|
| ^^^^ -
|
|
|
|
|
| |
|
|
|
|
|
| unexpected argument of type `{integer}`
|
|
|
|
|
| help: remove the extra argument
|
2020-09-24 02:43:32 +00:00
|
|
|
|
|
2023-02-21 21:11:08 +00:00
|
|
|
note: method defined here
|
2020-09-24 02:43:32 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:5:8
|
|
|
|
|
|
|
|
|
|
|
LL | fn zero(self) -> Foo { self }
|
2022-07-23 17:17:19 +00:00
|
|
|
| ^^^^
|
2017-10-09 01:13:37 +00:00
|
|
|
|
2023-01-05 03:02:10 +00:00
|
|
|
error[E0061]: this method takes 1 argument but 0 arguments were supplied
|
2020-02-06 05:08:07 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:14:7
|
2017-10-09 01:13:37 +00:00
|
|
|
|
|
2019-03-09 12:03:44 +00:00
|
|
|
LL | .one()
|
Implementation for 65853
This attempts to bring better error messages to invalid method calls, by applying some heuristics to identify common mistakes.
The algorithm is inspired by Levenshtein distance and longest common sub-sequence. In essence, we treat the types of the function, and the types of the arguments you provided as two "words" and compute the edits to get from one to the other.
We then modify that algorithm to detect 4 cases:
- A function input is missing
- An extra argument was provided
- The type of an argument is straight up invalid
- Two arguments have been swapped
- A subset of the arguments have been shuffled
(We detect the last two as separate cases so that we can detect two swaps, instead of 4 parameters permuted.)
It helps to understand this argument by paying special attention to terminology: "inputs" refers to the inputs being *expected* by the function, and "arguments" refers to what has been provided at the call site.
The basic sketch of the algorithm is as follows:
- Construct a boolean grid, with a row for each argument, and a column for each input. The cell [i, j] is true if the i'th argument could satisfy the j'th input.
- If we find an argument that could satisfy no inputs, provided for an input that can't be satisfied by any other argument, we consider this an "invalid type".
- Extra arguments are those that can't satisfy any input, provided for an input that *could* be satisfied by another argument.
- Missing inputs are inputs that can't be satisfied by any argument, where the provided argument could satisfy another input
- Swapped / Permuted arguments are identified with a cycle detection algorithm.
As each issue is found, we remove the relevant inputs / arguments and check for more issues. If we find no issues, we match up any "valid" arguments, and start again.
Note that there's a lot of extra complexity:
- We try to stay efficient on the happy path, only computing the diagonal until we find a problem, and then filling in the rest of the matrix.
- Closure arguments are wrapped in a tuple and need to be unwrapped
- We need to resolve closure types after the rest, to allow the most specific type constraints
- We need to handle imported C functions that might be variadic in their inputs.
I tried to document a lot of this in comments in the code and keep the naming clear.
2022-01-22 04:50:54 +00:00
|
|
|
| ^^^-- an argument of type `isize` is missing
|
2020-09-24 02:43:32 +00:00
|
|
|
|
|
2023-02-21 21:11:08 +00:00
|
|
|
note: method defined here
|
2020-09-24 02:43:32 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:6:8
|
|
|
|
|
|
|
|
|
|
|
LL | fn one(self, _: isize) -> Foo { self }
|
2022-07-23 17:17:19 +00:00
|
|
|
| ^^^ --------
|
Implementation for 65853
This attempts to bring better error messages to invalid method calls, by applying some heuristics to identify common mistakes.
The algorithm is inspired by Levenshtein distance and longest common sub-sequence. In essence, we treat the types of the function, and the types of the arguments you provided as two "words" and compute the edits to get from one to the other.
We then modify that algorithm to detect 4 cases:
- A function input is missing
- An extra argument was provided
- The type of an argument is straight up invalid
- Two arguments have been swapped
- A subset of the arguments have been shuffled
(We detect the last two as separate cases so that we can detect two swaps, instead of 4 parameters permuted.)
It helps to understand this argument by paying special attention to terminology: "inputs" refers to the inputs being *expected* by the function, and "arguments" refers to what has been provided at the call site.
The basic sketch of the algorithm is as follows:
- Construct a boolean grid, with a row for each argument, and a column for each input. The cell [i, j] is true if the i'th argument could satisfy the j'th input.
- If we find an argument that could satisfy no inputs, provided for an input that can't be satisfied by any other argument, we consider this an "invalid type".
- Extra arguments are those that can't satisfy any input, provided for an input that *could* be satisfied by another argument.
- Missing inputs are inputs that can't be satisfied by any argument, where the provided argument could satisfy another input
- Swapped / Permuted arguments are identified with a cycle detection algorithm.
As each issue is found, we remove the relevant inputs / arguments and check for more issues. If we find no issues, we match up any "valid" arguments, and start again.
Note that there's a lot of extra complexity:
- We try to stay efficient on the happy path, only computing the diagonal until we find a problem, and then filling in the rest of the matrix.
- Closure arguments are wrapped in a tuple and need to be unwrapped
- We need to resolve closure types after the rest, to allow the most specific type constraints
- We need to handle imported C functions that might be variadic in their inputs.
I tried to document a lot of this in comments in the code and keep the naming clear.
2022-01-22 04:50:54 +00:00
|
|
|
help: provide the argument
|
|
|
|
|
|
|
2022-06-19 22:10:42 +00:00
|
|
|
LL | .one(/* isize */)
|
2022-09-02 02:17:44 +00:00
|
|
|
| ~~~~~~~~~~~~~
|
2017-10-09 01:13:37 +00:00
|
|
|
|
2023-01-05 03:02:10 +00:00
|
|
|
error[E0061]: this method takes 2 arguments but 1 argument was supplied
|
2020-02-06 05:08:07 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:15:7
|
2017-10-09 01:13:37 +00:00
|
|
|
|
|
2019-03-09 12:03:44 +00:00
|
|
|
LL | .two(0);
|
Implementation for 65853
This attempts to bring better error messages to invalid method calls, by applying some heuristics to identify common mistakes.
The algorithm is inspired by Levenshtein distance and longest common sub-sequence. In essence, we treat the types of the function, and the types of the arguments you provided as two "words" and compute the edits to get from one to the other.
We then modify that algorithm to detect 4 cases:
- A function input is missing
- An extra argument was provided
- The type of an argument is straight up invalid
- Two arguments have been swapped
- A subset of the arguments have been shuffled
(We detect the last two as separate cases so that we can detect two swaps, instead of 4 parameters permuted.)
It helps to understand this argument by paying special attention to terminology: "inputs" refers to the inputs being *expected* by the function, and "arguments" refers to what has been provided at the call site.
The basic sketch of the algorithm is as follows:
- Construct a boolean grid, with a row for each argument, and a column for each input. The cell [i, j] is true if the i'th argument could satisfy the j'th input.
- If we find an argument that could satisfy no inputs, provided for an input that can't be satisfied by any other argument, we consider this an "invalid type".
- Extra arguments are those that can't satisfy any input, provided for an input that *could* be satisfied by another argument.
- Missing inputs are inputs that can't be satisfied by any argument, where the provided argument could satisfy another input
- Swapped / Permuted arguments are identified with a cycle detection algorithm.
As each issue is found, we remove the relevant inputs / arguments and check for more issues. If we find no issues, we match up any "valid" arguments, and start again.
Note that there's a lot of extra complexity:
- We try to stay efficient on the happy path, only computing the diagonal until we find a problem, and then filling in the rest of the matrix.
- Closure arguments are wrapped in a tuple and need to be unwrapped
- We need to resolve closure types after the rest, to allow the most specific type constraints
- We need to handle imported C functions that might be variadic in their inputs.
I tried to document a lot of this in comments in the code and keep the naming clear.
2022-01-22 04:50:54 +00:00
|
|
|
| ^^^--- an argument of type `isize` is missing
|
2020-09-24 02:43:32 +00:00
|
|
|
|
|
2023-02-21 21:11:08 +00:00
|
|
|
note: method defined here
|
2020-09-24 02:43:32 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:7:8
|
|
|
|
|
|
|
|
|
|
|
LL | fn two(self, _: isize, _: isize) -> Foo { self }
|
2022-07-23 17:17:19 +00:00
|
|
|
| ^^^ -------- --------
|
Implementation for 65853
This attempts to bring better error messages to invalid method calls, by applying some heuristics to identify common mistakes.
The algorithm is inspired by Levenshtein distance and longest common sub-sequence. In essence, we treat the types of the function, and the types of the arguments you provided as two "words" and compute the edits to get from one to the other.
We then modify that algorithm to detect 4 cases:
- A function input is missing
- An extra argument was provided
- The type of an argument is straight up invalid
- Two arguments have been swapped
- A subset of the arguments have been shuffled
(We detect the last two as separate cases so that we can detect two swaps, instead of 4 parameters permuted.)
It helps to understand this argument by paying special attention to terminology: "inputs" refers to the inputs being *expected* by the function, and "arguments" refers to what has been provided at the call site.
The basic sketch of the algorithm is as follows:
- Construct a boolean grid, with a row for each argument, and a column for each input. The cell [i, j] is true if the i'th argument could satisfy the j'th input.
- If we find an argument that could satisfy no inputs, provided for an input that can't be satisfied by any other argument, we consider this an "invalid type".
- Extra arguments are those that can't satisfy any input, provided for an input that *could* be satisfied by another argument.
- Missing inputs are inputs that can't be satisfied by any argument, where the provided argument could satisfy another input
- Swapped / Permuted arguments are identified with a cycle detection algorithm.
As each issue is found, we remove the relevant inputs / arguments and check for more issues. If we find no issues, we match up any "valid" arguments, and start again.
Note that there's a lot of extra complexity:
- We try to stay efficient on the happy path, only computing the diagonal until we find a problem, and then filling in the rest of the matrix.
- Closure arguments are wrapped in a tuple and need to be unwrapped
- We need to resolve closure types after the rest, to allow the most specific type constraints
- We need to handle imported C functions that might be variadic in their inputs.
I tried to document a lot of this in comments in the code and keep the naming clear.
2022-01-22 04:50:54 +00:00
|
|
|
help: provide the argument
|
|
|
|
|
|
|
2022-06-19 22:10:42 +00:00
|
|
|
LL | .two(0, /* isize */);
|
2022-09-02 02:17:44 +00:00
|
|
|
| ~~~~~~~~~~~~~~~~
|
2017-10-09 01:13:37 +00:00
|
|
|
|
2022-03-08 18:04:20 +00:00
|
|
|
error[E0599]: `Foo` is not an iterator
|
2020-02-06 05:08:07 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:19:7
|
2017-10-09 01:13:37 +00:00
|
|
|
|
|
2023-03-01 14:32:46 +00:00
|
|
|
LL | pub struct Foo;
|
2024-01-26 20:44:43 +00:00
|
|
|
| -------------- method `take` not found for this struct because it doesn't satisfy `Foo: Iterator`
|
2017-11-16 06:18:52 +00:00
|
|
|
...
|
2023-03-01 14:32:46 +00:00
|
|
|
LL | / y.zero()
|
|
|
|
|
LL | | .take()
|
|
|
|
|
| | -^^^^ `Foo` is not an iterator
|
|
|
|
|
| |______|
|
2024-04-25 10:17:29 +00:00
|
|
|
|
|
2017-10-09 01:13:37 +00:00
|
|
|
|
|
2020-09-26 21:20:14 +00:00
|
|
|
= note: the following trait bounds were not satisfied:
|
2020-09-02 07:40:56 +00:00
|
|
|
`Foo: Iterator`
|
|
|
|
|
which is required by `&mut Foo: Iterator`
|
2022-12-12 11:55:46 +00:00
|
|
|
note: the trait `Iterator` must be implemented
|
2021-09-28 14:48:54 +00:00
|
|
|
--> $SRC_DIR/core/src/iter/traits/iterator.rs:LL:COL
|
2017-10-09 01:13:37 +00:00
|
|
|
= help: items from traits can only be used if the trait is implemented and in scope
|
2024-01-30 18:10:12 +00:00
|
|
|
= note: the following traits define an item `take`, perhaps you need to implement one of them:
|
2024-03-21 17:00:11 +00:00
|
|
|
candidate #1: `Iterator`
|
|
|
|
|
candidate #2: `std::io::Read`
|
2017-10-09 01:13:37 +00:00
|
|
|
|
2023-01-05 03:02:10 +00:00
|
|
|
error[E0061]: this method takes 3 arguments but 0 arguments were supplied
|
2020-02-06 05:08:07 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:21:7
|
|
|
|
|
|
|
|
|
|
|
LL | y.three::<usize>();
|
Implementation for 65853
This attempts to bring better error messages to invalid method calls, by applying some heuristics to identify common mistakes.
The algorithm is inspired by Levenshtein distance and longest common sub-sequence. In essence, we treat the types of the function, and the types of the arguments you provided as two "words" and compute the edits to get from one to the other.
We then modify that algorithm to detect 4 cases:
- A function input is missing
- An extra argument was provided
- The type of an argument is straight up invalid
- Two arguments have been swapped
- A subset of the arguments have been shuffled
(We detect the last two as separate cases so that we can detect two swaps, instead of 4 parameters permuted.)
It helps to understand this argument by paying special attention to terminology: "inputs" refers to the inputs being *expected* by the function, and "arguments" refers to what has been provided at the call site.
The basic sketch of the algorithm is as follows:
- Construct a boolean grid, with a row for each argument, and a column for each input. The cell [i, j] is true if the i'th argument could satisfy the j'th input.
- If we find an argument that could satisfy no inputs, provided for an input that can't be satisfied by any other argument, we consider this an "invalid type".
- Extra arguments are those that can't satisfy any input, provided for an input that *could* be satisfied by another argument.
- Missing inputs are inputs that can't be satisfied by any argument, where the provided argument could satisfy another input
- Swapped / Permuted arguments are identified with a cycle detection algorithm.
As each issue is found, we remove the relevant inputs / arguments and check for more issues. If we find no issues, we match up any "valid" arguments, and start again.
Note that there's a lot of extra complexity:
- We try to stay efficient on the happy path, only computing the diagonal until we find a problem, and then filling in the rest of the matrix.
- Closure arguments are wrapped in a tuple and need to be unwrapped
- We need to resolve closure types after the rest, to allow the most specific type constraints
- We need to handle imported C functions that might be variadic in their inputs.
I tried to document a lot of this in comments in the code and keep the naming clear.
2022-01-22 04:50:54 +00:00
|
|
|
| ^^^^^^^^^^^^^^-- three arguments of type `usize`, `usize`, and `usize` are missing
|
2020-09-24 02:43:32 +00:00
|
|
|
|
|
2023-02-21 21:11:08 +00:00
|
|
|
note: method defined here
|
2020-09-24 02:43:32 +00:00
|
|
|
--> $DIR/method-call-err-msg.rs:8:8
|
|
|
|
|
|
|
|
|
|
|
LL | fn three<T>(self, _: T, _: T, _: T) -> Foo { self }
|
2022-07-23 17:17:19 +00:00
|
|
|
| ^^^^^ ---- ---- ----
|
Implementation for 65853
This attempts to bring better error messages to invalid method calls, by applying some heuristics to identify common mistakes.
The algorithm is inspired by Levenshtein distance and longest common sub-sequence. In essence, we treat the types of the function, and the types of the arguments you provided as two "words" and compute the edits to get from one to the other.
We then modify that algorithm to detect 4 cases:
- A function input is missing
- An extra argument was provided
- The type of an argument is straight up invalid
- Two arguments have been swapped
- A subset of the arguments have been shuffled
(We detect the last two as separate cases so that we can detect two swaps, instead of 4 parameters permuted.)
It helps to understand this argument by paying special attention to terminology: "inputs" refers to the inputs being *expected* by the function, and "arguments" refers to what has been provided at the call site.
The basic sketch of the algorithm is as follows:
- Construct a boolean grid, with a row for each argument, and a column for each input. The cell [i, j] is true if the i'th argument could satisfy the j'th input.
- If we find an argument that could satisfy no inputs, provided for an input that can't be satisfied by any other argument, we consider this an "invalid type".
- Extra arguments are those that can't satisfy any input, provided for an input that *could* be satisfied by another argument.
- Missing inputs are inputs that can't be satisfied by any argument, where the provided argument could satisfy another input
- Swapped / Permuted arguments are identified with a cycle detection algorithm.
As each issue is found, we remove the relevant inputs / arguments and check for more issues. If we find no issues, we match up any "valid" arguments, and start again.
Note that there's a lot of extra complexity:
- We try to stay efficient on the happy path, only computing the diagonal until we find a problem, and then filling in the rest of the matrix.
- Closure arguments are wrapped in a tuple and need to be unwrapped
- We need to resolve closure types after the rest, to allow the most specific type constraints
- We need to handle imported C functions that might be variadic in their inputs.
I tried to document a lot of this in comments in the code and keep the naming clear.
2022-01-22 04:50:54 +00:00
|
|
|
help: provide the arguments
|
|
|
|
|
|
|
2022-06-19 22:10:42 +00:00
|
|
|
LL | y.three::<usize>(/* usize */, /* usize */, /* usize */);
|
2022-09-02 02:17:44 +00:00
|
|
|
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
2020-02-06 05:08:07 +00:00
|
|
|
|
|
|
|
|
error: aborting due to 5 previous errors
|
2017-10-09 01:13:37 +00:00
|
|
|
|
2019-04-17 17:26:38 +00:00
|
|
|
Some errors have detailed explanations: E0061, E0599.
|
2018-03-03 14:59:40 +00:00
|
|
|
For more information about an error, try `rustc --explain E0061`.
|