BasicState.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_BASIC_STATE
#define COM_DAFER45_TBTK_BASIC_STATE
 
#include "TBTK/AbstractState.h"
#include "TBTK/DefaultOperator.h"
#include "TBTK/Index.h"
#include "TBTK/IndexTree.h"
 
#include <complex>
#include <tuple>
 
namespace TBTK{
 
class BasicState : public AbstractState{
public:
    BasicState(const Index &index, const Index &unitCellIndex = {});
 
    virtual ~BasicState();
 
    virtual BasicState* clone() const;
 
    void addOverlap(
        std::complex<double> overlap,
        const Index &braIndex,
        const Index &braRelativeUnitCell = {}
    );
 
    void addMatrixElement(
        std::complex<double> matrixElement,
        const Index &bra,
        const Index &braRelativeUnitCell = {}
    );
 
    virtual std::complex<double> getOverlap(const AbstractState &bra) const;
 
    virtual std::complex<double> getMatrixElement(
        const AbstractState &bra,
        const AbstractOperator &o = DefaultOperator()
    ) const;
private:
    class Storage{
    public:
//      static constexpr unsigned int MAX_ELEMENTS_LINEAR_SEARCH = 50;
 
        std::vector<std::tuple<std::complex<double>, Index, Index>> overlaps;
 
        bool overlapsIsSorted;
 
//      IndexTree *overlapsIndexTree;
 
//      std::complex<double> *indexedOverlaps;
 
        std::vector<std::tuple<std::complex<double>, Index, Index>> matrixElements;
 
        bool matrixElementsIsSorted;
 
//      IndexTree *matrixElementsIndexTree;
 
//      std::complex<double> *indexedMatrixElements;
 
        Storage();
 
        ~Storage();
 
        void grab();
 
        bool release();
 
        void sortOverlaps();
 
        void sortMatrixElements();
    private:
        unsigned int referenceCounter;
    };
 
    Storage *storage;
};
 
inline void BasicState::Storage::grab(){
    referenceCounter++;
}
 
inline bool BasicState::Storage::release(){
    referenceCounter--;
    if(referenceCounter == 0)
        return true;
    else
        return false;
}
 
};  //End of namespace TBTK
 
#endif