#include<iostream>
#include<iomanip>
using namespace std;
#include "fiboqueue.h"
void FiboQueue::BouwShowListOp(FiboNode*sv91,List*sv92,int&sv93){scl3*sv94;
List*sv95;FiboNode*sv96,*sv97;sv96=sv91;do{
sv94=new scl3(sv96->Value,sv96->Mark,sv93);if(sv92->sf34()==NULL)
{sv92->sf34(sv94);sv92->sf35(sv94);}else{sv92->sf35()->sf20(sv94);
sv92->sf35(sv94);}sv97=sv96->Child;if(sv97!=NULL){if(sv92->sf20()==NULL)
{sv95=new List();sv92->sf20(sv95);}BouwShowListOp(sv97,sv92->sf20(),sv93);}
sv96=sv96->Right;sv93++;}while(sv96!=sv91);sv93--;}
void FiboQueue::ShowList(List*sv98){List*sv92;scl3*sv94;int sv93,sv99;sv92=sv98;
do{sv94=sv92->sf34();sv93=0;do{sv99=sv94->sf33();while(sv93<sv99-1)
{cout<<"     ";sv93++;}cout<<setw(4)<<sv94->Value();if(sv94->Mark())cout<<'*';
else cout<<' ';sv93++;sv94=sv94->sf20();}while(sv94!=NULL);cout<<'\n';
sv92=sv92->sf20();}while(sv92!=NULL);}void FiboQueue::Show(){List*sv100;
int sv93;cout<<"De Fibonacci rij ziet er als volgt uit:\n";if(!IsEmpty())
{sv100=new List();sv93=1;BouwShowListOp(Min,sv100,sv93);ShowList(sv100);
delete sv100;}}