Maybe you can just use the @disk_cached_function decorator?
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to
When I gave a week-long lecture series using Sage I built a binary
distribution on one of the machines in the computer room. Just build Sage
with all patches of your liking and then sage -bdist. Then I wrote a small
shell for the students to use that would download and unpack the binary
We have already something like this:
sage: Polyhedron([ (0,1), (5/3,0), (-1/3,-1/3) ])
A 2-dimensional polyhedron in QQ^2 defined as the convex hull of 3 vertices
sage: _.integral_points()
((0, 0), (1, 0), (0, 1))
Latte would be interesting to include, ideally with a
Hi Martin,
PALP has various compile-time limits. You can increase POLY_Dmax in the
PALP sources but you are likely to hit another limit if your problem is
this large. Also, PALP typically does not do any checking so you'll get
wrong answers.
I wrote a Cython implementation of the naive point
I'm really impressed by the WeylCharacterRing and the branching rule
implementation, but there are a couple of exceptional ones missing (e.g. E6
- G2). Is there a fundamental problem why they are not implemented? It
would be great to get 100% coverage of McKayPatera.
--
You received this
The change in the deprecation framework (http://trac.sagemath.org/10508)
has been merged into sage-5.2.rc0. This is likely to break any patches that
are using deprecations. I can assure you that all jokes about deprecating
the deprecations have already been made.
What needs to be done is
last week, but then it breaks the entire
sage-combinat
queue.
Dear Sage-combinat developers,
Would it be ok to move to sage-5.2.rc0 and have the queue apply there to
avoid the
conflicts?
Best,
Anne
On 7/16/12 9:49 AM, Volker Braun wrote:
The change in the deprecation
Schilling wrote:
Dear Volker Braun,
I just installed sage-5.2.rc0, but your deprecation patch does not seem to
be part of
this version.
Dear All!
I guarded the following patches with respect to sage-5.2.rc0 as
they did not apply any longer:
trac_11305-rigged_configurations
Is the topic databases that you can download from the internet, or a system
to serve mathematical data over the internet without requiring a local
install? I've though about the latter at times. Its definitely not feasible
to install every database known to man locally. So it would be nice to
, Volker Braun wrote:
So it would be nice to have a online service to hook into if you just
want to look up something.
See http://www.lmfdb.org/
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To view this discussion on the web visit
But I need the classical invariants / covariants with their conventional
names and normalizations in the literature. I'm not trying to do the most
general SL(n,C) representation theory here.
On Tuesday, September 11, 2012 1:12:57 PM UTC+1, Dima Pasechnik wrote:
Yes, it's great, but I would
If you want to give another tool a try I would recommend meld. Its a
pretty neat GUI program (actually itself written in Python+GTK).
On Wednesday, September 12, 2012 5:08:38 AM UTC+1, Travis Scrimshaw wrote:
Can I just say that I really don't like vimdiff and it never has wanted
to work
If there is an implementation that is *always* faster than the alternatives
then it makes no sense to keep others around. The pedagogical value of
being able to pick a slow algorithm is really limited (especially if the
only thing that changes is the time it takes to spit out the same number),
If you click on log then you see that the server timed out. This was
sometime last week where the patchbot server was down. You can re-run the
tests by adding ?kick to the url (I just did that, for the record)
http://patchbot.sagemath.org/ticket/13461/?kick
On Monday, October 8, 2012 1:54:14
My desktop is still churning though tickets, it might take another day
until it gets to this one...
On Monday, October 8, 2012 11:52:16 PM UTC+1, bump wrote:
On Monday, October 8, 2012 4:50:58 AM UTC-7, Volker Braun wrote:
If you click on log then you see that the server timed out
, Volker Braun wrote:
My desktop is still churning though tickets, it might take another
day
until it gets to this one...
In case this would be easy for you to setup, you are welcome to use
combinat.sagemath.org to run your patchbot. Especially on
sage-combinat patches :-)
Cheers
The startup_modules is a friendly reminder that you could help out reducing
startup time by using the lazy module import. Should every Sage user really
import
from interval_exchanges.all import *
from flat_surfaces.all import *
at every startup?
See
I haven't tried QPA but it seems to be a pure GAP script, so I would expect
that performance will be comparable to a pure Python implementation. But it
looks like a very nice project and its likely that it would be of some use
even if the core computations of a Sage quiver module were
On Thursday, December 6, 2012 10:08:16 AM UTC, Nathann Cohen wrote:
#13742 (Changes to Posets) : The former meaning of facade = None (which
is the default parameter) was facade = False. Now, it means facade =
True.
Maybe the default parameter should just be facade=True. Whats the purpose
In sage-5.5.beta0 some stuff was merged that is supposed to speed
up WeylCharacterRing, but I noticed the following taking forever now:
sage: A3 = WeylCharacterRing('A3', style='coroots')
sage: A3 = WeylCharacterRing('A3', style='coroots')
sage: A4(1,0,0,0,0).branch(A3) # takes forever
No
Yes, sorry for the typos. I know that it works if I specify the branching
rule explicitly, but I was under the impression that the default
(rule='default') would be able to figure that out by itself.
On Sunday, December 9, 2012 1:18:14 AM UTC, bump wrote:
But anyway if you forget rule=levi
On Thursday, December 13, 2012 5:13:38 PM UTC, John H Palmieri wrote:
Or perhaps Volker meant a more recent release of Firefox. What is the most
recent release available for OS X 10.6.8?
Thats what I meant - most recent version is 17.0.1 on all platforms.
--
You received this message
On Thursday, December 13, 2012 10:06:47 PM UTC, Dima Pasechnik wrote:
it might be GAP to blame, in part, as GAP reserves an amount of swap
sort of proportional to available RAM.
Right now it basically eats all available swap, this is going to be fixed
in #13211
Now imagine you run 50
This is the following issue:
http://docs.mathjax.org/en/v1.1-latest/installation.html#firefox-and-local-fonts
I do have stix fonts installed in the OS (Fedora 18) and equations render
fine. If I uninstall stix-fonts then I get the [Math Processing Error].
Apparently they are only included from
And LatticePolytope has various compile-time limits like the maximal number
of dimension and vertices before you hit a C assertion. Whereas Polyhedron
has no limits within your CPU/Memory bounds.
Starting with Sage-5.6 the Polyhedron class also supports the base ring ZZ.
In the long run I'm
This is now http://trac.sagemath.org/14012
If nobody volunteers an opinion I'll just remove CombinatorialFreeModule,
I'm sure you don't mind (j/k)
On Friday, January 25, 2013 1:32:45 PM UTC, Volker Braun wrote:
sage: F.a,b = FreeGroup()
sage: F.algebra(ZZ)
Group algebra of Free Group
I'm looking into changing matrix groups to libgap and it would be nice if
all groups were lazily imported. You don't want to add libgap startup to
the startuptime for every Sage session. Have you ever tried to clean that
up? Right now WeylGroup is imported all over the place...
--
You
I've changed my code to import libgap lazily into the new matrix groups
precisely to avoid having to change too much combinat code. But it would
still be nice to make all the root system stuff lazy, its not like every
Sage user is going to depend on it (as nice as it is ;)
On Monday,
Hi Nicolas,
You are talking about lattice polytopes, right? There are three different
representations:
* The LatticePolytope class, which is mostly geared towards reflexive
polytopes in small dimensions. It uses a pexpect interface with PALP. It
also has some compile-time limits with number
On Monday, February 18, 2013 2:27:56 PM UTC, Nicolas M. Thiery wrote:
Actually no; I build a bunch of plain Polyhedrons to compute some
intersections and plot them.
Then I don't understand why you use the pexpect interface at all. Are you
using Polyhedron(..., backend='cdd') to manually
Make a database_foobar.spkg for your tables.
On Thursday, March 14, 2013 10:32:57 AM UTC-4, Christian Stump wrote:
Hi there,
I wonder if it is reasonable to add files containing precomputed data
to a patch. In our case, we are talking about 0.5mb of exceptional
mutation classes of
I think its unambiguous to define the orbit of x recursively as
1. use the action on domain elements if x is a domain element
2. otherwise, assume that the x is a list/set/... of domain elements
On Thursday, March 21, 2013 3:10:38 PM UTC+1, Dima Pasechnik wrote:
While working on
On Friday, March 22, 2013 2:51:05 PM UTC+1, Nathann Cohen wrote:
I think its unambiguous to define the orbit of x recursively as
1. use the action on domain elements if x is a domain element
2. otherwise, assume that the x is a list/set/... of domain elements
Well. It is when you know
Under my proposal, the orbit of ((1,2),(1,2)) would be the orbit of a pair,
i.e. {((1,2),(1,2)), (1,1), (2,2)}. If you want the orbit of pairs of
pairs, you can get it as orbit(..., action=OnTuplesTuples).
There is of course a limit of how nested the action is. If you really need
orbits of
We are talking about guessing the action once and for all for a given
input. You are talking about guessing the action each time a group element
acts in the orbit. I agree that the latter is not consistently doable. But
it is possible to guess the action in the beginning of the orbit
On Saturday, March 23, 2013 1:43:05 PM UTC+1, Dima Pasechnik wrote:
Now, if 1, 2, and (1,2) are in your domain, is (2,(1,2)) a tuple?
According to the minimum depth rule to guess the default action, it is.
And how many different meanings does ((2,(1,2)),((2,(1,2))) have?
There is a
The group action category stuff would be nice, but you would run into
exactly the same question that Dima asked: What are you going to do if
there is more than one possible action. You'll have to either use some
heuristics (take the simpler / less nested action) or raise some exception
telling
On Tuesday, March 26, 2013 7:01:40 AM UTC+1, tom d wrote:
Specify the action! [...] The 'usual' actions then become special
predefined objects, like the special graphs, maybe summoned up
automatically using the permutation/whatever's __call__ function if it's an
idiomatic action like
Clearly there is no canonical form for arbitrary groups/subgroups since
there is no algorithm to compare finitely generated groups. For finite
groups there is, of course. In GAP one would just IdGroup() to get a unique
label. A GPL-ed clone of the finite groups database in GAP would be nice,
On Thursday, April 11, 2013 2:49:10 AM UTC+1, Christian Stump wrote:
In GAP one would just IdGroup() to get a unique label.
Is this given for any finite group in GAP, or is this depending on
http://www.gap-system.org/Packages/sgl.html ?
This depends on the small groups library. IdGroup()
On Friday, May 3, 2013 11:06:59 AM UTC+1, hemmecke wrote:
Noble goal. But why filling libraries with hardcopies if it is cheaper
for them to store an electronic version on some server?
In the end its just another avenue to get the word out. The only advantage
of a hardcopy is that we can
On Monday, May 6, 2013 2:00:43 AM UTC+1, rjf wrote:
2. The author hopes to become famous (or gain tenure) from the book.
Does that actually fly in Maths? In Physics the consent seems to be that
writing a book counts against to your tenure evaluation, you'll be seen as
not focused enough on
Isn't graphviz under the EPL? Thats not so bad. And we don't even want to
link to it, so its perfectly fine for us to distribute it.
How about a new category of extra spkgs that are nice to have but not
really required. We could even install them by default, if wanted. Perhaps
only if you have
On Wednesday, May 22, 2013 11:53:53 PM UTC+1, William wrote:
Yes, but EPL is GPL incompatible, so it can't be a standard package.
I agree, if just for license clarity: The default Sage tarball should be
all GPL (-compatible).
Just to be clear -- are you making any proposal about what's
Somewhat related:
http://trac.sagemath.org/sage_trac/ticket/14015
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
How about
3. Disallow invalid paths as paths and path algebra elements.
On Friday, July 12, 2013 2:27:37 PM UTC-4, Simon King wrote:
Two possible solutions come to mind:
1. The invalid path maps to the zero of the algebra, or
2. If i comes from the invalid path and x is any element,
It looks strange, but really only means that the embedding D2 x D2 - D8
can't be chosen to be invariant under (D8-) parity. As a simpler example,
A3 - D4 can't be chosen to be invariant under triality: One of 8s, 8c, 8v
will be treated differently.
--
You received this message because you are
On Tuesday, November 5, 2013 5:03:56 AM UTC-8, Nicolas M. Thiery wrote:
sage -f ccache
Excellent; thanks! Feedback about how it behaves in practice (speed,
Fedora has had it installed by default for quite some time by now. I don't
understand why anybody would not use it.
space usage) is
$ git ls-remote trac *combinat*
504fb447046d70763865935892ad677bb6b601d3
refs/heads/u/aschilling/combinat/kschur
Note that the usual shell rules apply, so if you have a file in the local
directory that matches *combinat* (say, combinat.py) then the shell would
replace the *combinat* before
git push remote local branch name:remote branch name
The remote branch name should just be
public/combinat/15361-branching-rules, without the remotes/origin/. You
don't have write permissions outside u/bump/* and public/* on the remote.
Your local repo has internally a ref called
On Tuesday, December 3, 2013 11:00:18 AM UTC, Nathann Cohen wrote:
There was an __iter__ method on that, while this set is... uncountable
You can still iterate over *some* elements. You can't iterate over all
elements, but so what? Neither can you iterate on a computer over all
elements of
On Tuesday, December 3, 2013 1:33:45 PM UTC, Nathann Cohen wrote:
- If you iterate on it, you just get finite words
So? If you iterate over ZZ you never get numbers 10^20.
The rest of your email is just pointing out that there is no uniform
probability measure on infinite sets. Again, so
On Tuesday, December 3, 2013 1:56:53 PM UTC, Nathann Cohen wrote:
Well. I always assumed that we should only implement a random_element()
method when it was somehow uniform ?
Two fun paradoxes that are in that rabbit hole:
http://en.wikipedia.org/wiki/Bertrand_paradox_(probability)
This seems to have gotten quite a bit slower.Note that this is running on
my desktop. Running it on sage.math would quite a bit slower still. I'm
seeing some timeouts on the slower buildbot slaves, too. Please fix :-)
$ ./sage -t --long --verbose
E.g. timing on the sextus bulidslave (note that nothing happening in 1200
sec leads to buildbot timeout):
buildbot@sextus$ ./sage -t --long src/sage/combinat/rigged_configurations/
Running doctests with ID 2013-12-24-08-26-25-aafe2102.
Doctesting 19 files.
sage -t --long
On Sunday, January 19, 2014 1:32:06 AM UTC, Anne Schilling wrote:
Crystal bases are bases in the limit q-0, so in fact correspond to
absolute temperature
zero. This explains the name crystal since everything crystalizes at
zero temperature.
Helium doesn't agree with the statement ;-)
Like every revision control system, git is just a tool to handle an
immutable history. So whatever you do on your lower branch never affects
any other branch *unless* you merge the new changes.
So assume you have three branches upper, lower, and master
After making a change in lower that you
First of all, Nicolas has done a lot of work on this ticket and I very much
agree with his goal of providing a mixin framework for categories (called
axioms on the ticket) so that you don't have to, say, separately write a
FiniteCategory for each Category. Its also the hardest for me to say No
On Friday, March 7, 2014 1:50:29 PM UTC, Nathann Cohen wrote:
Is this method named 'is_finite' because the axiom's name is finite
No, because the Sets.Finite class implements a is_finite parent method
(which always returns True). This happens to be the only parent method that
finite sets
On Tuesday, March 11, 2014 8:42:04 PM UTC, Nathann Cohen wrote:
If you want to get this ticket inside of Sage there is an easy way :
review it.
+1
also would save me a lot of time
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To
We do carry the patch for the issue with scientific notation in Sage. There
seems to be no ticket or corresponding commit on the new repo, but the old
issue tracker says transferred:
https://code.google.com/p/dot2tex/issues/detail?id=29
--
You received this message because you are subscribed
$SAGE_ROOT/local/lib/*.la files contain incorrect dependency_libs on
sage-4.3.1-linux-fedora12-x86_64-Linux. Specifically, all c++
libraries have a dependency on
/usr/local/gcc-4.4.2/x86_64-Linux-core2-fc-binutils-2.20/lib/../lib64/libstdc++.la.
C-only libraries are ok. This bug must be some
Hi Mariah,
The problem is that no program can dlink the (C++-using) libraries.
All existing spkgs apparently link statically which works but suffers
from the usual drawbacks. I've tried to modify cddlib to link
dynamically with gmp/mpir:
http://www.stp.dias.ie/~vbraun/cddlib-094f.p3.spkg
Now
, Volker Braun vbraun.n...@gmail.com wrote:
Hi Mariah,
On Jan 26, 6:21 pm, Mariah mariah.le...@gmail.com wrote:
I guess I do not understand that usual drawbacks to
statically linking to which you refer. Can you expand, please?
First off all it wastes disk space; I'm trying to make
Hi Georg,
The bug you remembered is http://sagetrac.org/sage_trac/ticket/3304, I
had not seen that report. I'll try to get it fixed now.
Volker
On Jan 27, 2:27 pm, Georg S. Weber georgswe...@googlemail.com
wrote:
--- I consider the cddlib spkg example as another bug, and if I
remember
The cdd_both_reps/cdd_both_reps_gmp are used by the new polyhedra
package, and are indeed introduced in cddlib-094f.p2.spkg.
I have no idea what the patches/allfaces.c is for - it does not part
of the cddlib library, but only some utility binary. As far as I can
tell the allfaces binary is never
Another question about keeping src/ unmodified: Often the upstream
packages contain large examples and package 3rd-party libraries. For
example, cddlib-0.94f.spkg (before .p2) had already deleted ~2MB of
example files as well as a bundled gmp library that is in the upstream
package. This was
Sorry for the confusion. Here is the executive summary:
The offending patch is not relevant to building the cddlib spkg. You
can skip or reverse it, makes no difference to building
cddlib-094f.p2.spkg
There is an updated cddlib-094f.p4.spkg in #8115 that fixes this and
more bugs and makes cddlib
Instead of trying to detect the CPU and then possibly displaying an
error message, the binary packages should be built with the same
compiler flags as the binary distribution. This will ensure that every
computer that runs a target linux distribution will also be able to
run the sage binary
If you want to go that route you probably want to include glibc
(contains standard math library) as well. While a viable possibility,
there are two obvious arguments against it:
On Feb 22, 11:27 am, Dr. David Kirkby david.kir...@onetel.net
wrote:
* Always have the libraries.
Instead, check on
On Feb 22, 1:49 pm, Willem Jan Palenstijn w...@usecode.org wrote:
This text describes RedHat's policy on libgcc_s and
libstdc++:http://kbase.redhat.com/faq/docs/DOC-8313
It seems to suggest that if we want to include libstdc++ or libgcc_s, we
should
include both.
Well it literally says:
There is a fundamental difference between math and system libraries.
Specialist software receives much less testing, especially on exotic
architectures. You can easily be the first one who builds X on Y and
run into some obscure bug. So it is valuable to collect mathematical
programs and make sure
The p0 doesn't build for me on Fedora 12 gcc 4.4.3. Adding #include
stdio.h fixes it. You can get the (trivially) patched src/include/
chomp/multiwork/mwdata.h from
http://www.stp.dias.ie/~vbraun/mwdata.h
With this change, it builds fine.
Volker
- build log --
Hi Andrey (and sage-devel)
I'm using toric varieties for my research, mainly for Calabi-Yau
manifolds in string theory. So my goal for the toric varieties package
is to implement everything that is known ;-)
My current status is that I've implemented the following:
* The basic fan construction
Hi all,
I talked to David Cox and they are planning an appendix in their
upcoming book where they survey the different toric variety packages
in computer algebra systems. David was interested in covering Sage as
well; Their deadline is end of August.
Andrey's package is a nicer framework, but
Hi Andrey,
Why not allow arbitrary polytopal toric varieties instead of the
resolution of singular fano ones? The larger class still benefits from
the lattice polytope description and you can still talk about the
anticanonical divisor if you want.
FanoToricVarietyCrepantResolution_field is too
Hi Andrey,
I agree that the reflexive case is the most interesting, I just don't
understand where you need that in the FanoToricVariety code right now.
If we can relax restrictions without any cost then we should allow the
more general, right? On the other hand, if it would make the code more
Hi Andrey,
I've looked over your code and I think it would be good to extend the
class hierarchy of cones. I'm thinking about
Cone
Cone_of_fan(Cone)
keeps reference of fan
Cone_of_ToricVariety(Cone_of_fan)
keeps reference of toric variety
Cone_of_DomainOfToricMorphism(Cone_of_ToricVariety)
Fedora 13 should be released next week and Sage is currently not
building because Fedora 13beta is now stricter with DSO linkage. I've
filed bug reports with patches, but they haven't gotten any attention:
http://trac.sagemath.org/sage_trac/ticket/8657
Hi Andrey,
I like the ToricLattice/ToricLatticeMorphism/FanMorphism, though I
would call the latter ToricMorphism. Domain/Codomain always reminds me
of Cohomology Operations and Homology Cooperations (Capter 17 in
Switzer) but if we want to use that nomenclature then thats fine with
me :-)
As
To summarize: Plain python cannot pickle inner classes or functions:
class outer(object):
... class inner(object):
... pass
o = outer()
pickle.dumps(o)
(works)
i = o.inner()
pickle.dumps(i)
(ERROR)
The work-around is to make the cone factory a top-level class (or
function), then it
Hi Andrey,
Just to clarify, I only wanted to subclass Cones, but not Fans. The
fan is a container class for cones and that doesn't change. In
particular, I never felt the need to add any functionality at that
level in my code.
As for sharing of cached data, I think a clearer way would be to
Ok, I agree that it would be nice for all derived cones to share the
base cached data. How about Cone() just stores all of its cached data
in a hash self.shared_cache (or so) instead of in self. For the
computer thats essentially the same as what you are suggesting, but in
the implementation you
The system in place to officially register a channel name is described
here: http://freenode.net/group_registration.shtml
[X] Yes, let's move over to #sagemath.
[] No, let's stick to #sage-devel.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this
VirtualBox can import VMware virtual machines, so the documentation
should probably amended to say that either is fine.
Volker
On Jun 7, 1:58 pm, Jason Grout jason-s...@creativetrax.com wrote:
On the website:http://sagemath.org/download-windows.html
it says that we need VirtualBox, which is
Can PPL find integral points in polyhedra with not necessarily
integral vertices (mixed integer programming)? I'm somewhat familiar
with the library but I don't see how to do that. Code sample?
Volker
On Jun 8, 12:13 pm, Robert Schwarz m...@rschwarz.net wrote:
-BEGIN PGP SIGNED
Does not build on Fedora 13.
As described in tickets #8657 and #8658, the libgcrypt and opencdk
spkgs need to be patched. With these patches it builds fine.
Volker
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
Unsurprisingly, setting the random seed makes the random_expr() always
return the same value:
sage: set_random_seed(0xdeadbeef)
sage: random_expr(5)
tanh(-pi^real_part(v1)*sin(log(pi)*imag_part(v1)))
sage: set_random_seed(0xdeadbeef)
sage: random_expr(5)
The difference between the toric lattice computations and the root
lattices is that the (co)weight lattices are one of the main features
of interest to the end user, while the various toric lattices are
mostly of internal use for computing something else.
I don't have a strong opinion against
Good point! Here is a snapshot of the current documentation:
http://www.stp.dias.ie/~vbraun/Sage/html/en/reference/sage/geometry/cone.html#sage.geometry.cone.ConvexRationalPolyhedralCone.M_quotient_basis
Right now, I'm essentially using abbreviations N=spanned_lattice and
M=spanned_lattice_dual
Probably makes sense for bugs that produce obviously wrong results,
but what about bugs in the makesystem / autotools abuse / enabling of
shared libraries?
1) Sometimes you only have time for a quick build fix where doing
things right might require a major effort.
2) Testing, say, new autotools
On Jun 25, 3:34 pm, Andrey Novoseltsev novos...@gmail.com wrote:
So I'd prefer to keep the existing name
linear_subspace for the corresponding function.
For once, I totally agree! :-)
Volker
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this
On Jun 28, 9:49 pm, Justin C. Walker jus...@mac.com wrote:
I was only commenting on the trip through Google, not trying to get engaged
in discussions about religion and politics.
For the record, any url posted on google groups always redirects
through google when you click on it. Wiliam posted
About a week ago I started getting an infinite redirect when trying to
visit google groups with chrome 5.0.375. What fixed it for me was to
delete all google.groups.com cookies in chrome (Options-Under the
Hood-Content Settings-Show Cookies). Not only can I visit google
groups, I can also open
I would propose a mercurial patch queue in the spgk root directory.
Then sage -pkg simply checks that either all patches in the queue are
applied or that there exists an old-style /patches directory and no
queue.
Complicated spkgs that require lots of modifications would then use a
patch queue.
On Jul 3, 4:54 pm, Mike Hansen mhan...@gmail.com wrote:
1) The src/ directory needs be under Mercurial version control. This
would increase the size of the spkgs by quite a bit.
But you don't need to add all of src/. In fact, you could keep src
in .hgignore and only selectively hg add the
I believe its
#ifdef __ia64__
// gcc itanium code here
#endif
On Jul 3, 7:48 pm, Mike Hansen mhan...@gmail.com wrote:
Here is an example patch for Python that is only applied on Itanium
Linux systems:http://sage.pastebin.com/1hy3cyis
Is there a non-autoconf way to have an ifdef to check for
I recompiled 4.4.4 from scratch yesterday on Fedora 13 x86_64 and had
no problems. I don't have F13 i386 installed anywhere, though.
Volker
On Jul 4, 12:45 am, Dr. David Kirkby david.kir...@onetel.net
wrote:
Is anyone using 4.4.4 on Fedora 13?
--
To post to this group, send an email to
Does sage compile on anything but linux on itanium systems? But I
agree that, if the code is itanium linux-specific, then it must be
wrapped into
#if defined(__linux__) ( defined(__ia64__)
// itanium linux specific
#endif
About the readline on itanium patch, wtf is going on? That patch is
just
On Jul 4, 12:13 pm, Dr. David Kirkby david.kir...@onetel.net
wrote:
True, which is why I can't tell for 100% sure if
http://trac.sagemath.org/sage_trac/ticket/488
and
http://bugs.python.org/issue1204
are related or not. My gut feeling is they are unrelated.
I'm pretty sure they are the same.
1 - 100 of 3728 matches
Mail list logo
