IndexTreeGenerator.h

/* Copyright 2019 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_PROPERTY_EXTRACTOR_INDEX_TREE_GENERATOR
#define COM_DAFER45_TBTK_PROPERTY_EXTRACTOR_INDEX_TREE_GENERATOR
 
#include "TBTK/Index.h"
#include "TBTK/Property/AbstractProperty.h"
#include "TBTK/Property/Density.h"
#include "TBTK/Property/DOS.h"
#include "TBTK/Property/LDOS.h"
#include "TBTK/Property/Magnetization.h"
#include "TBTK/Property/SpinPolarizedLDOS.h"
 
#include <complex>
//#include <initializer_list>
 
namespace TBTK{
namespace PropertyExtractor{
 
class IndexTreeGenerator{
public:
    IndexTreeGenerator(const Model &model);
 
    IndexTree generateAllIndices(const std::vector<Index> &patterns) const;
 
    IndexTree generateMemoryLayout(const std::vector<Index> &patterns) const;
private:
    const Model &model;
 
    IndexTree generate(
        const std::vector<Index> &patterns,
        bool keepSummationWildcard
    ) const;
};
 
inline IndexTree IndexTreeGenerator::generateAllIndices(
    const std::vector<Index> &patterns
) const{
    return generate(patterns, false);
}
 
inline IndexTree IndexTreeGenerator::generateMemoryLayout(
    const std::vector<Index> &patterns
) const{
    return generate(patterns, true);
}
 
};  //End of namespace PropertyExtractor
};  //End of namespace TBTK
 
#endif