On Thu, 12 Nov 2015, Volker Braun wrote:
Just define your own exception
class LatticeMeetException(ValueError):
def __init__(self, msg, x, y):
...
Tried something: http://trac.sagemath.org/ticket/19163 . May belong under
"bad examples" -header on Python style book.
--
Jori Mäntys
On Thursday, November 12, 2015 at 6:00:00 PM UTC-8, kcrisman wrote:
>
> Surely many of you have seen the blogosphere erupt with a nearly P
> algorithm for graph isomorphism. I don't have any sense as to whether this
> is an actually implementable one that would be faster than e.g. nauty, but
FYI,
Just for the hell of it, I *did* update boost_cropped to 1.59.0 in a
private branch. The resultant Sage passes ptestlong with no errors, and
*can* run rstan with no error.
This should be considered for Sage itself (maybe with 1.58.0, which is the
version that many distros (including Debia
On 2015-11-12 19:27, Yueru Sun wrote:
Hello,
I was compiling sage 6.4(it is unfortunately the only version supported
by a math package I will be using) from the source on Ubuntu 14.04 with
the "make" command, and the process halted with the error below.
Can someone please help me with this erro
On Thu, 12 Nov 2015, David Roe wrote:
Exactly that. Posets are, shortly said, a digraph with
integers as vertices and a dictionary mapping them to
elements. hasse_diagram.py might raise error if 7 and 13 has
no meet, and I want to see that elements 'c' and 'r' has no
meet.
Then Volker's sugge
Alternatively, is it possible to find prebuilt binaries of older versions
of Sage somewhere? The official site only has binaries of the current
version; I also googled for them with no luck.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To uns
Hello,
I was compiling sage 6.4(it is unfortunately the only version supported by
a math package I will be using) from the source on Ubuntu 14.04 with the
"make" command, and the process halted with the error below.
Can someone please help me with this error?
Thanks,
Sun
/home/sun/Programs
> Are you sure you are remembering this correctly? I guess you don't have
> the exact output anymore, right?
>
>
No, of course not, unfortunately. That's what happens with network fails :(
> It should never say that some packages failed to build and at the same
> time saying that the Sage
Surely many of you have seen the blogosphere erupt with a nearly P
algorithm for graph isomorphism. I don't have any sense as to whether this
is an actually implementable one that would be faster than e.g. nauty, but
wondering whether anyone has a sense of this. There was already a social
med
On 2015-11-11 20:59, kcrisman wrote:
So I think that when ~/.sage is not possible to make, Sage doesn't make
all packages but still more or less claims to build effectively.
OK, I will test this with a fake $HOME directory.
--
You received this message because you are subscribed to the Google
On 2015-11-11 20:59, kcrisman wrote:
No errors,
other than maybe the "some packages failed to build" with empty message,
but then it said "sage build complete".
Are you sure you are remembering this correctly? I guess you don't have
the exact output anymore, right?
It should never say that s
Dear Michel,
Thanks a lot for the report!
I am cc-ing to Sage development list as I have no experience with
VoiceOver and no access to Mac OS for testing. Does anyone have any
experience fixing such issues and/or can submit a relevant pull
request to https://github.com/sagemath/sagecell ?
Best r
On Thu, Nov 12, 2015 at 3:13 PM, Jori Mäntysalo
wrote:
On Thu, 12 Nov 2015, Daniel Krenn wrote:
>
> True. Does this mean that you want to use x and y in the calling
>> function (e.g. catch the exception there and raise a different exception
>> explaining what is going on using x and y)?
>>
>
> Ex
On 12 November 2015 at 14:23, Francois Bissey
wrote:
>
>> On 13/11/2015, at 04:08, Dima Pasechnik wrote:
>>
>>
>>
>> On Wednesday, 11 November 2015 20:30:22 UTC, François wrote:
>> There is a ticket with a more recent boost:
>> http://trac.sagemath.org/ticket/17966
>>
>> It basically works on lin
On Thu, 12 Nov 2015, Daniel Krenn wrote:
True. Does this mean that you want to use x and y in the calling
function (e.g. catch the exception there and raise a different exception
explaining what is going on using x and y)?
Exactly that. Posets are, shortly said, a digraph with integers as
ver
> On 13/11/2015, at 04:08, Dima Pasechnik wrote:
>
>
>
> On Wednesday, 11 November 2015 20:30:22 UTC, François wrote:
> There is a ticket with a more recent boost:
> http://trac.sagemath.org/ticket/17966
>
> It basically works on linux. It needs love on OS X because
> boost's build system
On 2015-11-12 10:29, Jori Mäntysalo wrote:
> On Thu, 12 Nov 2015, Daniel Krenn wrote:
>
>>> Solution: From hasse_diagram.py do not raise just "no meet for x=1 y=2"
>>> but exception with value more complicated than a string.
>>
>> Something else: why is there a need for "x=" and "y=" (do these nam
Just define your own exception
class LatticeMeetException(ValueError):
def __init__(self, msg, x, y):
...
The HasseDiagram.meet_matrix already raises if there is no bottom, no need
to check that again at every step.
On Thursday, November 12, 2015 at 5:48:51 AM UTC-8, Jori Mäntysal
On 2015-11-12 07:31, David Roe wrote:
Sounds good. Also check out sage.misc.lazy_string if the string
representations of x and y could be complicated.
This is in particular true if you expect this exception to be caught in
an "except ValueError:".
--
You received this message because you ar
On Thu, 12 Nov 2015, Daniel Krenn wrote:
Solution: From hasse_diagram.py do not raise just "no meet for x=1 y=2"
but exception with value more complicated than a string.
Something else: why is there a need for "x=" and "y=" (do these names
mean anything in this context)? IMHO, "no meet for 1 a
On Thu, Nov 12, 2015 at 9:34 AM, Daniel Krenn wrote:
> On 2015-11-12 08:45, Jori Mäntysalo wrote:
> > LatticePoset({'a':['b', 'c'], 'b':['d', 'e'], 'c':['d', 'e'],
> > 'd':['f'], 'e':['f']})
> >
> > returns "ValueError: Not a lattice." I would like to see for example
> > "Not a lattice: no meet f
Hello,
The Athena patchbot is completely broken. Please stop it!
To avoid this I propose that after a failed build the patchbot checked
that the develop branch builds cleanly.
Vincent
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubsc
On Wednesday, 11 November 2015 20:30:22 UTC, François wrote:
>
> There is a ticket with a more recent boost:
> http://trac.sagemath.org/ticket/17966
>
> It basically works on linux. It needs love on OS X because
> boost's build system has no idea there is such a thing as
> "install_name" on O
On 2015-11-12 08:45, Jori Mäntysalo wrote:
> LatticePoset({'a':['b', 'c'], 'b':['d', 'e'], 'c':['d', 'e'],
> 'd':['f'], 'e':['f']})
>
> returns "ValueError: Not a lattice." I would like to see for example
> "Not a lattice: no meet for e and d."
+1
> Solution: From hasse_diagram.py do not raise j
Problem:
LatticePoset({'a':['b', 'c'], 'b':['d', 'e'], 'c':['d', 'e'],
'd':['f'], 'e':['f']})
returns "ValueError: Not a lattice." I would like to see for example "Not
a lattice: no meet for e and d."
Solution: From hasse_diagram.py do not raise just "no meet for x=1 y=2"
but exception with
Congratulations on your book! It looks beautiful and well-motivating. I
don't read any polish, so I can't judge contents, but I can tell you
that the "browsability value" of the book is very high, which is
important when you're judging which book to take home from the book
store or library :-) Beau
26 matches
Mail list logo
