rust/comprehensive-rust
1
0
Fork 0
mirror of https://github.com/google/comprehensive-rust.git synced 2025-07-11 08:40:31 +02:00
Code Issues Releases Activity

Avoid repetition across slides

Browse Source
This commit is contained in:
LukeMathWalker
2025-07-08 15:19:53 +02:00
parent 3c19ca0150
commit 28097f39b7
2 changed files with 1 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/idiomatic/leveraging-the-type-system/newtype-pattern/is-it-encapsulated.md
View File

@ -4,7 +4,7 @@ minutes: 5
# Is It Truly Encapsulated? # Is It Truly Encapsulated?
You must evaluate the entire API surface exposed by a newtype to determine if You must evaluate _the entire API surface_ exposed by a newtype to determine if
invariants are indeed bullet-proof. It is crucial to consider all possible invariants are indeed bullet-proof. It is crucial to consider all possible
interactions, including trait implementations, that may allow users to bypass interactions, including trait implementations, that may allow users to bypass
validation checks. validation checks.

8
src/idiomatic/leveraging-the-type-system/newtype-pattern/parse-don-t-validate.md
View File

@ -48,14 +48,6 @@ impl Username {
underlying value since `&str`, the returned type, restricts them to read-only underlying value since `&str`, the returned type, restricts them to read-only
access. access.
- Stress the importance of evaluating _the entire API surface_ exposed by a
newtype to determine if invariants are indeed bullet-proof.
It is crucial to consider all possible interactions, including trait
implementations, that may allow users to bypass the invariants. For example,
if the `Username` type implements the `DerefMut` trait, users can modify the
underlying string directly, bypassing the validation checks in `new`.
- Type-level invariants have second-order benefits. - Type-level invariants have second-order benefits.
The input is validated once, at the boundary, and the rest of the program can The input is validated once, at the boundary, and the rest of the program can