The Conley-Morse Graphs Software
Public Member Functions | Public Attributes | List of all members
IndexCache Class Reference

Cached information on the Conley-Morse decompositions which contains information on computed Conley indices for Morse sets and also the information on whether the invariant part was proved to be empty for the sets with the trivial index. More...

#include <indcache.h>

Public Member Functions

 IndexCache (int nSets)
 The constructor of an empty cached information structure for the given number of Morse sets. More...
 
int read (const std::string &fileName, theMorseDecompositionType &morseDec)
 Reads the cached information from a file, matches it with the given Morse decomposition and sets the Conley indices. More...
 
int write (const std::string &fileName, const theMorseDecompositionType &morseDec) const
 Writes the cached information for the given Morse decomposition to a file. More...
 
 ~IndexCache ()
 The destructor of a cached information structure. More...
 

Public Attributes

std::vector< bool > emptyInv
 The information on whether the invariant part of the given set has been proven to be empty. More...
 
std::vector< bool > attractor
 The information on whether the given Morse set is an attractor in the sense that its image is contained in itself. More...
 
std::vector< bool > wrongIndex
 The information on whether the given index could not be computed because of a problem with isolation. More...
 
std::vector< bool > skipped
 The information on whether the computation of the given index was skipped due to the limit on the size of the set. More...
 

Detailed Description

Cached information on the Conley-Morse decompositions which contains information on computed Conley indices for Morse sets and also the information on whether the invariant part was proved to be empty for the sets with the trivial index.

Definition at line 65 of file indcache.h.

Constructor & Destructor Documentation

◆ IndexCache()

IndexCache::IndexCache ( int  nSets)
inline

The constructor of an empty cached information structure for the given number of Morse sets.

Definition at line 108 of file indcache.h.

◆ ~IndexCache()

IndexCache::~IndexCache ( )
inline

The destructor of a cached information structure.

Definition at line 115 of file indcache.h.

Member Function Documentation

◆ read()

int IndexCache::read ( const std::string &  fileName,
theMorseDecompositionType morseDec 
)

Reads the cached information from a file, matches it with the given Morse decomposition and sets the Conley indices.

Returns 0 if succeeded, or -1 if failed.

Definition at line 120 of file indcache.h.

References attractor, emptyInv, skipped, and wrongIndex.

◆ write()

int IndexCache::write ( const std::string &  fileName,
const theMorseDecompositionType morseDec 
) const

Writes the cached information for the given Morse decomposition to a file.

Returns 0 if succeeded, 1 if the file already exists, or -1 in the case of failure.

Definition at line 367 of file indcache.h.

References attractor, emptyInv, skipped, and wrongIndex.

Member Data Documentation

◆ attractor

std::vector<bool> IndexCache::attractor

The information on whether the given Morse set is an attractor in the sense that its image is contained in itself.

Definition at line 94 of file indcache.h.

Referenced by read(), and write().

◆ emptyInv

std::vector<bool> IndexCache::emptyInv

The information on whether the invariant part of the given set has been proven to be empty.

Definition at line 90 of file indcache.h.

Referenced by read(), and write().

◆ skipped

std::vector<bool> IndexCache::skipped

The information on whether the computation of the given index was skipped due to the limit on the size of the set.

Definition at line 102 of file indcache.h.

Referenced by read(), and write().

◆ wrongIndex

std::vector<bool> IndexCache::wrongIndex

The information on whether the given index could not be computed because of a problem with isolation.

Definition at line 98 of file indcache.h.

Referenced by read(), and write().


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