Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
0d192c34
R
Rust
项目概览
int
/
Rust
大约 1 年 前同步成功
通知
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,发现更多精彩内容 >>
提交
0d192c34
编写于
7月 22, 2016
作者:
A
abhi
提交者:
GitHub
7月 22, 2016
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Update VecDeque documentation to specify direction of index 0 (#34920)
上级
d15e2656
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
16 addition
and
0 deletion
+16
-0
src/libcollections/vec_deque.rs
src/libcollections/vec_deque.rs
+16
-0
未找到文件。
src/libcollections/vec_deque.rs
浏览文件 @
0d192c34
...
...
@@ -402,6 +402,8 @@ pub fn with_capacity(n: usize) -> VecDeque<T> {
/// Retrieves an element in the `VecDeque` by index.
///
/// Element at index 0 is the front of the queue.
///
/// # Examples
///
/// ```
...
...
@@ -425,6 +427,8 @@ pub fn get(&self, index: usize) -> Option<&T> {
/// Retrieves an element in the `VecDeque` mutably by index.
///
/// Element at index 0 is the front of the queue.
///
/// # Examples
///
/// ```
...
...
@@ -456,6 +460,8 @@ pub fn get_mut(&mut self, index: usize) -> Option<&mut T> {
///
/// Fails if there is no element with either index.
///
/// Element at index 0 is the front of the queue.
///
/// # Examples
///
/// ```
...
...
@@ -1180,6 +1186,8 @@ fn is_contiguous(&self) -> bool {
///
/// Returns `None` if `index` is out of bounds.
///
/// Element at index 0 is the front of the queue.
///
/// # Examples
///
/// ```
...
...
@@ -1214,6 +1222,8 @@ pub fn swap_remove_back(&mut self, index: usize) -> Option<T> {
///
/// Returns `None` if `index` is out of bounds.
///
/// Element at index 0 is the front of the queue.
///
/// # Examples
///
/// ```
...
...
@@ -1245,6 +1255,8 @@ pub fn swap_remove_front(&mut self, index: usize) -> Option<T> {
/// end is closer to the insertion point will be moved to make room,
/// and all the affected elements will be moved to new positions.
///
/// Element at index 0 is the front of the queue.
///
/// # Panics
///
/// Panics if `index` is greater than `VecDeque`'s length
...
...
@@ -1472,6 +1484,8 @@ pub fn insert(&mut self, index: usize, value: T) {
/// room, and all the affected elements will be moved to new positions.
/// Returns `None` if `index` is out of bounds.
///
/// Element at index 0 is the front of the queue.
///
/// # Examples
///
/// ```
...
...
@@ -1651,6 +1665,8 @@ pub fn remove(&mut self, index: usize) -> Option<T> {
///
/// Note that the capacity of `self` does not change.
///
/// Element at index 0 is the front of the queue.
///
/// # Panics
///
/// Panics if `at > len`
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录