TPermutation.h

Go to the documentation of this file.

// Copyright (C) 2013-2024 CEA/DES
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published
// by the Free Software Foundation, either version 3 of the License, or any
// later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.

#ifndef TPERMUTATION_H
#define TPERMUTATION_H

#include "TEventList.h"
#include "TPatternsEventList.h"
#include "TRandom.h"
#include "TTree.h"

#include "DataServer.h"

namespace URANIE
{
    namespace DataServer
    {
    class TPermutation: public TEventList
    {

    public:
        //---------------------------------------------
        TPermutation();
        TPermutation(const char *name, const char *title, Int_t initsize, Bool_t bExact=kFALSE);

        virtual ~TPermutation();

        //---------------------------------------------
        virtual void Enter(Long64_t entry);

        virtual void enter(Long64_t entry)
        {
            Enter(entry);
        }

        virtual void generatePermutation(Int_t *vecindexes, Option_t *option="");



        //---------------------------------------------

        void setSeed(Int_t ind = 0);
        Int_t getSeed()
        {
            return _nSeed;
        }

        Bool_t getExact() {
            return _bExact;
        }
        TString getArchiveName() {
            return _sArchiveName;
        }

        TTree *getExactTree() {
            return _ntdOfExact;
        }

        TTree *getSampledTree() {
            return _ntdOfSampled;
        }


        //---------------------------------------------
        void setLog()
        {
            _blog = kTRUE;
        }
        void unsetLog()
        {
            _blog = kFALSE;
        }
        void changeLog()
        {
            _blog = _blog ? kFALSE : kTRUE;
        }
        Bool_t getLog()
        {
            return _blog;
        }
        virtual void Print(Option_t *option = "") const;
        void printLog(Option_t *option = "")
        {
            Print(option);
        }


    private:
        // methods
        void fillAllPermutations();

        void generateBySwapping(Option_t *option="");

        Bool_t isPermutationAlreadyExist();

        // Attributes
    protected:
        Int_t _nSeed;                          
        Long64_t _nMaxSize;                    
        Bool_t _bExact;                        
        TString _sArchiveName;                 
        TTree *_ntdOfExact;                    
        TPatternsEventList * _pelExactMixed;   
        Long64_t _nExactIndex;                 
        TTree *_ntdOfSampled;                  
        Int_t *_vecCurrent;                    
    public:
        Bool_t _blog;          

        ClassDef(TPermutation, ID_DATASERVER)
    };

    } // End Of namespace DataServer
} // End Of namespace URANIE

#endif
// End Of File