diff --git a/steps/11/README.md b/steps/11/README.md index 155603f3..c2c4d8a9 100644 --- a/steps/11/README.md +++ b/steps/11/README.md @@ -4,11 +4,9 @@ Let's now learn how to use our new `StorageValue`. ## Basic APIs -The full list of APIs available for a `StorageValue` can be found here: +This tutorial will only go over just the basic APIs needed to build our Pallet. -https://docs.rs/frame-support/37.0.0/frame_support/storage/types/struct.StorageValue.html - -But we will go over just the basics we need to build our Pallet. +Check out the [`StorageValue` documentation](https://docs.rs/frame-support/37.0.0/frame_support/storage/types/struct.StorageValue.html) if you want to see the full APIs. ### Reading Storage diff --git a/steps/13/README.md b/steps/13/README.md index c3e8a029..03296ebf 100644 --- a/steps/13/README.md +++ b/steps/13/README.md @@ -82,9 +82,7 @@ In blockchain systems, these can literally be billion dollar bugs, so let's look ### Checked Math -The first choice for doing safe math is to use `checked_*` APIs, for example `checked_add`: - -https://docs.rs/num/latest/num/trait.CheckedAdd.html +The first choice for doing safe math is to use `checked_*` APIs, for example [`checked_add`](https://docs.rs/num/latest/num/trait.CheckedAdd.html). The checked math APIs will check if there are any underflows or overflows, and return `None` in those cases. Otherwise, if the math operation is calculated without error, it returns `Some(result)`. @@ -111,9 +109,7 @@ Note that we didn't need to call `.into()` in this case, because `?` already doe ### Saturating Math -The other option for safe math is to use `saturating_*` APIs, for example `saturating_add`: - -https://docs.rs/num/latest/num/traits/trait.SaturatingAdd.html +The other option for safe math is to use `saturating_*` APIs, for example [`saturating_add`](https://docs.rs/num/latest/num/traits/trait.SaturatingAdd.html). This option is useful because it is safe and does NOT return an `Option`. diff --git a/steps/18/README.md b/steps/18/README.md index 9ef98861..9f0a5e3a 100644 --- a/steps/18/README.md +++ b/steps/18/README.md @@ -4,11 +4,9 @@ Now let's learn to interact with our `Kitties` storage map, and update the map w ## Basic APIs -The full list of APIs available for `StorageMap` can be found here: +This tutorial will only go over just the basic APIs needed to build our Pallet. -https://docs.rs/frame-support/37.0.0/frame_support/storage/types/struct.StorageMap.html - -But we will go over just the basics we need to build our Pallet. +Check out the [`StorageMap` documentation](https://docs.rs/frame-support/37.0.0/frame_support/storage/types/struct.StorageMap.html) if you want to see the full APIs. ### Reading Storage diff --git a/steps/31/README.md b/steps/31/README.md index 34edc59c..1b2de11a 100644 --- a/steps/31/README.md +++ b/steps/31/README.md @@ -32,9 +32,7 @@ There are other ways to define the bound, and even make it configurable, but tha ## Basic APIs -The `BoundedVec` type has almost all the same APIs as a `Vec. You can find the full list of APIs here: - -https://docs.rs/frame-support/37.0.0/frame_support/struct.BoundedVec.html +The `BoundedVec` type has almost all the same APIs as a `Vec`. You can find the full list of APIs in the [`BoundedVec` documentation](https://docs.rs/frame-support/37.0.0/frame_support/struct.BoundedVec.html). The main difference is the fact that a `BoundedVec` cannot always accept a new item.