提交 b7ce2303 编写于 作者: S Steve Klabnik

Rollup merge of #25138 - tshepang:typos, r=sanxiyn

...@@ -374,7 +374,7 @@ impl<'v, 'a> Visitor<'v> for GatherLabels<'a> { ...@@ -374,7 +374,7 @@ impl<'v, 'a> Visitor<'v> for GatherLabels<'a> {
fn visit_expr(&mut self, ex: &'v ast::Expr) { fn visit_expr(&mut self, ex: &'v ast::Expr) {
if let Some(label) = expression_label(ex) { if let Some(label) = expression_label(ex) {
for &(prior, prior_span) in &self.labels_in_fn[..] { for &(prior, prior_span) in &self.labels_in_fn[..] {
// FIXME (#24278): non-hygienic comparision // FIXME (#24278): non-hygienic comparison
if label.name == prior.name { if label.name == prior.name {
signal_shadowing_problem(self.sess, signal_shadowing_problem(self.sess,
label.name, label.name,
...@@ -420,7 +420,7 @@ fn check_if_label_shadows_lifetime<'a>(sess: &'a Session, ...@@ -420,7 +420,7 @@ fn check_if_label_shadows_lifetime<'a>(sess: &'a Session,
EarlyScope(_, lifetimes, s) | EarlyScope(_, lifetimes, s) |
LateScope(lifetimes, s) => { LateScope(lifetimes, s) => {
for lifetime_def in lifetimes { for lifetime_def in lifetimes {
// FIXME (#24278): non-hygienic comparision // FIXME (#24278): non-hygienic comparison
if label.name == lifetime_def.lifetime.name { if label.name == lifetime_def.lifetime.name {
signal_shadowing_problem( signal_shadowing_problem(
sess, sess,
...@@ -677,7 +677,7 @@ fn check_lifetime_def_for_shadowing(&self, ...@@ -677,7 +677,7 @@ fn check_lifetime_def_for_shadowing(&self,
lifetime: &ast::Lifetime) lifetime: &ast::Lifetime)
{ {
for &(label, label_span) in &self.labels_in_fn { for &(label, label_span) in &self.labels_in_fn {
// FIXME (#24278): non-hygienic comparision // FIXME (#24278): non-hygienic comparison
if lifetime.name == label.name { if lifetime.name == label.name {
signal_shadowing_problem(self.sess, signal_shadowing_problem(self.sess,
lifetime.name, lifetime.name,
......
...@@ -1344,7 +1344,7 @@ pub fn ast_ty_arg_to_ty<'tcx>(this: &AstConv<'tcx>, ...@@ -1344,7 +1344,7 @@ pub fn ast_ty_arg_to_ty<'tcx>(this: &AstConv<'tcx>,
} }
// Check the base def in a PathResolution and convert it to a Ty. If there are // Check the base def in a PathResolution and convert it to a Ty. If there are
// associated types in the PathResolution, these will need to be seperately // associated types in the PathResolution, these will need to be separately
// resolved. // resolved.
fn base_def_to_ty<'tcx>(this: &AstConv<'tcx>, fn base_def_to_ty<'tcx>(this: &AstConv<'tcx>,
rscope: &RegionScope, rscope: &RegionScope,
......
...@@ -944,7 +944,7 @@ fn clean(&self, cx: &DocContext) -> Generics { ...@@ -944,7 +944,7 @@ fn clean(&self, cx: &DocContext) -> Generics {
// a Sized bound, removing the bounds as we find them. // a Sized bound, removing the bounds as we find them.
// //
// Note that associated types also have a sized bound by default, but we // Note that associated types also have a sized bound by default, but we
// don't actually konw the set of associated types right here so that's // don't actually know the set of associated types right here so that's
// handled in cleaning associated types // handled in cleaning associated types
let mut sized_params = HashSet::new(); let mut sized_params = HashSet::new();
where_predicates.retain(|pred| { where_predicates.retain(|pred| {
......
...@@ -328,7 +328,7 @@ pub fn try_wait(&self) -> Option<ExitStatus> { ...@@ -328,7 +328,7 @@ pub fn try_wait(&self) -> Option<ExitStatus> {
}) { }) {
Ok(0) => None, Ok(0) => None,
Ok(n) if n == self.pid => Some(translate_status(status)), Ok(n) if n == self.pid => Some(translate_status(status)),
Ok(n) => panic!("unkown pid: {}", n), Ok(n) => panic!("unknown pid: {}", n),
Err(e) => panic!("unknown waitpid error: {}", e), Err(e) => panic!("unknown waitpid error: {}", e),
} }
} }
......
...@@ -5122,7 +5122,7 @@ VALGRIND_PRINTF_BACKTRACE(const char *format, ...) ...@@ -5122,7 +5122,7 @@ VALGRIND_PRINTF_BACKTRACE(const char *format, ...)
/* These requests allow control to move from the simulated CPU to the /* These requests allow control to move from the simulated CPU to the
real CPU, calling an arbitary function. real CPU, calling an arbitrary function.
Note that the current ThreadId is inserted as the first argument. Note that the current ThreadId is inserted as the first argument.
So this call: So this call:
......
...@@ -32,7 +32,7 @@ ...@@ -32,7 +32,7 @@
// type argument with trailing comma // type argument with trailing comma
type TypeG<T> = Box<T,>; type TypeG<T> = Box<T,>;
// trailing comma on liftime defs // trailing comma on lifetime defs
type TypeH<'a,> = &'a (); type TypeH<'a,> = &'a ();
// trailing comma on type argument // trailing comma on type argument
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册