Chains< _rank, _diff > Class Template Reference

A chain complex. More...

#include <Chains.hpp>

Inheritance diagram for Chains< _rank, _diff >:

Public Types
typedef _rank	rank_t
	The rank type. More...
typedef _diff	diff_t
	The differential type. More...

Public Member Functions
	Chains ()=default
	Default constructor. More...
int	maxindex () const
	The maximum index of the Chain complex. More...
	Chains (const std::vector< rank_t > &, const std::vector< diff_t > &)
	Constructor given ranks and diffs. More...
void	reserve (size_t)
void	push_back (const Arrow< rank_t, diff_t > &)
void	push_back (const rank_t &, const diff_t &)
Chains	dualize (int=-1) const
	The dual cochain complex reindexed as a Chain complex. Optionally stop at index k (if k=-1 then nonstop i.e. k=maxindex) More...
bool	operator== (const Chains< rank_t, diff_t > &) const
	Checks equality of Chain complexes. More...

Public Attributes
std::vector< rank_t >	rank
	rank[i]=rank(C[i]) More...
std::vector< diff_t >	diff
	diff[i] is the differential C[i]->C[i-1] (diff[0] is always empty) More...

Detailed Description

template<typename _rank, typename _diff>
class Mackey::Chains< _rank, _diff >

A chain complex.

Our chain complexes are always indexed as C[maxindex]—>C[0].

Member Typedef Documentation

rank_t

typedef _rank rank_t

The rank type.

diff_t

typedef _diff diff_t

The differential type.

Constructor & Destructor Documentation

Chains() [1/2]

Chains ( )

default

Default constructor.

Chains() [2/2]

Chains	(	const std::vector< rank_t > &	,
		const std::vector< diff_t > &
	)

Constructor given ranks and diffs.

Member Function Documentation

maxindex()

int maxindex

(

)

const

The maximum index of the Chain complex.

reserve()

void reserve

(

size_t

)

push_back() [1/2]

void push_back

(

const Arrow< rank_t, diff_t > &

)

push_back() [2/2]

void push_back	(	const rank_t &	,
		const diff_t &
	)

dualize()

Chains dualize

(

int

= -1

)

const

The dual cochain complex reindexed as a Chain complex. Optionally stop at index k (if k=-1 then nonstop i.e. k=maxindex)

operator==()

bool operator==

(

const Chains< rank_t, diff_t > &

)

const

Checks equality of Chain complexes.

Member Data Documentation

rank

std::vector<rank_t> rank

rank[i]=rank(C[i])

diff

std::vector<diff_t> diff

diff[i] is the differential C[i]->C[i-1] (diff[0] is always empty)

---

The documentation for this class was generated from the following file:

• Chains.hpp