Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
994c8815
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,发现更多精彩内容 >>
提交
994c8815
编写于
7月 07, 2012
作者:
B
Brian Anderson
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
tutorial: Use blockquotes for asides. Add styling
上级
3413b3f5
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
21 addition
and
14 deletion
+21
-14
doc/rust.css
doc/rust.css
+7
-0
doc/tutorial.md
doc/tutorial.md
+14
-14
未找到文件。
doc/rust.css
浏览文件 @
994c8815
...
...
@@ -57,3 +57,10 @@ h1.title {
background-repeat
:
no-repeat
;
background-position
:
right
;
}
blockquote
{
color
:
black
;
background-color
:
lavender
;
margin
:
1em
;
padding
:
0.5em
1em
0.5em
1em
;
}
\ No newline at end of file
doc/tutorial.md
浏览文件 @
994c8815
...
...
@@ -1553,8 +1553,8 @@ let y = x; // Copy the pointer, increase refcount
// When x and y go out of scope, refcount goes to 0, box is freed
~~~~
***Note:*** We will in the future switch to garbage collection, rather
than reference counting, for shared boxes.
> ***Note:*** We will in the future switch to garbage collection,
> rather
than reference counting, for shared boxes.
Shared boxes never cross task boundaries.
...
...
@@ -1642,8 +1642,8 @@ Rust vectors are always heap-allocated and unique. A value of type
`~[T]` is represented by a pointer to a section of heap memory
containing any number of values of type `T`.
***Note:*** This uniqueness is turning out to be quite awkward in
practice, and might change in the future.
>
***Note:*** This uniqueness is turning out to be quite awkward in
>
practice, and might change in the future.
Vector literals are enclosed in square brackets. Dereferencing is done
with square brackets (zero-based):
...
...
@@ -1676,10 +1676,10 @@ logarithmically, so the above code generates about the same amount of
copying and reallocation as `push` implementations in most other
languages.
***Note:*** Actually, currently, growing a vector is *exactly* as
inefficient as it looks, since vector `+` has been moved to the
libraries and Rust's operator overloading support is insufficient to
allow this optimization. Try using `vec::push`.
>
***Note:*** Actually, currently, growing a vector is *exactly* as
>
inefficient as it looks, since vector `+` has been moved to the
>
libraries and Rust's operator overloading support is insufficient to
>
allow this optimization. Try using `vec::push`.
## Strings
...
...
@@ -1946,8 +1946,8 @@ fn plus1(&&x: int) -> int { x + 1 }
vec::map(~[1, 2, 3], plus1);
~~~~
***Note:***: This is inconvenient, and we are hoping to get rid of this
restriction in the future.
> ***Note:*** This is inconvenient, and we are hoping to get rid of
> this
restriction in the future.
# Modules and crates
...
...
@@ -2222,8 +2222,8 @@ object-oriented languages tend to solve with methods and inheritance.
For example, writing a function that can operate on multiple types of
collections.
***Note:***:
This feature is very new, and will need a few extensions to be
applicable to more advanced use cases.
> ***Note:***
This feature is very new, and will need a few extensions to be
>
applicable to more advanced use cases.
## Declaration
...
...
@@ -2663,8 +2663,8 @@ copying it by making use of [unique boxes](#unique-boxes), which allow
the sending task to release ownership of a value, so that the
receiving task can keep on using it.
***Note:***: As Rust evolves, we expect the task API to grow and change
somewhat. The tutorial documents the API as it exists today.
> ***Note:*** As Rust evolves, we expect the task API to grow and
> change
somewhat. The tutorial documents the API as it exists today.
## Spawning a task
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录