Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members Related Pages

more::gen Namespace Reference

General templates (STL style). More...

Compounds

struct more::gen::abstract_binary_function
struct more::gen::abstract_generator
struct more::gen::abstract_ternary_function
struct more::gen::abstract_unary_function
class more::gen::handle
Utility class to deal with reference counting. More...
class more::gen::handle_base
Base class for the template argument of a handle. More...
struct more::gen::handle_data
struct more::gen::if_view
struct more::gen::instance_counter
struct more::gen::if_view::iterator
struct more::gen::transform_if_view::iterator
class more::gen::noncopyable
Classes derived from this can not be copied or assigned. More...
class more::gen::refpair
Like a pair, but contains references which can be assigned to. More...
class more::gen::select1st
A functional which returns a reference to the first component of a pair-like type. More...
class more::gen::select2nd
A functional which returns a reference to the second component of a pair-like type. More...
struct more::gen::transform_if_view
struct more::gen::unifying_partial_ordering::const_infimum_iterator
A bidirectional iterator used by infimum_range. More...
struct more::gen::unifying_partial_ordering::infimum_iterator
A bidirectional iterator used by infimum_range. More...
struct more::gen::unifying_partial_ordering::proxy0
struct more::gen::unifying_partial_ordering::const_proxy0
struct more::gen::unifying_partial_ordering::const_element
an element of the ordering with constant value. More...
struct more::gen::unifying_partial_ordering::element
an element of the ordering. More...
struct more::gen::unifying_partial_ordering::node
struct more::gen::unify_if_equal
struct more::gen::unify_none
struct more::gen::unify_to_first
class more::gen::unifying_partial_ordering
A container which provides a partial ordering of its elements. More...
struct more::gen::unifying_partial_ordering_base::element_base
union more::gen::unifying_partial_ordering_base::node_base::algo_cache_type
struct more::gen::unifying_partial_ordering_base::node_base
struct more::gen::ring::const_iterator
Yet another bidirectional iterator, but this one's got const values. More...
struct more::gen::ring::iterator
A bidirectional iterator. More...
struct more::gen::ring::node
struct more::gen::recycler::chunk
struct more::gen::class_property_accessor
struct more::gen::partial_ordering_product::element
struct more::gen::partial_ordering::const_infimum_iterator
A bidirectional iterator used by infimum_range. More...
struct more::gen::partial_ordering::infimum_iterator
A bidirectional iterator used by infimum_range. More...
struct more::gen::partial_ordering::const_proxy0
struct more::gen::partial_ordering::const_element
an element of the ordering with constant value. More...
struct more::gen::partial_ordering::element
an element of the ordering. More...
struct more::gen::partial_ordering::node
class more::gen::partial_ordering
A container which provides a partially ordering of its elements. More...
struct more::gen::partial_ordering_base::element_base
union more::gen::partial_ordering_base::node_base::algo_cache_type
class more::gen::allocator
An allocator which supports default construction without copying. More...
class more::gen::assign_iterator
An output iterator which repeatedly assigns to the same location. More...
class more::gen::bad_deref
Exception when an invalid dereferece is detected. More...
class more::gen::basic_gc_string
A shallow copied garbage collected string to use for string literals. More...
class more::gen::binary_closure
struct more::gen::binary_heap
struct more::gen::binary_multiclosure
class more::gen::bound_const_mem_fun1_ref_t
class more::gen::bound_const_mem_fun2_ref_t
class more::gen::bound_const_mem_fun3_ref_t
class more::gen::bound_const_mem_fun_ref_t
class more::gen::bound_mem_fun1_ref_t
class more::gen::bound_mem_fun2_ref_t
class more::gen::bound_mem_fun3_ref_t
class more::gen::bound_mem_fun_ref_t
struct more::gen::connection
struct more::gen::const_abstract_binary_function
struct more::gen::const_abstract_generator
struct more::gen::const_abstract_ternary_function
struct more::gen::const_abstract_unary_function
class more::gen::const_binary_closure
struct more::gen::const_encapsulated_binary_function
struct more::gen::const_encapsulated_generator
struct more::gen::const_encapsulated_ternary_function
struct more::gen::const_encapsulated_unary_function
class more::gen::const_generator_closure
struct more::gen::generator_multiclosure
struct more::gen::partial_ordering_base::node_base
struct more::gen::outer_product_container::iterator
struct more::gen::link::const_iterator
A constant valued bidirectional iterator over T. More...
class more::gen::const_ternary_closure
class more::gen::const_unary_closure
class more::gen::counter
A generator which returns numbers with a given increment. More...
class more::gen::degenerate_map
A map with degenerate values. More...
class more::gen::degenerate_set
A set which supports degenerate elements. More...
class more::gen::dereferencer
A functional which dereferences an iterator. More...
struct more::gen::encapsulated_binary_function
struct more::gen::encapsulated_generator
struct more::gen::encapsulated_ternary_function
struct more::gen::encapsulated_unary_function
class more::gen::generator
Convenience base class for a functional taking no arguments. More...
class more::gen::generator_closure
struct more::gen::degenerate_map::sub_value_type
struct more::gen::degenerate_map::sub_key_compare
struct more::gen::degenerate_map::selector
struct more::gen::degenerate_set::sub_value_type
struct more::gen::degenerate_set::sub_key_compare
struct more::gen::degenerate_set::selector
class more::gen::generic
A type which can hold an object or a range of any other copyable type. More...
struct more::gen::hook
class more::gen::identifier
An identifier. More...
struct more::gen::link::iterator
A bidirectional iterator over T. More...
struct more::gen::iterator_category_intersection_
struct more::gen::iterator_composition
class more::gen::link
A container of linked objects. More...
class more::gen::linked
A class for linking objects together. More...
class more::gen::mem_fun1_ref_fixed_t
An alternative to std::mem_fun1_ref_t. More...
class more::gen::mem_fun2_ref_fixed_t
Encapsulation of a pointer to a member function taking two additional arguments. More...
class more::gen::mem_fun2_t
Encapsulation of a pointer to a member function taking two additional arguments. More...
class more::gen::mem_fun_ref_fixed_t
An alternative to std::mem_fun_ref_t. More...
class more::gen::nary_tree
A tree with variable number of branches on each node. More...
struct more::gen::ntree::node
class more::gen::ntree
An general tree. More...
class more::gen::null_container
A container which is always empty. More...
class more::gen::null_iterator
A random access iterator with only one value, a past-the-end iterator. More...
class more::gen::null_output_iteraton
An output iterator which discards its output. More...
class more::gen::null_output_iterator
class more::gen::ostream_iterator
This is an alternative to std::ostream_iterator. More...
struct more::gen::outer_product_container
class more::gen::partial_ordering_base
Helper class. More...
struct more::gen::partial_ordering_product
struct more::gen::placeholder
Use to declare a placeholder variable for lambda expressions. More...
struct more::gen::po_map
A map with paritally ordered keys. More...
class more::gen::pointer_to_generator
Encapsulation of a pointer to a function taking no arguments. More...
class more::gen::pointer_to_ternary_function
Encapsulation of a pointer to a ternary function. More...
struct more::gen::null_output_iterator::proxy
struct more::gen::allocator::rebind
Provides to typedef other. More...
struct more::gen::nary_tree::swapper
struct more::gen::ntree::swapper
A class which can be used to move all nodes of a tree to another tree without copying. More...
struct more::gen::partial_ordering::proxy0
struct more::gen::recycler::rebind
class more::gen::recycler
A type for recycling garbage collected objects. More...
class more::gen::recycler_base
Base class for recycler. More...
class more::gen::recycler_group
Shared data for a group of recyclers whose objects reference each other. More...
class more::gen::ring
A ring is a collection of object which are bidirectionally linked into a ring. More...
class more::gen::ternary_closure
class more::gen::ternary_function
Convenience base class for a functional taking three arguments. More...
struct more::gen::ternary_multiclosure
class more::gen::thrower
A functional with, when called, throws an exception. More...
class more::gen::transforming_iterator
An iterator which iterate over a transformed range. More...
struct more::gen::tree_iterator_tag
class more::gen::trivial_iterator_tag
Iterator category tag for the trivial iterator concept as defined in the standard. More...
class more::gen::unary_closure
struct more::gen::degenerate_map::value_compare
struct more::gen::unary_multiclosure
struct more::gen::po_map::value_compare
class more::gen::unifying_partial_ordering_base
Helper class. More...

[NOHEADER]

template<typename Res, typename Obj> mem_fun_t< Res, Obj > adapt_with_ptr (Res(Obj::*f)())
Adapt a member function which takes the this pointer as the first argument. More...
template<typename Arg, typename Res, typename Obj> mem_fun1_t< Res, Obj, Arg > adapt_with_ptr (Res(Obj::*f)(Arg))
template<typename Arg1, typename Arg2, typename Res, typename Obj> mem_fun2_t< Res, Obj, Arg1,
Arg2 > adapt_with_ptr (Res(Obj::*f)(Arg1, Arg2))

[NOHEADER]

template<typename Res, typename Obj> mem_fun_ref_fixed_t< Res,
Obj > adapt_with_ref (Res(Obj::*f)())
Adapt a member function which takes a reference to *this as the first argument. More...
template<typename Arg, typename Res, typename Obj> mem_fun1_ref_fixed_t< Res,
Obj, Arg > adapt_with_ref (Res(Obj::*f)(Arg))
template<typename Arg1, typename Arg2, typename Res, typename Obj> mem_fun2_ref_fixed_t< Res,
Obj, Arg1, Arg2 > adapt_with_ref (Res(Obj::*f)(Arg1, Arg2))

Typedefs

typedef basic_gc_string< char > gc_string
typedef basic_gc_string< wchar_t > gc_wstring

Functions

template<typename InputIterator, typename OutputIterator> void copy_n (InputIterator u, int n, OutputIterator v)
template<typename ForwardIterator, typename T> void insert_sorted (ForwardIterator first, ForwardIterator last, T const x)
Insert an element into a sorted range. More...
template<typename ForwardIterator0, typename ForwardIterator1, typename > bool counted_equal (ForwardIterator0 it0, ForwardIterator0 it0end, ForwardIterator1 it1, ForwardIterator1 it1end)
Remove elements from a sorted range. More...
template<typename ForwardIterator0, typename ForwardIterator1, typename Equal> bool counted_equal (ForwardIterator0 it0, ForwardIterator0 it0end, ForwardIterator1 it1, ForwardIterator1 it1end, Equal eq)
template<typename Generator> encapsulated_generator< Generator > * encapsulate_generator (const Generator &f)
template<typename UnaryFunction> encapsulated_unary_function<
UnaryFunction > * encapsulate_unary (const UnaryFunction &f)
template<typename BinaryFunction> encapsulated_binary_function<
BinaryFunction > * encapsulate_binary (const BinaryFunction &f)
template<typename TernaryFunction> encapsulated_ternary_function<
TernaryFunction > * encapsulate_ternary (const TernaryFunction &f)
template<typename Generator> const_encapsulated_generator<
Generator > * const_encapsulate_generator (const Generator &f)
template<typename UnaryFunction> const_encapsulated_unary_function<
UnaryFunction > * const_encapsulate_unary (const UnaryFunction &f)
template<typename BinaryFunction> const_encapsulated_binary_function<
BinaryFunction > * const_encapsulate_binary (const BinaryFunction &f)
template<typename TernaryFunction> const_encapsulated_ternary_function<
TernaryFunction > * const_encapsulate_ternary (const TernaryFunction &f)
template<typename Res> void connect (generator_closure< Res > &slot, Res(*f)())
template<typename Arg, typename Res> void connect (unary_closure< Arg, Res > &slot, Res(*f)(Arg))
template<typename Arg1, typename Arg2, typename Res> void connect (binary_closure< Arg1, Arg2, Res > &slot, Res(*f)(Arg1, Arg2))
template<typename Arg1, typename Arg2, typename Arg3, typename Res> void connect (ternary_closure< Arg1, Arg2, Arg3, Res > &slot, Res(*f)(Arg1, Arg2, Arg3))
template<typename Obj, typename Res> void connect (unary_closure< Obj &, Res > &slot, Res(Obj::*f)())
template<typename Obj, typename Arg, typename Res> void connect (binary_closure< Obj &, Arg, Res > &slot, Res(Obj::*f)(Arg))
template<typename Obj, typename Arg1, typename Arg2, typename Res> void connect (ternary_closure< Obj &, Arg1, Arg2, Res > &slot, Res(Obj::*f)(Arg1, Arg2))
template<typename Res, typename Obj> void connect (generator_closure< Res > &slot, Obj &obj, Res(Obj::*f)())
template<typename Res, typename Arg, typename Obj> void connect (unary_closure< Arg, Res > &slot, Obj &obj, Res(Obj::*f)(Arg))
template<typename Res, typename Arg1, typename Arg2, typename Obj> void connect (binary_closure< Arg1, Arg2, Res > &slot, Obj &obj, Res(Obj::*f)(Arg1, Arg2))
template<typename Res, typename Arg1, typename Arg2, typename Arg3, typename Obj> void connect (ternary_closure< Arg1, Arg2, Arg3, Res > &slot, Obj &obj, Res(Obj::*f)(Arg1, Arg2, Arg3))
template<typename Res> pointer_to_generator< Res > adapt (Res(*f)())
template<typename Arg, typename Res> pointer_to_unary_function<
Arg, Res > adapt (Res(*f)(Arg))
template<typename Arg1, typename Arg2, typename Res> pointer_to_binary_function<
Arg1, Arg2, Res > adapt (Res(*f)(Arg1, Arg2))
template<typename Arg1, typename Arg2, typename Arg3, typename Res> pointer_to_ternary_function<
Arg1, Arg2, Arg3, Res > adapt (Res(*f)(Arg1, Arg2, Arg3))
template<typename Res, typename Obj> mem_fun_ref_fixed_t< Res,
Obj > adapt (Res(Obj::*f)())
template<typename Arg, typename Res, typename Obj> mem_fun1_ref_fixed_t< Res,
Obj, Arg > adapt (Res(Obj::*f)(Arg))
template<typename Arg1, typename Arg2, typename Res, typename Obj> mem_fun2_ref_fixed_t< Res,
Obj, Arg1, Arg2 > adapt (Res(Obj::*f)(Arg1, Arg2))
template<typename Res, typename Obj> bound_mem_fun_ref_t< Res,
Obj > bind_adapt (Obj *obj, Res(Obj::*f)())
template<typename Arg, typename Res, typename Obj> bound_mem_fun1_ref_t< Res,
Obj, Arg > bind_adapt (Obj *obj, Res(Obj::*f)(Arg))
template<typename Arg1, typename Arg2, typename Res, typename Obj> bound_mem_fun2_ref_t< Res,
Obj, Arg1, Arg2 > bind_adapt (Obj *obj, Res(Obj::*f)(Arg1, Arg2))
template<typename Arg1, typename Arg2, typename Arg3, typename Res, typename Obj> bound_mem_fun3_ref_t< Res,
Obj, Arg1, Arg2, Arg3 > bind_adapt (Obj *obj, Res(Obj::*f)(Arg1, Arg2, Arg3))
template<typename Res, typename Obj> bound_const_mem_fun_ref_t<
Res, Obj > bind_adapt (Obj const *obj, Res(Obj::*f)() const)
template<typename Arg, typename Res, typename Obj> bound_const_mem_fun1_ref_t<
Res, Obj, Arg > bind_adapt (Obj const *obj, Res(Obj::*f)(Arg) const)
template<typename Arg1, typename Arg2, typename Res, typename Obj> bound_const_mem_fun2_ref_t<
Res, Obj, Arg1, Arg2 > bind_adapt (Obj const *obj, Res(Obj::*f)(Arg1, Arg2) const)
template<typename Arg1, typename Arg2, typename Arg3, typename Res, typename Obj> bound_const_mem_fun3_ref_t<
Res, Obj, Arg1, Arg2, Arg3 > bind_adapt (Obj const *obj, Res(Obj::*f)(Arg1, Arg2, Arg3) const)
size_t cstrlen (char const *s)
size_t cstrlen (wchar_t const *s)
template<typename Ch> Ch * empty_c_str ()
template<> char * empty_c_str< char > ()
template<> wchar_t * empty_c_str< wchar_t > ()
template<typename Char> bool operator== (basic_gc_string< Char > const &x, basic_gc_string< Char > const &y)
True if the strings are equal. More...
template<typename Char> bool operator== (basic_gc_string< Char > const &x, Char const *y)
template<typename Char> bool operator== (Char const *x, basic_gc_string< Char > const &y)
template<typename Char> bool operator< (basic_gc_string< Char > const &x, basic_gc_string< Char > const &y)
An arbitrary full ordering of strings. More...
template<typename Char> bool operator< (basic_gc_string< Char > const &x, Char const *y)
template<typename Char> bool operator< (Char const *x, basic_gc_string< Char > const &y)
template<typename Char> basic_gc_string< Char > operator+ (basic_gc_string< Char > const &x, basic_gc_string< Char > const &y)
Concatenation of two strings. More...
template<typename Char> basic_gc_string< Char > operator+ (Char const *x, basic_gc_string< Char > y)
template<typename Char> basic_gc_string< Char > operator+ (basic_gc_string< Char > x, Char const *y)
std::ostream & operator<< (std::ostream &os, gc_string const &str)
template<typename T, typename U> transforming_iterator< T, U > operator+ (transforming_iterator< T, U > u, int i)
template<typename T, typename U> transforming_iterator< T, U > operator+ (int i, transforming_iterator< T, U > u)
template<typename T, typename U> transforming_iterator< T, U > operator- (transforming_iterator< T, U > u, int i)
template<typename T> assign_iterator< T > assigner (T &x)
template<typename Iterator1, typename Iterator2, typename BinaryFunction> iterator_composition< Iterator1,
Iterator2, BinaryFunction > compose_iterators (Iterator1 it1, Iterator2 it2, BinaryFunction f)
template<typename Expr> __Expr1 lambda (const Expr &a)
Return a nullary function from an expression (delayed evaluation). More...
template<typename Placeholder0, typename Expr> __Expr2 lambda (Placeholder0, var0, const Expr &a)
Return a unary function from an expression. More...
template<typename Placeholder0, typename Placeholder1, typename Expr> __Expr3 lambda (Placeholder0 var0, Placeholder1 var1, const Expr &a)
Return a binary function from an expression. More...
template<typename Generator> __Expr4 apply (const Generator &f)
Return an apply expression. More...
template<typename UnaryFunction, typename T> __Expr5 apply (const UnaryFunction &f, const T &x)
Return an apply expression. More...
template<typename BinaryFunction, typename T1, typename T2> __Expr6 apply (const BinaryFunction &f, const T1 &x1, const T2 &x2)
Return an apply expression. More...
template<typename T1, typename T2, typename T3> __Expr7 where (const T1 &x, const T2 &y, const T3 &z)
A replacement for the non-existing 'operator:?' for lambda expressions. More...
template<typename T> __Expr8 refer (T &x)
Pass x by reference rather than by value in a lambda expression. More...
template<typename TreeIterator0, typename TreeIterator1> bool subtree_counted_equal (TreeIterator0 it0, TreeIterator0 it0end, TreeIterator1 it1, TreeIterator1 it1end)
template<typename T0, typename T1> bool operator== (nary_tree< T0 > const &t0, nary_tree< T1 > const &t1)
template<typename T, typename Allocator> void swap (nary_tree< T, Allocator > &x, nary_tree< T, Allocator > &y)
template<typename TreeIterator> void subtree_dump (TreeIterator it, std::ostream &os, int level=0, unsigned int cont=0)
template<typename Element> std::pair< typename Element::supremum_iterator,
typename Element::supremum_iterator > supremums (Element e)
template<typename Element> std::pair< typename Element::infimum_iterator,
typename Element::infimum_iterator > infimums (Element e)
template<typename Element> bool preceq (Element e0, Element e1)
returns true if . More...
template<typename Element> bool prec (Element e0, Element e1)
returns true if . More...
template<typename Element> bool succeq (Element e0, Element e1)
returns true if . More...
template<typename Element> bool succ (Element e0, Element e1)
returns true if . More...
template<typename Element> bool is_max_element (Element e)
Return true if e is the maximum element of its ordering. More...
template<typename Element> bool is_min_element (Element e)
Return true if e is the minimum element of its ordering. More...
template<typename Element, typename OutputIterator> bool copy_open_range (Element e_low, Element e_high, OutputIterator it_out)
Copy elements in (e_low, e_high) to it_out. More...
template<typename Element, typename OutputIterator> bool copy_closed_range (Element e_low, Element e_high, OutputIterator it_out)
Copy elements in [e_low, e_high] to it_out. More...
template<typename Element, typename OutputIterator> bool copy_left_range (Element e_low, Element e_high, OutputIterator it_out)
Copy elements if [e_low, e_high) to it_out. More...
template<typename Element, typename OutputIterator> bool copy_right_range (Element e_low, Element e_high, OutputIterator it_out)
Copy elements in (e_low, e_high] to it_out. More...
template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator> void find_infimums (Element e_low, Value const &value, PrecEqPredicate preceq, OutputIterator it_out)
find infimums of value according to preceq in the node set from e_low and upwards. More...
template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator> void find_infimums_above (Element e_low, Value const &value, PrecEqPredicate preceq, OutputIterator it_out)
Find infimums of value according to preceq in the node set above (excluding) e_low. More...
template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator> void find_supremums (Element e_high, Value const &value, PrecEqPredicate preceq, OutputIterator it_out)
find supremums of value according to preceq in the node set from e_high and downwards. More...
template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator> void find_supremums_below (Element e_high, Value const &value, PrecEqPredicate preceq, OutputIterator it_out)
Find supremums of value according to preceq in the node set below (excluding) e_high. More...
template<typename Element, typename Predicate, typename OutputIterator> void find_infimums_if (Element e_low, Predicate const &pred, OutputIterator it_out)
template<typename Element, typename Predicate, typename OutputIterator> void find_supremums_if (Element e_high, Predicate const &pred, OutputIterator it_out)
template<typename Element, typename Predicate, typename OutputIterator> void find_infimums_above_if (Element e_low, Predicate const &pred, OutputIterator it_out)
template<typename Element, typename Predicate, typename OutputIterator> void find_supremums_below_if (Element e_high, Predicate const &pred, OutputIterator it_out)
char const * struniq_static (char const *)
Returns a unique pointer for all lexically equal strings. More...
char const * struniq_copy (char const *)
Returns a unique pointer for all lexically equal strings. More...
wchar_t const * struniq_static (wchar_t const *)
Returns a unique pointer for all lexically equal strings. More...
wchar_t const * struniq_copy (wchar_t const *)
Returns a unique pointer for all lexically equal strings. More...
char const * struniq_dense (int)
Returns a unique string pointer for each argument. More...
char const * struniq_sparse (int)
Returns a unique string pointer for each argument. More...
char * strcpy_new (char const *str)
Returns a copy of str allocated by new. More...
template<typename T, typename U> refpair< T, U > tie (T &x, U &y)
Creates a refpair. More...

Variables

bool opt_recycler_do_log
To enable some logging, set opt_recycler_enable_log to true. More...

Detailed Description

General templates (STL style).

This includes containers, iterators, algoritms, allocators, functionals, and some utilities. It is meant to be used in conjuntion with the STL. Depends on: only the C++ library.

Typedef Documentation

typedef basic_gc_string<char> more::gen::gc_string

typedef basic_gc_string<wchar_t> more::gen::gc_wstring

Function Documentation

template<typename Arg1, typename Arg2, typename Res, typename Obj>

mem_fun2_ref_fixed_t<Res, Obj, Arg1, Arg2> adapt ( Res(Obj::* f)(Arg1, Arg2) ) [inline]

template<typename Arg, typename Res, typename Obj>

mem_fun1_ref_fixed_t<Res, Obj, Arg> adapt ( Res(Obj::* f)(Arg) ) [inline]

template<typename Res, typename Obj>

mem_fun_ref_fixed_t<Res, Obj> adapt ( Res(Obj::* f)() ) [inline]

template<typename Arg1, typename Arg2, typename Arg3, typename Res>

pointer_to_ternary_function<Arg1, Arg2, Arg3, Res> adapt ( Res(* f)(Arg1, Arg2, Arg3) ) [inline]

template<typename Arg1, typename Arg2, typename Res>

pointer_to_binary_function<Arg1, Arg2, Res> adapt ( Res(* f)(Arg1, Arg2) ) [inline]

template<typename Arg, typename Res>

pointer_to_unary_function<Arg, Res> adapt ( Res(* f)(Arg) ) [inline]

template<typename Res>

pointer_to_generator<Res> adapt ( Res(* f)() ) [inline]

template<typename Arg1, typename Arg2, typename Res, typename Obj>

mem_fun2_t<Res, Obj, Arg1, Arg2> adapt_with_ptr ( Res(Obj::* f)(Arg1, Arg2) ) [inline]

template<typename Arg, typename Res, typename Obj>

mem_fun1_t<Res, Obj, Arg> adapt_with_ptr ( Res(Obj::* f)(Arg) ) [inline]

template<typename Res, typename Obj>

mem_fun_t<Res, Obj> adapt_with_ptr ( Res(Obj::* f)() ) [inline]

Adapt a member function which takes the this pointer as the first argument.

template<typename Arg1, typename Arg2, typename Res, typename Obj>

mem_fun2_ref_fixed_t<Res, Obj, Arg1, Arg2> adapt_with_ref ( Res(Obj::* f)(Arg1, Arg2) ) [inline]

template<typename Arg, typename Res, typename Obj>

mem_fun1_ref_fixed_t<Res, Obj, Arg> adapt_with_ref ( Res(Obj::* f)(Arg) ) [inline]

template<typename Res, typename Obj>

mem_fun_ref_fixed_t<Res, Obj> adapt_with_ref ( Res(Obj::* f)() ) [inline]

Adapt a member function which takes a reference to *this as the first argument.

template<typename BinaryFunction, typename T1, typename T2>

__Expr6 apply ( const BinaryFunction & f,

const T1 & x1,

const T2 & x2

) [inline]

Return an apply expression.
This allows placeholders and expressions to appear in arguments to functions.

template<typename UnaryFunction, typename T>

__Expr5 apply ( const UnaryFunction & f,

const T & x

) [inline]

Return an apply expression.
This allows placeholders and expressions to appear in arguments to functions.

template<typename Generator>

__Expr4 apply ( const Generator & f ) [inline]

Return an apply expression.

template<typename T>

assign_iterator<T> assigner ( T & x )

template<typename Arg1, typename Arg2, typename Arg3, typename Res, typename Obj>

bound_const_mem_fun3_ref_t<Res, Obj, Arg1, Arg2, Arg3> bind_adapt ( Obj const * obj,

Res(Obj::* f)(Arg1, Arg2, Arg3) const

) [inline]

template<typename Arg1, typename Arg2, typename Res, typename Obj>

bound_const_mem_fun2_ref_t<Res, Obj, Arg1, Arg2> bind_adapt ( Obj const * obj,

Res(Obj::* f)(Arg1, Arg2) const

) [inline]

template<typename Arg, typename Res, typename Obj>

bound_const_mem_fun1_ref_t<Res, Obj, Arg> bind_adapt ( Obj const * obj,

Res(Obj::* f)(Arg) const

) [inline]

template<typename Res, typename Obj>

bound_const_mem_fun_ref_t<Res, Obj> bind_adapt ( Obj const * obj,

Res(Obj::* f)() const

) [inline]

template<typename Arg1, typename Arg2, typename Arg3, typename Res, typename Obj>

bound_mem_fun3_ref_t<Res, Obj, Arg1, Arg2, Arg3> bind_adapt ( Obj * obj,

Res(Obj::* f)(Arg1, Arg2, Arg3)

) [inline]

template<typename Arg1, typename Arg2, typename Res, typename Obj>

bound_mem_fun2_ref_t<Res, Obj, Arg1, Arg2> bind_adapt ( Obj * obj,

Res(Obj::* f)(Arg1, Arg2)

) [inline]

template<typename Arg, typename Res, typename Obj>

bound_mem_fun1_ref_t<Res, Obj, Arg> bind_adapt ( Obj * obj,

Res(Obj::* f)(Arg)

) [inline]

template<typename Res, typename Obj>

bound_mem_fun_ref_t<Res, Obj> bind_adapt ( Obj * obj,

Res(Obj::* f)()

) [inline]

template<typename Iterator1, typename Iterator2, typename BinaryFunction>

iterator_composition<Iterator1, Iterator2, BinaryFunction> compose_iterators ( Iterator1 it1,

Iterator2 it2,

BinaryFunction f

) [inline]

template<typename Res, typename Arg1, typename Arg2, typename Arg3, typename Obj>

void connect ( ternary_closure< Arg1, Arg2, Arg3, Res > & slot,

Obj & obj,

Res(Obj::* f)(Arg1, Arg2, Arg3)

) [inline]

template<typename Res, typename Arg1, typename Arg2, typename Obj>

void connect ( binary_closure< Arg1, Arg2, Res > & slot,

Obj & obj,

Res(Obj::* f)(Arg1, Arg2)

) [inline]

template<typename Res, typename Arg, typename Obj>

void connect ( unary_closure< Arg, Res > & slot,

Obj & obj,

Res(Obj::* f)(Arg)

) [inline]

template<typename Res, typename Obj>

void connect ( generator_closure< Res > & slot,

Obj & obj,

Res(Obj::* f)()

) [inline]

template<typename Obj, typename Arg1, typename Arg2, typename Res>

void connect ( ternary_closure< Obj &, Arg1, Arg2, Res > & slot,

Res(Obj::* f)(Arg1, Arg2)

) [inline]

template<typename Obj, typename Arg, typename Res>

void connect ( binary_closure< Obj &, Arg, Res > & slot,

Res(Obj::* f)(Arg)

) [inline]

template<typename Obj, typename Res>

void connect ( unary_closure< Obj &, Res > & slot,

Res(Obj::* f)()

) [inline]

template<typename Arg1, typename Arg2, typename Arg3, typename Res>

void connect ( ternary_closure< Arg1, Arg2, Arg3, Res > & slot,

Res(* f)(Arg1, Arg2, Arg3)

) [inline]

template<typename Arg1, typename Arg2, typename Res>

void connect ( binary_closure< Arg1, Arg2, Res > & slot,

Res(* f)(Arg1, Arg2)

) [inline]

template<typename Arg, typename Res>

void connect ( unary_closure< Arg, Res > & slot,

Res(* f)(Arg)

) [inline]

template<typename Res>

void connect ( generator_closure< Res > & slot,

Res(* f)()

) [inline]

template<typename BinaryFunction>

const_encapsulated_binary_function<BinaryFunction>* const_encapsulate_binary ( const BinaryFunction & f ) [inline]

template<typename Generator>

const_encapsulated_generator<Generator>* const_encapsulate_generator ( const Generator & f ) [inline]

template<typename TernaryFunction>

const_encapsulated_ternary_function<TernaryFunction>* const_encapsulate_ternary ( const TernaryFunction & f ) [inline]

template<typename UnaryFunction>

const_encapsulated_unary_function<UnaryFunction>* const_encapsulate_unary ( const UnaryFunction & f ) [inline]

template<typename Element, typename OutputIterator>

bool copy_closed_range ( Element e_low,

Element e_high,

OutputIterator it_out

)

Copy elements in [e_low, e_high] to it_out.

template<typename Element, typename OutputIterator>

bool copy_left_range ( Element e_low,

Element e_high,

OutputIterator it_out

)

Copy elements if [e_low, e_high) to it_out.

template<typename InputIterator, typename OutputIterator>

void copy_n ( InputIterator u,

int n,

OutputIterator v

)

template<typename Element, typename OutputIterator>

bool copy_open_range ( Element e_low,

Element e_high,

OutputIterator it_out

)

Copy elements in (e_low, e_high) to it_out.

template<typename Element, typename OutputIterator>

bool copy_right_range ( Element e_low,

Element e_high,

OutputIterator it_out

)

Copy elements in (e_low, e_high] to it_out.

template<typename ForwardIterator0, typename ForwardIterator1, typename Equal>

bool counted_equal ( ForwardIterator0 it0,

ForwardIterator0 it0end,

ForwardIterator1 it1,

ForwardIterator1 it1end,

Equal eq

) [inline]

template<typename ForwardIterator0, typename ForwardIterator1, typename >

bool counted_equal ( ForwardIterator0 it0,

ForwardIterator0 it0end,

ForwardIterator1 it1,

ForwardIterator1 it1end

) [inline]

Remove elements from a sorted range.

Type requirements:
ForwardIterator is a model of Forward Iterator.
Precondition:
[first, last) is a sorted range.
Returns:
The PTE iterator of the modified range.

size_t cstrlen ( wchar_t const * s ) [inline]

size_t cstrlen ( char const * s ) [inline]

template<typename Ch>

Ch* empty_c_str ( ) [inline]

template<>

char* empty_c_str< char > ( ) [inline]

template<>

wchar_t* empty_c_str< wchar_t > ( ) [inline]

template<typename BinaryFunction>

encapsulated_binary_function<BinaryFunction>* encapsulate_binary ( const BinaryFunction & f ) [inline]

template<typename Generator>

encapsulated_generator<Generator>* encapsulate_generator ( const Generator & f ) [inline]

template<typename TernaryFunction>

encapsulated_ternary_function<TernaryFunction>* encapsulate_ternary ( const TernaryFunction & f ) [inline]

template<typename UnaryFunction>

encapsulated_unary_function<UnaryFunction>* encapsulate_unary ( const UnaryFunction & f ) [inline]

template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator>

void find_infimums ( Element e_low,

Value const & value,

PrecEqPredicate preceq,

OutputIterator it_out

)

find infimums of value according to preceq in the node set from e_low and upwards.

template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator>

void find_infimums_above ( Element e_low,

Value const & value,

PrecEqPredicate preceq,

OutputIterator it_out

)

Find infimums of value according to preceq in the node set above (excluding) e_low.

template<typename Element, typename Predicate, typename OutputIterator>

void find_infimums_above_if ( Element e_low,

Predicate const & pred,

OutputIterator it_out

)

template<typename Element, typename Predicate, typename OutputIterator>

void find_infimums_if ( Element e_low,

Predicate const & pred,

OutputIterator it_out

)

template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator>

void find_supremums ( Element e_high,

Value const & value,

PrecEqPredicate preceq,

OutputIterator it_out

)

find supremums of value according to preceq in the node set from e_high and downwards.

template<typename Element, typename Value, typename PrecEqPredicate, typename OutputIterator>

void find_supremums_below ( Element e_high,

Value const & value,

PrecEqPredicate preceq,

OutputIterator it_out

)

Find supremums of value according to preceq in the node set below (excluding) e_high.

template<typename Element, typename Predicate, typename OutputIterator>

void find_supremums_below_if ( Element e_high,

Predicate const & pred,

OutputIterator it_out

)

template<typename Element, typename Predicate, typename OutputIterator>

void find_supremums_if ( Element e_high,

Predicate const & pred,

OutputIterator it_out

)

template<typename Element>

std::pair< typename Element::infimum_iterator, typename Element::infimum_iterator > more::gen::infimums ( Element e )

template<typename ForwardIterator, typename T>

void insert_sorted ( ForwardIterator first,

ForwardIterator last,

T const x

) [inline]

Insert an element into a sorted range.

Type requirements:
ForwardIterator is a model of Forward Iterator.
Precondition:
[first, \a{last}) is a sorted range. last is dereferenceable.

template<typename Element>

bool is_max_element ( Element e ) [inline]

Return true if e is the maximum element of its ordering.

template<typename Element>

bool is_min_element ( Element e ) [inline]

Return true if e is the minimum element of its ordering.

template<typename Placeholder0, typename Placeholder1, typename Expr>

__Expr3 lambda ( Placeholder0 var0,

Placeholder1 var1,

const Expr & a

) [inline]

Return a binary function from an expression.

template<typename Placeholder0, typename Expr>

__Expr2 lambda ( Placeholder0 ,

var0 ,

const Expr & a

) [inline]

Return a unary function from an expression.

template<typename Expr>

__Expr1 lambda ( const Expr & a ) [inline]

Return a nullary function from an expression (delayed evaluation).

template<typename T, typename U>

transforming_iterator<T, U> operator+ ( int i,

transforming_iterator< T, U > u

) [inline]

template<typename T, typename U>

transforming_iterator<T, U> operator+ ( transforming_iterator< T, U > u,

int i

) [inline]

template<typename Char>

basic_gc_string<Char> operator+ ( basic_gc_string< Char > x,

Char const * y

) [inline]

template<typename Char>

basic_gc_string<Char> operator+ ( Char const * x,

basic_gc_string< Char > y

) [inline]

template<typename Char>

basic_gc_string<Char> operator+ ( basic_gc_string< Char > const & x,

basic_gc_string< Char > const & y

) [inline]

Concatenation of two strings.

template<typename T, typename U>

transforming_iterator<T, U> operator- ( transforming_iterator< T, U > u,

int i

) [inline]

template<typename Char>

bool operator< ( Char const * x,

basic_gc_string< Char > const & y

) [inline]

template<typename Char>

bool operator< ( basic_gc_string< Char > const & x,

Char const * y

) [inline]

template<typename Char>

bool operator< ( basic_gc_string< Char > const & x,

basic_gc_string< Char > const & y

) [inline]

An arbitrary full ordering of strings.
Use locale specific versions for dictionary ordering.

std::ostream& operator<< ( std::ostream & os,

gc_string const & str

) [inline]

template<typename T0, typename T1>

bool operator== ( nary_tree< T0 > const & t0,

nary_tree< T1 > const & t1

)

template<typename Char>

bool operator== ( Char const * x,

basic_gc_string< Char > const & y

) [inline]

template<typename Char>

bool operator== ( basic_gc_string< Char > const & x,

Char const * y

) [inline]

template<typename Char>

bool operator== ( basic_gc_string< Char > const & x,

basic_gc_string< Char > const & y

) [inline]

True if the strings are equal.

template<typename Element>

bool more::gen::prec ( Element e0,

Element e1

) [inline]

returns true if .

template<typename Element>

bool more::gen::preceq ( Element e0,

Element e1

) [inline]

returns true if .

template<typename T>

lambda_kns::expr< lambda_kns::valueref_expr< T > > more::gen::refer ( T & x ) [inline]

Pass x by reference rather than by value in a lambda expression.

char* strcpy_new ( char const * str ) [inline]

Returns a copy of str allocated by new.

wchar_t const* struniq_copy ( wchar_t const * )

Returns a unique pointer for all lexically equal strings.

char const* struniq_copy ( char const * )

Returns a unique pointer for all lexically equal strings.

char const* struniq_dense ( int )

Returns a unique string pointer for each argument.
The string is a valid C identifier. The global time and space complexty scales lineary with the maximum absolute value of the argument, in addition to amortized constant time and zero space for each call.

char const* struniq_sparse ( int )

Returns a unique string pointer for each argument.
The string is a valid C identifier. The time complexity is logarithmic in the number of distinct uniqstr_* pointers returned.

wchar_t const* struniq_static ( wchar_t const * )

Returns a unique pointer for all lexically equal strings.
The string argument must have static lifetime.

char const* struniq_static ( char const * )

Returns a unique pointer for all lexically equal strings.
The string argument must have static lifetime.

template<typename TreeIterator0, typename TreeIterator1>

bool subtree_counted_equal ( TreeIterator0 it0,

TreeIterator0 it0end,

TreeIterator1 it1,

TreeIterator1 it1end

)

template<typename TreeIterator>

void subtree_dump ( TreeIterator it,

std::ostream & os,

int level = 0,

unsigned int cont = 0

)

template<typename Element>

bool more::gen::succ ( Element e0,

Element e1

) [inline]

returns true if .

template<typename Element>

bool more::gen::succeq ( Element e0,

Element e1

) [inline]

returns true if .

template<typename Element>

std::pair< typename Element::supremum_iterator, typename Element::supremum_iterator > more::gen::supremums ( Element e )

template<typename T, typename Allocator>

void swap ( nary_tree< T, Allocator > & x,

nary_tree< T, Allocator > & y

) [inline]

template<typename T, typename U>

refpair<T, U> tie ( T & x,

U & y

) [inline]

Creates a refpair.

template<typename T1, typename T2, typename T3>

__Expr7 where ( const T1 & x,

const T2 & y,

const T3 & z

) [inline]

A replacement for the non-existing 'operator:?' for lambda expressions.

Variable Documentation

bool more::gen::opt_recycler_do_log

To enable some logging, set opt_recycler_enable_log to true.
MORE_ENABLE_LOGGING must be defined for this to take full effect.