table_branch_decisions.hpp

См. документацию.

#pragma once
 
#include <algorithm>
#include <eosio/eosio.hpp>
#include <string>
#include <vector>
 
#include "../consts.hpp"
#include "document_core.hpp"
 
static constexpr uint64_t MIN_DECISION_QUORUM = 3;
 
static constexpr uint32_t DECISION_VOTING_WINDOW_SECONDS = 15 * 60;
 
struct decision_point {
  std::string title;     
  std::string decision;  
  std::string context;   
};
 
struct decision_vote_point {
  uint64_t question_id;  
  eosio::name vote;      
};
 
struct [[eosio::table, eosio::contract(BRANCH)]] coodecision {
  uint64_t id;                            
  eosio::checksum256 hash;                
  eosio::name coopname;                   
  eosio::name type;                       
  eosio::name initiator;                  
  eosio::name chairman;                   
  eosio::name status;                     
 
  document2 proposal;                     
  document2 protocol;                     
  document2 petition;                     
  document2 liability;                    
  document2 authority;                     
  document2 authorization;                
 
  eosio::time_point_sec open_at;          
  eosio::time_point_sec close_at;         
  uint64_t signed_ballots;                
 
  eosio::name braname;                    
  std::string address;                    
 
  std::vector<eosio::name> participants;  
  eosio::time_point_sec created_at;       
  // Место и время проведения собрания НЕ публикуются в блокчейн —
  // это приватные данные пайщиков, живут в БД платформы (composite db-слой).
 
  uint64_t primary_key() const { return id; }
  eosio::checksum256 by_hash() const { return hash; }
 
  bool is_participant(const eosio::name &username) const {
    return std::find(participants.begin(), participants.end(), username) != participants.end();
  }
};
 
typedef eosio::multi_index<
    "decisions"_n, coodecision,
    eosio::indexed_by<"byhash"_n, eosio::const_mem_fun<coodecision, eosio::checksum256, &coodecision::by_hash>>>
    decision_index;
 
struct [[eosio::table, eosio::contract(BRANCH)]] coodecquest {
  uint64_t id;                                 
  uint64_t decision_id;                        
  uint64_t number;                             
  eosio::name coopname;                        
 
  std::string title;                           
  std::string decision;                        
  std::string context;                         
 
  uint64_t counter_votes_for;                  
  uint64_t counter_votes_against;              
  uint64_t counter_votes_abstained;            
 
  std::vector<eosio::name> voters_for;         
  std::vector<eosio::name> voters_against;     
  std::vector<eosio::name> voters_abstained;   
 
  uint64_t primary_key() const { return id; }
  uint64_t by_decision() const { return decision_id; }
};
 
typedef eosio::multi_index<
    "decisionq"_n, coodecquest,
    eosio::indexed_by<"bydecision"_n, eosio::const_mem_fun<coodecquest, uint64_t, &coodecquest::by_decision>>>
    coodecquest_index;
 
inline coodecision get_decision_or_fail(eosio::name coopname, eosio::checksum256 hash) {
  decision_index decisions(_branch, coopname.value);
  auto idx = decisions.get_index<"byhash"_n>();
  auto itr = idx.find(hash);
  eosio::check(itr != idx.end(), "Решение собрания не найдено");
  return *itr;
}
 
inline void erase_coodecquests(eosio::name coopname, uint64_t decision_id) {
  coodecquest_index questions(_branch, coopname.value);
  auto by_dec = questions.get_index<"bydecision"_n>();
  auto itr = by_dec.lower_bound(decision_id);
  while (itr != by_dec.end() && itr->decision_id == decision_id) {
    itr = by_dec.erase(itr);
  }
}