FockStateRuleSet.h

/* Copyright 2016 Kristofer Björnson
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
 
 
#ifndef COM_DAFER45_TBTK_FOCK_STATE_RULE_SET
#define COM_DAFER45_TBTK_FOCK_STATE_RULE_SET
 
#include "TBTK/FockStateRule/FockStateRule.h"
#include "TBTK/FockStateRule/WrapperRule.h"
 
#include <vector>
 
namespace TBTK{
 
class FockStateRuleSet{
public:
    FockStateRuleSet();
 
    ~FockStateRuleSet();
 
    bool isSatisfied(
        const FockSpace<BitRegister> &fockSpace,
        const FockState<BitRegister> &fockState
    ) const;
 
    bool isSatisfied(
        const FockSpace<ExtensiveBitRegister> &fockSpace,
        const FockState<ExtensiveBitRegister> &fockState
    ) const;
 
    void addFockStateRule(const FockStateRule::WrapperRule &fockStateRule);
 
    unsigned int getSize() const;
 
    bool operator==(const FockStateRuleSet &rhs) const;
 
    friend FockStateRuleSet operator*(
        const LadderOperator<BitRegister> &ladderOperator,
        const FockStateRuleSet &fockStateRuleSet
    );
 
    friend FockStateRuleSet operator*(
        const LadderOperator<ExtensiveBitRegister> &ladderOperator,
        const FockStateRuleSet &fockStateRuleSet
    );
 
    void print() const;
private:
    std::vector<FockStateRule::WrapperRule> fockStateRules;
};
 
inline void FockStateRuleSet::addFockStateRule(
    const FockStateRule::WrapperRule &fockStateRule
){
    for(unsigned int n = 0; n < fockStateRules.size(); n++)
        if(fockStateRules.at(n) == fockStateRule)
            return;
 
    fockStateRules.push_back(fockStateRule);
}
 
inline unsigned int FockStateRuleSet::getSize() const{
    return fockStateRules.size();
}
 
inline FockStateRuleSet operator*(
    const LadderOperator<BitRegister> &ladderOperator,
    const FockStateRuleSet &fockStateRuleSet
){
    FockStateRuleSet newRuleSet;
    for(unsigned int n = 0; n < fockStateRuleSet.fockStateRules.size(); n++)
        newRuleSet.addFockStateRule(ladderOperator*fockStateRuleSet.fockStateRules.at(n));
 
    return newRuleSet;
}
 
inline FockStateRuleSet operator*(
    const LadderOperator<ExtensiveBitRegister> &ladderOperator,
    const FockStateRuleSet &fockStateRuleSet
){
    FockStateRuleSet newRuleSet;
    for(unsigned int n = 0; n < fockStateRuleSet.fockStateRules.size(); n++)
        newRuleSet.addFockStateRule(ladderOperator*fockStateRuleSet.fockStateRules.at(n));
 
    return newRuleSet;
}
 
inline void FockStateRuleSet::print() const{
    Streams::out << "FockStateRuleSet{\n";
    for(unsigned int n = 0; n < fockStateRules.size(); n++){
        if(n > 0)
            Streams::out << ",\n";
        Streams::out << "\t";
        fockStateRules.at(n).print();
    }
    Streams::out << "\n}\n";
}
 
};  //End of namespace TBTK
 
#endif