Struct Actions 

pub struct Actions<T: Caller> {
    pub caller: T,
}

Fields

caller: T

Implementations

impl<T: Caller> Actions<T>

pub fn gmp( &self, population: u32, allowed_groups: Vec<u32>, ) -> T::ReturnType<Option<Vec<u32>>>

This action runs an algorithm that could be called, “greatest minimum partition”.

It returns a vector of subgroupings that sum to the total population, where each subgrouping has a size that is allowed by the allowed_groups parameter, and with a grouping preference that maximizes the size of the smallest subgroup.

For example, with a population of size 10, and allowed_groups = [4,5,6], one valid way to construct groups would be: [4, 6]. But the optimal way according to this algorithm would be: [5,5]. This is because the minimum partition in the first case is 4, and in the second case it is 5, and this algorithm tries to find the greatest minimum partition.

Parameters:

• population - The total population to partition
• allowed_groups - A vector of allowed group sizes

Returns:

• Some(Vec<u32>) - A valid partition of the population into allowed group sizes.
• None - No valid partition exists

Trait Implementations

impl<T: Clone + Caller> Clone for Actions<T>

fn clone(&self) -> Actions<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Caller> Debug for Actions<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Caller> From<T> for Actions<T>

fn from(caller: T) -> Self

Converts to this type from the input type.

impl<T: Caller> ToActionsSchema for Actions<T>

fn to_schema( builder: &mut SchemaBuilder, ) -> IndexMap<MethodString, FunctionType>