| ▲ | nicce an hour ago | ||||||||||||||||||||||
> not planning on including, mainly lifetimes and some ways they handle pointer mutability How are you going to solve the problem with other means? Lifetimes basically guarantee, that there are no use-after-free bugs. | |||||||||||||||||||||||
| ▲ | jordan_bonecut an hour ago | parent [-] | ||||||||||||||||||||||
The compiler statically tracks “where” everything lives. It also knows “when” the “where” is valid. Each “where” is called a plane, which is a tree. The stack plane contains all your function calls memory, a structure allocated on the stack has a child plane for each field. The compiler tags which plane something is from at compile time and tracks when it dies. Things do get complicated in scenarios like: fn max(a: &usize, b: &usize) -> &usize {
}In such a scenario the compiler tags the result with both of the input planes. However, you cannot define add a postcondition ensures clause to make it more precise | |||||||||||||||||||||||
| |||||||||||||||||||||||