library of assembled shared sources |
http://lass.cocamware.com |
Namespaces | |
namespace | impl |
Data Structures | |
struct | deletor_t |
functor to delete object argument More... | |
struct | deletor_array_t |
functor to delete array argument More... | |
class | const_integral_iterator |
class | integral_range_t |
class | iterator_range |
iterator range. More... | |
class | lass_allocator< void, VariableAllocator > |
class | lass_allocator |
an adaptor to use an lass::util Allocator as a replacement for std::allocator More... | |
class | lock_free_queue |
Non-blocking, lock-free FIFO data structure. More... | |
class | overwrite_insert_iterator |
struct | select_1st |
selects first element of std::pair or stde::triple and applies supplied operator on it More... | |
struct | select_2nd |
selects second element of std::pair or stde::triple and applies supplied operator on it More... | |
struct | select_3rd |
selects second element of std::pair or stde::triple and applies supplied operator on it More... | |
class | slist |
a single linked list, just like the one in SGI STL (and STLport . More... | |
class | static_vector |
it looks like a vector, it smells like a vector, but it only uses a fixed amout of memory More... | |
class | triple |
extension of std::pair to three values, trait three values as a single unit. More... | |
class | vector_map |
a map-like container built on a sorted vector (write-rarely, read-many) More... | |
class | integral_range |
integral range. More... | |
Functions | |
template<class InputIterator , class Size , class OutputIterator > | |
OutputIterator | copy_n (InputIterator first, Size count, OutputIterator result) |
copy count elements from sequence starting at first to sequence starting at result | |
template<class InputIterator , class OutputIterator , class Size > | |
OutputIterator | repeat (InputIterator first, InputIterator last, OutputIterator output, Size n) |
copy sequence first to last n times to sequence starting at output | |
template<class Container , class Size > | |
Container | repeat_c (const Container &iC, Size n) |
template<class Container , class Size > | |
Container & | inplace_repeat_c (Container &iC, Size n) |
template<typename Iter > | |
Iter | prev (Iter i) |
template<typename Iter > | |
Iter | next (Iter i) |
template<typename Iter , typename Diff > | |
Iter | prev (Iter i, Diff d) |
template<typename Iter , typename Diff > | |
Iter | next (Iter i, Diff d) |
template<typename Iterator > | |
Iterator | next (Iterator iterator) |
template<typename Iterator > | |
Iterator | prior (Iterator iterator) |
template<typename Iterator , typename Distance > | |
Iterator | next (Iterator iterator, Distance distance) |
template<typename Iterator , typename Distance > | |
Iterator | prior (Iterator iterator, Distance distance) |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | tolower (const std::basic_string< Char, Traits, Alloc > &input, const std::locale &locale) |
convert std::basic_string to lower case by using user locale | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | toupper (const std::basic_string< Char, Traits, Alloc > &input, const std::locale &locale) |
convert std::basic_string to upper case by using user locale | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | replace_all (const std::basic_string< Char, Traits, Alloc > &input, const std::basic_string< Char, Traits, Alloc > &to_be_replaced, const std::basic_string< Char, Traits, Alloc > &replacement) |
replace all instances of to_be_replaced in input by replacement. | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | replace_all (const std::basic_string< Char, Traits, Alloc > &input, const Char *to_be_replaced, const Char *replacement) |
replace all instances of to_be_replaced in input by replacement. | |
template<typename Char , typename Traits , typename Alloc > | |
bool | begins_with (const std::basic_string< Char, Traits, Alloc > &input, const std::basic_string< Char, Traits, Alloc > &prefix) |
returns true if input begins with the input prefix | |
template<typename Char , typename Traits , typename Alloc > | |
bool | begins_with (const std::basic_string< Char, Traits, Alloc > &input, const Char *prefix) |
returns true if input begins with the input prefix | |
template<typename Char , typename Traits , typename Alloc > | |
bool | ends_with (const std::basic_string< Char, Traits, Alloc > &input, const std::basic_string< Char, Traits, Alloc > &suffix) |
returns true if input ends with the input suffix | |
template<typename Char , typename Traits , typename Alloc > | |
bool | ends_with (const std::basic_string< Char, Traits, Alloc > &input, const Char *suffix) |
returns true if input ends with the input suffix | |
template<typename Char , typename Traits , typename Alloc > | |
std::vector< std::basic_string < Char, Traits, Alloc > > | split (const std::basic_string< Char, Traits, Alloc > &to_be_split) |
Reflects the Python function split without seperator argument. | |
template<typename Char , typename Traits , typename Alloc > | |
std::vector< std::basic_string < Char, Traits, Alloc > > | split (const std::basic_string< Char, Traits, Alloc > &to_be_split, const std::basic_string< Char, Traits, Alloc > &seperator, size_t max_split) |
Reflects the Python function split without seperator argument. | |
template<typename Char , typename Traits , typename Alloc > | |
std::vector< std::basic_string < Char, Traits, Alloc > > | split (const std::basic_string< Char, Traits, Alloc > &to_be_split, const Char *seperator, size_t max_split) |
Reflects the Python function split without seperator argument. | |
template<typename Char , typename Traits , typename Alloc , typename InputIterator > | |
std::basic_string< Char, Traits, Alloc > | join (const std::basic_string< Char, Traits, Alloc > &joiner, InputIterator first, InputIterator last) |
template<typename Char , typename Traits , typename Alloc , typename InputRange > | |
std::basic_string< Char, Traits, Alloc > | join_r (const std::basic_string< Char, Traits, Alloc > &joiner, const InputRange &range) |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | lstrip (const std::basic_string< Char, Traits, Alloc > &to_be_stripped, const std::basic_string< Char, Traits, Alloc > &to_be_removed) |
Return a copy of the string to_be_stripped with leading characters removed. | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | lstrip (const std::basic_string< Char, Traits, Alloc > &to_be_stripped) |
Return a copy of the string to_be_stripped with leading whitespace removed. | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | rstrip (const std::basic_string< Char, Traits, Alloc > &to_be_stripped, const std::basic_string< Char, Traits, Alloc > &to_be_removed) |
Return a copy of the string to_be_stripped with trailing characters removed. | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | rstrip (const std::basic_string< Char, Traits, Alloc > &to_be_stripped) |
Return a copy of the string to_be_stripped with trailing whitespace removed. | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | strip (const std::basic_string< Char, Traits, Alloc > &to_be_stripped, const std::basic_string< Char, Traits, Alloc > &to_be_removed) |
Return a copy of the string to_be_stripped with both leading and trailing characters removed. | |
template<typename Char , typename Traits , typename Alloc > | |
std::basic_string< Char, Traits, Alloc > | strip (const std::basic_string< Char, Traits, Alloc > &to_be_stripped) |
Return a copy of the string to_be_stripped with leading and trailing whitespace removed. | |
template<typename I > | |
bool | operator== (const const_integral_iterator< I > &a, const const_integral_iterator< I > &b) |
template<typename I > | |
bool | operator!= (const const_integral_iterator< I > &a, const const_integral_iterator< I > &b) |
template<typename I > | |
bool | operator< (const const_integral_iterator< I > &a, const const_integral_iterator< I > &b) |
template<typename I > | |
bool | operator> (const const_integral_iterator< I > &a, const const_integral_iterator< I > &b) |
template<typename I > | |
bool | operator<= (const const_integral_iterator< I > &a, const const_integral_iterator< I > &b) |
template<typename I > | |
bool | operator>= (const const_integral_iterator< I > &a, const const_integral_iterator< I > &b) |
template<typename I > | |
bool | operator== (const integral_range_t< I > &a, const integral_range_t< I > &b) |
template<typename I > | |
bool | operator!= (const integral_range_t< I > &a, const integral_range_t< I > &b) |
template<typename I > | |
bool | operator< (const integral_range_t< I > &a, const integral_range_t< I > &b) |
template<typename I > | |
bool | operator> (const integral_range_t< I > &a, const integral_range_t< I > &b) |
template<typename I > | |
bool | operator<= (const integral_range_t< I > &a, const integral_range_t< I > &b) |
template<typename I > | |
bool | operator>= (const integral_range_t< I > &a, const integral_range_t< I > &b) |
template<typename I > | |
integral_range_t< I > | integral_range (const I &last) |
template<typename I > | |
integral_range_t< I > | integral_range (const I &first, const I &last) |
template<typename I > | |
integral_range_t< I > | integral_range (const I &first, const I &last, const I &step) |
template<typename I > | |
iterator_range< I > | range (const I &a, const I &b) |
template<typename I > | |
const bool | operator== (const iterator_range< I > &a, const iterator_range< I > &b) |
template<typename I > | |
const bool | operator!= (const iterator_range< I > &a, const iterator_range< I > &b) |
template<typename T1 , typename T2 , typename VariableAllocator > | |
bool | operator== (const lass_allocator< T1, VariableAllocator > &, const lass_allocator< T2, VariableAllocator > &) |
template<typename T1 , typename T2 , typename VariableAllocator > | |
bool | operator!= (const lass_allocator< T1, VariableAllocator > &, const lass_allocator< T2, VariableAllocator > &) |
template<typename T1 , typename T2 , typename VA > | |
bool | operator== (const lass_allocator< T1, VA > &, const lass_allocator< T2, VA > &) |
template<typename T1 , typename T2 , typename VA > | |
bool | operator!= (const lass_allocator< T1, VA > &, const lass_allocator< T2, VA > &) |
template<typename Container > | |
overwrite_insert_iterator < Container > | overwrite_inserter (Container &container) |
template<typename InputRange , typename Op > | |
Op | for_each_r (InputRange &range, Op op) |
std::for_each wrapper for ranges | |
template<typename InputRange , typename T > | |
InputRange::iterator | find_r (const InputRange &range, const T &value) |
std::find wrapper for ranges | |
template<typename InputRange , typename Predicate > | |
InputRange::iterator | find_if_r (const InputRange &range, Predicate pred) |
std::find_if wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 > | |
ForwardRange1::iterator | find_end_r (const ForwardRange1 &range1, const ForwardRange2 &range2) |
std::find_end wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 , typename BinaryPredicate > | |
ForwardRange1::iterator | find_end_r (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
std::find_end wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 > | |
ForwardRange1::iterator | find_first_of_r (const ForwardRange1 &range1, const ForwardRange2 &range2) |
std::find_first_of wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 , typename BinaryPredicate > | |
ForwardRange1::iterator | find_first_of_r (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
std::find_first_of wrapper for ranges | |
template<typename ForwardRange > | |
ForwardRange::iterator | adjacent_find_r (const ForwardRange &range) |
std::adjacent_find wrapper for ranges | |
template<typename ForwardRange , typename Predicate > | |
ForwardRange::iterator | adjacent_find_r (const ForwardRange &range, Predicate pred) |
std::adjacent_find wrapper for ranges | |
template<typename InputRange , typename T > | |
std::iterator_traits< typename InputRange::iterator > ::difference_type | count_r (const InputRange &range, const T &value) |
std::count wrapper for ranges | |
template<typename InputRange , typename Predicate > | |
std::iterator_traits< typename InputRange::iterator > ::difference_type | count_if_r (const InputRange &range, Predicate pred) |
std::count_if wrapper for ranges | |
template<typename InputRange1 , typename InputRange2 , typename BinaryPredicate > | |
std::pair< typename InputRange1::iterator, typename InputRange2::iterator > | mismatch_r (const InputRange1 &range1, const InputRange2 &range2, BinaryPredicate pred) |
std::mismatch wrapper for ranges | |
template<typename InputRange1 , typename InputRange2 > | |
std::pair< typename InputRange1::iterator, typename InputRange2::iterator > | mismatch_r (const InputRange1 &range1, const InputRange2 &range2) |
std::mismatch wrapper for ranges | |
template<typename InputRange1 , typename InputRange2 > | |
bool | equal_r (const InputRange1 &range1, const InputRange2 &range2) |
std::mismatch wrapper for ranges | |
template<typename InputRange1 , typename InputRange2 , typename BinaryPredicate > | |
bool | equal_r (const InputRange1 &range1, const InputRange2 &range2, BinaryPredicate pred) |
std::mismatch wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 > | |
ForwardRange1::iterator | search_r (const ForwardRange1 &range1, const ForwardRange2 &range2) |
std::search wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 , typename BinaryPredicate > | |
ForwardRange1::iterator | search_r (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
std::search wrapper for ranges | |
template<typename ForwardRange , typename Size , typename T > | |
ForwardRange::iterator | search_n_r (const ForwardRange &range, Size count, const T &value) |
std::search_n wrapper for ranges | |
template<typename ForwardRange , typename Size , typename T , typename BinaryPredicate > | |
ForwardRange::iterator | search_n_r (const ForwardRange &range, Size count, const T &value, BinaryPredicate pred) |
std::search_n wrapper for ranges | |
template<typename InputRange , typename OutputIterator > | |
OutputIterator | copy_r (const InputRange &range, OutputIterator result) |
std::copy wrapper for ranges | |
template<typename BidirectionalRange , typename BidirectionalIterator > | |
BidirectionalIterator | copy_backward_r (const BidirectionalRange &range, BidirectionalIterator result) |
std::copy_backward wrapper for ranges | |
template<typename ForwardRange1 , typename ForwardRange2 > | |
ForwardRange2::iterator | swap_ranges_r (ForwardRange1 &range1, ForwardRange2 &range2) |
std::swap_ranges wrapper for ranges | |
template<typename InputRange , typename OutputIterator , typename UnaryOperation > | |
OutputIterator | transform_r (const InputRange &range, OutputIterator result, UnaryOperation op) |
std::transform wrapper for ranges | |
template<typename InputRange1 , typename InputRange2 , typename OutputIterator , typename BinaryOperation > | |
OutputIterator | transform_r (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, BinaryOperation op) |
std::transform wrapper for ranges | |
template<typename ForwardRange , typename T > | |
void | replace_r (ForwardRange &range, const T &old_value, const T &new_value) |
std::replace wrapper for ranges | |
template<typename ForwardRange , typename Predicate , typename T > | |
void | replace_if_r (ForwardRange &range, Predicate pred, const T &new_value) |
std::replace_if wrapper for ranges | |
template<typename InputRange , typename OutputIterator , typename T > | |
OutputIterator | replace_copy_r (const InputRange &range, OutputIterator result, const T &old_value, const T &new_value) |
std::replace_copy wrapper for ranges | |
template<typename InputRange , typename OutputIterator , typename Predicate , typename T > | |
OutputIterator | replace_copy_if_r (const InputRange &range, OutputIterator result, Predicate pred, const T &new_value) |
std::replace_copy_if wrapper for ranges | |
template<typename ForwardRange , typename T > | |
void | fill_r (ForwardRange &range, const T &value) |
std::fill wrapper for ranges | |
template<typename ForwardRange , typename Generator > | |
void | generate_r (ForwardRange &range, Generator gen) |
std::generate wrapper for ranges | |
template<typename ForwardRange , typename T > | |
ForwardRange::iterator | remove_r (ForwardRange &range, const T &value) |
std::remove wrapper for ranges | |
template<typename ForwardRange , typename Predicate > | |
ForwardRange::iterator | remove_if_r (ForwardRange &range, Predicate pred) |
std::remove wrapper for ranges | |
template<typename InputRange , typename OutputIterator , typename T > | |
OutputIterator | remove_copy_r (const InputRange &range, OutputIterator result, const T &value) |
std::remove_copy wrapper for ranges | |
template<typename InputRange , typename OutputIterator , typename Predicate > | |
OutputIterator | remove_copy_if_r (const InputRange &range, OutputIterator result, Predicate pred) |
std::remove_copy wrapper for ranges | |
template<typename ForwardRange > | |
ForwardRange::iterator | unique_r (ForwardRange &range) |
std::unique wrapper for ranges | |
template<typename ForwardRange , typename Predicate > | |
ForwardRange::iterator | unique_r (ForwardRange &range, Predicate pred) |
std::unique wrapper for ranges | |
template<typename InputRange , typename OutputIterator > | |
OutputIterator | unique_copy_r (const InputRange &range, OutputIterator result) |
std::unique_copy_r wrapper for ranges | |
template<typename InputRange , typename OutputIterator , typename Predicate > | |
OutputIterator | unique_copy_r (const InputRange &range, OutputIterator result, Predicate pred) |
std::unique_copy_r wrapper for ranges | |
template<typename BidirectionalRange > | |
void | reverse_r (BidirectionalRange &range) |
std::reverse wrapper for ranges | |
template<typename BidirectionalRange , typename OutputIterator > | |
OutputIterator | reverse_copy_r (const BidirectionalRange &range, OutputIterator result) |
std::reverse_copy wrapper for ranges | |
template<typename ForwardRange > | |
void | rotate_r (ForwardRange &range, typename ForwardRange::iterator middle) |
std::rotate wrapper for ranges | |
template<typename ForwardRange , typename OutputIterator > | |
void | rotate_copy_r (const ForwardRange &range, typename ForwardRange::iterator middle, OutputIterator result) |
std::rotate_copy wrapper for ranges | |
template<typename RandomAccessRange > | |
void | random_shuffle_r (RandomAccessRange &range) |
std::random_shuffle wrapper for ranges | |
template<typename RandomAccessRange , typename RandomNumberGenerator > | |
void | random_shuffle_r (RandomAccessRange &range, RandomNumberGenerator &rand) |
std::random_shuffle wrapper for ranges | |
template<typename BidirectionalRange , typename Predicate > | |
BidirectionalRange::iterator | partition_r (BidirectionalRange &range, Predicate pred) |
std::partition wrapper for ranges | |
template<typename BidirectionalRange , typename Predicate > | |
BidirectionalRange::iterator | stable_partition_r (BidirectionalRange &range, Predicate pred) |
std::stable_partition wrapper for ranges | |
template<typename T , class Alloc > | |
bool | operator== (const slist< T, Alloc > &a, const slist< T, Alloc > &b) |
template<typename T , class Alloc > | |
bool | operator!= (const slist< T, Alloc > &a, const slist< T, Alloc > &b) |
template<typename T , class Alloc > | |
bool | operator< (const slist< T, Alloc > &a, const slist< T, Alloc > &b) |
template<typename T , class Alloc > | |
bool | operator> (const slist< T, Alloc > &a, const slist< T, Alloc > &b) |
template<typename T , class Alloc > | |
bool | operator<= (const slist< T, Alloc > &a, const slist< T, Alloc > &b) |
template<typename T , class Alloc > | |
bool | operator>= (const slist< T, Alloc > &a, const slist< T, Alloc > &b) |
template<typename T , class Alloc , typename Char , typename Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &o_stream, const slist< T, Alloc > &container) |
template<typename T , class Alloc , typename Char , typename Traits > | |
std::basic_istream< Char, Traits > & | operator>> (std::basic_istream< Char, Traits > &i_stream, slist< T, Alloc > &container) |
template<typename T , size_t max_size> | |
bool | operator== (const static_vector< T, max_size > &x, const static_vector< T, max_size > &y) |
template<typename T , size_t max_size> | |
bool | operator!= (const static_vector< T, max_size > &x, const static_vector< T, max_size > &y) |
template<typename T , size_t max_size> | |
bool | operator< (const static_vector< T, max_size > &x, const static_vector< T, max_size > &y) |
template<typename T , size_t max_size> | |
bool | operator> (const static_vector< T, max_size > &x, const static_vector< T, max_size > &y) |
template<typename T , size_t max_size> | |
bool | operator<= (const static_vector< T, max_size > &x, const static_vector< T, max_size > &y) |
template<typename T , size_t max_size> | |
bool | operator>= (const static_vector< T, max_size > &x, const static_vector< T, max_size > &y) |
template<typename T , size_t max_size, typename Char , typename Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &o_stream, const static_vector< T, max_size > &container) |
template<typename T , size_t max_size, typename Char , typename Traits > | |
std::basic_istream< Char, Traits > & | operator>> (std::basic_istream< Char, Traits > &i_stream, static_vector< T, max_size > &container) |
template<typename T1 , typename T2 , typename T3 , typename U1 , typename U2 , typename U3 > | |
bool | operator== (const triple< T1, T2, T3 > &x, const triple< U1, U2, U3 > &y) |
template<typename T1 , typename T2 , typename T3 , typename U1 , typename U2 , typename U3 > | |
bool | operator!= (const triple< T1, T2, T3 > &x, const triple< U1, U2, U3 > &y) |
template<typename T1 , typename T2 , typename T3 , typename U1 , typename U2 , typename U3 > | |
bool | operator< (const triple< T1, T2, T3 > &x, const triple< U1, U2, U3 > &y) |
template<typename T1 , typename T2 , typename T3 , typename U1 , typename U2 , typename U3 > | |
bool | operator> (const triple< T1, T2, T3 > &x, const triple< U1, U2, U3 > &y) |
template<typename T1 , typename T2 , typename T3 , typename U1 , typename U2 , typename U3 > | |
bool | operator<= (const triple< T1, T2, T3 > &x, const triple< U1, U2, U3 > &y) |
template<typename T1 , typename T2 , typename T3 , typename U1 , typename U2 , typename U3 > | |
bool | operator>= (const triple< T1, T2, T3 > &x, const triple< U1, U2, U3 > &y) |
template<typename T1 , typename T2 , typename T3 > | |
std::ostream & | operator<< (std::ostream &stream, const triple< T1, T2, T3 > &x) |
template<typename T1 , typename T2 , typename T3 > | |
triple< T1, T2, T3 > | make_triple (const T1 &a, const T2 &b, const T3 &c) |
template<typename Key , typename T , typename Compare , typename Allocator > | |
bool | operator== (const vector_map< Key, T, Compare, Allocator > &a, const vector_map< Key, T, Compare, Allocator > &b) |
template<typename Key , typename T , typename Compare , typename Allocator > | |
bool | operator< (const vector_map< Key, T, Compare, Allocator > &a, const vector_map< Key, T, Compare, Allocator > &b) |
template<typename Key , typename T , typename Compare , typename Allocator > | |
bool | operator!= (const vector_map< Key, T, Compare, Allocator > &a, const vector_map< Key, T, Compare, Allocator > &b) |
template<typename Key , typename T , typename Compare , typename Allocator > | |
bool | operator> (const vector_map< Key, T, Compare, Allocator > &a, const vector_map< Key, T, Compare, Allocator > &b) |
template<typename Key , typename T , typename Compare , typename Allocator > | |
bool | operator>= (const vector_map< Key, T, Compare, Allocator > &a, const vector_map< Key, T, Compare, Allocator > &b) |
template<typename Key , typename T , typename Compare , typename Allocator > | |
bool | operator<= (const vector_map< Key, T, Compare, Allocator > &a, const vector_map< Key, T, Compare, Allocator > &b) |
template<typename Key , typename T , typename Compare , typename Allocator , typename Char , typename Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &o_stream, const vector_map< Key, T, Compare, Allocator > &container) |
template<typename Key , typename T , typename Compare , typename Allocator , typename Char , typename Traits > | |
std::basic_istream< Char, Traits > & | operator>> (std::basic_istream< Char, Traits > &i_stream, vector_map< Key, T, Compare, Allocator > &container) |
Variables | |
T | |
C |
This namespace contains extensions to the standard library (std
namespace), provided by the lass library. In contrary to the rest of the lass
library, these extensions will follow the codestyle of the standard library and boost
.
Although these are extensions to the standard library, we've choosen to not incorporate these in the std
namespace. This to avoid conflicts with whatever is inside that std
namespace (boost
has its own namespace too).
And yes, stde
stands for standard extensions
These are the extensions we offer:
std::pair
and STL containers.std::basic_string
functionaly.next
and prior
.
Iter lass::stde::prev | ( | Iter | i | ) | [inline] |
Definition at line 56 of file extended_iterator.h.
Iter lass::stde::next | ( | Iter | i | ) | [inline] |
Definition at line 57 of file extended_iterator.h.
Referenced by lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::finalInit(), lass::num::SplineLinear< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineCubic< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineLinear< ScalarType, DataType, DataTraits >::init(), lass::num::IirFilter< T, InputIterator, OutputIterator >::init(), lass::stde::lock_free_queue< T, FixedAllocator >::pop(), lass::stde::lock_free_queue< T, FixedAllocator >::push(), and lass::stde::lock_free_queue< T, FixedAllocator >::~lock_free_queue().
Iter lass::stde::prev | ( | Iter | i, | |
Diff | d | |||
) | [inline] |
Definition at line 58 of file extended_iterator.h.
Referenced by lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::finalInit(), lass::num::SplineLinear< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineCubic< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineLinear< ScalarType, DataType, DataTraits >::init(), and lass::spat::experimental::ResetableThreadLocalVariable< TEdge * >::registerImpl().
Iter lass::stde::next | ( | Iter | i, | |
Diff | d | |||
) | [inline] |
Definition at line 59 of file extended_iterator.h.
Iterator lass::stde::next | ( | Iterator | iterator | ) | [inline] |
Definition at line 56 of file extended_iterator.inl.
Iterator lass::stde::prior | ( | Iterator | iterator | ) | [inline] |
Definition at line 65 of file extended_iterator.inl.
Iterator lass::stde::next | ( | Iterator | iterator, | |
Distance | distance | |||
) | [inline] |
Definition at line 74 of file extended_iterator.inl.
Referenced by lass::util::AllocatorConcurrentFreeList< FixedAllocator >::allocate(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::derivative(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::derivative2(), lass::io::BinaryIMemoryBlock::doRead(), lass::num::SplineLinear< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineCubic< ScalarType, DataType, DataTraits >::findNode(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::findNode(), lass::num::DataTraitsSequence< SequenceType >::get(), lass::num::SplineLinear< ScalarType, DataType, DataTraits >::integral(), lass::num::SplineCubic< ScalarType, DataType, DataTraits >::integral(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::integral(), lass::num::SplineBezierPath< ScalarType, DataType, DataTraits >::operator()(), lass::util::lock_free_stack< T, FixedAllocator >::pop_node(), lass::num::DataTraitsSequence< SequenceType >::set(), lass::util::AllocatorConcurrentFreeList< FixedAllocator >::~AllocatorConcurrentFreeList(), and lass::util::lock_free_stack< T, FixedAllocator >::~lock_free_stack().
Iterator lass::stde::prior | ( | Iterator | iterator, | |
Distance | distance | |||
) | [inline] |
Definition at line 83 of file extended_iterator.inl.
std::basic_string< Char, Traits, Alloc > lass::stde::join_r | ( | const std::basic_string< Char, Traits, Alloc > & | joiner, | |
const InputRange & | range | |||
) | [inline] |
bool lass::stde::operator== | ( | const const_integral_iterator< I > & | a, | |
const const_integral_iterator< I > & | b | |||
) | [inline] |
Definition at line 182 of file integral_range.inl.
References LASS_ASSERT, lass::stde::const_integral_iterator< integral_type >::step_, and lass::stde::const_integral_iterator< integral_type >::value_.
bool lass::stde::operator!= | ( | const const_integral_iterator< I > & | a, | |
const const_integral_iterator< I > & | b | |||
) | [inline] |
Definition at line 191 of file integral_range.inl.
bool lass::stde::operator< | ( | const const_integral_iterator< I > & | a, | |
const const_integral_iterator< I > & | b | |||
) | [inline] |
bool lass::stde::operator> | ( | const const_integral_iterator< I > & | a, | |
const const_integral_iterator< I > & | b | |||
) | [inline] |
Definition at line 208 of file integral_range.inl.
bool lass::stde::operator<= | ( | const const_integral_iterator< I > & | a, | |
const const_integral_iterator< I > & | b | |||
) | [inline] |
Definition at line 216 of file integral_range.inl.
bool lass::stde::operator>= | ( | const const_integral_iterator< I > & | a, | |
const const_integral_iterator< I > & | b | |||
) | [inline] |
Definition at line 224 of file integral_range.inl.
bool lass::stde::operator== | ( | const integral_range_t< I > & | a, | |
const integral_range_t< I > & | b | |||
) | [inline] |
Definition at line 446 of file integral_range.inl.
References lass::stde::integral_range_t< integral_type >::first_, LASS_ASSERT, lass::stde::integral_range_t< integral_type >::last_, and lass::stde::integral_range_t< integral_type >::step_.
bool lass::stde::operator!= | ( | const integral_range_t< I > & | a, | |
const integral_range_t< I > & | b | |||
) | [inline] |
Definition at line 455 of file integral_range.inl.
bool lass::stde::operator< | ( | const integral_range_t< I > & | a, | |
const integral_range_t< I > & | b | |||
) | [inline] |
bool lass::stde::operator> | ( | const integral_range_t< I > & | a, | |
const integral_range_t< I > & | b | |||
) | [inline] |
Definition at line 472 of file integral_range.inl.
bool lass::stde::operator<= | ( | const integral_range_t< I > & | a, | |
const integral_range_t< I > & | b | |||
) | [inline] |
Definition at line 480 of file integral_range.inl.
bool lass::stde::operator>= | ( | const integral_range_t< I > & | a, | |
const integral_range_t< I > & | b | |||
) | [inline] |
Definition at line 488 of file integral_range.inl.
integral_range_t< I > lass::stde::integral_range | ( | const I & | last | ) | [inline] |
Definition at line 422 of file integral_range.inl.
integral_range_t< I > lass::stde::integral_range | ( | const I & | first, | |
const I & | last | |||
) | [inline] |
Definition at line 430 of file integral_range.inl.
integral_range_t< I > lass::stde::integral_range | ( | const I & | first, | |
const I & | last, | |||
const I & | step | |||
) | [inline] |
Definition at line 438 of file integral_range.inl.
iterator_range< I > lass::stde::range | ( | const I & | a, | |
const I & | b | |||
) | [inline] |
const bool lass::stde::operator== | ( | const iterator_range< I > & | a, | |
const iterator_range< I > & | b | |||
) | [inline] |
Definition at line 216 of file iterator_range.inl.
References lass::stde::iterator_range< iterator_type >::begin(), and lass::stde::iterator_range< iterator_type >::end().
const bool lass::stde::operator!= | ( | const iterator_range< I > & | a, | |
const iterator_range< I > & | b | |||
) | [inline] |
Definition at line 224 of file iterator_range.inl.
bool lass::stde::operator== | ( | const lass_allocator< T1, VariableAllocator > & | , | |
const lass_allocator< T2, VariableAllocator > & | ||||
) | [inline] |
bool lass::stde::operator!= | ( | const lass_allocator< T1, VariableAllocator > & | , | |
const lass_allocator< T2, VariableAllocator > & | ||||
) | [inline] |
bool lass::stde::operator== | ( | const lass_allocator< T1, VA > & | , | |
const lass_allocator< T2, VA > & | ||||
) | [inline] |
Definition at line 156 of file lass_allocator.inl.
bool lass::stde::operator!= | ( | const lass_allocator< T1, VA > & | , | |
const lass_allocator< T2, VA > & | ||||
) | [inline] |
Definition at line 164 of file lass_allocator.inl.
overwrite_insert_iterator<Container> lass::stde::overwrite_inserter | ( | Container & | container | ) | [inline] |
Definition at line 103 of file overwrite_insert_iterator.h.
bool lass::stde::operator== | ( | const slist< T, Alloc > & | a, | |
const slist< T, Alloc > & | b | |||
) | [related] |
bool lass::stde::operator!= | ( | const slist< T, Alloc > & | a, | |
const slist< T, Alloc > & | b | |||
) | [related] |
bool lass::stde::operator< | ( | const slist< T, Alloc > & | a, | |
const slist< T, Alloc > & | b | |||
) | [related] |
bool lass::stde::operator> | ( | const slist< T, Alloc > & | a, | |
const slist< T, Alloc > & | b | |||
) | [related] |
bool lass::stde::operator<= | ( | const slist< T, Alloc > & | a, | |
const slist< T, Alloc > & | b | |||
) | [related] |
bool lass::stde::operator>= | ( | const slist< T, Alloc > & | a, | |
const slist< T, Alloc > & | b | |||
) | [related] |
std::basic_ostream<Char, Traits>& lass::stde::operator<< | ( | std::basic_ostream< Char, Traits > & | o_stream, | |
const slist< T, Alloc > & | container | |||
) | [related] |
std::basic_istream<Char, Traits>& lass::stde::operator>> | ( | std::basic_istream< Char, Traits > & | i_stream, | |
slist< T, Alloc > & | container | |||
) | [related] |
bool lass::stde::operator== | ( | const static_vector< T, max_size > & | x, | |
const static_vector< T, max_size > & | y | |||
) | [inline] |
bool lass::stde::operator!= | ( | const static_vector< T, max_size > & | x, | |
const static_vector< T, max_size > & | y | |||
) | [inline] |
bool lass::stde::operator< | ( | const static_vector< T, max_size > & | x, | |
const static_vector< T, max_size > & | y | |||
) | [inline] |
bool lass::stde::operator> | ( | const static_vector< T, max_size > & | x, | |
const static_vector< T, max_size > & | y | |||
) | [inline] |
bool lass::stde::operator<= | ( | const static_vector< T, max_size > & | x, | |
const static_vector< T, max_size > & | y | |||
) | [inline] |
bool lass::stde::operator>= | ( | const static_vector< T, max_size > & | x, | |
const static_vector< T, max_size > & | y | |||
) | [inline] |
std::basic_ostream<Char, Traits>& lass::stde::operator<< | ( | std::basic_ostream< Char, Traits > & | o_stream, | |
const static_vector< T, max_size > & | container | |||
) | [inline] |
std::basic_istream<Char, Traits>& lass::stde::operator>> | ( | std::basic_istream< Char, Traits > & | i_stream, | |
static_vector< T, max_size > & | container | |||
) | [inline] |
bool lass::stde::operator== | ( | const triple< T1, T2, T3 > & | x, | |
const triple< U1, U2, U3 > & | y | |||
) | [related] |
bool lass::stde::operator!= | ( | const triple< T1, T2, T3 > & | x, | |
const triple< U1, U2, U3 > & | y | |||
) | [related] |
bool lass::stde::operator< | ( | const triple< T1, T2, T3 > & | x, | |
const triple< U1, U2, U3 > & | y | |||
) | [related] |
bool lass::stde::operator> | ( | const triple< T1, T2, T3 > & | x, | |
const triple< U1, U2, U3 > & | y | |||
) | [related] |
bool lass::stde::operator<= | ( | const triple< T1, T2, T3 > & | x, | |
const triple< U1, U2, U3 > & | y | |||
) | [related] |
bool lass::stde::operator>= | ( | const triple< T1, T2, T3 > & | x, | |
const triple< U1, U2, U3 > & | y | |||
) | [related] |
std::ostream & lass::stde::operator<< | ( | std::ostream & | stream, | |
const triple< T1, T2, T3 > & | x | |||
) | [inline] |
Definition at line 174 of file triple.inl.
triple<T1, T2, T3> lass::stde::make_triple | ( | const T1 & | a, | |
const T2 & | b, | |||
const T3 & | c | |||
) | [related] |
bool lass::stde::operator== | ( | const vector_map< Key, T, Compare, Allocator > & | a, | |
const vector_map< Key, T, Compare, Allocator > & | b | |||
) | [inline] |
bool lass::stde::operator< | ( | const vector_map< Key, T, Compare, Allocator > & | a, | |
const vector_map< Key, T, Compare, Allocator > & | b | |||
) | [inline] |
bool lass::stde::operator!= | ( | const vector_map< Key, T, Compare, Allocator > & | a, | |
const vector_map< Key, T, Compare, Allocator > & | b | |||
) | [inline] |
bool lass::stde::operator> | ( | const vector_map< Key, T, Compare, Allocator > & | a, | |
const vector_map< Key, T, Compare, Allocator > & | b | |||
) | [inline] |
bool lass::stde::operator>= | ( | const vector_map< Key, T, Compare, Allocator > & | a, | |
const vector_map< Key, T, Compare, Allocator > & | b | |||
) | [inline] |
bool lass::stde::operator<= | ( | const vector_map< Key, T, Compare, Allocator > & | a, | |
const vector_map< Key, T, Compare, Allocator > & | b | |||
) | [inline] |
std::basic_ostream<Char, Traits>& lass::stde::operator<< | ( | std::basic_ostream< Char, Traits > & | o_stream, | |
const vector_map< Key, T, Compare, Allocator > & | container | |||
) | [inline] |
std::basic_istream<Char, Traits>& lass::stde::operator>> | ( | std::basic_istream< Char, Traits > & | i_stream, | |
vector_map< Key, T, Compare, Allocator > & | container | |||
) | [inline] |
lass::stde::T [inline] |
Definition at line 61 of file vector_map.inl.
Referenced by lass::prim::impl::AllocatorHelper< T, false >::allocate(), lass::prim::impl::AllocatorHelper< T, hasTrivialConstructorAndDestructor >::allocate(), lass::spat::PlanarMesh::along(), lass::num::amp2dB(), lass::spat::barycenters(), lass::util::experimental::Future< T >::bind(), lass::prim::Point2D< T >::ccw(), lass::prim::Ray2D< T, NormalizingPolicy, ParameterPolicy >::classify(), lass::util::clearMaskedIf(), lass::prim::Transformation3D< T >::concatenate(), lass::prim::Transformation2D< T >::concatenate(), lass::stde::lass_allocator< T, VariableAllocator >::construct(), lass::num::cosineHemisphere(), lass::num::impl::cramer2(), lass::num::impl::cramer3(), lass::prim::Point2D< T >::cw(), lass::num::dB2amp(), lass::num::dB2I(), lass::num::dB2p(), lass::num::dB2pow(), lass::num::dB2W(), lass::prim::impl::AllocatorHelper< T, false >::deallocate(), lass::prim::impl::AllocatorHelper< T, hasTrivialConstructorAndDestructor >::deallocate(), lass::stde::lass_allocator< T, VariableAllocator >::deallocate(), lass::util::impl::AtomicOperations< 8 >::decrement(), lass::num::Polynomial< T >::derivative(), lass::util::ThreadLocalVariable< Allocator >::destructor(), lass::num::IirFilter< T, InputIterator, OutputIterator >::doFilter(), lass::num::FirFilter< T, InputIterator, OutputIterator >::doFilter(), lass::io::ArgValue< T >::doSetValue(), lass::num::Vector< T, S >::dot(), lass::spat::PlanarMesh::fastAlong(), lass::spat::impl::fastIntersect(), lass::spat::impl::BrutePointLocatorVerbose::findEdge(), lass::util::flipMaskedIf(), lass::spat::experimental::ObjectAllocator::free(), lass::python::PyExportTraits< std::complex< T > >::get(), lass::num::I2dB(), lass::prim::Point2D< T >::inCircle(), lass::util::impl::AtomicOperations< 8 >::increment(), lass::num::Vector< T, S >::init(), lass::spat::PlanarMesh::init4(), lass::spat::PlanarMesh::insertEdge(), lass::spat::PlanarMesh::insertSite(), lass::num::Polynomial< T >::integral(), lass::prim::impl::interectSlab(), lass::spat::LinearMeshInterpolator< T, TPI >::interpolate(), lass::prim::Triangle3D< T >::intersect(), lass::prim::Parallelogram3D< T >::intersect(), lass::prim::Line2D< T, EquationPolicy, NormalizingPolicy >::intersect(), lass::prim::Ray3D< T, NormalizingPolicy, ParameterPolicy >::intersect(), lass::prim::Ray2D< T, NormalizingPolicy, ParameterPolicy >::intersect(), lass::prim::impl::intersectEdge2D(), lass::prim::impl::intersectTriangle3D(), lass::num::impl::laplaceButterworthHighPass(), lass::num::impl::laplaceButterworthLowPass(), lass::num::impl::laplaceToZHelper(), lass::num::impl::ludecomp(), lass::num::impl::lusolve(), lass::spat::experimental::ObjectAllocator::make(), lass::spat::impl::EdgeGatherer::makeConvexPolygon(), lass::spat::impl::EdgeGatherer::makeRectangular(), lass::stde::lass_allocator< T, VariableAllocator >::max_size(), lass::prim::Transformation3D< T >::normalTransform(), lass::prim::Transformation2D< T >::normalTransform(), lass::spat::PlanarMesh::onEdge(), lass::util::ThrowOnUnknownVisit::onUnknownPostVisit(), lass::util::ThrowOnUnknownVisit::onUnknownPreVisit(), lass::util::experimental::Future< T >::operator()(), lass::num::FilteredFloat< T >::operator*=(), lass::num::FilteredFloat< T >::operator+=(), lass::num::FilteredFloat< T >::operator-=(), lass::num::FilteredFloat< T >::operator/=(), lass::prim::Transformation3D< T >::operator<<(), lass::prim::Transformation2D< T >::operator<<(), lass::num::operator<<(), lass::num::operator>>(), std::operator>>(), lass::io::BinaryIStream::operator>>(), lass::num::p2dB(), lass::spat::PlanarMesh::pointShoot(), lass::num::pow2dB(), lass::stde::impl::read_container(), lass::io::BinaryIStream::readValue(), lass::prim::Line3D< T, NormalizingPolicy >::reflect(), lass::prim::impl::Line2DParametric< T, NormalizingPolicy >::reflect(), lass::prim::impl::Line2DCombined< T, NormalizingPolicy >::reflect(), lass::prim::impl::Line2DCartesian< T, NormalizingPolicy >::reflect(), lass::num::impl::VStorage< T >::resize(), lass::num::impl::MStorage< T >::resize(), lass::prim::Transformation3D< T >::rotation(), lass::prim::Transformation2D< T >::rotation(), lass::spat::experimental::BitField< unsigned int >::set(), lass::util::setMaskedIf(), lass::spat::PlanarMesh::setOrientedEdgeHandle(), lass::spat::PlanarMesh::shoot(), lass::prim::Triangle2D< T >::signedArea(), lass::prim::SimplePolygon2D< T, DegeneratePolicy >::signedArea(), lass::spat::PlanarMesh::snap(), lass::num::impl::solveTridiagonal(), lass::spat::PlanarMesh::split(), lass::num::FilteredFloat< T >::split(), lass::prim::Transformation2D< T >::transform(), lass::prim::Transformation3D< T >::transform(), lass::util::experimental::Future< T >::Impl::unbind(), lass::num::uniformCone(), lass::num::uniformDisk(), lass::num::uniformSphere(), lass::num::W2dB(), lass::prim::Point2D< T >::weakCcw(), lass::prim::Point2D< T >::weakCw(), and lass::io::BinaryOStream::writeValue().
lass::stde::C [inline] |
Definition at line 61 of file vector_map.inl.
Referenced by applyFunction(), lass::python::impl::CallMethod< CppClass >::call(), lass::python::impl::CallMethod< CppClass >::callFree(), inpsqr(), lass::num::interval< C >::interval(), impl::numMax4(), impl::numMin4(), sqr(), lass::io::Image::transformColors(), and lass::util::impl::IndexPredicate::wrong().
Generated on Mon Nov 10 14:22:16 2008 for Library of Assembled Shared Sources by 1.5.7.1 |