https://github.com/ITensor/ITensor
Tip revision: 127526447e9a22be1b847ff5703fd80b055e0941 authored by Miles Stoudenmire on 07 July 2016, 15:45:24 UTC
Made SiteSet operator string parsing recursive, now supports "A*B*C*D*..."
Made SiteSet operator string parsing recursive, now supports "A*B*C*D*..."
Tip revision: 1275264
iqindex.h
//
// Distributed under the ITensor Library License, Version 1.1.
// (See accompanying LICENSE file.)
//
#ifndef __ITENSOR_IQINDEX_H
#define __ITENSOR_IQINDEX_H
#include "itensor/itensor.h"
#include "itensor/qn.h"
namespace itensor {
// Forward declarations
class IndexQN;
class IQIndexDat;
class IQIndexVal;
using IQIndexDatPtr = shared_ptr<IQIndexDat>;
//
// IQIndex
//
class IQIndex : public Index
{
public:
//
//Constructors
//
IQIndex();
IQIndex(const std::string& name,
const Index& i1, const QN& q1,
Arrow dir = Out);
IQIndex(const std::string& name,
const Index& i1, const QN& q1,
const Index& i2, const QN& q2,
Arrow dir = Out);
IQIndex(const std::string& name,
const Index& i1, const QN& q1,
const Index& i2, const QN& q2,
const Index& i3, const QN& q3,
Arrow dir = Out);
IQIndex(const std::string& name,
const Index& i1, const QN& q1,
const Index& i2, const QN& q2,
const Index& i3, const QN& q3,
const Index& i4, const QN& q4,
Arrow dir = Out);
IQIndex(const std::string& name,
const Index& i1, const QN& q1,
const Index& i2, const QN& q2,
const Index& i3, const QN& q3,
const Index& i4, const QN& q4,
const Index& i5, const QN& q5,
Arrow dir = Out);
IQIndex(const std::string& name,
const Index& i1, const QN& q1,
const Index& i2, const QN& q2,
const Index& i3, const QN& q3,
const Index& i4, const QN& q4,
const Index& i5, const QN& q5,
const Index& i6, const QN& q6,
Arrow dir = Out);
IQIndex(const std::string& name,
std::vector<IndexQN>& ind_qn,
Arrow dir = Out,
int plev = 0);
//
//Accessor Methods
//
using Storage = std::vector<IndexQN>;
const Storage&
indices() const;
int
nindex() const;
const Index&
index(int i) const;
const Index&
operator[](int i) const;
const QN&
qn(int i) const;
Arrow
dir() const { return dir_; }
void
dir(Arrow ndir) { dir_ = ndir; }
int
primeLevel() const { return Index::primeLevel(); }
IQIndex&
primeLevel(int val);
//
// Prime level methods
//
IQIndex&
prime(int inc = 1);
IQIndex&
prime(IndexType type, int inc = 1);
IQIndex&
noprime(IndexType type = All);
IQIndex&
mapprime(int plevold, int plevnew, IndexType type = All);
//
// Operators
//
IQIndexVal
operator()(int n) const;
//
// Other methods
//
IQIndex&
dag();
void
write(std::ostream& s) const;
IQIndex&
read(std::istream& s);
//
// Static Index instances
//
static const
IQIndex& Null();
private:
/////////////
Arrow dir_;
shared_ptr<IQIndexDat> pd;
/////////////
IQIndex(const Index& index, const IQIndexDatPtr& pdat);
void
solo();
}; //class IQIndex
//
// IndexQN
//
class IndexQN : public Index
{
public:
QN qn;
IndexQN() { }
IndexQN(const Index& i, const QN& q) : Index(i), qn(q) { }
void
write(std::ostream& s) const { Index::write(s); qn.write(s); }
void
read(std::istream& s) { Index::read(s); qn.read(s); }
};
//
// IQIndexVal
//
class IQIndexVal
{
public:
//////////
IQIndex index;
int i;
//////////
IQIndexVal();
IQIndexVal(const IQIndex& iqindex, int i_);
const QN&
qn() const;
const QN&
qn(int j) const { return index.qn(j); }
bool
operator==(const IQIndexVal& other) const;
bool
operator!=(const IQIndexVal& other) const { return !operator==(other); }
explicit operator bool() const { return valid(); }
IndexQN
indexqn() const;
operator IndexVal() const;
IndexVal
blockIndexVal() const;
bool
valid() const { return index.valid(); }
int
m() const { return index.m(); }
IQIndexVal&
prime(int inc = 1);
IQIndexVal&
prime(IndexType type, int inc = 1);
IQIndexVal&
noprime(IndexType type = All);
IQIndexVal&
mapprime(int plevold, int plevnew, IndexType type = All);
IQIndexVal&
dag();
ITensor
operator*(const IndexVal& iv) const
{
return IndexVal(Index(index),i) * iv;
}
static const IQIndexVal& Null()
{
static const IQIndexVal Null_;
return Null_;
}
};
IndexQN inline
dag(IndexQN res) { res.dag(); return res; }
IQIndex inline
dag(IQIndex res) { res.dag(); return res; }
IQIndexVal inline
dag(IQIndexVal res) { res.dag(); return res; }
bool
hasindex(const IQIndex& I, const Index& i);
int
findindex(const IQIndex& I, const Index& i);
int
offset(const IQIndex& I, const Index& i);
QN
qn(const IQIndex& I, const Index& i);
Index
findByQN(const IQIndex& I, const QN& qn);
std::string
showm(const IQIndex& I);
std::ostream&
operator<<(std::ostream &o, const IQIndex &I);
std::ostream&
operator<<(std::ostream &s, const IndexQN& x);
std::ostream&
operator<<(std::ostream& s, const IQIndexVal& iv);
} //namespace itensor
#endif