Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update po4a.conf and regenerate .po files. #12005

Merged
merged 1 commit into from
Feb 3, 2014
Merged

Update po4a.conf and regenerate .po files. #12005

merged 1 commit into from
Feb 3, 2014

Conversation

omasanori
Copy link
Contributor

Also, I've corrected src/doc/README.md in line with this change.

Also, I've corrected src/doc/README.md in line with this change.

Signed-off-by: OGINO Masanori <masanori.ogino@gmail.com>
bors added a commit that referenced this pull request Feb 3, 2014
Also, I've corrected src/doc/README.md in line with this change.
@bors bors closed this Feb 3, 2014
@bors bors merged commit f72a2c7 into rust-lang:master Feb 3, 2014
@omasanori omasanori deleted the update-trans branch February 4, 2014 06:20
flip1995 pushed a commit to flip1995/rust that referenced this pull request Jan 25, 2024
`unused_io_amount` captures `Ok(_)`s

Partial rewrite of `unused_io_amount` to lint over `Ok(_)` and `Ok(..)`.

Moved the check to `check_block` to simplify context checking for expressions and allow us to check only some expressions.

For match (expr, arms) we emit a lint for io ops used on `expr` when an arm is `Ok(_)|Ok(..)`. Also considers the cases when there are guards in the arms and `if let Ok(_) = ...` cases.

For `Ok(_)` and `Ok(..)` it emits a note indicating where the value is ignored.

changelog: False Negatives [`unused_io_amount`]: Extended `unused_io_amount` to catch `Ok(_)`s in `If let` and match exprs.

Closes rust-lang#11713

r? `@giraffate`
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants