Enum DDAlgorithmType 

pub enum DDAlgorithmType {
    SingleTargetLottery,
    MultiTargetLottery,
    MultiLevelLottery,
    MultiTargetVoting,
    HierarchicalDistribution,
    SingleTargetWithCompensation,
    PokerShuffleOneTime,
    PokerShuffleSequential,
}

去中心化决策算法类型

Variants

SingleTargetLottery

单目标抽奖决策

MultiTargetLottery

多目标抽奖决策

MultiLevelLottery

多等级抽奖决策

MultiTargetVoting

多目标投票决策

HierarchicalDistribution

多等级分层分配决策

SingleTargetWithCompensation

单目标抽奖与补偿机制

PokerShuffleOneTime

扑克牌洗牌与一次性分配

PokerShuffleSequential

扑克牌洗牌与顺序多次分配

Implementations

impl DDAlgorithmType

pub fn as_str(&self) -> &'static str

将算法类型转换为字符串表示

pub fn all() -> &'static [DDAlgorithmType]

返回所有已知的算法变体

Trait Implementations

impl Clone for DDAlgorithmType

fn clone(&self) -> DDAlgorithmType

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DDAlgorithmType

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DDAlgorithmType

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl JsonSchema for DDAlgorithmType

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl KeyDeserialize for DDAlgorithmType

fn from_vec(value: Vec<u8>) -> Result<Self, StdError>

从字节向量反序列化算法类型

const KEY_ELEMS: u16 = 1u16

The number of key elements is used for the deserialization of compound keys. It should be equal to PrimaryKey::key().len()

type Output = DDAlgorithmType

fn from_slice(value: &[u8]) -> Result<Self::Output, StdError>

impl PartialEq for DDAlgorithmType

fn eq(&self, other: &DDAlgorithmType) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> PrimaryKey<'a> for DDAlgorithmType

fn key(&self) -> Vec<Key<'_>>

将算法类型转换为存储键

type Prefix = ()

These associated types need to implement Prefixer, so that they can be useful arguments for prefix(), sub_prefix(), and their key-deserializable variants.

type SubPrefix = ()

type Suffix = DDAlgorithmType

These associated types need to implement KeyDeserialize, so that they can be returned from range_de() and friends.

type SuperSuffix = DDAlgorithmType

fn joined_key(&self) -> Vec<u8>

fn joined_extra_key(&self, key: &[u8]) -> Vec<u8>

impl Serialize for DDAlgorithmType

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for DDAlgorithmType