macOS 上安装 rustup 如果你使用 Linux 或 macOS，打开终端并输入如下命令： $ curl --proto '=https' --tlsv1.2 https://sh.rustup.rs -sSf | sh 此命令下载一个脚本并开始安装 rustup 工具，这会安装最新稳定版 Rust。过程中可能会提示 你输入密码。如果安装成功，将会出现如下内容： Rust is installed 程序 接下来，新建一个源文件，命名为 main.rs。Rust 源文件总是以 .rs 扩展名结尾。如果文件名 包含多个单词，那么按照命名习惯，应当使用下划线来分隔单词。例如命名为 hello_world.rs， 而不是 helloworld.rs。 现在打开刚创建的 main.rs 文件，输入示例 1-1 中的代码。 文件名：main.rs fn main() { println!("Hello 上，输 入如下命令，编译并运行文件： 15/562Rust 程序设计语言 简体中文版 $ rustc main.rs $ ./main Hello, world! 在 Windows 上，输入命令 .\main.exe，而不是 ./main： > rustc main.rs > .\main Hello, world! 不管使用何种操作系统，终端应该打印字符串 Hello, world!。如果没有看到这些输出，回到

"#$%Bloomberg*&'()18 !"#$%&'() • ¶+)€5tHIAPPFN¨C5OÄÅk¨´ÇG]^Ç-8PQ°G™Î • ˜†5)RS°TUG=$>WWDCF,V=…M'kÇ©WéXCraig FederighiY{"#Ä#º»GZÍ,[L2\#]GZ^ž_È )RS°TUG=$>`P,Apple Intelligence —tÉ·°a$û+«TU¬G=$ÄÅWO«P„có׬,ÌÍ2\GP„có×

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators of the factorization F can be accessed by indexing: The relation between F and A is F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: • \CHAPTER 79. LINEAR ALGEBRA 1462 Component triangular) part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components • det See also lu! Note lu(A::AbstractSparseMatrixCSC) uses the

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators of the factorization F can be accessed by indexing: The relation between F and A is F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: • \CHAPTER 79. LINEAR ALGEBRA 1462 Component triangular) part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components • det See also lu! Note lu(A::AbstractSparseMatrixCSC) uses the

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators of the factorization F can be accessed by indexing: The relation between F and A is F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: • \CHAPTER 79. LINEAR ALGEBRA 1462 Component triangular) part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components • det See also lu! Note lu(A::AbstractSparseMatrixCSC) uses the

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: •

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: •

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components The relation between F and A is F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators of the factorization F can be accessed by indexing: The relation between F and A is F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: • \CHAPTER 81. LINEAR ALGEBRA 1521 Component triangular) part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components • det See also lu! Note lu(A::AbstractSparseMatrixCSC) uses the

example, we would implement Iterators.Reverse{Squares} methods: julia> Base.iterate(rS::Iterators.Reverse{Squares}, state=rS.itr.count) = state < 1 ? nothing : (state*state, state-1) �→ julia> collect(Iterators of the factorization F can be accessed by indexing: The relation between F and A is F.L*F.U == (F.Rs .* A)[F.p, F.q] F further supports the following functions: • \CHAPTER 81. LINEAR ALGEBRA 1520 Component triangular) part of LU p right permutation Vector q left permutation Vector Rs Vector of scaling factors : (L,U,p,q,Rs) components • det See also lu! Note lu(A::AbstractSparseMatrixCSC) uses the