def test_escrita_campo_num_decimal(self):
        # aceitar somente tipo Decimal
        with self.assertRaises(errors.TipoError):
            self.seg_p.valor_titulo = 10.0
        with self.assertRaises(errors.TipoError):
            self.seg_p.valor_titulo = ''

        # Testa se as casas decimais estao sendo verificadas
        with self.assertRaises(errors.NumDecimaisError):
            self.seg_p.valor_titulo = Decimal('100.2')
        with self.assertRaises(errors.NumDecimaisError):
            self.seg_p.valor_titulo = Decimal('1001')
        with self.assertRaises(errors.NumDecimaisError):
            self.seg_p.valor_titulo = Decimal('1.000')

        # verifica se o numero de digitos esta sendo verificado
        with self.assertRaises(errors.NumDigitosExcedidoError):
            self.seg_p.valor_titulo = Decimal('10000000008100.21')

        # armazemamento correto de um decimal
        self.seg_p.valor_titulo = Decimal('2.13')
        self.assertEqual(self.seg_p.valor_titulo, Decimal('2.13'))
def __init__(self, root, cwd, kindpats, ctx=None, badfn=None):
        super(includematcher, self).__init__(root, cwd, badfn)

        # Can we use tree matcher?
        rules = _kindpatstoglobs(kindpats, recursive=True)
        fallback = True
        if rules is not None:
            try:
                matcher = treematcher(root, cwd, badfn=badfn, rules=rules)
                # Replace self to 'matcher'.
                self.__dict__ = matcher.__dict__
                self.__class__ = matcher.__class__
                fallback = False
            except ValueError:
                # for example, Regex("Compiled regex exceeds size limit of 10485760 bytes.")
                pass
        if fallback:
            self._pats, self.matchfn = _buildmatch(ctx, kindpats, "(?:/|$)", root)
            # prefix is True if all patterns are recursive, so certain fast paths
            # can be enabled. Unfortunately, it's too easy to break it (ex. by
            # using "glob:*.c", "re:...", etc).
            self._prefix = _prefix(kindpats)
            roots, dirs = _rootsanddirs(kindpats)
            # roots are directories which are recursively included.
            # If self._prefix is True, then _roots can have a fast path for
            # visitdir to return "all", marking things included unconditionally.
            # If self._prefix is False, then that optimization is unsound because
            # "roots" might contain entries that is not recursive (ex. roots will
            # include "foo/bar" for pattern "glob:foo/bar/*.c").
            self._roots = set(roots)
            # dirs are directories which are non-recursively included.
            # That is, files under that directory are included. But not
            # subdirectories.
            self._dirs = set(dirs)
            # Try to use a more efficient visitdir implementation
            visitdir = _buildvisitdir(kindpats)
            if visitdir:
                self.visitdir = visitdir