Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
6235e6f9
R
Rust
项目概览
int
/
Rust
12 个月 前同步成功
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
Rust
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
6235e6f9
编写于
6月 25, 2021
作者:
E
Eric Huss
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix a few misspellings.
上级
f726dbe9
变更
12
隐藏空白更改
内联
并排
Showing
12 changed file
with
16 addition
and
16 deletion
+16
-16
compiler/rustc_lint_defs/src/builtin.rs
compiler/rustc_lint_defs/src/builtin.rs
+1
-1
library/alloc/src/collections/btree/fix.rs
library/alloc/src/collections/btree/fix.rs
+1
-1
library/alloc/src/collections/btree/node.rs
library/alloc/src/collections/btree/node.rs
+1
-1
library/core/src/cmp.rs
library/core/src/cmp.rs
+1
-1
library/core/src/iter/adapters/mod.rs
library/core/src/iter/adapters/mod.rs
+1
-1
library/core/src/mem/maybe_uninit.rs
library/core/src/mem/maybe_uninit.rs
+5
-5
library/core/src/ptr/metadata.rs
library/core/src/ptr/metadata.rs
+1
-1
library/proc_macro/src/bridge/rpc.rs
library/proc_macro/src/bridge/rpc.rs
+1
-1
library/std/src/keyword_docs.rs
library/std/src/keyword_docs.rs
+1
-1
library/std/src/os/unix/process.rs
library/std/src/os/unix/process.rs
+1
-1
library/std/src/process.rs
library/std/src/process.rs
+1
-1
library/std/src/sys/hermit/mutex.rs
library/std/src/sys/hermit/mutex.rs
+1
-1
未找到文件。
compiler/rustc_lint_defs/src/builtin.rs
浏览文件 @
6235e6f9
...
...
@@ -3280,7 +3280,7 @@
///
/// In Rust 2021, one of the important introductions is the [prelude changes], which add
/// `TryFrom`, `TryInto`, and `FromIterator` into the standard library's prelude. Since this
/// results in an amiguity as to which method/function to call when an existing `try_into`
/// results in an am
b
iguity as to which method/function to call when an existing `try_into`
/// method is called via dot-call syntax or a `try_from`/`from_iter` associated function
/// is called directly on a type.
///
...
...
library/alloc/src/collections/btree/fix.rs
浏览文件 @
6235e6f9
...
...
@@ -3,7 +3,7 @@
impl
<
'a
,
K
:
'a
,
V
:
'a
>
NodeRef
<
marker
::
Mut
<
'a
>
,
K
,
V
,
marker
::
LeafOrInternal
>
{
/// Stocks up a possibly underfull node by merging with or stealing from a
/// sibling. If succesful but at the cost of shrinking the parent node,
/// sibling. If succes
s
ful but at the cost of shrinking the parent node,
/// returns that shrunk parent node. Returns an `Err` if the node is
/// an empty root.
fn
fix_node_through_parent
(
...
...
library/alloc/src/collections/btree/node.rs
浏览文件 @
6235e6f9
...
...
@@ -167,7 +167,7 @@ unsafe fn new() -> Box<Self> {
/// carry a lifetime, because we want it to return `&'a` references.
/// Therefore, we define it only for the least powerful type `Immut<'a>`.
/// - We cannot get implicit coercion from say `Mut<'a>` to `Immut<'a>`.
/// Therefore, we have to explicitly call `reborrow` on a more powerful
l
/// Therefore, we have to explicitly call `reborrow` on a more powerful
/// `NodeRef` in order to reach a method like `into_kv`.
///
/// All methods on `NodeRef` that return some kind of reference, either:
...
...
library/core/src/cmp.rs
浏览文件 @
6235e6f9
...
...
@@ -41,7 +41,7 @@
///
/// If [`PartialOrd`] or [`Ord`] are also implemented for `Self` and `Rhs`, their methods must also
/// be consistent with `PartialEq` (see the documentation of those traits for the exact
/// requireme
m
ts). It's easy to accidentally make them disagree by deriving some of the traits and
/// requireme
n
ts). It's easy to accidentally make them disagree by deriving some of the traits and
/// manually implementing others.
///
/// The equality relation `==` must satisfy the following conditions
...
...
library/core/src/iter/adapters/mod.rs
浏览文件 @
6235e6f9
...
...
@@ -54,7 +54,7 @@
#[unstable(feature
=
"iter_zip"
,
issue
=
"83574"
)]
pub
use
self
::
zip
::
zip
;
/// This trait provides transitive access to source-stage in an i
n
terator-adapter pipeline
/// This trait provides transitive access to source-stage in an iterator-adapter pipeline
/// under the conditions that
/// * the iterator source `S` itself implements `SourceIter<Source = S>`
/// * there is a delegating implementation of this trait for each adapter in the pipeline between
...
...
library/core/src/mem/maybe_uninit.rs
浏览文件 @
6235e6f9
...
...
@@ -980,7 +980,7 @@ pub const fn slice_as_mut_ptr(this: &mut [MaybeUninit<T>]) -> *mut T {
this
.as_mut_ptr
()
as
*
mut
T
}
/// Copies the elements from `src` to `this`, returning a mutable reference to the now initalized contents of `this`.
/// Copies the elements from `src` to `this`, returning a mutable reference to the now init
i
alized contents of `this`.
///
/// If `T` does not implement `Copy`, use [`write_slice_cloned`]
///
...
...
@@ -1033,12 +1033,12 @@ pub fn write_slice<'a>(this: &'a mut [MaybeUninit<T>], src: &[T]) -> &'a mut [T]
this
.copy_from_slice
(
uninit_src
);
// SAFETY: Valid elements have just been copied into `this` so it is initalized
// SAFETY: Valid elements have just been copied into `this` so it is init
i
alized
unsafe
{
MaybeUninit
::
slice_assume_init_mut
(
this
)
}
}
/// Clones the elements from `src` to `this`, returning a mutable reference to the now initalized contents of `this`.
/// Any already initalized elements will not be dropped.
/// Clones the elements from `src` to `this`, returning a mutable reference to the now init
i
alized contents of `this`.
/// Any already init
i
alized elements will not be dropped.
///
/// If `T` implements `Copy`, use [`write_slice`]
///
...
...
@@ -1124,7 +1124,7 @@ fn drop(&mut self) {
super
::
forget
(
guard
);
// SAFETY: Valid elements have just been written into `this` so it is initalized
// SAFETY: Valid elements have just been written into `this` so it is init
i
alized
unsafe
{
MaybeUninit
::
slice_assume_init_mut
(
this
)
}
}
}
library/core/src/ptr/metadata.rs
浏览文件 @
6235e6f9
...
...
@@ -101,7 +101,7 @@ pub const fn metadata<T: ?Sized>(ptr: *const T) -> <T as Pointee>::Metadata {
///
/// This function is safe but the returned pointer is not necessarily safe to dereference.
/// For slices, see the documentation of [`slice::from_raw_parts`] for safety requirements.
/// For trait objects, the metadata must come from a pointer to the same underlying er
e
ased type.
/// For trait objects, the metadata must come from a pointer to the same underlying erased type.
///
/// [`slice::from_raw_parts`]: crate::slice::from_raw_parts
#[unstable(feature
=
"ptr_metadata"
,
issue
=
"81513"
)]
...
...
library/proc_macro/src/bridge/rpc.rs
浏览文件 @
6235e6f9
...
...
@@ -246,7 +246,7 @@ fn decode(r: &mut Reader<'_>, s: &mut S) -> Self {
}
}
/// Simplied version of panic payloads, ignoring
/// Simpli
fi
ed version of panic payloads, ignoring
/// types other than `&'static str` and `String`.
pub
enum
PanicMessage
{
StaticStr
(
&
'static
str
),
...
...
library/std/src/keyword_docs.rs
浏览文件 @
6235e6f9
...
...
@@ -971,7 +971,7 @@ mod match_keyword {}
/// ```
///
/// Like [`struct`]s and [`enum`]s, a module and its content are private by
/// default,
u
naccessible to code outside of the module.
/// default,
i
naccessible to code outside of the module.
///
/// To learn more about allowing access, see the documentation for the [`pub`]
/// keyword.
...
...
library/std/src/os/unix/process.rs
浏览文件 @
6235e6f9
...
...
@@ -226,7 +226,7 @@ pub trait ExitStatusExt: Sealed {
///
/// Panics on an attempt to make an `ExitStatusError` from a wait status of `0`.
///
/// Making an `ExitStatus` always succeds and never panics.
/// Making an `ExitStatus` always succe
e
ds and never panics.
#[stable(feature
=
"exit_status_from"
,
since
=
"1.12.0"
)]
fn
from_raw
(
raw
:
i32
)
->
Self
;
...
...
library/std/src/process.rs
浏览文件 @
6235e6f9
...
...
@@ -1568,7 +1568,7 @@ pub fn code(&self) -> Option<i32> {
/// Reports the exit code, if applicable, from an `ExitStatusError`, as a `NonZero`
///
/// This is exac
lt
y like [`code()`](Self::code), except that it returns a `NonZeroI32`.
/// This is exac
tl
y like [`code()`](Self::code), except that it returns a `NonZeroI32`.
///
/// Plain `code`, returning a plain integer, is provided because is is often more convenient.
/// The returned value from `code()` is indeed also nonzero; use `code_nonzero()` when you want
...
...
library/std/src/sys/hermit/mutex.rs
浏览文件 @
6235e6f9
...
...
@@ -14,7 +14,7 @@
/// This structure behaves a lot like a common mutex. There are some differences:
///
/// - By using busy waiting, it can be used outside the runtime.
/// - It is a so called ticket lock and is completly fair.
/// - It is a so called ticket lock and is complet
e
ly fair.
#[cfg_attr(target_arch
=
"x86_64"
,
repr(align(
128
)))]
#[cfg_attr(not(target_arch
=
"x86_64"
),
repr(align(
64
)))]
struct
Spinlock
<
T
:
?
Sized
>
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录