python-brial 0.8.5-4 / usr / lib / python2.7 / dist-packages / brial / PyPolyBoRi.py

"""PolyBoRi's interface to libpolybori*

This file makes interfaces to PolyBoRi's runtime libraries available in Python.

It is smart in such a way, that it may also detect and use Sage's Cython based
interface, where availables. If that's not the case (if if the environment
variables PBORI_NOSAGE is set) it falls back to PolyBoRi's boost_python-based
interface.

AUTHOR:
    The PolyBoRi Team, 2007-2012

            Examples:

            >>> from brial.frontend import *
            >>> r=declare_ring(["x0","x1","x2","y0","y1","y2"], globals())
            >>> x0>x1
            True
            >>> x0>x1*x2
            True
            >>> y0>y1
            True
            >>> y0>y1*y2
            True

            >>> r = r.clone(ordering=dlex)
            >>> r(x0) > r(x1)
            True
            >>> r(x0) > r(x1*x2)
            False

            >>> r = r.clone(ordering=dp_asc)
            >>> r(x0) > r(x1)
            False
            >>> r(x0) > r(x1*x2)
            False

            >>> r = r.clone(ordering=block_dlex, blocks=[3])
            >>> r(x0) > r(x1)
            True
            >>> r(x0) > r(x1*x2)
            False
            >>> r(x0) > r(y0*y1*y2)
            True

            >>> r = r.clone(ordering=block_dp_asc)
            >>> r(x0) > r(x1)
            False
            >>> r(x0) > r(y0)
            False
            >>> r(x0) > r(x1*x2)
            False

            >>> r = r.clone(ordering=block_dp_asc, blocks=[3])
            >>> r(x0) > r(y0)
            True

            >>> r(x0) > r(y0*y1)
            True

            >>> r = r.clone(names=["z17", "z7"])
            >>> [r.variable(idx) for idx in xrange(3)]
            [z17, z7, x2]
            >>> r = r.clone(names="abcde")
            >>> [r.variable(idx) for idx in xrange(6)]
            [a, b, c, d, e, y2]

"""

import os as _os
_sageify = 'PBORI_NOSAGE' not in _os.environ

try:
    if _sageify:
        from sage import all
        from sage.rings.polynomial.pbori import *
except:
    _sageify = False

if _sageify:
    import weakref


    class OrderCode:
        pass

    OrderCode.__dict__ = order_dict
    OrderCode.__module__ = __name__


    def Ring(n, order='lp', names=None, blocks=[]):

        pbnames = names
        if pbnames is None:
            pbnames = ['x(' + str(idx) + ')' for idx in range(n)]
        order = TermOrder_from_pb_order(n, order, blocks)
        R = BooleanPolynomialRing(n, names=pbnames, order=order)
        return R

    BoolePolynomialVector = BooleanPolynomialVector


    #todo: PolyBoRi's original interface uses its WeakRingPtr here
    def WeakRingRef(ring):
        return weakref.weakref(ring)

    Monomial = MonomialFactory()
    Polynomial = PolynomialFactory()
    Variable = VariableFactory()


else:  # import Polybori's original interface
    from sys import modules
    from itertools import chain
    import re
    import warnings
    compatibility_mode = False
    # First try, whether PyPolyBoRi is already in modules (e.g. static
    # profiling)
    try:
        pb = modules["PyPolyBoRi"]
        for k in dir(pb):
            globals()[k] = getattr(pb, k)
    except:
        from .dynamic.PyPolyBoRi import *


    def replace_init_proc(cls):
        old_init = cls.__init__

        def init(self, iteratable=None):
            old_init(self)
            if iteratable:
                for item in iteratable:
                    self.append(item)
        cls.__init__ = init

    replace_init_proc(BoolePolynomialVector)
    replace_init_proc(IntVector)

    monomial_old_init = Monomial.__init__


    def fix_monomials():
        try:
            monomial_old_init = Monomial._libpolybori_init
            return
        except:
            monomial_old_init = Monomial._libpolybori_init = Monomial.__init__

        def monomial_new_init(self, arg=None):
            """
            Constructor of the class Monomial
            Constructs a Monomial from
              - Monomial
              - Variable
              - sequence of variables
            """
            try:
                monomial_old_init(self, arg)
            except:
                items = sorted((x for x in arg), reverse=True, key=top_index)
                prototype = Monomial(items[0])
                for x in items[1:]:
                    prototype *= x

                monomial_old_init(self, prototype)

        Monomial.__init__ = monomial_new_init

    _add_up_polynomials = add_up_polynomials


    def fix_booleset(set_type):
        booleset_old_init = set_type.__init__

        def booleset_new_init(self, arg=None, second=None):
            """
            Constructor of the class BooleSet (constructs a BooleSet from a CCuddNavigator
            arg    : of type polybori.dynamic.PyPolyBoRi.CCuddNavigator
            second : of type polybori.dynamic.PyPolyBoRi.BooleRing
            """
            if second != None:
                booleset_old_init(self, arg, second)
            else:
                try:
                    booleset_old_init(self, arg)
                except:
                    s = set()
                    v = BoolePolynomialVector()
                    arglist = list(arg)
                    for i in arglist:
                        s.add(Monomial(i))
                    for i in s:
                        v.append(i)
                    p = _add_up_polynomials(v, Polynomial(arglist[0].ring().
                        zero()))
                    booleset_old_init(self, p.set())

        set_type.__init__ = booleset_new_init

    fix_booleset(BooleSet)

    for k in OrderCode.values:
        globals()[str(OrderCode.values[k])] = OrderCode.values[k]

    monomial_cplusplus_div = Monomial.__div__


    def monomial_python_div(self, arg):
        try:
            return monomial_cplusplus_div(self, arg)
        except ValueError:
            return Polynomial(0, self.ring())

    Monomial.__div__ = monomial_python_div

    variable_cplusplus_div = Variable.__div__


    def variable_python_div(self, arg):
        try:
            return variable_cplusplus_div(self, arg)
        except ValueError:
            return Polynomial(0, self.ring())

    Variable.__div__ = variable_python_div

    snake_pattern = re.compile('(((?<=[a-z])[A-Z])|([A-Z](?![A-Z]|$)))')


    def to_snake_case(s):
        return snake_pattern.sub('_\\1', s).lower().strip('_')


    def warn_snake_case(a, snaked):
        warnings.warn("access to %s is deprecated, use %s instead" % (a,
            snaked), stacklevel=3)


    def _strategy_getattr(self, a):
        if hasattr(self.reduction_strategy, a):
            return getattr(self.reduction_strategy, a)
        snaked = to_snake_case(a)

        if snaked in self.__dict__:
            warn_snake_case(a, snaked)
            return self.__dict__[snaked]
        if hasattr(self.reduction_strategy, snaked):
            warn_snake_case(a, snaked)
            return getattr(self.reduction_strategy, snaked)
        raise AttributeError


    def _strategy_setattr(self, a, v):
        if a in self.__dict__:
            self.__dict__[a] = v
            return
        if hasattr(self.reduction_strategy, a):
            return setattr(self.reduction_strategy, a, v)
        snaked = to_snake_case(a)
        if snaked in self.__dict__:
            warn_snake_case(a, snaked)
            return setattr(self, snaked, v)

        if hasattr(self.reduction_strategy, snaked):
            warn_snake_case(a, snaked)
            return setattr(self.reduction_strategy, snaked, v)
        self.__dict__[a] = v
    if compatibility_mode:
        GroebnerStrategy.__getattr__ = _strategy_getattr
        GroebnerStrategy.__setattr__ = _strategy_setattr


    def weakringref_call(self):
        if self.is_valid():
            return self.deref()
        return None

    WeakRingRef.__call__ = weakringref_call


    def fix_ring():
        try:
            _cpp_ring_init = Ring._libpolybori_init
            return
        except:
            _cpp_ring_init = Ring._libpolybori_init = Ring.__init__

        old_ring_var = Ring.var
        _cpp_set_variable_name = Ring.set_variable_name
        _cpp_append_block = Ring.append_block
        _cpp_change_ordering = Ring.change_ordering
        _cpp_set_variable_name = Ring.set_variable_name
        _cpp_append_block = Ring.append_block
        _cpp_ring_clone = Ring.clone

        def ring_var(self, i):
            """Deprecated; use Ring.variable(...). """
            warnings.warn('Ring.var is deprectated; use Ring.variable instead')
            return old_ring_var(self, i)

        def _ring_settings(ring, names, blocks):
            for (idx, elt) in enumerate(names):
                _cpp_set_variable_name(ring, idx, elt)

            for elt in blocks:
                _cpp_append_block(ring, elt)

        def _ring_init(self, first, ordering=None, names=[], blocks=[]):
            """Ring(n, ordering, names, block) generates a new Boolean
            polynomial ring with n variables, given  monomial ordering, variable
            names and block ordering blocks, if given.
            Further information/call patterns: """""" """
            if ordering is None:
                _cpp_ring_init(self, first)
            else:
                _cpp_ring_init(self, first, ordering)
            _ring_settings(self, names, blocks)

        def _set_variable_name(self, idx, name):
            """ Deprecated; use Ring.clone(names=...). """
            warnings.warn('Ring.set_variable_name is deprectated:\
        use Ring.clone(names=...) instead')
            return _cpp_set_variable_name(self, idx, name)

        def ring_var(self, i):
            """Deprecated; use Ring.variable(...). """
            warnings.warn('Ring.var is deprectated; use Ring.variable instead')
            return old_ring_var(self, i)

        def _ring_clone(self, ordering=None, names=[], blocks=[]):
            """ring.clone(ordering=..., names=..., block=...) generates a shallow copy
            of ring, but with different ordering, names or blocks if given.

            Further information/call patterns: """
            ring = _cpp_ring_clone(self)
            if ordering is not None:
                _cpp_change_ordering(ring, ordering)

            _ring_settings(ring, names, blocks)

            return ring

        def _change_ordering(self, ordercode):
            """ Deprecated; use Ring.clone(ordering=...). """
            warnings.warn('Ring.change_ordering is deprectated:\
            use Ring.clone(ordering=...) instead')
            return _cpp_change_ordering(self, ordercode)

        def _append_block(self, next_block_start):
            """Deprectated; use Ring.clone(blocks=...). """
            warnings.warn('Ring.append_block is deprecated:\
            use Ring.clone(blocks=...) instead')
            return _cpp_append_block(self, next_block_start)

        _append_block.__doc__ += _cpp_append_block.__doc__

        if _cpp_change_ordering.__doc__:
            _change_ordering.__doc__ += _cpp_change_ordering.__doc__
        if _cpp_ring_clone.__doc__:
            _ring_clone.__doc__ += _cpp_ring_clone.__doc__
        if old_ring_var.__doc__:
            ring_var.__doc__ += old_ring_var.__doc__
        if _cpp_set_variable_name.__doc__:
            _set_variable_name.__doc__ += _cpp_set_variable_name.__doc__

        Ring.__init__ = _ring_init
        Ring.var = ring_var
        Ring.set_variable_name = _set_variable_name
        Ring.clone = _ring_clone
        Ring.change_ordering = _change_ordering
        Ring.append_block = _append_block

    fix_monomials()
    fix_ring()
    del fix_monomials, fix_ring

# clean up
del _os, _sageify

# Common stuff og both interfaces
_add_up_polynomials = add_up_polynomials


def add_up_polynomials(polys, init):
    """
    Adds up the polynomials in polys (which should be a BoolePolynomialVector or a sequence of ???
    """
    if not isinstance(polys, BoolePolynomialVector):
        vec = BoolePolynomialVector
        for p in polys:
            vec.append(p)
        polys = vec

    return _add_up_polynomials(polys, init)

_gauss_on_polys = gauss_on_polys


def gauss_on_polys(l):
    vec = BoolePolynomialVector(l)
    return list(_gauss_on_polys(vec))