spot
0.8.2
|
Whether a word is bare. More...
Classes | |
class | spot::bdd_allocator |
Manage ranges of variables. More... | |
struct | spot::bdd_less_than |
Comparison functor for BDDs. More... | |
struct | spot::bdd_hash |
Hash functor for BDDs. More... | |
class | spot::free_list |
Manage list of free integers. More... | |
struct | spot::char_ptr_less_than |
Strict Weak Ordering for char* .This is meant to be used as a comparison functor for STL map whose key are of type const char* . More... | |
class | spot::minato_isop |
Generate an irredundant sum-of-products (ISOP) form of a BDD function.This algorithm implements a derecursived version the Minato-Morreale algorithm presented in the following paper. More... | |
class | spot::loopless_modular_mixed_radix_gray_code |
Loopless modular mixed radix Gray code iteration.This class is based on the loopless modular mixed radix gray code algorithm described in exercise 77 of "The Art of Computer
Programming", Pre-Fascicle 2A (Draft of section 7.2.1.1: generating all n-tuples) by Donald E. Knuth. More... | |
class | spot::option_map |
Manage a map of options.Each option is defined by a string and is associated to an integer value. More... | |
struct | spot::time_info |
A structure to record elapsed time in clock ticks. More... | |
class | spot::timer |
A timekeeper that accumulate interval of time. More... | |
class | spot::timer_map |
A map of timer, where each timer has a name. More... | |
Modules | |
Hashing functions | |
Random functions | |
Functions | |
bool | spot::is_bare_word (const char *str) |
std::string | spot::quote_unless_bare_word (const std::string &str) |
Double-quote words that are not bare. | |
std::ostream & | spot::escape_str (std::ostream &os, const std::string &str) |
Escape characters " , \ , and \n in str. | |
std::string | spot::escape_str (const std::string &str) |
Escape characters " , \ , and \n in str. | |
void | spot::int_array_array_compress2 (const int *array, size_t n, int *dest, size_t &dest_size) |
Compress an int array of size n into a int array. | |
void | spot::int_array_array_decompress2 (const int *array, size_t array_size, int *res, size_t size) |
Uncompress an int array of size array_size into a int array of size size. | |
void | spot::int_vector_vector_compress (const std::vector< int > &input, std::vector< unsigned int > &output) |
Compress an int vector into a vector of unsigned int. | |
void | spot::int_vector_vector_decompress (const std::vector< unsigned int > &array, std::vector< int > &output, size_t size) |
Uncompress a vector of unsigned int into a vector of size size. | |
const std::vector< unsigned int > * | spot::int_array_vector_compress (const int *array, size_t n) |
Compress an int array if size n into a vector of unsigned int. | |
void | spot::int_vector_array_decompress (const std::vector< unsigned int > *array, int *res, size_t size) |
Uncompress a vector of unsigned int into an int array of size size. | |
void | spot::int_array_array_compress (const int *array, size_t n, int *dest, size_t &dest_size) |
Compress an int array of size n into a int array. | |
void | spot::int_array_array_decompress (const int *array, size_t array_size, int *res, size_t size) |
Uncompress an int array of size array_size into a int array of size size. | |
const char * | spot::version () |
Return Spot's version. |
Whether a word is bare.
Bare words should start with a letter or an underscore, and consist solely of alphanumeric characters and underscores.
std::ostream& spot::escape_str | ( | std::ostream & | os, |
const std::string & | str | ||
) |
Escape characters "
, \
, and \n
in str.
std::string spot::escape_str | ( | const std::string & | str | ) |
Escape characters "
, \
, and \n
in str.
void spot::int_array_array_compress | ( | const int * | array, |
size_t | n, | ||
int * | dest, | ||
size_t & | dest_size | ||
) |
Compress an int array of size n into a int array.
The destination array should be at least dest_size large An assert will be triggered if dest_size is too small. On return, dest_size will be set to the actually number of int filled in dest
void spot::int_array_array_compress2 | ( | const int * | array, |
size_t | n, | ||
int * | dest, | ||
size_t & | dest_size | ||
) |
Compress an int array of size n into a int array.
The destination array should be at least dest_size large An assert will be triggered if dest_size is too small. On return, dest_size will be set to the actually number of int filled in dest
void spot::int_array_array_decompress | ( | const int * | array, |
size_t | array_size, | ||
int * | res, | ||
size_t | size | ||
) |
Uncompress an int array of size array_size into a int array of size size.
size must be the exact expected size of uncompressed array.
void spot::int_array_array_decompress2 | ( | const int * | array, |
size_t | array_size, | ||
int * | res, | ||
size_t | size | ||
) |
Uncompress an int array of size array_size into a int array of size size.
size must be the exact expected size of uncompressed array.
const std::vector<unsigned int>* spot::int_array_vector_compress | ( | const int * | array, |
size_t | n | ||
) |
Compress an int array if size n into a vector of unsigned int.
void spot::int_vector_array_decompress | ( | const std::vector< unsigned int > * | array, |
int * | res, | ||
size_t | size | ||
) |
Uncompress a vector of unsigned int into an int array of size size.
size must be the exact expected size of uncompressed array.
void spot::int_vector_vector_compress | ( | const std::vector< int > & | input, |
std::vector< unsigned int > & | output | ||
) |
Compress an int vector into a vector of unsigned int.
void spot::int_vector_vector_decompress | ( | const std::vector< unsigned int > & | array, |
std::vector< int > & | output, | ||
size_t | size | ||
) |
Uncompress a vector of unsigned int into a vector of size size.
size must be the exact expected size of uncompressed array.
bool spot::is_bare_word | ( | const char * | str | ) |
std::string spot::quote_unless_bare_word | ( | const std::string & | str | ) |
Double-quote words that are not bare.
const char* spot::version | ( | ) |
Return Spot's version.