mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-21 01:41:03 +00:00
WIP: CI: add spellcheck (#3421)
* CI: add spellcheck * revert me * CI: explicit command for spellchecker * spellcheck: edit misspells * CI: run spellcheck on diff * spellcheck: edits * spellcheck: edit misspells * spellcheck: add rules * spellcheck: mv configs * spellcheck: more edits * spellcheck: chore * spellcheck: one more thing * spellcheck: and another one * spellcheck: seems like it doesn't get to an end * spellcheck: new words after rebase * spellcheck: new words appearing out of nowhere * chore * review edits * more review edits * more edits * wonky behavior * wonky behavior 2 * wonky behavior 3 * change git behavior * spellcheck: another bunch of new edits * spellcheck: new words are koming out of nowhere * CI: finding the master * CI: fetching master implicitly * CI: undebug * new errors * a bunch of new edits * and some more * Update node/core/approval-voting/src/approval_db/v1/mod.rs Co-authored-by: Andronik Ordian <write@reusable.software> * Update xcm/xcm-executor/src/assets.rs Co-authored-by: Andronik Ordian <write@reusable.software> * Apply suggestions from code review Co-authored-by: Andronik Ordian <write@reusable.software> * Suggestions from the code review * CI: scan only changed files Co-authored-by: Andronik Ordian <write@reusable.software>
This commit is contained in:
@@ -48,7 +48,7 @@ pub mod opaque {
|
||||
pub use crate::v0::opaque::{Xcm, Order};
|
||||
}
|
||||
|
||||
/// The basic VersionedXcm type which just uses the `Vec<u8>` as an encoded call.
|
||||
/// The basic `VersionedXcm` type which just uses the `Vec<u8>` as an encoded call.
|
||||
pub type VersionedXcm = super::VersionedXcm<()>;
|
||||
}
|
||||
|
||||
|
||||
@@ -14,7 +14,7 @@
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Cumulus. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
//! Support datastructures for `MultiLocation`, primarily the `Junction` datatype.
|
||||
//! Support data structures for `MultiLocation`, primarily the `Junction` datatype.
|
||||
|
||||
use alloc::vec::Vec;
|
||||
use parity_scale_codec::{self, Encode, Decode};
|
||||
|
||||
@@ -171,7 +171,7 @@ pub enum Xcm<Call> {
|
||||
/// - `assets`: The asset(s) to be withdrawn.
|
||||
/// - `dest`: The new owner for the assets.
|
||||
/// - `effects`: The orders that should be contained in the `ReserveAssetDeposit` which is sent onwards to
|
||||
/// `dest.
|
||||
/// `dest`.
|
||||
///
|
||||
/// Safety: No concerns.
|
||||
///
|
||||
|
||||
@@ -28,7 +28,7 @@ pub enum AssetInstance {
|
||||
/// Undefined - used if the NFA class has only one instance.
|
||||
Undefined,
|
||||
|
||||
/// A compact index. Technically this could be greater than u128, but this implementation supports only
|
||||
/// A compact index. Technically this could be greater than `u128`, but this implementation supports only
|
||||
/// values up to `2**128 - 1`.
|
||||
Index { #[codec(compact)] id: u128 },
|
||||
|
||||
|
||||
@@ -66,7 +66,7 @@ pub enum MultiLocation {
|
||||
X8(Junction, Junction, Junction, Junction, Junction, Junction, Junction, Junction),
|
||||
}
|
||||
|
||||
/// Maximum number of junctions a multilocation can contain.
|
||||
/// Maximum number of junctions a `MultiLocation` can contain.
|
||||
pub const MAX_MULTILOCATION_LENGTH: usize = 8;
|
||||
|
||||
impl From<Junction> for MultiLocation {
|
||||
|
||||
@@ -49,7 +49,7 @@ pub enum Order<Call> {
|
||||
/// - `assets`: The asset(s) to remove from holding.
|
||||
/// - `dest`: The new owner for the assets.
|
||||
/// - `effects`: The orders that should be contained in the `ReserveAssetDeposit` which is sent onwards to
|
||||
/// `dest.
|
||||
/// `dest`.
|
||||
///
|
||||
/// Errors:
|
||||
#[codec(index = 2)]
|
||||
@@ -101,7 +101,7 @@ pub enum Order<Call> {
|
||||
#[codec(index = 6)]
|
||||
QueryHolding { #[codec(compact)] query_id: u64, dest: MultiLocation, assets: Vec<MultiAsset> },
|
||||
|
||||
/// Pay for the execution of some Xcm with up to `weight` picoseconds of execution time, paying for this with
|
||||
/// Pay for the execution of some XCM with up to `weight` picoseconds of execution time, paying for this with
|
||||
/// up to `fees` from the holding account.
|
||||
///
|
||||
/// Errors:
|
||||
|
||||
@@ -171,7 +171,7 @@ impl<C> ExecuteXcm<C> for () {
|
||||
///
|
||||
/// These can be amalgamated in tuples to form sophisticated routing systems. In tuple format, each router might return
|
||||
/// `CannotReachDestination` to pass the execution to the next sender item. Note that each `CannotReachDestination`
|
||||
/// might alter the destination and the xcm message for to the next router.
|
||||
/// might alter the destination and the XCM message for to the next router.
|
||||
///
|
||||
///
|
||||
/// # Example
|
||||
|
||||
Reference in New Issue
Block a user