From: engelbert g. <gr...@us...> - 2004-06-08 07:16:29
|
Update of /cvsroot/docutils/sandbox/grubert/test In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv19055/test Modified Files: tables.txt Added Files: no-citations.txt Log Message: Add table with literal-block and text mixed. Add tests for use-LaTeX-citations. --- NEW FILE: no-citations.txt --- LaTeX writer test no citations ------------------------------ This file is used to verify that no bibliography is inserted when ``use-latex-citations`` is specified if there are no citations [1]_ in the document. .. [1] footnotes are allowed. Index: tables.txt =================================================================== RCS file: /cvsroot/docutils/sandbox/grubert/test/tables.txt,v retrieving revision 1.7 retrieving revision 1.8 diff -u -d -r1.7 -r1.8 --- tables.txt 26 May 2004 16:19:16 -0000 1.7 +++ tables.txt 8 Jun 2004 07:16:20 -0000 1.8 @@ -88,3 +88,72 @@ | > | > | +--------------------------+----------------------------+ +a longer and complicated table thanks to dave abrahams + ++--------------------------+----------------------------+-------------------------+ +|Metafunction |Result `` ::type`` |Complexity | ++==========================+============================+=========================+ +|``find<seq, T>`` |An iterator to the first |Linear | +| |occurrence of ``T`` in | | +| |``seq``, or | | +| |``end<seq>::type`` if not | | +| |found. | | ++--------------------------+----------------------------+-------------------------+ +|``find_if<seq, T, pred>`` |An iterator to the first |Linear | +| |element of ``seq`` that | | +| |satisfies predicate | | +| |``pred``, or | | +| |``end<seq>::type`` if not | | +| |found. | | ++--------------------------+----------------------------+-------------------------+ +|``contains<seq, T>`` |True iff ``seq`` contains |Linear | +| |``T``. | | ++--------------------------+----------------------------+-------------------------+ +|``count<seq, T>`` |The number of occurences of |Linear | +| |``T`` in ``seq``. | | ++--------------------------+----------------------------+-------------------------+ +|``count_if<seq, pred>`` |The number of elements in |Linear | +| |``seq`` that satisfy | | +| |predicate ``pred``. | | ++--------------------------+----------------------------+-------------------------+ +|``equal<seq1, seq2>`` |True iff ``seq1`` and |Linear | +| |``seq2`` contain the same | | +| |elements in the same order. | | ++--------------------------+----------------------------+-------------------------+ +|:: |The earliest |Logarithmic in | +| |order-preserving position at|invocations to | +| lower_bound< |which ``T`` could be |``compare``. Logarithmic | +| seq, T |inserted in a sequence |traversal of | +| , compare = less<_,_> |``seq`` sorted according to |random-access | +| > |comparison ``compare``. |sequences. Linear | +| | |traversal otherwise. | ++--------------------------+----------------------------+-------------------------+ +|:: |The latest order-preserving |Logarithmic in | +| |position at which ``T`` |invocations to | +| upper_bound< |could be inserted in a |``compare``. Logarithmic | +| seq, T |sequence ``seq`` sorted |traversal of | +| , compare = less<_,_> |according to comparison |random-access | +| > |``compare``. |sequences. Linear | +| | |traversal otherwise. | ++--------------------------+----------------------------+-------------------------+ +|:: |The first position ``i`` in |Linear | +| |``seq`` such that for all | | +| max_element< |positions ``j``:: | | +| seq | | | +| , compare = less<_,_> | apply< | | +| > | compare | | +| | , deref<i>::type | | +| | , deref<j>::type | | +| | >::type::value == false | | ++--------------------------+----------------------------+-------------------------+ +|:: |The first position ``i`` in |Linear | +| |``seq`` such that for all | | +| min_element< |positions ``j``:: | | +| seq | | | +| , compare = less<_,_> | apply< | | +| > | compare | | +| | , deref<j>::type | | +| | , deref<i>::type | | +| | >::type::value == false | | ++--------------------------+----------------------------+-------------------------+ + |