pev_1_priorities.cpp File Reference

#include "libfaudes.h"

Go to the source code of this file.

Functions
int	main ()

Detailed Description

Tutorial, events stes and generators with priorities

/** @file pev_1_priorities.cpp 
 
Tutorial, events stes and generators with priorities
 
@ingroup Tutorials 
 
@include pev_1_priorities.cpp
 
*/
 
#include "libfaudes.h"
 
 
using namespace faudes;
 
 
 
int main() {
 
  ////////////////////////////////////////////////////
  // TaEventSet with Attribute AttributePriority
  ////////////////////////////////////////////////////
 
  // set up some alphabet with prioritised events
  TaEventSet<AttributePriority> prios1;
  Idx alpha= prios1.Insert("alpha");
  Idx beta=  prios1.Insert("beta");
  Idx gamma= prios1.Insert("gamma");
  AttributePriority prio;
  prio.Priority(10);
  prios1.Attribute(alpha,prio);
  prio.Priority(20);
  prios1.Attribute(beta,prio);
  prio.Priority(30);
  prios1.Attribute(gamma,prio);
  // report
  std::cout << "alphabet of priorisied events (using vanilla attributed event set)" << std::endl;
  prios1.XWrite();
 
 
  ////////////////////////////////////////////////////
  // Convenienceclass EventPriorities (fully registered faudes type)
  ////////////////////////////////////////////////////
 
  // set up some alphabet with prioritised events
  EventPriorities prios2;
  alpha= prios2.Insert("alpha");
  beta=  prios2.Insert("beta");
  gamma= prios2.Insert("gamma");
  prios2.Priority(alpha,0);     // access by index
  prios2.Priority("beta",10);   // access by symbolic name (convenience, performance penalty)
  prios2.Priority("gamma",20);  // access by symbolic name (convenience, performance penalty)  
  // report
  std::cout << "alphabet of priorisied events (using convenience class)" << std::endl;
  prios2.Write();
 
  // normalise to a consecutive range starting with 1
  prios2.NormalisePriorities();
  std::cout << "normalised priosities" << std::endl;
  prios2.Write();
  
  // stress test copy/casting/equality
  EventSet events(prios2);
  bool ok= events == prios2;
  if(ok)
    std::cout << "copy to plain alphabet: events match (PASS)" << std::endl;
  else        
    std::cout << "copy to plain alphabet: events mismatch (FAIL)" << std::endl;
  EventPriorities prios3(prios2);
  ok= prios3 == prios2;
  if(ok)
    std::cout << "copy to prio alphabet: events match (PASS)" << std::endl;
  else        
    std::cout << "copy to prio alphabet: events mismatch (FAIL)" << std::endl;
  ok= prios2.EqualAttributes(prios3);
  if(ok)
    std::cout << "copy to prio alphabet: priorities match (PASS)" << std::endl;
  else        
    std::cout << "copy to prio alphabet: priorities mismatch (FAIL)" << std::endl;
  prios3.Priority("alpha",50);
  prios3.Write();
  ok=prios2.EqualAttributes(prios3);
  if(ok)
    std::cout << "manipulate priorities: still match (FAIL)" << std::endl;
  else        
    std::cout << "manipulate priorities: mismatch (PASS)" << std::endl;
 
 
  ////////////////////////////////////////////////////
  // Fairness
  ////////////////////////////////////////////////////
 
  FairnessConstraints fconstr;
  EventSet falph1, falph2;
  falph1.FromString("<EventSet> alpha beta </EventSet>");
  falph2.FromString("<EventSet> beta gamma </EventSet>");
  fconstr.Append(falph1);
  fconstr.Append(falph2);
  fconstr.Write();
  FairnessConstraints::Position pos=fconstr.Find(falph2);
  if(pos==1) 
    std::cout << "found alph2 at " << pos << " (PASS)" << std::endl;
  else
    std::cout << "found alph2 at " << pos << " (FAIL)" << std::endl;
 
  
 
  ////////////////////////////////////////////////////
  // pGenerator
  ////////////////////////////////////////////////////
 
  pGenerator pgen;
  pgen.FromString(R"(
    <Generator>
      <T>
        1 alpha 2
        2 beta  3
        3 gamma 1
      </T>
    </Generator>
  )");
  pgen.Priorities(prios3);
  pgen.Fairness(fconstr);
  pgen.XWrite();
  
 
}

Definition in file pev_1_priorities.cpp.

Function Documentation

main()

int main

(

void

)

Definition at line 18 of file pev_1_priorities.cpp.