bee_python 0.0.1

data/tools/common/common/test/unittest_textutils.py

@@ -0,0 +1,247 @@
+# -*- coding: utf-8 -*-
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+#
+# This file is part of logilab-common.
+#
+# logilab-common is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free
+# Software Foundation, either version 2.1 of the License, or (at your option) any
+# later version.
+#
+# logilab-common is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
+# details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-common.  If not, see <http://www.gnu.org/licenses/>.
+"""
+unit tests for module textutils
+squeleton generated by /home/syt/cvs_work/logilab/pyreverse/py2tests.py on Sep 08 at 09:1:31
+
+"""
+import re
+from os import linesep
+
+from logilab.common import textutils as tu # .textutils import *
+from logilab.common.testlib import TestCase, DocTest, unittest_main
+
+
+if linesep != '\n':
+    import re
+    LINE_RGX = re.compile(linesep)
+    def ulines(string):
+        return LINE_RGX.sub('\n', string)
+else:
+    def ulines(string):
+        return string
+
+class NormalizeTextTC(TestCase):
+
+    def test_known_values(self):
+        self.assertEquals(ulines(tu.normalize_text('''some really malformated
+        text.
+With some times some veeeeeeeeeeeeeeerrrrryyyyyyyyyyyyyyyyyyy loooooooooooooooooooooong linnnnnnnnnnnes
+
+and empty lines!
+        ''')),
+                         '''some really malformated text. With some times some
+veeeeeeeeeeeeeeerrrrryyyyyyyyyyyyyyyyyyy loooooooooooooooooooooong
+linnnnnnnnnnnes
+
+and empty lines!''')
+        self.assertTextEquals(ulines(tu.normalize_text('''\
+some ReST formated text
+=======================
+With some times some veeeeeeeeeeeeeeerrrrryyyyyyyyyyyyyyyyyyy loooooooooooooooooooooong linnnnnnnnnnnes
+and normal lines!
+
+another paragraph
+        ''', rest=True)),
+                         '''\
+some ReST formated text
+=======================
+With some times some veeeeeeeeeeeeeeerrrrryyyyyyyyyyyyyyyyyyy
+loooooooooooooooooooooong linnnnnnnnnnnes
+and normal lines!
+
+another paragraph''')
+
+    def test_nonregr_unsplitable_word(self):
+        self.assertEquals(ulines(tu.normalize_text('''petit complement :
+
+http://www.plonefr.net/blog/archive/2005/10/30/tester-la-future-infrastructure-i18n
+''', 80)),
+                         '''petit complement :
+
+http://www.plonefr.net/blog/archive/2005/10/30/tester-la-future-infrastructure-i18n''')
+
+
+    def test_nonregr_rest_normalize(self):
+        self.assertEquals(ulines(tu.normalize_text("""... Il est donc evident que tout le monde doit lire le compte-rendu de RSH et aller discuter avec les autres si c'est utile ou necessaire.
+        """, rest=True)), """... Il est donc evident que tout le monde doit lire le compte-rendu de RSH et
+aller discuter avec les autres si c'est utile ou necessaire.""")
+
+    def test_normalize_rest_paragraph(self):
+        self.assertEquals(ulines(tu.normalize_rest_paragraph("""**nico**: toto""")),
+                          """**nico**: toto""")
+
+    def test_normalize_rest_paragraph2(self):
+        self.assertEquals(ulines(tu.normalize_rest_paragraph(""".. _tdm: http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Table-des-matieres/.20_adaa41fb-c125-4919-aece-049601e81c8e_0_0.pdf
+.. _extrait: http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Extrait-du-livre/.20_d6eed0be-0d36-4384-be59-2dd09e081012_0_0.pdf""", indent='> ')),
+                          """> .. _tdm:
+> http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Table-des-matieres/.20_adaa41fb-c125-4919-aece-049601e81c8e_0_0.pdf
+> .. _extrait:
+> http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Extrait-du-livre/.20_d6eed0be-0d36-4384-be59-2dd09e081012_0_0.pdf""")
+
+    def test_normalize_paragraph2(self):
+        self.assertEquals(ulines(tu.normalize_paragraph(""".. _tdm: http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Table-des-matieres/.20_adaa41fb-c125-4919-aece-049601e81c8e_0_0.pdf
+.. _extrait: http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Extrait-du-livre/.20_d6eed0be-0d36-4384-be59-2dd09e081012_0_0.pdf""", indent='> ')),
+                          """> .. _tdm:
+> http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Table-des-matieres/.20_adaa41fb-c125-4919-aece-049601e81c8e_0_0.pdf
+> .. _extrait:
+> http://www.editions-eni.fr/Livres/Python-Les-fondamentaux-du-langage---La-programmation-pour-les-scientifiques-Extrait-du-livre/.20_d6eed0be-0d36-4384-be59-2dd09e081012_0_0.pdf""")
+
+class NormalizeParagraphTC(TestCase):
+
+    def test_known_values(self):
+        self.assertEquals(ulines(tu.normalize_text("""This package contains test files shared by the logilab-common package. It isn't
+necessary to install this package unless you want to execute or look at
+the tests.""", indent=' ', line_len=70)),
+                         """\
+ This package contains test files shared by the logilab-common
+ package. It isn't necessary to install this package unless you want
+ to execute or look at the tests.""")
+
+
+class GetCsvTC(TestCase):
+
+    def test_known(self):
+        self.assertEquals(tu.splitstrip('a, b,c '), ['a', 'b', 'c'])
+
+class UnitsTC(TestCase):
+
+    def setUp(self):
+        self.units = {
+            'm':60,
+            'kb':1024,
+            'mb':1024*1024,
+            }
+
+    def test_empty_base(self):
+        self.assertEquals(tu.apply_units('17', {}), 17)
+
+    def test_empty_inter(self):
+        def inter(value):
+            return int(float(value)) * 2
+        result = tu.apply_units('12.4', {}, inter=inter)
+        self.assertEquals(result, 12 * 2)
+        self.assertIsInstance(result, float)
+
+    def test_empty_final(self):
+        # int('12.4') raise value error
+        self.assertRaises(ValueError, tu.apply_units,'12.4', {}, final=int)
+
+    def test_empty_inter_final(self):
+        result = tu.apply_units('12.4', {}, inter=float,final=int)
+        self.assertEquals(result, 12)
+        self.assertIsInstance(result, int)
+
+    def test_blank_base(self):
+        result = tu.apply_units(' 42  ', {}, final=int)
+        self.assertEquals(result, 42)
+
+    def test_blank_space(self):
+        result = tu.apply_units(' 1 337 ', {}, final=int)
+        self.assertEquals(result, 1337)
+
+    def test_blank_coma(self):
+        result = tu.apply_units(' 4,298.42 ', {})
+        self.assertEquals(result, 4298.42)
+
+    def test_blank_mixed(self):
+        result = tu.apply_units('45, 317, 337', {},final=int)
+        self.assertEquals(result, 45317337)
+
+    def test_unit_singleunit_singleletter(self):
+        result = tu.apply_units('15m', self.units)
+        self.assertEquals(result, 15 * self.units['m'] )
+
+    def test_unit_singleunit_multipleletter(self):
+        result = tu.apply_units('47KB', self.units)
+        self.assertEquals(result, 47 * self.units['kb'] )
+
+    def test_unit_singleunit_caseinsensitive(self):
+        result = tu.apply_units('47kb', self.units)
+        self.assertEquals(result, 47 * self.units['kb'] )
+
+    def test_unit_multipleunit(self):
+        result = tu.apply_units('47KB 1.5MB', self.units)
+        self.assertEquals(result, 47 * self.units['kb'] + 1.5 * self.units['mb'])
+
+    def test_unit_with_blank(self):
+        result = tu.apply_units('1 000 KB', self.units)
+        self.assertEquals(result, 1000 * self.units['kb'])
+
+RGX = re.compile('abcd')
+class PrettyMatchTC(TestCase):
+
+    def test_known(self):
+        string = 'hiuherabcdef'
+        self.assertEquals(ulines(tu.pretty_match(RGX.search(string), string)),
+                         'hiuherabcdef\n      ^^^^')
+    def test_known_values_1(self):
+        rgx = re.compile('(to*)')
+        string = 'toto'
+        match = rgx.search(string)
+        self.assertEquals(ulines(tu.pretty_match(match, string)), '''toto
+^^''')
+
+    def test_known_values_2(self):
+        rgx = re.compile('(to*)')
+        string = ''' ... ... to to
+ ... ... '''
+        match = rgx.search(string)
+        self.assertEquals(ulines(tu.pretty_match(match, string)), ''' ... ... to to
+         ^^
+ ... ...''')
+
+
+
+class UnquoteTC(TestCase):
+    def test(self):
+        self.assertEquals(tu.unquote('"toto"'), 'toto')
+        self.assertEquals(tu.unquote("'l'inenarrable toto'"), "l'inenarrable toto")
+        self.assertEquals(tu.unquote("no quote"), "no quote")
+
+
+class ColorizeAnsiTC(TestCase):
+    def test_known(self):
+        self.assertEquals(tu.colorize_ansi('hello', 'blue', 'strike'), '\x1b[9;34mhello\x1b[0m')
+        self.assertEquals(tu.colorize_ansi('hello', style='strike, inverse'), '\x1b[9;7mhello\x1b[0m')
+        self.assertEquals(tu.colorize_ansi('hello', None, None), 'hello')
+        self.assertEquals(tu.colorize_ansi('hello', '', ''), 'hello')
+    def test_raise(self):
+        self.assertRaises(KeyError, tu.colorize_ansi, 'hello', 'bleu', None)
+        self.assertRaises(KeyError, tu.colorize_ansi, 'hello', None, 'italique')
+
+
+class UnormalizeTC(TestCase):
+    def test_unormalize(self):
+        data = [(u'\u0153nologie', u'oenologie'),
+                (u'\u0152nologie', u'OEnologie'),
+                (u'l\xf8to', u'loto'),
+                (u'été', u'ete'),
+                ]
+        for input, output in data:
+            yield self.assertEquals, tu.unormalize(input), output
+
+class ModuleDocTest(DocTest):
+    """test doc test in this module"""
+    module = tu
+    # from logilab.common import textutils as module
+del DocTest # necessary if we don't want it to be executed (we don't...)
+
+if __name__ == '__main__':
+    unittest_main()

data/tools/common/common/test/unittest_tree.py

@@ -0,0 +1,248 @@
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+#
+# This file is part of logilab-common.
+#
+# logilab-common is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free
+# Software Foundation, either version 2.1 of the License, or (at your option) any
+# later version.
+#
+# logilab-common is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
+# details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-common.  If not, see <http://www.gnu.org/licenses/>.
+"""
+unit tests for module logilab.common.tree
+squeleton generated by /home/syt/bin/py2tests on Jan 20 at 10:43:25
+"""
+__revision__ = "$Id: unittest_tree.py,v 1.1 2010/06/11 09:23:45 casa Exp $"
+
+from logilab.common.testlib import TestCase, unittest_main
+from logilab.common.tree import *
+
+tree = ('root', (
+    ('child_1_1', (
+    ('child_2_1', ()), ('child_2_2', (
+    ('child_3_1', ()),
+    )))),
+    ('child_1_2', (('child_2_3', ()),))))
+
+def make_tree(tuple):
+    n = Node(tuple[0])
+    for child in tuple[1]:
+        n.append(make_tree(child))
+    return n
+
+class Node_ClassTest(TestCase):
+    """ a basic tree node, caracterised by an id"""
+    def setUp(self):
+        """ called before each test from this class """
+        self.o = make_tree(tree)
+
+
+    def test_flatten(self):
+        result = [r.id for r in self.o.flatten()]
+        expected = ['root', 'child_1_1', 'child_2_1', 'child_2_2', 'child_3_1', 'child_1_2', 'child_2_3']
+        self.assertListEqual(result, expected)
+
+    def test_flatten_with_outlist(self):
+        resultnodes = []
+        self.o.flatten(resultnodes)
+        result = [r.id for r in resultnodes]
+        expected = ['root', 'child_1_1', 'child_2_1', 'child_2_2', 'child_3_1', 'child_1_2', 'child_2_3']
+        self.assertListEqual(result, expected)
+
+
+    def test_known_values_remove(self):
+        """
+        remove a child node
+        """
+        self.o.remove(self.o.get_node_by_id('child_1_1'))
+        self.assertRaises(NodeNotFound, self.o.get_node_by_id, 'child_1_1')
+
+    def test_known_values_replace(self):
+        """
+        replace a child node with another
+        """
+        self.o.replace(self.o.get_node_by_id('child_1_1'), Node('hoho'))
+        self.assertRaises(NodeNotFound, self.o.get_node_by_id, 'child_1_1')
+        self.assertEqual(self.o.get_node_by_id('hoho'), self.o.children[0])
+
+    def test_known_values_get_sibling(self):
+        """
+        return the sibling node that has given id
+        """
+        self.assertEqual(self.o.children[0].get_sibling('child_1_2'), self.o.children[1], None)
+
+    def test_raise_get_sibling_NodeNotFound(self):
+        self.assertRaises(NodeNotFound, self.o.children[0].get_sibling, 'houhou')
+
+    def test_known_values_get_node_by_id(self):
+        """
+        return node in whole hierarchy that has given id
+        """
+        self.assertEqual(self.o.get_node_by_id('child_1_1'), self.o.children[0])
+
+    def test_raise_get_node_by_id_NodeNotFound(self):
+        self.assertRaises(NodeNotFound, self.o.get_node_by_id, 'houhou')
+
+    def test_known_values_get_child_by_id(self):
+        """
+        return child of given id
+        """
+        self.assertEqual(self.o.get_child_by_id('child_2_1', recurse=1), self.o.children[0].children[0])
+
+    def test_raise_get_child_by_id_NodeNotFound(self):
+        self.assertRaises(NodeNotFound, self.o.get_child_by_id, nid='child_2_1')
+        self.assertRaises(NodeNotFound, self.o.get_child_by_id, 'houhou')
+
+    def test_known_values_get_child_by_path(self):
+        """
+        return child of given path (path is a list of ids)
+        """
+        self.assertEqual(self.o.get_child_by_path(['root', 'child_1_1', 'child_2_1']), self.o.children[0].children[0])
+
+    def test_raise_get_child_by_path_NodeNotFound(self):
+        self.assertRaises(NodeNotFound, self.o.get_child_by_path, ['child_1_1', 'child_2_11'])
+
+    def test_known_values_depth_down(self):
+        """
+        return depth of this node in the tree
+        """
+        self.assertEqual(self.o.depth_down(), 4)
+        self.assertEqual(self.o.get_child_by_id('child_2_1',True).depth_down(), 1)
+
+    def test_known_values_depth(self):
+        """
+        return depth of this node in the tree
+        """
+        self.assertEqual(self.o.depth(), 0)
+        self.assertEqual(self.o.get_child_by_id('child_2_1',True).depth(), 2)
+
+    def test_known_values_width(self):
+        """
+        return depth of this node in the tree
+        """
+        self.assertEqual(self.o.width(), 3)
+        self.assertEqual(self.o.get_child_by_id('child_2_1',True).width(), 1)
+
+    def test_known_values_root(self):
+        """
+        return the root node of the tree
+        """
+        self.assertEqual(self.o.get_child_by_id('child_2_1', True).root(), self.o)
+
+    def test_known_values_leaves(self):
+        """
+        return a list with all the leaf nodes descendant from this task
+        """
+        self.assertEqual(self.o.leaves(), [self.o.get_child_by_id('child_2_1',True),
+                                          self.o.get_child_by_id('child_3_1',True),
+                                          self.o.get_child_by_id('child_2_3',True)])
+
+    def test_known_values_lineage(self):
+        c31 = self.o.get_child_by_id('child_3_1',True)
+        self.assertEqual(c31.lineage(), [self.o.get_child_by_id('child_3_1',True),
+                                         self.o.get_child_by_id('child_2_2',True),
+                                         self.o.get_child_by_id('child_1_1',True),
+                                         self.o])
+
+
+class post_order_list_FunctionTest(TestCase):
+    """"""
+    def setUp(self):
+        """ called before each test from this class """
+        self.o = make_tree(tree)
+
+    def test_known_values_post_order_list(self):
+        """
+        create a list with tree nodes for which the <filter> function returned true
+        in a post order foashion
+        """
+        L = ['child_2_1', 'child_3_1', 'child_2_2', 'child_1_1', 'child_2_3', 'child_1_2', 'root']
+        l = [n.id for n in post_order_list(self.o)]
+        self.assertEqual(l, L, l)
+
+    def test_known_values_post_order_list2(self):
+        """
+        create a list with tree nodes for which the <filter> function returned true
+        in a post order foashion
+        """
+        def filter(node):
+            if node.id == 'child_2_2':
+                return 0
+            return 1
+        L = ['child_2_1', 'child_1_1', 'child_2_3', 'child_1_2', 'root']
+        l = [n.id for n in post_order_list(self.o, filter)]
+        self.assertEqual(l, L, l)
+
+
+class PostfixedDepthFirstIterator_ClassTest(TestCase):
+    """"""
+    def setUp(self):
+        """ called before each test from this class """
+        self.o = make_tree(tree)
+
+    def test_known_values_next(self):
+        L = ['child_2_1', 'child_3_1', 'child_2_2', 'child_1_1', 'child_2_3', 'child_1_2', 'root']
+        iter = PostfixedDepthFirstIterator(self.o)
+        o = iter.next()
+        i = 0
+        while o:
+            self.assertEqual(o.id, L[i])
+            o = iter.next()
+            i += 1
+
+
+class pre_order_list_FunctionTest(TestCase):
+    """"""
+    def setUp(self):
+        """ called before each test from this class """
+        self.o = make_tree(tree)
+
+    def test_known_values_pre_order_list(self):
+        """
+        create a list with tree nodes for which the <filter> function returned true
+        in a pre order fashion
+        """
+        L = ['root', 'child_1_1', 'child_2_1', 'child_2_2', 'child_3_1', 'child_1_2', 'child_2_3']
+        l = [n.id for n in pre_order_list(self.o)]
+        self.assertEqual(l, L, l)
+
+    def test_known_values_pre_order_list2(self):
+        """
+        create a list with tree nodes for which the <filter> function returned true
+        in a pre order fashion
+        """
+        def filter(node):
+            if node.id == 'child_2_2':
+                return 0
+            return 1
+        L = ['root', 'child_1_1', 'child_2_1', 'child_1_2', 'child_2_3']
+        l = [n.id for n in pre_order_list(self.o, filter)]
+        self.assertEqual(l, L, l)
+
+
+class PrefixedDepthFirstIterator_ClassTest(TestCase):
+    """"""
+    def setUp(self):
+        """ called before each test from this class """
+        self.o = make_tree(tree)
+
+    def test_known_values_next(self):
+        L = ['root', 'child_1_1', 'child_2_1', 'child_2_2', 'child_3_1', 'child_1_2', 'child_2_3']
+        iter = PrefixedDepthFirstIterator(self.o)
+        o = iter.next()
+        i = 0
+        while o:
+            self.assertEqual(o.id, L[i])
+            o = iter.next()
+            i += 1
+
+
+if __name__ == '__main__':
+    unittest_main()

data/tools/common/common/test/unittest_umessage.py

@@ -0,0 +1,55 @@
+# encoding: iso-8859-15
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+#
+# This file is part of logilab-common.
+#
+# logilab-common is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free
+# Software Foundation, either version 2.1 of the License, or (at your option) any
+# later version.
+#
+# logilab-common is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
+# details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-common.  If not, see <http://www.gnu.org/licenses/>.
+
+from logilab.common.testlib import TestCase, unittest_main
+from logilab.common.umessage import UMessage, decode_QP
+
+import email
+
+class UMessageTC(TestCase):
+
+    def setUp(self):
+        msg1 = email.message_from_file(open('data/test1.msg'))
+        self.umessage1 = UMessage(msg1)
+        msg2 = email.message_from_file(open('data/test2.msg'))
+        self.umessage2 = UMessage(msg2)
+
+    def test_get_subject(self):
+        subj = self.umessage2.get('Subject')
+        self.assertEquals(type(subj), unicode)
+        self.assertEquals(subj, u'� LA MER')
+
+    def test_get_all(self):
+        to = self.umessage2.get_all('To')
+        self.assertEquals(type(to[0]), unicode)
+        self.assertEquals(to, [u'�l�ment � accents <alf@logilab.fr>'])
+
+    def test_get_payload_no_multi(self):
+        payload = self.umessage1.get_payload()
+        self.assertEquals(type(payload), unicode)
+
+    def test_decode_QP(self):
+        test_line =  '=??b?UmFwaGHrbA==?= DUPONT<raphael.dupont@societe.fr>'
+        test = decode_QP(test_line)
+        self.assertEquals(type(test), unicode)
+        self.assertEquals(test, u'Rapha�l DUPONT<raphael.dupont@societe.fr>')
+
+
+if __name__ == '__main__':
+    unittest_main()

data/tools/common/common/test/unittest_ureports_html.py

@@ -0,0 +1,64 @@
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+#
+# This file is part of logilab-common.
+#
+# logilab-common is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free
+# Software Foundation, either version 2.1 of the License, or (at your option) any
+# later version.
+#
+# logilab-common is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
+# details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-common.  If not, see <http://www.gnu.org/licenses/>.
+'''unit tests for ureports.html_writer
+'''
+
+__revision__ = "$Id: unittest_ureports_html.py,v 1.1 2010/06/11 09:23:46 casa Exp $"
+
+from utils import WriterTC
+from logilab.common.testlib import TestCase, unittest_main
+from logilab.common.ureports.html_writer import *
+
+class HTMLWriterTC(TestCase, WriterTC):
+
+    def setUp(self):
+        self.writer = HTMLWriter(1)
+
+    # Section tests ###########################################################
+    section_base = '''<div>
+<h1>Section title</h1>
+<p>Section\'s description.
+Blabla bla</p></div>
+'''
+    section_nested = '''<div>\n<h1>Section title</h1>\n<p>Section\'s description.\nBlabla bla</p><div>\n<h2>Subsection</h2>\n<p>Sub section description</p></div>\n</div>\n'''
+
+    # List tests ##############################################################
+    list_base = '''<ul>\n<li>item1</li>\n<li>item2</li>\n<li>item3</li>\n<li>item4</li>\n</ul>\n'''
+
+    nested_list = '''<ul>
+<li><p>blabla<ul>
+<li>1</li>
+<li>2</li>
+<li>3</li>
+</ul>
+</p></li>
+<li>an other point</li>
+</ul>
+'''
+
+    # Table tests #############################################################
+    table_base = '''<table>\n<tr class="odd">\n<td>head1</td>\n<td>head2</td>\n</tr>\n<tr class="even">\n<td>cell1</td>\n<td>cell2</td>\n</tr>\n</table>\n'''
+    field_table = '''<table class="field" id="mytable">\n<tr class="odd">\n<td>f1</td>\n<td>v1</td>\n</tr>\n<tr class="even">\n<td>f22</td>\n<td>v22</td>\n</tr>\n<tr class="odd">\n<td>f333</td>\n<td>v333</td>\n</tr>\n</table>\n'''
+    advanced_table = '''<table class="whatever" id="mytable">\n<tr class="header">\n<th>field</th>\n<th>value</th>\n</tr>\n<tr class="even">\n<td>f1</td>\n<td>v1</td>\n</tr>\n<tr class="odd">\n<td>f22</td>\n<td>v22</td>\n</tr>\n<tr class="even">\n<td>f333</td>\n<td>v333</td>\n</tr>\n<tr class="odd">\n<td> <a href="http://www.perdu.com">toi perdu ?</a></td>\n<td>&#160;</td>\n</tr>\n</table>\n'''
+
+
+    # VerbatimText tests ######################################################
+    verbatim_base = '''<pre>blablabla</pre>'''
+
+if __name__ == '__main__':
+    unittest_main()