storage.cc File Reference

#include "storage.hh"
#include "combinatorics.hh"
#include "props.hh"
#include <iomanip>
#include <sstream>

Functions

long to_long (multiplier_t mul)
std::string to_string (long num)
void multiply (rset_t::iterator &num, multiplier_t fac)
void add (rset_t::iterator &num, multiplier_t fac)
void zero (rset_t::iterator &num)
void one (rset_t::iterator &num)
void flip_sign (rset_t::iterator &num)
void half (rset_t::iterator &num)
int subtree_compare (exptree::iterator one, exptree::iterator two, int mod_prel, bool checksets, int compare_multiplier, bool literal_wildcards)
bool tree_less (const exptree &one, const exptree &two, int mod_prel, bool checksets, int compare_multiplier)
bool tree_equal (const exptree &one, const exptree &two, int mod_prel, bool checksets, int compare_multiplier)
bool tree_exact_less (const exptree &one, const exptree &two, int mod_prel, bool checksets, int compare_multiplier, bool literal_wildcards)
bool tree_exact_equal (const exptree &one, const exptree &two, int mod_prel, bool checksets, int compare_multiplier, bool literal_wildcards)
bool subtree_less (exptree::iterator one, exptree::iterator two, int mod_prel, bool checksets, int compare_multiplier)
bool subtree_equal (exptree::iterator one, exptree::iterator two, int mod_prel, bool checksets, int compare_multiplier)
bool subtree_exact_less (exptree::iterator one, exptree::iterator two, int mod_prel, bool checksets, int compare_multiplier, bool literal_wildcards)
bool subtree_exact_equal (exptree::iterator one, exptree::iterator two, int mod_prel, bool checksets, int compare_multiplier, bool literal_wildcards)
bool operator== (const exptree &first, const exptree &second)

Variables

nset_t name_set
rset_t rat_set

Function Documentation

void add rset_t::iterator &  num,
multiplier_t  fac
 

void flip_sign rset_t::iterator &  num  ) 
 

void half rset_t::iterator &  num  ) 
 

void multiply rset_t::iterator &  num,
multiplier_t  fac
 

void one rset_t::iterator &  num  ) 
 

bool operator== const exptree first,
const exptree second
 

This operator does an exact comparison, with no symbols interpreted as wildcards or patterns.

int subtree_compare exptree::iterator  one,
exptree::iterator  two,
int  mod_prel,
bool  checksets,
int  compare_multiplier,
bool  literal_wildcards
 

bool subtree_equal exptree::iterator  one,
exptree::iterator  two,
int  mod_prel,
bool  checksets,
int  compare_multiplier
 

bool subtree_exact_equal exptree::iterator  one,
exptree::iterator  two,
int  mod_prel,
bool  checksets,
int  compare_multiplier,
bool  literal_wildcards
 

bool subtree_exact_less exptree::iterator  one,
exptree::iterator  two,
int  mod_prel,
bool  checksets,
int  compare_multiplier,
bool  literal_wildcards
 

bool subtree_less exptree::iterator  one,
exptree::iterator  two,
int  mod_prel,
bool  checksets,
int  compare_multiplier
 

long to_long multiplier_t  mul  ) 
 

std::string to_string long  num  ) 
 

bool tree_equal const exptree one,
const exptree two,
int  mod_prel,
bool  checksets,
int  compare_multiplier
 

bool tree_exact_equal const exptree one,
const exptree two,
int  mod_prel,
bool  checksets,
int  compare_multiplier,
bool  literal_wildcards
 

bool tree_exact_less const exptree one,
const exptree two,
int  mod_prel,
bool  checksets,
int  compare_multiplier,
bool  literal_wildcards
 

bool tree_less const exptree one,
const exptree two,
int  mod_prel = -2,
bool  checksets = true,
int  compare_multiplier = -2
 

Various comparison functions, some exact, some with pattern logic. The mod_prel variable determines whether parent relations are taken into account when comparing:

-2: require that parent relations match (or that indices are position-free) -1: do not require that parent relations match >=0: do not require parent relations to match up to and including this level

Similar logic holds for the compare_multiplier parameter.

void zero rset_t::iterator &  num  ) 
 


Variable Documentation

nset_t name_set
 

rset_t rat_set
 


Generated on Sat Jul 18 23:03:14 2009 for cadabra by  doxygen 1.4.6