Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
create misc.py and move functions from other files to this file
Browse files Browse the repository at this point in the history
  • Loading branch information
@dkrenn
dkrenn committed Aug 30, 2015
1 parent fff27da commit 1097dee
Show file tree
Hide file tree
Showing 4 changed files with 444 additions and 434 deletions.
218 changes: 0 additions & 218 deletions src/sage/rings/asymptotic/growth_group.py
View file
Original file line number Diff line number Diff line change
Expand Up @@ -200,224 +200,6 @@
lazy_import('sage.rings.asymptotic.growth_group_cartesian', 'CartesianProductGrowthGroups')


def repr_short_to_parent(s):
r"""
Helper method for the growth group factory, which converts a short
representation string to a parent.
INPUT:
A string.
OUTPUT:
A parent.
EXAMPLES::
sage: import sage.rings.asymptotic.growth_group as agg
sage: agg.repr_short_to_parent('ZZ')
Integer Ring
sage: agg.repr_short_to_parent('QQ')
Rational Field
sage: agg.repr_short_to_parent('SR')
Symbolic Ring
sage: agg.repr_short_to_parent('NN')
Non negative integer semiring
TESTS::
sage: agg.repr_short_to_parent('abcdef')
Traceback (most recent call last):
...
ValueError: Cannot create a parent out of 'abcdef'.
> *previous* NameError: name 'abcdef' is not defined
"""
from sage.misc.sage_eval import sage_eval
try:
P = sage_eval(s)
except Exception as e:
raise combine_exceptions(
ValueError("Cannot create a parent out of '%s'." % (s,)), e)

from sage.misc.lazy_import import LazyImport
if type(P) is LazyImport:
P = P._get_object()

from sage.structure.parent import is_Parent
if not is_Parent(P):
raise ValueError("'%s' does not describe a parent." % (s,))
return P


def parent_to_repr_short(P):
r"""
Helper method which generates a short(er) representation string
out of a parent.
INPUT:
A parent.
OUTPUT:
A string.
EXAMPLES::
sage: import sage.rings.asymptotic.growth_group as agg
sage: agg.parent_to_repr_short(ZZ)
'ZZ'
sage: agg.parent_to_repr_short(QQ)
'QQ'
sage: agg.parent_to_repr_short(SR)
'SR'
sage: agg.parent_to_repr_short(ZZ[x])
'(Univariate Polynomial Ring in x over Integer Ring)'
"""
if P is sage.rings.integer_ring.ZZ:
return 'ZZ'
elif P is sage.rings.rational_field.QQ:
return 'QQ'
elif P is sage.symbolic.ring.SR:
return 'SR'
else:
rep = repr(P)
if ' ' in rep:
rep = '(' + rep + ')'
return rep


def split_str_by_mul(string):
r"""
Split the given string into a tuple of substrings arising by
splitting by '*' and taking care of parentheses.
INPUT:
- ``string`` - a string.
OUTPUT:
A tuple of strings.
TESTS::
sage: from sage.rings.asymptotic.growth_group import split_str_by_mul
sage: split_str_by_mul('x^ZZ')
('x^ZZ',)
sage: split_str_by_mul('log(x)^ZZ * y^QQ')
('log(x)^ZZ', 'y^QQ')
sage: split_str_by_mul('log(x)**ZZ * y**QQ')
('log(x)**ZZ', 'y**QQ')
sage: split_str_by_mul('a^b * * c^d')
Traceback (most recent call last):
...
ValueError: 'a^b * * c^d' is invalid since a '*' follows a '*'
sage: split_str_by_mul('a^b * (c*d^e)')
('a^b', 'c*d^e')
"""
factors = list()
balanced = True
if string and string[0] == '*':
raise ValueError("'%s' is invalid since it starts with a '*'." %
(string,))
for s in string.split('*'):
if not s:
factors[-1] += '*'
balanced = False
continue
if not s.strip():
raise ValueError("'%s' is invalid since a '*' follows a '*'" %
(string,))
if not balanced:
s = factors.pop() + '*' + s
balanced = s.count('(') == s.count(')')
factors.append(s)

if not balanced:
raise ValueError("Parentheses in '%s' are not balanced" % (string,))

def strip(s):
s = s.strip()
if not s:
return s
if s[0] == '(' and s[-1] == ')':
s = s[1:-1]
return s.strip()

return tuple(strip(f) for f in factors)


def combine_exceptions(e, *f):
r"""
Helper function which combines the messages of the given exceptions.
EXAMPLES::
sage: from sage.rings.asymptotic.growth_group import combine_exceptions
sage: raise combine_exceptions(ValueError('Outer.'), TypeError('Inner.'))
Traceback (most recent call last):
...
ValueError: Outer.
> *previous* TypeError: Inner.
sage: raise combine_exceptions(ValueError('Outer.'),
....: TypeError('Inner1.'), TypeError('Inner2.'))
Traceback (most recent call last):
...
ValueError: Outer.
> *previous* TypeError: Inner1.
> *and* TypeError: Inner2.
sage: raise combine_exceptions(ValueError('Outer.'),
....: combine_exceptions(TypeError('Middle.'),
....: TypeError('Inner.')))
Traceback (most recent call last):
...
ValueError: Outer.
> *previous* TypeError: Middle.
>> *previous* TypeError: Inner.
"""
import re
msg = ('\n *previous* ' +
'\n *and* '.join("%s: %s" % (ff.__class__.__name__, str(ff)) for ff in f))
msg = re.sub(r'^([>]* \*previous\*)', r'>\1', msg, flags=re.MULTILINE)
msg = re.sub(r'^([>]* \*and\*)', r'>\1', msg, flags=re.MULTILINE)
msg = str(e.args if len(e.args) > 1 else e.args[0]) + msg
e.args = (msg,)
return e


def underlying_class(P):
r"""
Return the underlying class (class without the attached
categories) of the given instance.
OUTPUT:
A class.
EXAMPLES::
sage: from sage.rings.asymptotic.growth_group import underlying_class
sage: type(QQ)
<class 'sage.rings.rational_field.RationalField_with_category'>
sage: underlying_class(QQ)
<class 'sage.rings.rational_field.RationalField'>
"""
cls = type(P)
if not P._is_category_initialized():
return cls
from sage.structure.misc import is_extension_type
if is_extension_type(cls):
return cls

from sage.categories.sets_cat import Sets
Sets_parent_class = Sets().parent_class
while issubclass(cls, Sets_parent_class):
cls = cls.__base__
return cls


class Variable(sage.structure.unique_representation.CachedRepresentation,
sage.structure.sage_object.SageObject):
r"""
Expand Down
100 changes: 0 additions & 100 deletions src/sage/rings/asymptotic/growth_group_cartesian.py
View file
Original file line number Diff line number Diff line change
Expand Up @@ -88,106 +88,6 @@
#*****************************************************************************

import sage
from growth_group import combine_exceptions

def merge_overlapping(A, B, key=None):
r"""
Merge the two overlapping tuples/lists.
TESTS::
sage: from sage.rings.asymptotic.growth_group_cartesian import merge_overlapping
sage: def f(L, s):
....: return list((ell, s) for ell in L)
sage: key = lambda k: k[0]
sage: merge_overlapping(f([0..3], 'a'), f([5..7], 'b'), key)
Traceback (most recent call last):
...
ValueError: Input does not have an overlap.
sage: merge_overlapping(f([0..2], 'a'), f([4..7], 'b'), key)
Traceback (most recent call last):
...
ValueError: Input does not have an overlap.
sage: merge_overlapping(f([4..7], 'a'), f([0..2], 'b'), key)
Traceback (most recent call last):
...
ValueError: Input does not have an overlap.
sage: merge_overlapping(f([0..3], 'a'), f([3..4], 'b'), key)
([(0, 'a'), (1, 'a'), (2, 'a'), (3, 'a'), (4, 'b')],
[(0, 'a'), (1, 'a'), (2, 'a'), (3, 'b'), (4, 'b')])
sage: merge_overlapping(f([3..4], 'a'), f([0..3], 'b'), key)
([(0, 'b'), (1, 'b'), (2, 'b'), (3, 'a'), (4, 'a')],
[(0, 'b'), (1, 'b'), (2, 'b'), (3, 'b'), (4, 'a')])
sage: merge_overlapping(f([0..1], 'a'), f([0..4], 'b'), key)
([(0, 'a'), (1, 'a'), (2, 'b'), (3, 'b'), (4, 'b')],
[(0, 'b'), (1, 'b'), (2, 'b'), (3, 'b'), (4, 'b')])
sage: merge_overlapping(f([0..3], 'a'), f([0..1], 'b'), key)
([(0, 'a'), (1, 'a'), (2, 'a'), (3, 'a')],
[(0, 'b'), (1, 'b'), (2, 'a'), (3, 'a')])
sage: merge_overlapping(f([0..3], 'a'), f([1..3], 'b'), key)
([(0, 'a'), (1, 'a'), (2, 'a'), (3, 'a')],
[(0, 'a'), (1, 'b'), (2, 'b'), (3, 'b')])
sage: merge_overlapping(f([1..3], 'a'), f([0..3], 'b'), key)
([(0, 'b'), (1, 'a'), (2, 'a'), (3, 'a')],
[(0, 'b'), (1, 'b'), (2, 'b'), (3, 'b')])
sage: merge_overlapping(f([0..6], 'a'), f([3..4], 'b'), key)
([(0, 'a'), (1, 'a'), (2, 'a'), (3, 'a'), (4, 'a'), (5, 'a'), (6, 'a')],
[(0, 'a'), (1, 'a'), (2, 'a'), (3, 'b'), (4, 'b'), (5, 'a'), (6, 'a')])
sage: merge_overlapping(f([0..3], 'a'), f([1..2], 'b'), key)
([(0, 'a'), (1, 'a'), (2, 'a'), (3, 'a')],
[(0, 'a'), (1, 'b'), (2, 'b'), (3, 'a')])
sage: merge_overlapping(f([1..2], 'a'), f([0..3], 'b'), key)
([(0, 'b'), (1, 'a'), (2, 'a'), (3, 'b')],
[(0, 'b'), (1, 'b'), (2, 'b'), (3, 'b')])
sage: merge_overlapping(f([1..3], 'a'), f([1..3], 'b'), key)
([(1, 'a'), (2, 'a'), (3, 'a')],
[(1, 'b'), (2, 'b'), (3, 'b')])
"""
if key is None:
key = lambda k: k

def find_overlapping_index(A, B):
if len(B) > len(A) - 2:
raise StopIteration
matches = iter(i for i in xrange(1, len(A) - len(B))
if all(key(a) == key(b) for a, b in zip(A[i:i+len(B)], B)))
return next(matches)

def find_mergedoverlapping_index(A, B):
"""
Return in index i where to merge two overlapping tuples/lists ``A`` and ``B``.
Then ``A + B[i:]`` or ``A[:-i] + B`` are the merged tuples/lists.
Adapted from http://stackoverflow.com/a/30056066/1052778.
"""
matches = iter(i for i in xrange(min(len(A), len(B)), 0, -1)
if all(key(a) == key(b) for a, b in zip(A[-i:], B[:i])))
return next(matches, 0)

i = find_mergedoverlapping_index(A, B)
if i > 0:
return A + B[i:], A[:-i] + B

i = find_mergedoverlapping_index(B, A)
if i > 0:
return B[:-i] + A, B + A[i:]

try:
i = find_overlapping_index(A, B)
except StopIteration:
pass
else:
return A, A[:i] + B + A[i+len(B):]

try:
i = find_overlapping_index(B, A)
except StopIteration:
pass
else:
return B[:i] + A + B[i+len(A):], B

raise ValueError('Input does not have an overlap.')


class CartesianProductFactory(sage.structure.factory.UniqueFactory):
Expand Down
Loading

0 comments on commit 1097dee

Please sign in to comment.