Reference

Summary

MembersDescriptions
namespace alps
namespace alps::detail
namespace alps::graph
namespace boost
class alps::hypercubic_lattice::cell_iterator
class alps::hypercubic_lattice::momentum_iterator

namespace alps

Summary

MembersDescriptions
public template<>
inline std::pair< typename coordinate_traits](#da/d24/structalps_1_1coordinate__traits)< C >::iterator, typename [coordinate_traits< C >::iterator > coordinates(C & c)
public template<>
inline std::pair< T *, T * > coordinates(std::valarray< T > & c)
public template<>
inline std::pair< const T *, const T * > coordinates(const std::valarray< T > & c)
public template<>
std::string coordinate_to_string(const C & c,int precision)
public template<>
inline dimensional_traits< std::vector< T, A > >::dimension_type dimension(const std::vector< T, A > & d)
public template<>
void disorder_vertices(G & g,MAP & type)
public template<>
void disorder_edges(G & g,MAP & type)
public template<>
void disorder_bonds(G & g,MAP & type)
public template<>
void disorder_sites(G & g,MAP & t)
public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::InhomogeneityDescriptor & l)
public inline std::ostream & operator<<(std::ostream & out,const alps::InhomogeneityDescriptor & l)
public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::DepletionDescriptor & l)
public inline std::ostream & operator<<(std::ostream & out,const alps::DepletionDescriptor & l)
public template<>
inline void write_graph_xml(oxstream & out,const GRAPH & g,const std::string & n)
public template<>
inline std::string read_graph_xml(std::istream & in,GRAPH & g)
public template<>
inline std::string read_graph_xml(const XMLTag & intag,std::istream & p,GRAPH & g)
public template<>
inline void copy_property(PROPERTY,const SRC & s,const SRCREF & sr,DST & d,DSTREF & dr)
public template<>
inline void copy_property(PROPERTY,const SRC & s,DST & d)
public template<>
inline void copy_graph(const SRC & src,DST & dst)
public template<>
inline int constant_degree(const G & g)
public template<>
inline std::size_t maximum_edge_type(const G & g)
public template<>
inline std::size_t maximum_vertex_type(const G & g)
public template<>
void throw_if_xyz_defined(const Parameters & p,const G & graph)
public template<>
Parameters coordinate_as_parameter(const G & graph,const typename boost::graph_traits< G >::vertex_descriptor & source,const typename boost::graph_traits< G >::vertex_descriptor & target)
public template<>
Parameters coordinate_as_parameter(const G & graph,const typename boost::graph_traits< G >::edge_descriptor & edge)
public template<>
Parameters coordinate_as_parameter(const G & graph,const typename boost::graph_traits< G >::vertex_descriptor & vertex)
public template<>
std::string site_label(G const & g,typename graph_traits< G >::site_descriptor const & v,int precision)
public template<>
std::vector< std::string > site_labels(G const & g,int precision)
public template<>
std::string bond_label(G const & g,typename graph_traits< G >::bond_descriptor const & e,int precision)
public template<>
std::vector< std::string > bond_labels(G const & g,int precision)
public template<>
inline std::size_t dimension(const hypercubic_lattice< BASE, EX > & l)
public template<>
inline const lattice_traits< Lattice >::unit_cell_type & unit_cell(const Lattice & l)
public template<>
inline lattice_traits< Lattice >::cell_descriptor cell(const typename lattice_traits< Lattice >::offset_type & o,const Lattice & l)
public template<>
inline const lattice_traits< Lattice >::offset_type & offset(const typename lattice_traits< Lattice >::cell_descriptor & c,const Lattice &)
public template<>
inline lattice_traits< Lattice >::size_type volume(const Lattice & l)
public template<>
inline bool on_lattice(const typename lattice_traits< Lattice >::offset_type & o,const Lattice & l)
public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::cell_iterator, typename [lattice_traits< Lattice >::cell_iterator > cells(const Lattice & l)
public template<>
inline std::pair< bool, typename lattice_traits< Lattice >::boundary_crossing_type > shift(typename lattice_traits< Lattice >::offset_type & o,const typename lattice_traits< Lattice >::offset_type & s,const Lattice & l)
public template<>
inline lattice_traits< Lattice >::size_type index(const typename lattice_traits< Lattice >::cell_descriptor & c,const Lattice & l)
public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::basis_vector_iterator, typename [lattice_traits< Lattice >::basis_vector_iterator > basis_vectors(const Lattice & l)
public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::basis_vector_iterator, typename [lattice_traits< Lattice >::basis_vector_iterator > reciprocal_basis_vectors(const Lattice & l)
public template<>
inline lattice_traits< Lattice >::vector_type coordinate(const typename lattice_traits< Lattice >::cell_descriptor & c,const typename lattice_traits< Lattice >::vector_type & p,const Lattice & l)
public template<>
inline lattice_traits< Lattice >::vector_type origin(const typename lattice_traits< Lattice >::cell_descriptor & c,const Lattice & l)
public void ALPS_DECL prevent_optimization()
public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::momentum_iterator, typename [lattice_traits< Lattice >::momentum_iterator > momenta(const Lattice & l)
public template<>
inline lattice_traits< Lattice >::vector_type momentum(const typename lattice_traits< Lattice >::vector_type & m,const Lattice & l)
public template<>
inline lattice_traits< Lattice >::extent_type extent(const Lattice & l)
public template<>
inline element_type< typenamelattice_traits< Lattice >::extent_type >::type extent(const Lattice & l,unsigned int d)
public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [LatticeDescriptor>::dimension_typedimension(const LatticeDescriptor & c)
public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [FiniteLatticeDescriptor>::dimension_typedimension(const FiniteLatticeDescriptor & c)
public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::LatticeDescriptor & l)
public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::FiniteLatticeDescriptor & l)
public inline std::ostream & operator<<(std::ostream & out,const alps::LatticeDescriptor & l)
public inline std::ostream & operator<<(std::ostream & out,const alps::FiniteLatticeDescriptor & l)
public template<>
inline void make_graph_from_lattice(GRAPH & g,const LATTICE & l,DepletionDescriptor depl_desc)
public template<>
std::size_t dimension(const lattice_graph< L, G > & l)
public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::LatticeGraphDescriptor & l)
public inline std::ostream & operator<<(std::ostream & out,const alps::LatticeGraphDescriptor & l)
public inline alps::oxstream & operator<<(alps::oxstream & xml,const alps::LatticeLibrary & l)
public inline std::ostream & operator<<(std::ostream & os,const alps::LatticeLibrary & l)
public inline std::istream & operator>>(std::istream & is,alps::LatticeLibrary & l)
public template<>
bool set_parity(Graph & g,alps::Parameters const & p,Parity)
public template<>
bool set_parity(Graph & g,alps::Parameters const & p)
public template<>
bool set_parity(Graph & g)
public template<>
inline property_map< P, G, V >::type get_or_default(P p,G & g,const V & v)
public template<>
inline simple_cell< UnitCell, Offset >::dimension_type dimension(const simple_cell< UnitCell, Offset > & c)
public template<>
inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [simple_lattice< U, C > >::dimension_type dimension(const simple_lattice< U, C > & l)
public template<>
simple_lattice< UnitCell, Cell >::unit_cell_type & unit_cell(simple_lattice< UnitCell, Cell > & l)
public template<>
const simple_lattice< UnitCell, Cell >::unit_cell_type & unit_cell(const simple_lattice< UnitCell, Cell > & l)
public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [EmptyUnitCell>::dimension_typedimension(const EmptyUnitCell & c)
public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [GraphUnitCell>::dimension_typedimension(const GraphUnitCell & c)
public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::GraphUnitCell & u)
public inline std::ostream & operator<<(std::ostream & out,const alps::GraphUnitCell & u)
class alps::coordinate_lattice
class alps::Depletion
class alps::DepletionDescriptor
class alps::EmptyUnitCell
class alps::FiniteLatticeDescriptor
class alps::graph_helper
class alps::GraphUnitCell
class alps::hypercubic_lattice
class alps::InhomogeneityDescriptor
class alps::lattice_graph
class alps::LatticeDescriptor
class alps::LatticeGraphDescriptor
class alps::LatticeLibrary
class alps::simple_cell
class alps::simple_lattice
class alps::singleton_property_map
struct alps::bond_descriptor_compare
struct alps::bond_descriptor_compare_undirected
struct alps::boundary_crossing
struct alps::boundary_crossing_t
struct alps::cell_traits
struct alps::coordinate_t
struct alps::coordinate_traits
struct alps::coordinate_traits< const C >
struct alps::coordinate_traits< std::valarray< T > >
struct alps::coordinate_traits< T[sz]>
struct alps::copy_property_helper
struct alps::copy_property_helper< SRC, DST, PROPERTY, true >
struct alps::dimension_t
struct alps::dimensional_traits
struct alps::edge_type_t
struct alps::edge_vector_relative_t
struct alps::edge_vector_t
struct alps::graph_name_t
struct alps::graph_traits
struct alps::graph_traits< lattice_graph< L, G > >
struct alps::has_property
struct alps::has_property< P, boost::adjacency_list< s1, s2, s3, VP, EP, GP, s4 >, D >
struct alps::has_property< P, const boost::adjacency_list< s1, s2, s3, VP, EP, GP, s4 >, D >
struct alps::lattice_traits
struct alps::lattice_traits< coordinate_lattice< B, V > >
struct alps::lattice_traits< hypercubic_lattice< BASE, EX > >
struct alps::lattice_traits< lattice_graph< L, G > >
struct alps::lattice_traits< LatticeGraphDescriptor >
struct alps::lattice_traits< simple_lattice< U, C > >
struct alps::parity_t
struct alps::parity_traits
struct alps::parity_traits< parity_t, Graph >
struct alps::point_traits
struct alps::property_map
struct alps::property_map< P, const G, Default >
struct alps::source_offset_t
struct alps::target_offset_t
struct alps::vertex_type_t

Members

public template<>
inline std::pair< typename coordinate_traits](#da/d24/structalps_1_1coordinate__traits)< C >::iterator, typename [coordinate_traits< C >::iterator > coordinates(C & c)

public template<>
inline std::pair< T *, T * > coordinates(std::valarray< T > & c)

public template<>
inline std::pair< const T *, const T * > coordinates(const std::valarray< T > & c)

public template<>
std::string coordinate_to_string(const C & c,int precision)

public template<>
inline dimensional_traits< std::vector< T, A > >::dimension_type dimension(const std::vector< T, A > & d)

public template<>
void disorder_vertices(G & g,MAP & type)

public template<>
void disorder_edges(G & g,MAP & type)

public template<>
void disorder_bonds(G & g,MAP & type)

public template<>
void disorder_sites(G & g,MAP & t)

public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::InhomogeneityDescriptor & l)

public inline std::ostream & operator<<(std::ostream & out,const alps::InhomogeneityDescriptor & l)

public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::DepletionDescriptor & l)

public inline std::ostream & operator<<(std::ostream & out,const alps::DepletionDescriptor & l)

public template<>
inline void write_graph_xml(oxstream & out,const GRAPH & g,const std::string & n)

public template<>
inline std::string read_graph_xml(std::istream & in,GRAPH & g)

public template<>
inline std::string read_graph_xml(const XMLTag & intag,std::istream & p,GRAPH & g)

public template<>
inline void copy_property(PROPERTY,const SRC & s,const SRCREF & sr,DST & d,DSTREF & dr)

public template<>
inline void copy_property(PROPERTY,const SRC & s,DST & d)

public template<>
inline void copy_graph(const SRC & src,DST & dst)

public template<>
inline int constant_degree(const G & g)

public template<>
inline std::size_t maximum_edge_type(const G & g)

public template<>
inline std::size_t maximum_vertex_type(const G & g)

public template<>
void throw_if_xyz_defined(const Parameters & p,const G & graph)

public template<>
Parameters coordinate_as_parameter(const G & graph,const typename boost::graph_traits< G >::vertex_descriptor & source,const typename boost::graph_traits< G >::vertex_descriptor & target)

public template<>
Parameters coordinate_as_parameter(const G & graph,const typename boost::graph_traits< G >::edge_descriptor & edge)

public template<>
Parameters coordinate_as_parameter(const G & graph,const typename boost::graph_traits< G >::vertex_descriptor & vertex)

public template<>
std::string site_label(G const & g,typename graph_traits< G >::site_descriptor const & v,int precision)

public template<>
std::vector< std::string > site_labels(G const & g,int precision)

public template<>
std::string bond_label(G const & g,typename graph_traits< G >::bond_descriptor const & e,int precision)

public template<>
std::vector< std::string > bond_labels(G const & g,int precision)

public template<>
inline std::size_t dimension(const hypercubic_lattice< BASE, EX > & l)

public template<>
inline const lattice_traits< Lattice >::unit_cell_type & unit_cell(const Lattice & l)

public template<>
inline lattice_traits< Lattice >::cell_descriptor cell(const typename lattice_traits< Lattice >::offset_type & o,const Lattice & l)

public template<>
inline const lattice_traits< Lattice >::offset_type & offset(const typename lattice_traits< Lattice >::cell_descriptor & c,const Lattice &)

public template<>
inline lattice_traits< Lattice >::size_type volume(const Lattice & l)

public template<>
inline bool on_lattice(const typename lattice_traits< Lattice >::offset_type & o,const Lattice & l)

public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::cell_iterator, typename [lattice_traits< Lattice >::cell_iterator > cells(const Lattice & l)

public template<>
inline std::pair< bool, typename lattice_traits< Lattice >::boundary_crossing_type > shift(typename lattice_traits< Lattice >::offset_type & o,const typename lattice_traits< Lattice >::offset_type & s,const Lattice & l)

public template<>
inline lattice_traits< Lattice >::size_type index(const typename lattice_traits< Lattice >::cell_descriptor & c,const Lattice & l)

public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::basis_vector_iterator, typename [lattice_traits< Lattice >::basis_vector_iterator > basis_vectors(const Lattice & l)

public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::basis_vector_iterator, typename [lattice_traits< Lattice >::basis_vector_iterator > reciprocal_basis_vectors(const Lattice & l)

public template<>
inline lattice_traits< Lattice >::vector_type coordinate(const typename lattice_traits< Lattice >::cell_descriptor & c,const typename lattice_traits< Lattice >::vector_type & p,const Lattice & l)

public template<>
inline lattice_traits< Lattice >::vector_type origin(const typename lattice_traits< Lattice >::cell_descriptor & c,const Lattice & l)

public void ALPS_DECL prevent_optimization()

public template<>
inline std::pair< typename lattice_traits](#d5/d83/structalps_1_1lattice__traits)< Lattice >::momentum_iterator, typename [lattice_traits< Lattice >::momentum_iterator > momenta(const Lattice & l)

public template<>
inline lattice_traits< Lattice >::vector_type momentum(const typename lattice_traits< Lattice >::vector_type & m,const Lattice & l)

public template<>
inline lattice_traits< Lattice >::extent_type extent(const Lattice & l)

public template<>
inline element_type< typenamelattice_traits< Lattice >::extent_type >::type extent(const Lattice & l,unsigned int d)

public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [LatticeDescriptor>::dimension_typedimension(const LatticeDescriptor & c)

public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [FiniteLatticeDescriptor>::dimension_typedimension(const FiniteLatticeDescriptor & c)

public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::LatticeDescriptor & l)

public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::FiniteLatticeDescriptor & l)

public inline std::ostream & operator<<(std::ostream & out,const alps::LatticeDescriptor & l)

public inline std::ostream & operator<<(std::ostream & out,const alps::FiniteLatticeDescriptor & l)

public template<>
inline void make_graph_from_lattice(GRAPH & g,const LATTICE & l,DepletionDescriptor depl_desc)

public template<>
std::size_t dimension(const lattice_graph< L, G > & l)

public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::LatticeGraphDescriptor & l)

public inline std::ostream & operator<<(std::ostream & out,const alps::LatticeGraphDescriptor & l)

public inline alps::oxstream & operator<<(alps::oxstream & xml,const alps::LatticeLibrary & l)

public inline std::ostream & operator<<(std::ostream & os,const alps::LatticeLibrary & l)

public inline std::istream & operator>>(std::istream & is,alps::LatticeLibrary & l)

public template<>
bool set_parity(Graph & g,alps::Parameters const & p,Parity)

public template<>
bool set_parity(Graph & g,alps::Parameters const & p)

public template<>
bool set_parity(Graph & g)

public template<>
inline property_map< P, G, V >::type get_or_default(P p,G & g,const V & v)

public template<>
inline simple_cell< UnitCell, Offset >::dimension_type dimension(const simple_cell< UnitCell, Offset > & c)

public template<>
inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [simple_lattice< U, C > >::dimension_type dimension(const simple_lattice< U, C > & l)

public template<>
simple_lattice< UnitCell, Cell >::unit_cell_type & unit_cell(simple_lattice< UnitCell, Cell > & l)

public template<>
const simple_lattice< UnitCell, Cell >::unit_cell_type & unit_cell(const simple_lattice< UnitCell, Cell > & l)

public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [EmptyUnitCell>::dimension_typedimension(const EmptyUnitCell & c)

public inline dimensional_traits](#d8/d28/structalps_1_1dimensional__traits)< [GraphUnitCell>::dimension_typedimension(const GraphUnitCell & c)

public inline alps::oxstream & operator<<(alps::oxstream & out,const alps::GraphUnitCell & u)

public inline std::ostream & operator<<(std::ostream & out,const alps::GraphUnitCell & u)

class alps::coordinate_lattice

class alps::coordinate_lattice
  : public alps::simple_lattice<>

Summary

MembersDescriptions
public inline coordinate_lattice()
public template<>
inline coordinate_lattice(const coordinate_lattice< B2, V2 > & l)
public template<>
inline coordinate_lattice(const unit_cell_type & u,InputIterator first,InputIterator last)
public template<>
inline coordinate_lattice(const unit_cell_type & u,InputIterator1 first1,InputIterator1 last1,InputIterator2 first2,InputIterator2 last2)
public inline coordinate_lattice(const unit_cell_type & u)
public template<>
inline const coordinate_lattice&operator=(const coordinate_lattice< B2, V2 > & l)
public inline void set_parameters(const Parameters & p)
public inline void add_basis_vector(const vector_type & v)
public inline std::size_t num_basis_vectors() const
public inline std::pair< basis_vector_iterator, basis_vector_iterator > basis_vectors() const
public inline void add_reciprocal_basis_vector(const vector_type & v)
public inline std::size_t num_reciprocal_basis_vectors() const
public inline std::pair< basis_vector_iterator, basis_vector_iterator > reciprocal_basis_vectors() const
typedef parent_lattice_type
typedef unit_cell_type
typedef offset_type
typedef cell_descriptor
typedef vector_type
typedef basis_vector_iterator

Members

public inline coordinate_lattice()

public template<>
inline coordinate_lattice(const coordinate_lattice< B2, V2 > & l)

public template<>
inline coordinate_lattice(const unit_cell_type & u,InputIterator first,InputIterator last)

public template<>
inline coordinate_lattice(const unit_cell_type & u,InputIterator1 first1,InputIterator1 last1,InputIterator2 first2,InputIterator2 last2)

public inline coordinate_lattice(const unit_cell_type & u)

public template<>
inline const coordinate_lattice&operator=(const coordinate_lattice< B2, V2 > & l)

public inline void set_parameters(const Parameters & p)

public inline void add_basis_vector(const vector_type & v)

public inline std::size_t num_basis_vectors() const

public inline std::pair< basis_vector_iterator, basis_vector_iterator > basis_vectors() const

public inline void add_reciprocal_basis_vector(const vector_type & v)

public inline std::size_t num_reciprocal_basis_vectors() const

public inline std::pair< basis_vector_iterator, basis_vector_iterator > reciprocal_basis_vectors() const

typedef parent_lattice_type

typedef unit_cell_type

typedef offset_type

typedef cell_descriptor

typedef vector_type

typedef basis_vector_iterator

class alps::Depletion

class alps::Depletion
  : public alps::DepletionDescriptor

Summary

MembersDescriptions
public Depletion(DepletionDescriptor const & depl,std::size_t num_sites)
public inline bool exists(std::size_t site) const
public inline std::size_t mapped_site(std::size_t site) const
public inline std::size_t num_sites()

Members

public Depletion(DepletionDescriptor const & depl,std::size_t num_sites)

public inline bool exists(std::size_t site) const

public inline std::size_t mapped_site(std::size_t site) const

public inline std::size_t num_sites()

class alps::DepletionDescriptor

Summary

MembersDescriptions
public boost::optional< Expression > prob
public std::string seed_name
public int seed_
public inline DepletionDescriptor()
public DepletionDescriptor(XMLTag &,std::istream &)
public void write_xml(oxstream &) const
public inline double probability() const
public void set_parameters(const Parameters & p)
public inline int seed() const

Members

public boost::optional< Expression > prob

public std::string seed_name

public int seed_

public inline DepletionDescriptor()

public DepletionDescriptor(XMLTag &,std::istream &)

public void write_xml(oxstream &) const

public inline double probability() const

public void set_parameters(const Parameters & p)

public inline int seed() const

class alps::EmptyUnitCell

Summary

MembersDescriptions
public inline EmptyUnitCell(std::size_t d)
public inline std::size_t dimension() const

Members

public inline EmptyUnitCell(std::size_t d)

public inline std::size_t dimension() const

class alps::FiniteLatticeDescriptor

class alps::FiniteLatticeDescriptor
  : public alps::hypercubic_lattice< coordinate_lattice< simple_lattice<>, std::vector< alps::StringValue > >, std::vector< alps::StringValue > >

Summary

MembersDescriptions
public FiniteLatticeDescriptor()
public FiniteLatticeDescriptor(const alps::XMLTag &,std::istream &,const LatticeMap &)
public void write_xml(oxstream &) const
public inline const std::string & name() const
public void set_parameters(const alps::Parameters &)
public inline std::size_t dimension() const
typedef base_type
typedef base_base_type
typedef unit_cell_type
typedef offset_type
typedef cell_descriptor
typedef vector_type
typedef basis_vector_iterator
typedef cell_iterator
typedef size_type

Members

public FiniteLatticeDescriptor()

public FiniteLatticeDescriptor(const alps::XMLTag &,std::istream &,const LatticeMap &)

public void write_xml(oxstream &) const

public inline const std::string & name() const

public void set_parameters(const alps::Parameters &)

public inline std::size_t dimension() const

typedef base_type

typedef base_base_type

typedef unit_cell_type

typedef offset_type

typedef cell_descriptor

typedef vector_type

typedef basis_vector_iterator

typedef cell_iterator

typedef size_type

class alps::graph_helper

class alps::graph_helper
  : public alps::LatticeLibrary

Summary

MembersDescriptions
public inline graph_helper(std::istream & in,const Parameters & p)
public inline graph_helper(const alps::Parameters & p)
public inline ~graph_helper()
public inline graph_type & graph()
public inline const graph_type & graph() const
public template<>
inline graph_traits< H >::graph_type & graph(H & g) const
public template<>
inline const graph_traits< H >::graph_type & graph(const H & g) const
public inline lattice_type&lattice()
public inline const lattice_type&lattice() const
public inline vertices_size_type num_vertices() const
public inline edges_size_type num_edges() const
public inline std::pair< vertex_iterator, vertex_iterator > vertices() const
public inline std::pair< edge_iterator, edge_iterator > edges() const
public inline degree_size_type out_degree(const vertex_descriptor & v) const
public inline degree_size_type in_degree(const vertex_descriptor & v) const
public inline degree_size_type degree(const vertex_descriptor & v) const
public inline std::pair< out_edge_iterator, out_edge_iterator > out_edges(const vertex_descriptor & v) const
public inline std::pair< in_edge_iterator, in_edge_iterator > in_edges(const vertex_descriptor & v) const
public inline std::pair< adjacency_iterator, adjacency_iterator > adjacent_vertices(const vertex_descriptor & v) const
public inline vertex_descriptor vertex(vertices_size_type i) const
public inline site_descriptor source(const bond_descriptor & b) const
public inline site_descriptor target(const bond_descriptor & b) const
public template<>
inline graph_traits< H >::vertices_size_type num_vertices(const H & g) const
public template<>
inline graph_traits< H >::edges_size_type num_edges(const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::vertex_iterator, typename [graph_traits< H >::vertex_iterator > vertices(const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::edge_iterator, typename [graph_traits< H >::edge_iterator > edges(const H & g) const
public template<>
inline graph_traits< H >::degree_size_type out_degree(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const
public template<>
inline graph_traits< H >::degree_size_type in_degree(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const
public template<>
inline graph_traits< H >::degree_size_type degree(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::out_edge_iterator, typename [graph_traits< H >::out_edge_iterator > out_edges(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::in_edge_iterator, typename [graph_traits< H >::in_edge_iterator > in_edges(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::adjacency_iterator, typename [graph_traits< H >::adjacency_iterator > adjacent_vertices(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const
public template<>
inline graph_traits< H >::vertex_descriptor vertex(typename graph_traits< H >::vertices_size_type i,const H & g) const
public template<>
inline graph_traits< H >::site_descriptor source(const typename graph_traits< H >::bond_descriptor & b,const H & g) const
public template<>
inline graph_traits< H >::site_descriptor target(const typename graph_traits< H >::bond_descriptor & b,const H & g) const
public inline sites_size_type num_sites() const
public inline bonds_size_type num_bonds() const
public inline std::pair< site_iterator, site_iterator > sites() const
public inline site_descriptor site(sites_size_type i) const
public inline std::pair< bond_iterator, bond_iterator > bonds() const
public inline bond_descriptor bond(bonds_size_type i) const
public inline neighbors_size_type num_neighbors(const site_descriptor & v) const
public inline std::pair< neighbor_bond_iterator, neighbor_bond_iterator > neighbor_bonds(const site_descriptor & v) const
public inline std::pair< neighbor_iterator, neighbor_iterator > neighbors(const site_descriptor & v) const
public inline site_descriptor neighbor(const site_descriptor & v,neighbors_size_type i) const
public template<>
inline graph_traits< H >::sites_size_type num_sites(const H & g) const
public template<>
inline graph_traits< H >::bonds_size_type num_bonds(const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::site_iterator, typename [graph_traits< H >::site_iterator > sites(const H & g) const
public template<>
inline graph_traits< H >::site_descriptor site(typename graph_traits< H >::sites_size_type i,const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::bond_iterator, typename [graph_traits< H >::bond_iterator > bonds(const H & g) const
public template<>
inline graph_traits< H >::bond_descriptor bond(typename graph_traits< H >::bonds_size_type i,const H & g) const
public template<>
inline graph_traits< H >::neighbors_size_type num_neighbors(const typename graph_traits< H >::site_descriptor & v,const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::neighbor_bond_iterator, typename [graph_traits< H >::neighbor_bond_iterator > neighbor_bonds(const typename graph_traits< H >::site_descriptor & v,const H & g) const
public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::neighbor_iterator, typename [graph_traits< H >::neighbor_iterator > neighbors(const typename graph_traits< H >::site_descriptor & v,const H & g) const
public template<>
inline graph_traits< H >::site_descriptor neighbor(const typename graph_traits< H >::site_descriptor & v,typename graph_traits< H >::neighbors_size_type i,const H & g) const
public inline double parity(const site_descriptor & v) const
public inline bool is_bipartite() const
public inline vertex_type_map_type vertex_type_map() const
public inline site_type_map_type site_type_map() const
public inline edge_type_map_type edge_type_map() const
public inline bond_type_map_type bond_type_map() const
public inline type_type vertex_type(const vertex_descriptor & v) const
public inline type_type site_type(const site_descriptor & s) const
public inline type_type edge_type(const edge_descriptor & e) const
public inline type_type bond_type(const bond_descriptor & b) const
public inline bool inhomogeneous() const
public inline bool inhomogeneous_vertices() const
public inline bool inhomogeneous_sites() const
public inline bool inhomogeneous_edges() const
public inline bool inhomogeneous_bonds() const
public inline inhomogeneous_vertex_type_map_type inhomogeneous_vertex_type_map() const
public inline inhomogeneous_site_type_map_type inhomogeneous_site_type_map() const
public inline inhomogeneous_edge_type_map_type inhomogeneous_edge_type_map() const
public inline inhomogeneous_bond_type_map_type inhomogeneous_bond_type_map() const
public inline type_type inhomogeneous_vertex_type(const vertex_descriptor & v) const
public inline type_type inhomogeneous_site_type(const site_descriptor & s) const
public inline type_type inhomogeneous_edge_type(const edge_descriptor & e) const
public inline type_type inhomogeneous_bond_type(const bond_descriptor & b) const
public inline const vector_type & coordinate(const site_descriptor & s) const
public inline std::string coordinate_string(const site_descriptor & s,int precision) const
public inline const vector_type & bond_vector(const bond_descriptor & b) const
public inline const vector_type & bond_vector_relative(const bond_descriptor & b) const
public inline std::size_t dimension() const
public inline std::pair< momentum_iterator, momentum_iterator > momenta() const
public inline void throw_if_xyz_defined(const Parameters & p,const vertex_descriptor &) const
public inline void throw_if_xyz_defined(const Parameters & p,const edge_descriptor &) const
public inline Parameters coordinate_as_parameter(const edge_descriptor & e) const
public inline Parameters coordinate_as_parameter(const vertex_descriptor & v) const
public inline size_type volume() const
public inline const unit_cell_type & unit_cell() const
public inline cell_descriptor cell(const offset_type & o) const
public inline std::pair< cell_iterator, cell_iterator > cells() const
public inline const offset_type & offset(const cell_descriptor & c) const
public inline bool on_lattice(const offset_type & o) const
public inline std::pair< bool, boundary_crossing_type > shift(offset_type & o,const offset_type & s) const
public inline size_type cell_index(const cell_descriptor & c) const
public inline size_type vertex_index(const vertex_descriptor & v) const
public inline size_type edge_index(const edge_descriptor & e) const
public inline size_type index(const cell_descriptor & c) const
public inline size_type index(const vertex_descriptor & v) const
public inline size_type index(const edge_descriptor & e) const
public inline std::pair< basis_vector_iterator, basis_vector_iterator > basis_vectors() const
public inline std::pair< basis_vector_iterator, basis_vector_iterator > reciprocal_basis_vectors() const
public inline vector_type origin(const cell_descriptor & c) const
public inline vector_type coordinate(const cell_descriptor & c,const vector_type & p) const
public inline vector_type momentum(const vector_type & m) const
public inline size_type num_distances() const
public inline std::vector< unsigned int > distance_multiplicities() const
public inline std::vector< std::string > momenta_labels(int precision) const
public inline std::vector< std::string > distance_labels(int precision) const
public inline std::string site_label(site_descriptor const & s,int precision) const
public inline std::vector< std::string > site_labels(int precision) const
public inline std::string bond_labels(bond_descriptor const & b,int precision) const
public inline std::vector< std::string > bond_labels(int precision) const
public inline size_type distance(vertex_descriptor x,vertex_descriptor y) const
public inline void calculate_distances() const
public inline std::vector< std::pair< std::complex< double >, std::vector< std::size_t > > > translations(const vector_type & k) const
public inline std::vector< int > translation_directions() const
public inline std::vector< vector_type > translation_momenta() const
typedef graph_type
typedef lattice_type
typedef vertex_iterator
typedef edge_iterator
typedef out_edge_iterator
typedef in_edge_iterator
typedef edge_descriptor
typedef vertex_descriptor
typedef vertices_size_type
typedef edges_size_type
typedef degree_size_type
typedef adjacency_iterator
typedef site_iterator
typedef bond_iterator
typedef neighbor_bond_iterator
typedef bond_descriptor
typedef site_descriptor
typedef sites_size_type
typedef bonds_size_type
typedef neighbors_size_type
typedef neighbor_iterator
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type
typedef vector_type
typedef size_type
typedef cell_iterator
typedef momentum_iterator
typedef basis_vector_iterator
typedef boundary_crossing_type
typedef edge_type_map_type
typedef bond_type_map_type
typedef vertex_type_map_type
typedef site_type_map_type
typedef inhomogeneous_vertex_type_map_type
typedef inhomogeneous_site_type_map_type
typedef inhomogeneous_edge_type_map_type
typedef inhomogeneous_bond_type_map_type

Members

public inline graph_helper(std::istream & in,const Parameters & p)

public inline graph_helper(const alps::Parameters & p)

public inline ~graph_helper()

public inline graph_type & graph()

public inline const graph_type & graph() const

public template<>
inline graph_traits< H >::graph_type & graph(H & g) const

public template<>
inline const graph_traits< H >::graph_type & graph(const H & g) const

public inline lattice_type&lattice()

public inline const lattice_type&lattice() const

public inline vertices_size_type num_vertices() const

public inline edges_size_type num_edges() const

public inline std::pair< vertex_iterator, vertex_iterator > vertices() const

public inline std::pair< edge_iterator, edge_iterator > edges() const

public inline degree_size_type out_degree(const vertex_descriptor & v) const

public inline degree_size_type in_degree(const vertex_descriptor & v) const

public inline degree_size_type degree(const vertex_descriptor & v) const

public inline std::pair< out_edge_iterator, out_edge_iterator > out_edges(const vertex_descriptor & v) const

public inline std::pair< in_edge_iterator, in_edge_iterator > in_edges(const vertex_descriptor & v) const

public inline std::pair< adjacency_iterator, adjacency_iterator > adjacent_vertices(const vertex_descriptor & v) const

public inline vertex_descriptor vertex(vertices_size_type i) const

public inline site_descriptor source(const bond_descriptor & b) const

public inline site_descriptor target(const bond_descriptor & b) const

public template<>
inline graph_traits< H >::vertices_size_type num_vertices(const H & g) const

public template<>
inline graph_traits< H >::edges_size_type num_edges(const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::vertex_iterator, typename [graph_traits< H >::vertex_iterator > vertices(const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::edge_iterator, typename [graph_traits< H >::edge_iterator > edges(const H & g) const

public template<>
inline graph_traits< H >::degree_size_type out_degree(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const

public template<>
inline graph_traits< H >::degree_size_type in_degree(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const

public template<>
inline graph_traits< H >::degree_size_type degree(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::out_edge_iterator, typename [graph_traits< H >::out_edge_iterator > out_edges(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::in_edge_iterator, typename [graph_traits< H >::in_edge_iterator > in_edges(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::adjacency_iterator, typename [graph_traits< H >::adjacency_iterator > adjacent_vertices(const typename graph_traits< H >::vertex_descriptor & v,const H & g) const

public template<>
inline graph_traits< H >::vertex_descriptor vertex(typename graph_traits< H >::vertices_size_type i,const H & g) const

public template<>
inline graph_traits< H >::site_descriptor source(const typename graph_traits< H >::bond_descriptor & b,const H & g) const

public template<>
inline graph_traits< H >::site_descriptor target(const typename graph_traits< H >::bond_descriptor & b,const H & g) const

public inline sites_size_type num_sites() const

public inline bonds_size_type num_bonds() const

public inline std::pair< site_iterator, site_iterator > sites() const

public inline site_descriptor site(sites_size_type i) const

public inline std::pair< bond_iterator, bond_iterator > bonds() const

public inline bond_descriptor bond(bonds_size_type i) const

public inline neighbors_size_type num_neighbors(const site_descriptor & v) const

public inline std::pair< neighbor_bond_iterator, neighbor_bond_iterator > neighbor_bonds(const site_descriptor & v) const

public inline std::pair< neighbor_iterator, neighbor_iterator > neighbors(const site_descriptor & v) const

public inline site_descriptor neighbor(const site_descriptor & v,neighbors_size_type i) const

public template<>
inline graph_traits< H >::sites_size_type num_sites(const H & g) const

public template<>
inline graph_traits< H >::bonds_size_type num_bonds(const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::site_iterator, typename [graph_traits< H >::site_iterator > sites(const H & g) const

public template<>
inline graph_traits< H >::site_descriptor site(typename graph_traits< H >::sites_size_type i,const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::bond_iterator, typename [graph_traits< H >::bond_iterator > bonds(const H & g) const

public template<>
inline graph_traits< H >::bond_descriptor bond(typename graph_traits< H >::bonds_size_type i,const H & g) const

public template<>
inline graph_traits< H >::neighbors_size_type num_neighbors(const typename graph_traits< H >::site_descriptor & v,const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::neighbor_bond_iterator, typename [graph_traits< H >::neighbor_bond_iterator > neighbor_bonds(const typename graph_traits< H >::site_descriptor & v,const H & g) const

public template<>
inline std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< H >::neighbor_iterator, typename [graph_traits< H >::neighbor_iterator > neighbors(const typename graph_traits< H >::site_descriptor & v,const H & g) const

public template<>
inline graph_traits< H >::site_descriptor neighbor(const typename graph_traits< H >::site_descriptor & v,typename graph_traits< H >::neighbors_size_type i,const H & g) const

public inline double parity(const site_descriptor & v) const

public inline bool is_bipartite() const

public inline vertex_type_map_type vertex_type_map() const

public inline site_type_map_type site_type_map() const

public inline edge_type_map_type edge_type_map() const

public inline bond_type_map_type bond_type_map() const

public inline type_type vertex_type(const vertex_descriptor & v) const

public inline type_type site_type(const site_descriptor & s) const

public inline type_type edge_type(const edge_descriptor & e) const

public inline type_type bond_type(const bond_descriptor & b) const

public inline bool inhomogeneous() const

public inline bool inhomogeneous_vertices() const

public inline bool inhomogeneous_sites() const

public inline bool inhomogeneous_edges() const

public inline bool inhomogeneous_bonds() const

public inline inhomogeneous_vertex_type_map_type inhomogeneous_vertex_type_map() const

public inline inhomogeneous_site_type_map_type inhomogeneous_site_type_map() const

public inline inhomogeneous_edge_type_map_type inhomogeneous_edge_type_map() const

public inline inhomogeneous_bond_type_map_type inhomogeneous_bond_type_map() const

public inline type_type inhomogeneous_vertex_type(const vertex_descriptor & v) const

public inline type_type inhomogeneous_site_type(const site_descriptor & s) const

public inline type_type inhomogeneous_edge_type(const edge_descriptor & e) const

public inline type_type inhomogeneous_bond_type(const bond_descriptor & b) const

public inline const vector_type & coordinate(const site_descriptor & s) const

public inline std::string coordinate_string(const site_descriptor & s,int precision) const

public inline const vector_type & bond_vector(const bond_descriptor & b) const

public inline const vector_type & bond_vector_relative(const bond_descriptor & b) const

public inline std::size_t dimension() const

public inline std::pair< momentum_iterator, momentum_iterator > momenta() const

public inline void throw_if_xyz_defined(const Parameters & p,const vertex_descriptor &) const

public inline void throw_if_xyz_defined(const Parameters & p,const edge_descriptor &) const

public inline Parameters coordinate_as_parameter(const edge_descriptor & e) const

public inline Parameters coordinate_as_parameter(const vertex_descriptor & v) const

public inline size_type volume() const

public inline const unit_cell_type & unit_cell() const

public inline cell_descriptor cell(const offset_type & o) const

public inline std::pair< cell_iterator, cell_iterator > cells() const

public inline const offset_type & offset(const cell_descriptor & c) const

public inline bool on_lattice(const offset_type & o) const

public inline std::pair< bool, boundary_crossing_type > shift(offset_type & o,const offset_type & s) const

public inline size_type cell_index(const cell_descriptor & c) const

public inline size_type vertex_index(const vertex_descriptor & v) const

public inline size_type edge_index(const edge_descriptor & e) const

public inline size_type index(const cell_descriptor & c) const

public inline size_type index(const vertex_descriptor & v) const

public inline size_type index(const edge_descriptor & e) const

public inline std::pair< basis_vector_iterator, basis_vector_iterator > basis_vectors() const

public inline std::pair< basis_vector_iterator, basis_vector_iterator > reciprocal_basis_vectors() const

public inline vector_type origin(const cell_descriptor & c) const

public inline vector_type coordinate(const cell_descriptor & c,const vector_type & p) const

public inline vector_type momentum(const vector_type & m) const

public inline size_type num_distances() const

public inline std::vector< unsigned int > distance_multiplicities() const

public inline std::vector< std::string > momenta_labels(int precision) const

public inline std::vector< std::string > distance_labels(int precision) const

public inline std::string site_label(site_descriptor const & s,int precision) const

public inline std::vector< std::string > site_labels(int precision) const

public inline std::string bond_labels(bond_descriptor const & b,int precision) const

public inline std::vector< std::string > bond_labels(int precision) const

public inline size_type distance(vertex_descriptor x,vertex_descriptor y) const

public inline void calculate_distances() const

public inline std::vector< std::pair< std::complex< double >, std::vector< std::size_t > > > translations(const vector_type & k) const

public inline std::vector< int > translation_directions() const

public inline std::vector< vector_type > translation_momenta() const

typedef graph_type

typedef lattice_type

typedef vertex_iterator

typedef edge_iterator

typedef out_edge_iterator

typedef in_edge_iterator

typedef edge_descriptor

typedef vertex_descriptor

typedef vertices_size_type

typedef edges_size_type

typedef degree_size_type

typedef adjacency_iterator

typedef site_iterator

typedef bond_iterator

typedef neighbor_bond_iterator

typedef bond_descriptor

typedef site_descriptor

typedef sites_size_type

typedef bonds_size_type

typedef neighbors_size_type

typedef neighbor_iterator

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

typedef vector_type

typedef size_type

typedef cell_iterator

typedef momentum_iterator

typedef basis_vector_iterator

typedef boundary_crossing_type

typedef edge_type_map_type

typedef bond_type_map_type

typedef vertex_type_map_type

typedef site_type_map_type

typedef inhomogeneous_vertex_type_map_type

typedef inhomogeneous_site_type_map_type

typedef inhomogeneous_edge_type_map_type

typedef inhomogeneous_bond_type_map_type

class alps::GraphUnitCell

Summary

MembersDescriptions
public GraphUnitCell()
public GraphUnitCell(const EmptyUnitCell & e)
public GraphUnitCell(const XMLTag &,std::istream &)
public GraphUnitCell(const std::string & name,std::size_t dim)
public const GraphUnitCell&operator=(const EmptyUnitCell & e)
public void write_xml(oxstream &) const
public inline graph_type&graph()
public inline const graph_type&graph() const
public inline std::size_t dimension() const
public inline const std::string & name() const
public std::size_t add_vertex(int type,const coordinate_type & coord)
public std::size_t add_edge(int type,uint32_t si,const offset_type & so,uint32_t ti,const offset_type & to)
typedef offset_type
typedef coordinate_type
typedef graph_type

Members

public GraphUnitCell()

public GraphUnitCell(const EmptyUnitCell & e)

public GraphUnitCell(const XMLTag &,std::istream &)

public GraphUnitCell(const std::string & name,std::size_t dim)

public const GraphUnitCell&operator=(const EmptyUnitCell & e)

public void write_xml(oxstream &) const

public inline graph_type&graph()

public inline const graph_type&graph() const

public inline std::size_t dimension() const

public inline const std::string & name() const

public std::size_t add_vertex(int type,const coordinate_type & coord)

public std::size_t add_edge(int type,uint32_t si,const offset_type & so,uint32_t ti,const offset_type & to)

typedef offset_type

typedef coordinate_type

typedef graph_type

class alps::hypercubic_lattice

class alps::hypercubic_lattice
  : public BASE

Summary

MembersDescriptions
public inline hypercubic_lattice()
public template<>
inline hypercubic_lattice(const hypercubic_lattice< BASE2, EX2 > & l)
public inline hypercubic_lattice(const parent_lattice_type & p,size_type length,const std::string & bc)
public template<>
inline hypercubic_lattice(const parent_lattice_type & p,InputIterator first,InputIterator last,const std::string & bc)
public template<>
inline hypercubic_lattice(const parent_lattice_type & p,size_type length,InputIterator2 first2,InputIterator2 last2)
public template<>
inline hypercubic_lattice(const parent_lattice_type & p,InputIterator first,InputIterator last,InputIterator2 first2,InputIterator2 last2)
public template<>
inline const hypercubic_lattice&operator=(const hypercubic_lattice< BASE2, EX2 > & l)
public inline std::pair< cell_iterator](#d0/d8d/classalps_1_1hypercubic__lattice_1_1cell__iterator), [cell_iterator>cells() const
public inline size_type volume() const
public inline size_type index(const cell_descriptor & c) const
public inline bool on_lattice(const cell_descriptor & c) const
public inline cell_descriptor cell(size_type i) const
public inline cell_descriptor cell(offset_type o) const
public inline std::pair< bool, boundary_crossing_type>shift(offset_type & o,const offset_type & s) const
public inline const std::string & boundary(unsigned int dim) const
public inline const std::vector< std::string > & boundary() const
public inline extent_type::value_type extent(unsigned int dim) const
public inline const extent_type & extent() const
public inline std::vector< std::string > distance_labels(int precision) const
public inline std::vector< std::string > momenta_labels(int precision) const
public inline std::vector< unsigned int > distance_multiplicities() const
public inline std::size_t num_distances() const
public inline std::size_t distance(const offset_type & x,const offset_type & y) const
public inline std::pair< momentum_iterator](#d6/d0d/classalps_1_1hypercubic__lattice_1_1momentum__iterator), [momentum_iterator>momenta() const
public inline std::vector< int > translation_directions() const
public inline std::vector< vector_type > translation_momenta() const
public inline std::vector< std::pair< std::complex< double >, std::vector< std::size_t > > > translations(const vector_type & k) const
protected extent_type extent_
protected std::vector< std::string > bc_
typedef lattice_type
typedef parent_lattice_type
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type
typedef extent_type
typedef basis_vector_iterator
typedef vector_type
typedef boundary_crossing_type
typedef distance_type
typedef size_type

Members

public inline hypercubic_lattice()

public template<>
inline hypercubic_lattice(const hypercubic_lattice< BASE2, EX2 > & l)

public inline hypercubic_lattice(const parent_lattice_type & p,size_type length,const std::string & bc)

public template<>
inline hypercubic_lattice(const parent_lattice_type & p,InputIterator first,InputIterator last,const std::string & bc)

public template<>
inline hypercubic_lattice(const parent_lattice_type & p,size_type length,InputIterator2 first2,InputIterator2 last2)

public template<>
inline hypercubic_lattice(const parent_lattice_type & p,InputIterator first,InputIterator last,InputIterator2 first2,InputIterator2 last2)

public template<>
inline const hypercubic_lattice&operator=(const hypercubic_lattice< BASE2, EX2 > & l)

public inline std::pair< cell_iterator](#d0/d8d/classalps_1_1hypercubic__lattice_1_1cell__iterator), [cell_iterator>cells() const

public inline size_type volume() const

public inline size_type index(const cell_descriptor & c) const

public inline bool on_lattice(const cell_descriptor & c) const

public inline cell_descriptor cell(size_type i) const

public inline cell_descriptor cell(offset_type o) const

public inline std::pair< bool, boundary_crossing_type>shift(offset_type & o,const offset_type & s) const

public inline const std::string & boundary(unsigned int dim) const

public inline const std::vector< std::string > & boundary() const

public inline extent_type::value_type extent(unsigned int dim) const

public inline const extent_type & extent() const

public inline std::vector< std::string > distance_labels(int precision) const

public inline std::vector< std::string > momenta_labels(int precision) const

public inline std::vector< unsigned int > distance_multiplicities() const

public inline std::size_t num_distances() const

public inline std::size_t distance(const offset_type & x,const offset_type & y) const

public inline std::pair< momentum_iterator](#d6/d0d/classalps_1_1hypercubic__lattice_1_1momentum__iterator), [momentum_iterator>momenta() const

public inline std::vector< int > translation_directions() const

public inline std::vector< vector_type > translation_momenta() const

public inline std::vector< std::pair< std::complex< double >, std::vector< std::size_t > > > translations(const vector_type & k) const

protected extent_type extent_

protected std::vector< std::string > bc_

typedef lattice_type

typedef parent_lattice_type

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

typedef extent_type

typedef basis_vector_iterator

typedef vector_type

typedef boundary_crossing_type

typedef distance_type

typedef size_type

class alps::InhomogeneityDescriptor

Summary

MembersDescriptions
public inline InhomogeneityDescriptor()
public InhomogeneityDescriptor(XMLTag &,std::istream &)
public void write_xml(oxstream &) const
public inline bool inhomogeneous_vertices() const
public inline bool inhomogeneous_edges() const
public inline bool inhomogeneous_sites() const
public inline bool inhomogeneous_bonds() const
public inline bool inhomogeneous() const
public template<>
inline void disorder_edges(G & g,M & m) const
public template<>
inline void disorder_vertices(G & g,M & m) const
public template<>
inline void disorder_vertices(G & g) const
public template<>
inline void disorder_edges(G & g) const
public template<>
inline void disorder_sites(G & g) const
public template<>
inline void disorder_sites(G & g,M & m) const
public template<>
inline void disorder_bonds(G & g) const
public template<>
inline void disorder_bonds(G & g,M & m) const

Members

public inline InhomogeneityDescriptor()

public InhomogeneityDescriptor(XMLTag &,std::istream &)

public void write_xml(oxstream &) const

public inline bool inhomogeneous_vertices() const

public inline bool inhomogeneous_edges() const

public inline bool inhomogeneous_sites() const

public inline bool inhomogeneous_bonds() const

public inline bool inhomogeneous() const

public template<>
inline void disorder_edges(G & g,M & m) const

public template<>
inline void disorder_vertices(G & g,M & m) const

public template<>
inline void disorder_vertices(G & g) const

public template<>
inline void disorder_edges(G & g) const

public template<>
inline void disorder_sites(G & g) const

public template<>
inline void disorder_sites(G & g,M & m) const

public template<>
inline void disorder_bonds(G & g) const

public template<>
inline void disorder_bonds(G & g,M & m) const

class alps::lattice_graph

class alps::lattice_graph
  : public LATTICE

Summary

MembersDescriptions
public inline lattice_graph()
public template<>
inline lattice_graph(const L2 &)
public inline const graph_type & graph() const
public inline graph_type & graph()
public template<>
inline H::graph_type & graph(H & g) const
public template<>
inline const H::graph_type & graph(const H & g) const
public inline std::vector< std::string > distance_labels(int precision) const
public inline std::vector< unsigned int > distance_multiplicities() const
public inline size_type num_distances() const
public inline size_type distance(vertex_descriptor x,vertex_descriptor y) const
public inline std::vector< std::pair< std::complex< double >, std::vector< std::size_t > > > translations(const vector_type & k) const
typedef super_type
typedef base_type
typedef unit_cell_type
typedef offset_type
typedef extent_type
typedef vector_type
typedef basis_vector_iterator
typedef cell_iterator
typedef boundary_crossing_type
typedef size_type
typedef graph_type
typedef vertex_iterator
typedef vertex_descriptor
typedef edge_iterator

Members

public inline lattice_graph()

public template<>
inline lattice_graph(const L2 &)

public inline const graph_type & graph() const

public inline graph_type & graph()

public template<>
inline H::graph_type & graph(H & g) const

public template<>
inline const H::graph_type & graph(const H & g) const

public inline std::vector< std::string > distance_labels(int precision) const

public inline std::vector< unsigned int > distance_multiplicities() const

public inline size_type num_distances() const

public inline size_type distance(vertex_descriptor x,vertex_descriptor y) const

public inline std::vector< std::pair< std::complex< double >, std::vector< std::size_t > > > translations(const vector_type & k) const

typedef super_type

typedef base_type

typedef unit_cell_type

typedef offset_type

typedef extent_type

typedef vector_type

typedef basis_vector_iterator

typedef cell_iterator

typedef boundary_crossing_type

typedef size_type

typedef graph_type

typedef vertex_iterator

typedef vertex_descriptor

typedef edge_iterator

class alps::LatticeDescriptor

class alps::LatticeDescriptor
  : public alps::coordinate_lattice< simple_lattice<>, std::vector< alps::StringValue > >

Summary

MembersDescriptions
public inline LatticeDescriptor()
public inline LatticeDescriptor(const std::string & name,std::size_t dim)
public LatticeDescriptor(const alps::XMLTag &,std::istream &)
public void write_xml(oxstream &) const
public inline const std::string & name() const
public inline std::size_t dimension() const
public void set_parameters(const alps::Parameters &)
public template<>
inline void add_default_parameter(const std::string & name,const T & value)
typedef base_type
typedef unit_cell_type
typedef offset_type
typedef cell_descriptor
typedef vector_type
typedef basis_vector_iterator

Members

public inline LatticeDescriptor()

public inline LatticeDescriptor(const std::string & name,std::size_t dim)

public LatticeDescriptor(const alps::XMLTag &,std::istream &)

public void write_xml(oxstream &) const

public inline const std::string & name() const

public inline std::size_t dimension() const

public void set_parameters(const alps::Parameters &)

public template<>
inline void add_default_parameter(const std::string & name,const T & value)

typedef base_type

typedef unit_cell_type

typedef offset_type

typedef cell_descriptor

typedef vector_type

typedef basis_vector_iterator

class alps::LatticeGraphDescriptor

class alps::LatticeGraphDescriptor
  : public alps::hypercubic_lattice< coordinate_lattice< simple_lattice< GraphUnitCell >, std::vector< StringValue > >, std::vector< StringValue > >

Summary

MembersDescriptions
public inline LatticeGraphDescriptor()
public LatticeGraphDescriptor(const std::string & unitcell,const UnitCellMap &)
public LatticeGraphDescriptor(const XMLTag &,std::istream &,const LatticeMap &,const FiniteLatticeMap &,const UnitCellMap &)
public void write_xml(oxstream &) const
public inline const std::string & name() const
public void set_parameters(const Parameters &)
public inline const InhomogeneityDescriptor&inhomogeneity() const
public inline const DepletionDescriptor&depletion() const
typedef base_type
typedef unit_cell_type
typedef offset_type
typedef extent_type
typedef cell_descriptor
typedef vector_type
typedef basis_vector_iterator
typedef cell_iterator
typedef size_type
typedef boundary_crossing_type

Members

public inline LatticeGraphDescriptor()

public LatticeGraphDescriptor(const std::string & unitcell,const UnitCellMap &)

public LatticeGraphDescriptor(const XMLTag &,std::istream &,const LatticeMap &,const FiniteLatticeMap &,const UnitCellMap &)

public void write_xml(oxstream &) const

public inline const std::string & name() const

public void set_parameters(const Parameters &)

public inline const InhomogeneityDescriptor&inhomogeneity() const

public inline const DepletionDescriptor&depletion() const

typedef base_type

typedef unit_cell_type

typedef offset_type

typedef extent_type

typedef cell_descriptor

typedef vector_type

typedef basis_vector_iterator

typedef cell_iterator

typedef size_type

typedef boundary_crossing_type

class alps::LatticeLibrary

Summary

MembersDescriptions
public inline LatticeLibrary()
public inline LatticeLibrary(std::istream & in)
public inline LatticeLibrary(const XMLTag & tag,std::istream & p)
public LatticeLibrary(const Parameters & p)
public void read_xml(std::istream & in)
public void read_xml(const XMLTag & tag,std::istream & p)
public void write_xml(oxstream &) const
public bool has_graph(const std::string & name) const
public bool has_lattice(const std::string & name) const
public bool has_unitcell(const std::string & name) const
public const LatticeGraphDescriptor&lattice_descriptor(const std::string & name) const
public lattice_type lattice(const std::string & name) const
public const coordinate_graph_type&graph(const std::string & name) const
public template<>
inline bool get_graph(G & graph,const std::string & name) const
public void make_all_graphs()
protected LatticeMap lattices_
protected FiniteLatticeMap finitelattices_
protected UnitCellMap unitcells_
protected LatticeGraphMap latticegraphs_
protected GraphMap graphs_
typedef lattice_type

Members

public inline LatticeLibrary()

public inline LatticeLibrary(std::istream & in)

public inline LatticeLibrary(const XMLTag & tag,std::istream & p)

public LatticeLibrary(const Parameters & p)

public void read_xml(std::istream & in)

public void read_xml(const XMLTag & tag,std::istream & p)

public void write_xml(oxstream &) const

public bool has_graph(const std::string & name) const

public bool has_lattice(const std::string & name) const

public bool has_unitcell(const std::string & name) const

public const LatticeGraphDescriptor&lattice_descriptor(const std::string & name) const

public lattice_type lattice(const std::string & name) const

public const coordinate_graph_type&graph(const std::string & name) const

public template<>
inline bool get_graph(G & graph,const std::string & name) const

public void make_all_graphs()

protected LatticeMap lattices_

protected FiniteLatticeMap finitelattices_

protected UnitCellMap unitcells_

protected LatticeGraphMap latticegraphs_

protected GraphMap graphs_

typedef lattice_type

class alps::simple_cell

Summary

MembersDescriptions
public inline simple_cell()
public inline simple_cell(const unit_cell_type & u,const offset_type & o)
public inline const offset_type & offset() const
public inline dimension_type dimension()
typedef offset_type
typedef unit_cell_type
typedef dimension_type

Members

public inline simple_cell()

public inline simple_cell(const unit_cell_type & u,const offset_type & o)

public inline const offset_type & offset() const

public inline dimension_type dimension()

typedef offset_type

typedef unit_cell_type

typedef dimension_type

class alps::simple_lattice

Summary

MembersDescriptions
public inline simple_lattice()
public template<>
inline simple_lattice(const simple_lattice< U2, C2 > & l)
public inline simple_lattice(const unit_cell_type & c)
public template<>
inline const simple_lattice&operator=(const simple_lattice< U2, C2 > & l)
public inline unit_cell_type & unit_cell()
public inline const unit_cell_type & unit_cell() const
public inline cell_descriptor cell(offset_type o) const
public inline dimension_type dimension() const
protected unit_cell_type unit_cell_
typedef unit_cell_type
typedef cell_descriptor
typedef dimension_type
typedef offset_type

Members

public inline simple_lattice()

public template<>
inline simple_lattice(const simple_lattice< U2, C2 > & l)

public inline simple_lattice(const unit_cell_type & c)

public template<>
inline const simple_lattice&operator=(const simple_lattice< U2, C2 > & l)

public inline unit_cell_type & unit_cell()

public inline const unit_cell_type & unit_cell() const

public inline cell_descriptor cell(offset_type o) const

public inline dimension_type dimension() const

protected unit_cell_type unit_cell_

typedef unit_cell_type

typedef cell_descriptor

typedef dimension_type

typedef offset_type

class alps::singleton_property_map

Summary

MembersDescriptions
public inline singleton_property_map(V v)
public inline operator V() const
public inline V value() const
public inline const singleton_property_map< V, K > & operator=(const V & v)
public template<>
inline V & operator[](T)
public template<>
inline const V & operator[](T) const
typedef key_type
typedef value_type
typedef reference
typedef category

Members

public inline singleton_property_map(V v)

public inline operator V() const

public inline V value() const

public inline const singleton_property_map< V, K > & operator=(const V & v)

public template<>
inline V & operator[](T)

public template<>
inline const V & operator[](T) const

typedef key_type

typedef value_type

typedef reference

typedef category

struct alps::bond_descriptor_compare

Summary

MembersDescriptions
public graph_type const * Graph
public inline bond_descriptor_compare(G const * Gr)
public inline bool operator()(bond_descriptor b1,bond_descriptor b2) const
typedef graph_type
typedef traits_type
typedef bond_descriptor
typedef site_descriptor
typedef result_type
typedef first_argument_type
typedef second_argument_type

Members

public graph_type const * Graph

public inline bond_descriptor_compare(G const * Gr)

public inline bool operator()(bond_descriptor b1,bond_descriptor b2) const

typedef graph_type

typedef traits_type

typedef bond_descriptor

typedef site_descriptor

typedef result_type

typedef first_argument_type

typedef second_argument_type

struct alps::bond_descriptor_compare_undirected

Summary

MembersDescriptions
public graph_type const * Graph
public inline bond_descriptor_compare_undirected(G const * Gr)
public inline bool operator()(bond_descriptor b1,bond_descriptor b2) const
typedef graph_type
typedef traits_type
typedef bond_descriptor
typedef site_descriptor
typedef result_type
typedef first_argument_type
typedef second_argument_type

Members

public graph_type const * Graph

public inline bond_descriptor_compare_undirected(G const * Gr)

public inline bool operator()(bond_descriptor b1,bond_descriptor b2) const

typedef graph_type

typedef traits_type

typedef bond_descriptor

typedef site_descriptor

typedef result_type

typedef first_argument_type

typedef second_argument_type

struct alps::boundary_crossing

Summary

MembersDescriptions
public inline boundary_crossing()
public inline operator bool() const
public inline direction_type crosses(dimension_type d) const
public inline const boundary_crossing&set_crossing(dimension_type d,direction_type dir)
public inline const boundary_crossing&invert()
public inline void save(ODump & dump) const
public inline void load(IDump & dump)
public template<>
inline void serialize(Archive & ar,const unsigned int version)
typedef dimension_type
typedef direction_type

Members

public inline boundary_crossing()

public inline operator bool() const

public inline direction_type crosses(dimension_type d) const

public inline const boundary_crossing&set_crossing(dimension_type d,direction_type dir)

public inline const boundary_crossing&invert()

public inline void save(ODump & dump) const

public inline void load(IDump & dump)

public template<>
inline void serialize(Archive & ar,const unsigned int version)

typedef dimension_type

typedef direction_type

struct alps::boundary_crossing_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::cell_traits

Summary

MembersDescriptions
typedef offset_type

Members

typedef offset_type

struct alps::coordinate_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::coordinate_traits

Summary

MembersDescriptions
typedef value_type
typedef iterator
typedef const_iterator

Members

typedef value_type

typedef iterator

typedef const_iterator

struct alps::coordinate_traits< const C >

Summary

MembersDescriptions
typedef value_type
typedef iterator
typedef const_iterator

Members

typedef value_type

typedef iterator

typedef const_iterator

struct alps::coordinate_traits< std::valarray< T > >

Summary

MembersDescriptions
typedef value_type
typedef iterator
typedef const_iterator

Members

typedef value_type

typedef iterator

typedef const_iterator

struct alps::coordinate_traits< T[sz]>

Summary

MembersDescriptions
typedef value_type
typedef iterator
typedef const_iterator

Members

typedef value_type

typedef iterator

typedef const_iterator

struct alps::copy_property_helper

Summary

MembersDescriptions

Members

struct alps::copy_property_helper< SRC, DST, PROPERTY, true >

Summary

MembersDescriptions

Members

struct alps::dimension_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::dimensional_traits

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(bool,fixed_dimension)
typedef dimension_type

Members

public BOOST_STATIC_CONSTANT(bool,fixed_dimension)

typedef dimension_type

struct alps::edge_type_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::edge_vector_relative_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::edge_vector_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::graph_name_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::graph_traits

struct alps::graph_traits
  : public boost::graph_traits< G >

Summary

MembersDescriptions
typedef graph_type
typedef site_iterator
typedef bond_iterator
typedef neighbor_bond_iterator
typedef site_descriptor
typedef bond_descriptor
typedef sites_size_type
typedef bonds_size_type
typedef neighbors_size_type
typedef neighbor_iterator

Members

typedef graph_type

typedef site_iterator

typedef bond_iterator

typedef neighbor_bond_iterator

typedef site_descriptor

typedef bond_descriptor

typedef sites_size_type

typedef bonds_size_type

typedef neighbors_size_type

typedef neighbor_iterator

struct alps::graph_traits< lattice_graph< L, G > >

Summary

MembersDescriptions
typedef graph_type

Members

typedef graph_type

struct alps::has_property

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(bool,vertex_property)
public BOOST_STATIC_CONSTANT(bool,edge_property)
public BOOST_STATIC_CONSTANT(bool,graph_property)
public BOOST_STATIC_CONSTANT(bool,any_property)
public BOOST_STATIC_CONSTANT(bool,site_property)
public BOOST_STATIC_CONSTANT(bool,bond_property)
typedef vertex_property_type
typedef edge_property_type
typedef graph_property_type
typedef property_type
typedef type
typedef site_property_type
typedef bond_property_type

Members

public BOOST_STATIC_CONSTANT(bool,vertex_property)

public BOOST_STATIC_CONSTANT(bool,edge_property)

public BOOST_STATIC_CONSTANT(bool,graph_property)

public BOOST_STATIC_CONSTANT(bool,any_property)

public BOOST_STATIC_CONSTANT(bool,site_property)

public BOOST_STATIC_CONSTANT(bool,bond_property)

typedef vertex_property_type

typedef edge_property_type

typedef graph_property_type

typedef property_type

typedef type

typedef site_property_type

typedef bond_property_type

struct alps::has_property< P, boost::adjacency_list< s1, s2, s3, VP, EP, GP, s4 >, D >

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(bool,vertex_property)
public BOOST_STATIC_CONSTANT(bool,edge_property)
public BOOST_STATIC_CONSTANT(bool,graph_property)
public BOOST_STATIC_CONSTANT(bool,any_property)
public BOOST_STATIC_CONSTANT(bool,site_property)
public BOOST_STATIC_CONSTANT(bool,bond_property)
typedef Graph
typedef vertex_property_type
typedef edge_property_type
typedef graph_property_type
typedef property_type
typedef type
typedef site_property_type
typedef bond_property_type

Members

public BOOST_STATIC_CONSTANT(bool,vertex_property)

public BOOST_STATIC_CONSTANT(bool,edge_property)

public BOOST_STATIC_CONSTANT(bool,graph_property)

public BOOST_STATIC_CONSTANT(bool,any_property)

public BOOST_STATIC_CONSTANT(bool,site_property)

public BOOST_STATIC_CONSTANT(bool,bond_property)

typedef Graph

typedef vertex_property_type

typedef edge_property_type

typedef graph_property_type

typedef property_type

typedef type

typedef site_property_type

typedef bond_property_type

struct alps::has_property< P, const boost::adjacency_list< s1, s2, s3, VP, EP, GP, s4 >, D >

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(bool,vertex_property)
public BOOST_STATIC_CONSTANT(bool,edge_property)
public BOOST_STATIC_CONSTANT(bool,graph_property)
public BOOST_STATIC_CONSTANT(bool,any_property)
public BOOST_STATIC_CONSTANT(bool,site_property)
public BOOST_STATIC_CONSTANT(bool,bond_property)
typedef Graph
typedef vertex_property_type
typedef edge_property_type
typedef graph_property_type
typedef property_type
typedef type
typedef site_property_type
typedef bond_property_type

Members

public BOOST_STATIC_CONSTANT(bool,vertex_property)

public BOOST_STATIC_CONSTANT(bool,edge_property)

public BOOST_STATIC_CONSTANT(bool,graph_property)

public BOOST_STATIC_CONSTANT(bool,any_property)

public BOOST_STATIC_CONSTANT(bool,site_property)

public BOOST_STATIC_CONSTANT(bool,bond_property)

typedef Graph

typedef vertex_property_type

typedef edge_property_type

typedef graph_property_type

typedef property_type

typedef type

typedef site_property_type

typedef bond_property_type

struct alps::lattice_traits

Summary

MembersDescriptions

Members

struct alps::lattice_traits< coordinate_lattice< B, V > >

Summary

MembersDescriptions
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type
typedef vector_type
typedef basis_vector_iterator

Members

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

typedef vector_type

typedef basis_vector_iterator

struct alps::lattice_traits< hypercubic_lattice< BASE, EX > >

Summary

MembersDescriptions
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type
typedef extent_type
typedef basis_vector_iterator
typedef momentum_iterator
typedef cell_iterator
typedef size_type
typedef vector_type
typedef boundary_crossing_type

Members

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

typedef extent_type

typedef basis_vector_iterator

typedef momentum_iterator

typedef cell_iterator

typedef size_type

typedef vector_type

typedef boundary_crossing_type

struct alps::lattice_traits< lattice_graph< L, G > >

Summary

MembersDescriptions
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type
typedef extent_type
typedef basis_vector_iterator
typedef cell_iterator
typedef momentum_iterator
typedef size_type
typedef vector_type
typedef boundary_crossing_type

Members

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

typedef extent_type

typedef basis_vector_iterator

typedef cell_iterator

typedef momentum_iterator

typedef size_type

typedef vector_type

typedef boundary_crossing_type

struct alps::lattice_traits< LatticeGraphDescriptor >

Summary

MembersDescriptions
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type
typedef extent_type
typedef basis_vector_iterator
typedef cell_iterator
typedef momentum_iterator
typedef size_type
typedef vector_type
typedef boundary_crossing_type

Members

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

typedef extent_type

typedef basis_vector_iterator

typedef cell_iterator

typedef momentum_iterator

typedef size_type

typedef vector_type

typedef boundary_crossing_type

struct alps::lattice_traits< simple_lattice< U, C > >

Summary

MembersDescriptions
typedef unit_cell_type
typedef cell_descriptor
typedef offset_type

Members

typedef unit_cell_type

typedef cell_descriptor

typedef offset_type

struct alps::parity_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::parity_traits

Summary

MembersDescriptions

Members

struct alps::parity_traits< parity_t, Graph >

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(value_type,white)
public BOOST_STATIC_CONSTANT(value_type,black)
public BOOST_STATIC_CONSTANT(value_type,undefined)
typedef value_type

Members

public BOOST_STATIC_CONSTANT(value_type,white)

public BOOST_STATIC_CONSTANT(value_type,black)

public BOOST_STATIC_CONSTANT(value_type,undefined)

typedef value_type

struct alps::point_traits

Summary

MembersDescriptions
typedef vector_type

Members

typedef vector_type

struct alps::property_map

Summary

MembersDescriptions
typedef type
typedef const_type

Members

typedef type

typedef const_type

struct alps::property_map< P, const G, Default >

Summary

MembersDescriptions
typedef type
typedef const_type

Members

typedef type

typedef const_type

struct alps::source_offset_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::target_offset_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

struct alps::vertex_type_t

Summary

MembersDescriptions
typedef kind

Members

typedef kind

namespace alps::detail

Summary

MembersDescriptions
public alps::oxstream & operator<<(alps::oxstream & out,const alps::detail::BasicVertexReference & d)
public alps::oxstream & operator<<(alps::oxstream & out,const alps::detail::VertexReference & d)
public alps::oxstream & operator<<(alps::oxstream & out,const alps::detail::EdgeReference & d)
public template<>
T disorder_it(IT start,IT end,MAP & type,T i)
public template<>
unsigned int disorder_it(IT start,IT end,MAP & type)
public template<>
graph_traits< G >::vertices_size_type num_vertices_wrap(const G & g)
public template<>
graph_traits< G >::edges_size_type num_edges_wrap(const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::vertex_iterator, typename [graph_traits< G >::vertex_iterator > vertices_wrap(const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::edge_iterator, typename [graph_traits< G >::edge_iterator > edges_wrap(const G & g)
public template<>
graph_traits< G >::degree_size_type out_degree_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)
public template<>
graph_traits< G >::degree_size_type in_degree_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)
public template<>
graph_traits< G >::degree_size_type degree_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::out_edge_iterator, typename [graph_traits< G >::out_edge_iterator > out_edges_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::in_edge_iterator, typename [graph_traits< G >::in_edge_iterator > in_edges_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::adjacency_iterator, typename [graph_traits< G >::adjacency_iterator > adjacent_vertices_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)
public template<>
graph_traits< G >::vertex_descriptor vertex_wrap(typename graph_traits< G >::vertex_size_type i,const G & g)
public template<>
graph_traits< G >::vertex_descriptor source_wrap(const typename graph_traits< G >::edge_descriptor & e,const G & g)
public template<>
graph_traits< G >::vertex_descriptor target_wrap(const typename graph_traits< G >::edge_descriptor & e,const G & g)
public template<>
graph_traits< G >::sites_size_type num_sites_wrap(const G & g)
public template<>
graph_traits< G >::bonds_size_type num_bonds_wrap(const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::site_iterator, typename [graph_traits< G >::site_iterator > sites_wrap(const G & g)
public template<>
graph_traits< G >::site_descriptor site_wrap(typename graph_traits< G >::sites_size_type i,const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::bond_iterator, typename [graph_traits< G >::bond_iterator > bonds_wrap(const G & g)
public template<>
graph_traits< G >::bond_descriptor bond_wrap(typename graph_traits< G >::bonds_size_type i,const G & g)
public template<>
graph_traits< G >::degree_size_type num_neighbors_wrap(const typename graph_traits< G >::site_descriptor & v,const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::neighbor_bond_iterator, typename [graph_traits< G >::neighbor_bond_iterator > neighbor_bonds_wrap(const typename graph_traits< G >::site_descriptor & v,const G & g)
public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::neighbor_iterator, typename [graph_traits< G >::neighbor_iterator > neighbors_wrap(const typename graph_traits< G >::site_descriptor & v,const G & g)
public template<>
graph_traits< G >::site_descriptor neighbor_wrap(const typename graph_traits< G >::site_descriptor & v,typename graph_traits< G >::degree_size_type i,const G & g)
public template<>
T::graph_type & graph_wrap(T & x)
public template<>
const T::graph_type & graph_wrap(const T & x)
class alps::detail::BasicVertexReference
class alps::detail::EdgeReference
class alps::detail::ParityVisitor
class alps::detail::VertexReference
struct alps::detail::backbone_edges
struct alps::detail::found_property_type_or_default
struct alps::detail::found_property_type_or_default_impl
struct alps::detail::found_property_type_or_default_impl< true, PropertyList, Tag, Default >
struct alps::detail::get_const_type_member
struct alps::detail::graph_dimension_helper
struct alps::detail::graph_dimension_helper< true >
struct alps::detail::parity_helper
struct alps::detail::parity_helper< Graph, Parity, true >
struct alps::detail::put_get_helper
struct alps::detail::put_get_helper< false >
struct alps::detail::put_get_helper< true >

Members

public alps::oxstream & operator<<(alps::oxstream & out,const alps::detail::BasicVertexReference & d)

public alps::oxstream & operator<<(alps::oxstream & out,const alps::detail::VertexReference & d)

public alps::oxstream & operator<<(alps::oxstream & out,const alps::detail::EdgeReference & d)

public template<>
T disorder_it(IT start,IT end,MAP & type,T i)

public template<>
unsigned int disorder_it(IT start,IT end,MAP & type)

public template<>
graph_traits< G >::vertices_size_type num_vertices_wrap(const G & g)

public template<>
graph_traits< G >::edges_size_type num_edges_wrap(const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::vertex_iterator, typename [graph_traits< G >::vertex_iterator > vertices_wrap(const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::edge_iterator, typename [graph_traits< G >::edge_iterator > edges_wrap(const G & g)

public template<>
graph_traits< G >::degree_size_type out_degree_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)

public template<>
graph_traits< G >::degree_size_type in_degree_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)

public template<>
graph_traits< G >::degree_size_type degree_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::out_edge_iterator, typename [graph_traits< G >::out_edge_iterator > out_edges_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::in_edge_iterator, typename [graph_traits< G >::in_edge_iterator > in_edges_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::adjacency_iterator, typename [graph_traits< G >::adjacency_iterator > adjacent_vertices_wrap(const typename graph_traits< G >::vertex_descriptor & v,const G & g)

public template<>
graph_traits< G >::vertex_descriptor vertex_wrap(typename graph_traits< G >::vertex_size_type i,const G & g)

public template<>
graph_traits< G >::vertex_descriptor source_wrap(const typename graph_traits< G >::edge_descriptor & e,const G & g)

public template<>
graph_traits< G >::vertex_descriptor target_wrap(const typename graph_traits< G >::edge_descriptor & e,const G & g)

public template<>
graph_traits< G >::sites_size_type num_sites_wrap(const G & g)

public template<>
graph_traits< G >::bonds_size_type num_bonds_wrap(const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::site_iterator, typename [graph_traits< G >::site_iterator > sites_wrap(const G & g)

public template<>
graph_traits< G >::site_descriptor site_wrap(typename graph_traits< G >::sites_size_type i,const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::bond_iterator, typename [graph_traits< G >::bond_iterator > bonds_wrap(const G & g)

public template<>
graph_traits< G >::bond_descriptor bond_wrap(typename graph_traits< G >::bonds_size_type i,const G & g)

public template<>
graph_traits< G >::degree_size_type num_neighbors_wrap(const typename graph_traits< G >::site_descriptor & v,const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::neighbor_bond_iterator, typename [graph_traits< G >::neighbor_bond_iterator > neighbor_bonds_wrap(const typename graph_traits< G >::site_descriptor & v,const G & g)

public template<>
std::pair< typename graph_traits](#d5/d1a/structalps_1_1graph__traits)< G >::neighbor_iterator, typename [graph_traits< G >::neighbor_iterator > neighbors_wrap(const typename graph_traits< G >::site_descriptor & v,const G & g)

public template<>
graph_traits< G >::site_descriptor neighbor_wrap(const typename graph_traits< G >::site_descriptor & v,typename graph_traits< G >::degree_size_type i,const G & g)

public template<>
T::graph_type & graph_wrap(T & x)

public template<>
const T::graph_type & graph_wrap(const T & x)

class alps::detail::BasicVertexReference

Summary

MembersDescriptions
public inline BasicVertexReference()
public BasicVertexReference(XMLTag)
public inline const offset_type & cell_offset() const
public inline const offset_type & offset() const
public inline unsigned int vertex() const
typedef offset_type

Members

public inline BasicVertexReference()

public BasicVertexReference(XMLTag)

public inline const offset_type & cell_offset() const

public inline const offset_type & offset() const

public inline unsigned int vertex() const

typedef offset_type

class alps::detail::EdgeReference

Summary

MembersDescriptions
public EdgeReference(XMLTag,std::istream &)
public inline const BasicVertexReference&source() const
public inline const BasicVertexReference&target() const
public inline type_type new_type() const

Members

public EdgeReference(XMLTag,std::istream &)

public inline const BasicVertexReference&source() const

public inline const BasicVertexReference&target() const

public inline type_type new_type() const

class alps::detail::ParityVisitor

class alps::detail::ParityVisitor
  : public boost::dfs_visitor<>

Summary

MembersDescriptions
public inline ParityVisitor(PropertyMap & map,bool * bipartite)
public inline void initialize_vertex(vertex_descriptor s,Graph const &)
public inline void start_vertex(vertex_descriptor s,Graph const &)
public inline void tree_edge(edge_descriptor e,Graph const & g)
public inline void back_edge(edge_descriptor e,const Graph & g) const
typedef vertex_descriptor
typedef edge_descriptor

Members

public inline ParityVisitor(PropertyMap & map,bool * bipartite)

public inline void initialize_vertex(vertex_descriptor s,Graph const &)

public inline void start_vertex(vertex_descriptor s,Graph const &)

public inline void tree_edge(edge_descriptor e,Graph const & g)

public inline void back_edge(edge_descriptor e,const Graph & g) const

typedef vertex_descriptor

typedef edge_descriptor

class alps::detail::VertexReference

class alps::detail::VertexReference
  : public alps::detail::BasicVertexReference

Summary

MembersDescriptions
public VertexReference(XMLTag,std::istream &)
public inline type_type new_type() const

Members

public VertexReference(XMLTag,std::istream &)

public inline type_type new_type() const

struct alps::detail::backbone_edges

Summary

MembersDescriptions
public const Graph * graph
public const std::set< int > * backbone
public inline backbone_edges()
public inline backbone_edges(Graph const & g,std::set< int > const & bb)
public inline bool operator()(edge_descriptor e) const
typedef edge_descriptor

Members

public const Graph * graph

public const std::set< int > * backbone

public inline backbone_edges()

public inline backbone_edges(Graph const & g,std::set< int > const & bb)

public inline bool operator()(edge_descriptor e) const

typedef edge_descriptor

struct alps::detail::found_property_type_or_default

struct alps::detail::found_property_type_or_default
  : public alps::detail::found_property_type_or_default_impl< !boost::is_same< boost::property_value< PropertyList, Tag >::type, boost::detail::error_property_not_found >::value, PropertyList, Tag, int >

Summary

MembersDescriptions

Members

struct alps::detail::found_property_type_or_default_impl

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(bool,found)
typedef type

Members

public BOOST_STATIC_CONSTANT(bool,found)

typedef type

struct alps::detail::found_property_type_or_default_impl< true, PropertyList, Tag, Default >

Summary

MembersDescriptions
public BOOST_STATIC_CONSTANT(bool,found)
typedef type

Members

public BOOST_STATIC_CONSTANT(bool,found)

typedef type

struct alps::detail::get_const_type_member

Summary

MembersDescriptions
typedef type

Members

typedef type

struct alps::detail::graph_dimension_helper

Summary

MembersDescriptions

Members

struct alps::detail::graph_dimension_helper< true >

Summary

MembersDescriptions

Members

struct alps::detail::parity_helper

Summary

MembersDescriptions

Members

struct alps::detail::parity_helper< Graph, Parity, true >

Summary

MembersDescriptions
typedef map_type

Members

typedef map_type

struct alps::detail::put_get_helper

Summary

MembersDescriptions

Members

struct alps::detail::put_get_helper< false >

Summary

MembersDescriptions

Members

struct alps::detail::put_get_helper< true >

Summary

MembersDescriptions

Members

namespace alps::graph

Summary

MembersDescriptions
public template<>
lattice_graph< L, G >::graph_type & graph(lattice_graph< L, G > & l)
public template<>
const lattice_graph< L, G >::graph_type & graph(const lattice_graph< L, G > & l)
public inline GraphUnitCell::graph_type&graph(GraphUnitCell & c)
public inline const GraphUnitCell::graph_type&graph(const GraphUnitCell & c)

Members

public template<>
lattice_graph< L, G >::graph_type & graph(lattice_graph< L, G > & l)

public template<>
const lattice_graph< L, G >::graph_type & graph(const lattice_graph< L, G > & l)

public inline GraphUnitCell::graph_type&graph(GraphUnitCell & c)

public inline const GraphUnitCell::graph_type&graph(const GraphUnitCell & c)

namespace boost

Summary

MembersDescriptions
public template<>
inline std::ostream & operator<<(std::ostream & os,const boost::adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
inline alps::oxstream & operator<<(alps::oxstream & oxs,const boost::adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::sites_size_type num_sites(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bonds_size_type num_bonds(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::site_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_iterator > sites(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor site(typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::sites_size_type i,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::bond_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bond_iterator > bonds(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bond_descriptor bond(typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bonds_size_type i,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::degree_size_type num_neighbors(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_bond_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_bond_iterator > neighbor_bonds(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_iterator > neighbors(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor neighbor(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::degree_size_type i,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)
public template<>
V get(const alps::singleton_property_map< V, K > & m,const K &)
public template<>
void put(alps::singleton_property_map< V, K > & m,const K & k,const V & v)
class boost::adjacency_list

Members

public template<>
inline std::ostream & operator<<(std::ostream & os,const boost::adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
inline alps::oxstream & operator<<(alps::oxstream & oxs,const boost::adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::sites_size_type num_sites(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bonds_size_type num_bonds(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::site_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_iterator > sites(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor site(typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::sites_size_type i,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::bond_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bond_iterator > bonds(const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bond_descriptor bond(typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::bonds_size_type i,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::degree_size_type num_neighbors(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_bond_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_bond_iterator > neighbor_bonds(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
std::pair< typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list](#de/d7d/classboost_1_1adjacency__list)< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_iterator, typename [alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::neighbor_iterator > neighbors(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor neighbor(const typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::site_descriptor & v,typename alps::graph_traits](#d5/d1a/structalps_1_1graph__traits)< [adjacency_list< T0, T1, T2, T3, T4, T5, T6 > >::degree_size_type i,const adjacency_list< T0, T1, T2, T3, T4, T5, T6 > & g)

public template<>
V get(const alps::singleton_property_map< V, K > & m,const K &)

public template<>
void put(alps::singleton_property_map< V, K > & m,const K & k,const V & v)

class boost::adjacency_list

Summary

MembersDescriptions

Members

class alps::hypercubic_lattice::cell_iterator

Summary

MembersDescriptions
public inline cell_iterator()
public inline cell_iterator(const lattice_type & l,const offset_type & o)
public inline const cell_iterator&operator++()
public inline cell_iterator operator++(int)
public inline bool operator==(const cell_iterator & it)
public inline bool operator!=(const cell_iterator & it)
public inline cell_descriptor operator*() const
protected const lattice_type*lattice_
protected offset_type offset_
typedef difference_type
typedef value_type
typedef pointer
typedef reference
typedef iterator_category

Members

public inline cell_iterator()

public inline cell_iterator(const lattice_type & l,const offset_type & o)

public inline const cell_iterator&operator++()

public inline cell_iterator operator++(int)

public inline bool operator==(const cell_iterator & it)

public inline bool operator!=(const cell_iterator & it)

public inline cell_descriptor operator*() const

protected const lattice_type*lattice_

protected offset_type offset_

typedef difference_type

typedef value_type

typedef pointer

typedef reference

typedef iterator_category

class alps::hypercubic_lattice::momentum_iterator

class alps::hypercubic_lattice::momentum_iterator
  : public alps::hypercubic_lattice< BASE, EX >::cell_iterator

Summary

MembersDescriptions
public inline momentum_iterator(cell_iterator it)
public inline const vector_type & operator*() const
public inline const vector_type * operator->() const
public inline const momentum_iterator&operator++()
public inline const momentum_iterator&operator++(int)

Members

public inline momentum_iterator(cell_iterator it)

public inline const vector_type & operator*() const

public inline const vector_type * operator->() const

public inline const momentum_iterator&operator++()

public inline const momentum_iterator&operator++(int)

Generated by Moxygen