mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-14 09:45:42 +00:00
93e8ffed55
* Introduce preimages module in traits * Multisize Preimages * Len not actually necessary * Tweaks to the preimage API * Fixes * Get Scheduler building with new API * Scheduler tests pass * Bounded Scheduler 🎉 * Use Agenda holes and introduce IncompleteSince to avoid need to reschedule * Tests pass with new weight system * New benchmarks * Add missing file * Drop preimage when permenantly overeight * Drop preimage when permenantly overeight * Referenda uses latest preimage API * Testing ok * Adding tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * fmt Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add preimage migration Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Docs * Remove dbg * Refactor Democracy * Refactor Democracy * Add final MEL * Remove silly maps * Fixes * Minor refactor * Formatting * Fixes * Fixes * Fixes * Update frame/preimage/src/lib.rs Co-authored-by: Shawn Tabrizi <shawntabrizi@gmail.com> * Add migrations to Democracy * WIP Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Resolve conflicts Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Revert "Resolve conflicts" This reverts commit 734d66d69e54553471ffa54fa52e3e304dc8f106. * Undo wrong resolves... Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * WIP Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Make compile Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * massage clippy Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * More clippy Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * clippy annoyance Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * clippy annoyance Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix benchmarks Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * add missing file * Test <Preimage as QueryPreimage> Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * More tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Clippy harassment Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add test Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * clippy Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fixup tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Remove old stuff Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * fmt Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Test <Scheduler as Anon> trait functions Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Update pallet-ui tests Why is this needed? Should not be the case unless master is broken... Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * More scheduler trait test Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * More tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Apply review suggestion Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Beauty fixes Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add Scheduler test migration_v3_to_v4_works Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Merge fixup Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Keep referenda benchmarks instantiatable Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Update weights Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Use new scheduler weight functions Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Use new democracy weight functions Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Use weight compare functions Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Update pallet-ui tests Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * More renaming… Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * More renaming… Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add comment Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Implement OnRuntimeUpgrade for scheduler::v3_to_v4 migration Put the migration into a proper `MigrateToV4` struct and implement the OnRuntimeUpgrade hooks for it. Also move the test to use that instead. This should make it easier for adding it to Polkadot. Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Clippy Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Handle undecodable Agendas Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Remove trash Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix test Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Use new OnRuntimeUpgrade functions Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * fix test Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix BoundedSlice::truncate_from Co-authored-by: jakoblell Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix pre_upgrade hook return values Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add more error logging Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Find too large preimages in the pre_upgrade hook Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Test that too large Calls in agendas are ignored Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Use new OnRuntimeUpgrade hooks Why did the CI not catch this?! Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * works fine - just more logs Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix staking migration Causing issues on Kusama... Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix UI tests No idea why this is needed. This is actually undoing an earlier change. Maybe the CI has different rustc versions!? Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Remove multisig's Calls (#12072) * Remove multisig's Calls * Multisig: Fix tests and re-introduce reserve logic (#12241) * Fix tests and re-introduce reserve logic * fix benches * add todo * remove irrelevant bench * [Feature] Add a migration that drains and refunds stored calls (#12313) * [Feature] Add a migration that drains and refunds stored calls * migration fixes * fixes * address review comments * consume the whole block weight * fix assertions * license header * fix interface Co-authored-by: parity-processbot <> Co-authored-by: parity-processbot <> Co-authored-by: Roman Useinov <roman.useinov@gmail.com> * Fix test Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Fix multisig benchmarks Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * ".git/.scripts/bench-bot.sh" pallet dev pallet_democracy * ".git/.scripts/bench-bot.sh" pallet dev pallet_scheduler * ".git/.scripts/bench-bot.sh" pallet dev pallet_preimage Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Shawn Tabrizi <shawntabrizi@gmail.com> Co-authored-by: parity-processbot <> Co-authored-by: Roman Useinov <roman.useinov@gmail.com>
522 lines
14 KiB
Rust
522 lines
14 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) 2017-2022 Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
//! The crate's tests.
|
|
|
|
use super::*;
|
|
use crate::mock::{RefState::*, *};
|
|
use assert_matches::assert_matches;
|
|
use codec::Decode;
|
|
use frame_support::{
|
|
assert_noop, assert_ok,
|
|
dispatch::{DispatchError::BadOrigin, RawOrigin},
|
|
traits::Contains,
|
|
};
|
|
use pallet_balances::Error as BalancesError;
|
|
|
|
#[test]
|
|
fn params_should_work() {
|
|
new_test_ext().execute_with(|| {
|
|
assert_eq!(ReferendumCount::<Test>::get(), 0);
|
|
assert_eq!(Balances::free_balance(42), 0);
|
|
assert_eq!(Balances::total_issuance(), 600);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn basic_happy_path_works() {
|
|
new_test_ext().execute_with(|| {
|
|
// #1: submit
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
set_balance_proposal_bounded(1),
|
|
DispatchTime::At(10),
|
|
));
|
|
assert_eq!(Balances::reserved_balance(&1), 2);
|
|
assert_eq!(ReferendumCount::<Test>::get(), 1);
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
run_to(4);
|
|
assert_eq!(DecidingCount::<Test>::get(0), 0);
|
|
run_to(5);
|
|
// #5: 4 blocks after submit - vote should now be deciding.
|
|
assert_eq!(DecidingCount::<Test>::get(0), 1);
|
|
run_to(6);
|
|
// #6: Lots of ayes. Should now be confirming.
|
|
set_tally(0, 100, 0);
|
|
run_to(7);
|
|
assert_eq!(confirming_until(0), 9);
|
|
run_to(9);
|
|
// #8: Should be confirmed & ended.
|
|
assert_eq!(approved_since(0), 9);
|
|
assert_ok!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
run_to(12);
|
|
// #9: Should not yet be enacted.
|
|
assert_eq!(Balances::free_balance(&42), 0);
|
|
run_to(13);
|
|
// #10: Proposal should be executed.
|
|
assert_eq!(Balances::free_balance(&42), 1);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn insta_confirm_then_kill_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Confirming { immediate: true }.create();
|
|
run_to(6);
|
|
assert_ok!(Referenda::kill(RuntimeOrigin::root(), r));
|
|
assert_eq!(killed_since(r), 6);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_then_reconfirm_with_elapsed_trigger_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Confirming { immediate: false }.create();
|
|
assert_eq!(confirming_until(r), 8);
|
|
run_to(7);
|
|
set_tally(r, 100, 99);
|
|
run_to(8);
|
|
assert_eq!(deciding_and_failing_since(r), 5);
|
|
run_to(11);
|
|
assert_eq!(approved_since(r), 11);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn instaconfirm_then_reconfirm_with_elapsed_trigger_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Confirming { immediate: true }.create();
|
|
run_to(6);
|
|
assert_eq!(confirming_until(r), 7);
|
|
set_tally(r, 100, 99);
|
|
run_to(7);
|
|
assert_eq!(deciding_and_failing_since(r), 5);
|
|
run_to(11);
|
|
assert_eq!(approved_since(r), 11);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn instaconfirm_then_reconfirm_with_voting_trigger_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Confirming { immediate: true }.create();
|
|
run_to(6);
|
|
assert_eq!(confirming_until(r), 7);
|
|
set_tally(r, 100, 99);
|
|
run_to(7);
|
|
assert_eq!(deciding_and_failing_since(r), 5);
|
|
run_to(8);
|
|
set_tally(r, 100, 0);
|
|
run_to(9);
|
|
assert_eq!(confirming_until(r), 11);
|
|
run_to(11);
|
|
assert_eq!(approved_since(r), 11);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn voting_should_extend_for_late_confirmation() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Passing.create();
|
|
run_to(10);
|
|
assert_eq!(confirming_until(r), 11);
|
|
run_to(11);
|
|
assert_eq!(approved_since(r), 11);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn should_instafail_during_extension_confirmation() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Passing.create();
|
|
run_to(10);
|
|
assert_eq!(confirming_until(r), 11);
|
|
// Should insta-fail since it's now past the normal voting time.
|
|
set_tally(r, 100, 101);
|
|
run_to(11);
|
|
assert_eq!(rejected_since(r), 11);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn confirming_then_fail_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let r = Failing.create();
|
|
// Normally ends at 5 + 4 (voting period) = 9.
|
|
assert_eq!(deciding_and_failing_since(r), 5);
|
|
set_tally(r, 100, 0);
|
|
run_to(6);
|
|
assert_eq!(confirming_until(r), 8);
|
|
set_tally(r, 100, 101);
|
|
run_to(9);
|
|
assert_eq!(rejected_since(r), 9);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn queueing_works() {
|
|
new_test_ext().execute_with(|| {
|
|
// Submit a proposal into a track with a queue len of 1.
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(5),
|
|
Box::new(RawOrigin::Root.into()),
|
|
set_balance_proposal_bounded(0),
|
|
DispatchTime::After(0),
|
|
));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(5), 0));
|
|
|
|
run_to(2);
|
|
|
|
// Submit 3 more proposals into the same queue.
|
|
for i in 1..=4 {
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(i),
|
|
Box::new(RawOrigin::Root.into()),
|
|
set_balance_proposal_bounded(i),
|
|
DispatchTime::After(0),
|
|
));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(i), i as u32));
|
|
// TODO: decision deposit after some initial votes with a non-highest voted coming
|
|
// first.
|
|
}
|
|
assert_eq!(ReferendumCount::<Test>::get(), 5);
|
|
|
|
run_to(5);
|
|
// One should be being decided.
|
|
assert_eq!(DecidingCount::<Test>::get(0), 1);
|
|
assert_eq!(deciding_and_failing_since(0), 5);
|
|
for i in 1..=4 {
|
|
assert_eq!(waiting_since(i), 2);
|
|
}
|
|
|
|
// Vote to set order.
|
|
set_tally(1, 1, 10);
|
|
set_tally(2, 2, 20);
|
|
set_tally(3, 3, 30);
|
|
set_tally(4, 100, 0);
|
|
println!("Agenda #6: {:?}", pallet_scheduler::Agenda::<Test>::get(6));
|
|
run_to(6);
|
|
println!("{:?}", Vec::<_>::from(TrackQueue::<Test>::get(0)));
|
|
|
|
// Cancel the first.
|
|
assert_ok!(Referenda::cancel(RuntimeOrigin::signed(4), 0));
|
|
assert_eq!(cancelled_since(0), 6);
|
|
|
|
// The other with the most approvals (#4) should be being decided.
|
|
run_to(7);
|
|
assert_eq!(DecidingCount::<Test>::get(0), 1);
|
|
assert_eq!(deciding_since(4), 7);
|
|
assert_eq!(confirming_until(4), 9);
|
|
|
|
// Vote on the remaining two to change order.
|
|
println!("Set tally #1");
|
|
set_tally(1, 30, 31);
|
|
println!("{:?}", Vec::<_>::from(TrackQueue::<Test>::get(0)));
|
|
println!("Set tally #2");
|
|
set_tally(2, 20, 20);
|
|
println!("{:?}", Vec::<_>::from(TrackQueue::<Test>::get(0)));
|
|
|
|
// Let confirmation period end.
|
|
run_to(9);
|
|
|
|
// #4 should have been confirmed.
|
|
assert_eq!(approved_since(4), 9);
|
|
|
|
// On to the next block to select the new referendum
|
|
run_to(10);
|
|
// #1 (the one with the most approvals) should now be being decided.
|
|
assert_eq!(deciding_since(1), 10);
|
|
|
|
// Let it end unsuccessfully.
|
|
run_to(14);
|
|
assert_eq!(rejected_since(1), 14);
|
|
|
|
// Service queue.
|
|
run_to(15);
|
|
// #2 should now be being decided. It will (barely) pass.
|
|
assert_eq!(deciding_and_failing_since(2), 15);
|
|
|
|
// #2 moves into confirming at the last moment with a 50% approval.
|
|
run_to(19);
|
|
assert_eq!(confirming_until(2), 21);
|
|
|
|
// #2 gets approved.
|
|
run_to(21);
|
|
assert_eq!(approved_since(2), 21);
|
|
|
|
// The final one has since timed out.
|
|
run_to(22);
|
|
assert_eq!(timed_out_since(3), 22);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn auto_timeout_should_happen_with_nothing_but_submit() {
|
|
new_test_ext().execute_with(|| {
|
|
// #1: submit
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
set_balance_proposal_bounded(1),
|
|
DispatchTime::At(20),
|
|
));
|
|
run_to(20);
|
|
assert_matches!(ReferendumInfoFor::<Test>::get(0), Some(ReferendumInfo::Ongoing(..)));
|
|
run_to(21);
|
|
// #11: Timed out - ended.
|
|
assert_matches!(
|
|
ReferendumInfoFor::<Test>::get(0),
|
|
Some(ReferendumInfo::TimedOut(21, _, None))
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn tracks_are_distinguished() {
|
|
new_test_ext().execute_with(|| {
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
set_balance_proposal_bounded(1),
|
|
DispatchTime::At(10),
|
|
));
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(2),
|
|
Box::new(RawOrigin::None.into()),
|
|
set_balance_proposal_bounded(2),
|
|
DispatchTime::At(20),
|
|
));
|
|
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(3), 0));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(4), 1));
|
|
|
|
let mut i = ReferendumInfoFor::<Test>::iter().collect::<Vec<_>>();
|
|
i.sort_by_key(|x| x.0);
|
|
assert_eq!(
|
|
i,
|
|
vec![
|
|
(
|
|
0,
|
|
ReferendumInfo::Ongoing(ReferendumStatus {
|
|
track: 0,
|
|
origin: OriginCaller::system(RawOrigin::Root),
|
|
proposal: set_balance_proposal_bounded(1),
|
|
enactment: DispatchTime::At(10),
|
|
submitted: 1,
|
|
submission_deposit: Deposit { who: 1, amount: 2 },
|
|
decision_deposit: Some(Deposit { who: 3, amount: 10 }),
|
|
deciding: None,
|
|
tally: Tally { ayes: 0, nays: 0 },
|
|
in_queue: false,
|
|
alarm: Some((5, (5, 0))),
|
|
})
|
|
),
|
|
(
|
|
1,
|
|
ReferendumInfo::Ongoing(ReferendumStatus {
|
|
track: 1,
|
|
origin: OriginCaller::system(RawOrigin::None),
|
|
proposal: set_balance_proposal_bounded(2),
|
|
enactment: DispatchTime::At(20),
|
|
submitted: 1,
|
|
submission_deposit: Deposit { who: 2, amount: 2 },
|
|
decision_deposit: Some(Deposit { who: 4, amount: 1 }),
|
|
deciding: None,
|
|
tally: Tally { ayes: 0, nays: 0 },
|
|
in_queue: false,
|
|
alarm: Some((3, (3, 0))),
|
|
})
|
|
),
|
|
]
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn submit_errors_work() {
|
|
new_test_ext().execute_with(|| {
|
|
let h = set_balance_proposal_bounded(1);
|
|
// No track for Signed origins.
|
|
assert_noop!(
|
|
Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Signed(2).into()),
|
|
h.clone(),
|
|
DispatchTime::At(10),
|
|
),
|
|
Error::<Test>::NoTrack
|
|
);
|
|
|
|
// No funds for deposit
|
|
assert_noop!(
|
|
Referenda::submit(
|
|
RuntimeOrigin::signed(10),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
),
|
|
BalancesError::<Test>::InsufficientBalance
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn decision_deposit_errors_work() {
|
|
new_test_ext().execute_with(|| {
|
|
let e = Error::<Test>::NotOngoing;
|
|
assert_noop!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0), e);
|
|
|
|
let h = set_balance_proposal_bounded(1);
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
));
|
|
let e = BalancesError::<Test>::InsufficientBalance;
|
|
assert_noop!(Referenda::place_decision_deposit(RuntimeOrigin::signed(10), 0), e);
|
|
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
let e = Error::<Test>::HasDeposit;
|
|
assert_noop!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0), e);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn refund_deposit_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let e = Error::<Test>::BadReferendum;
|
|
assert_noop!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(1), 0), e);
|
|
|
|
let h = set_balance_proposal_bounded(1);
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
));
|
|
let e = Error::<Test>::NoDeposit;
|
|
assert_noop!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(2), 0), e);
|
|
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
let e = Error::<Test>::Unfinished;
|
|
assert_noop!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(3), 0), e);
|
|
|
|
run_to(11);
|
|
assert_ok!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(3), 0));
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn cancel_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let h = set_balance_proposal_bounded(1);
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
|
|
run_to(8);
|
|
assert_ok!(Referenda::cancel(RuntimeOrigin::signed(4), 0));
|
|
assert_ok!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(3), 0));
|
|
assert_eq!(cancelled_since(0), 8);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn cancel_errors_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let h = set_balance_proposal_bounded(1);
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
assert_noop!(Referenda::cancel(RuntimeOrigin::signed(1), 0), BadOrigin);
|
|
|
|
run_to(11);
|
|
assert_noop!(Referenda::cancel(RuntimeOrigin::signed(4), 0), Error::<Test>::NotOngoing);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn kill_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let h = set_balance_proposal_bounded(1);
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
|
|
run_to(8);
|
|
assert_ok!(Referenda::kill(RuntimeOrigin::root(), 0));
|
|
let e = Error::<Test>::NoDeposit;
|
|
assert_noop!(Referenda::refund_decision_deposit(RuntimeOrigin::signed(3), 0), e);
|
|
assert_eq!(killed_since(0), 8);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn kill_errors_works() {
|
|
new_test_ext().execute_with(|| {
|
|
let h = set_balance_proposal_bounded(1);
|
|
assert_ok!(Referenda::submit(
|
|
RuntimeOrigin::signed(1),
|
|
Box::new(RawOrigin::Root.into()),
|
|
h,
|
|
DispatchTime::At(10),
|
|
));
|
|
assert_ok!(Referenda::place_decision_deposit(RuntimeOrigin::signed(2), 0));
|
|
assert_noop!(Referenda::kill(RuntimeOrigin::signed(4), 0), BadOrigin);
|
|
|
|
run_to(11);
|
|
assert_noop!(Referenda::kill(RuntimeOrigin::root(), 0), Error::<Test>::NotOngoing);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn set_balance_proposal_is_correctly_filtered_out() {
|
|
for i in 0..10 {
|
|
let call = crate::mock::RuntimeCall::decode(&mut &set_balance_proposal(i)[..]).unwrap();
|
|
assert!(!<Test as frame_system::Config>::BaseCallFilter::contains(&call));
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn curve_handles_all_inputs() {
|
|
let test_curve = Curve::LinearDecreasing {
|
|
length: Perbill::one(),
|
|
floor: Perbill::zero(),
|
|
ceil: Perbill::from_percent(100),
|
|
};
|
|
|
|
let delay = test_curve.delay(Perbill::zero());
|
|
assert_eq!(delay, Perbill::one());
|
|
|
|
let threshold = test_curve.threshold(Perbill::one());
|
|
assert_eq!(threshold, Perbill::zero());
|
|
}
|