://piranha-psm.blogspot.com/
There is not much info yet on the website, so if someone is interested they'd
just better ask me directly :)
Best regards to everybody,
Francesco Biscani.
signature.asc
Description: This is a digitally signed message part.
On Friday 14 December 2007, mhampton wrote:
> I am interested - I have done some work in celestial mechanics,
> although not using poisson and fourier series. Since I don't have a
> lot of expertise, I'm not sure I can be much help, but I thought I
> would at least make a gesture of support :)
>
>
On Tuesday 18 December 2007, William Stein wrote:
> Hi Sage-Devel,
>
> On Irc I noticed:
>
> 02:27 < ondrej> hi mabshoff - sage is second in my google search in Prague.
> :)
>
> So in the US I just did a Google search for "sage", and
> our Sage math software project is now number 2 in
> google sear
On Sunday 30 December 2007, Jaap Spies wrote:
> As an alternative:
>
> Generic Mathematics Computing System,
> [...]
> Eventualy Generic Mathematics Computing Software?
> Or Generic Mathematics Computing Environment?
>
> Jaap
Personally I liked the "comprehensive" someone mentioned, hence my sugge
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
parisse wrote:
|> (c) Create some sort of C/C++ library interface. This is very
|> very difficult.
|>
|
| I had some hope that swig could help do the bridge between the C++
| giac library and python, but I never tried.
If your code is heav
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Bill,
may I ask what your take on language bindings for mpir is? I think it
would be important to be able to use it from C++, Python, Ruby, etc. I
would certainly be glad to help in such an effort.
Best regards,
~ Francesco.
-BEGIN PGP SIGN
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi William,
William Stein wrote:
| That said I really *really* want a full native version of Sage on
Windows...
I've been wondering about this for a while. Are you referring
specifically to MSVC support or "it gets compiled natively under
windows" (
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Michael,
mabshoff wrote:
| For 32 bits we are fixing the Cygwin issues and one goal for Dev1
| [starting in a little less than two weeks] is to get that port up and
| working again. MinGW's support for Python is allegedly problematic, at
| least d
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Michael,
mabshoff wrote:
| Various people have started looking into this, but so far no one has
| produced code. One big issue (at least for me) with pycuda is the
| requirement for boost, but I am not sure how that could be overcome.
| [...]
| Th
On Wed, Sep 30, 2009 at 8:16 AM, Dr. David Kirkby
wrote:
>
> Does there need to be a Fortran compiler on the system to build Sage, or
> is the fortran-20071120.p9 package a fortran compiler able to build Sage?
>
> The reason I ask is that if there is no need for a Fortran compiler, it
> is quite
Very inspiring, thanks for sharing.
Francesco.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: h
Hi all,
looks like GMP 5.0.0 has been released:
http://gmplib.org/gmp5.0.html
Cheers,
Francesco.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group
I suppose it refers to this:
http://en.wikipedia.org/wiki/Pardus_%28operating_system%29
Cheers,
Francesco
On Mon, Jan 25, 2010 at 1:20 PM, John Cremona wrote:
> Looking in the SPKG.txt file for eclib (eclib-20080310.p8) I see the
> following block:
>
> == Distribution ==
>
> === Padus ===
>
Erm, April 1st?
Francesco.
On Thu, Apr 1, 2010 at 4:48 PM, Robert Miller wrote:
> MPIR Team wrote:
>>> We'd like the community to comment on this proposal. An announcement
>>> of our first v3+ version of MPIR will be forthcoming in a few days.
>
> David Kirkby wrote:
>> This stikes me as admitt
I'm having a hard time understanding whether this thread is flooding
with sarcasm or is completely devoid of it.
;)
Francesco.
On Thu, Apr 1, 2010 at 6:21 PM, Jaap Spies wrote:
> Tom Boothby wrote:
>>
>> On Thu, Apr 1, 2010 at 7:58 AM, Francesco Biscani
>> wro
Hi Sergey,
On Sat, May 8, 2010 at 10:13 PM, Sergey Bochkanov
wrote:
> (3) - OOP overhead. Multiple precision ALGLIB makes use of OOP to
> implement multiple precision expressions like "x=y+z". However, it
> leads to excessive creation of temporaries, so I will replace OOP by
> somethin
Hello,
On Sun, May 9, 2010 at 11:22 AM, Dr. David Kirkby
wrote:
> That is factually incorrect.
>
> There are a number of jobs in engineering which specifically ask for MATLAB
> skills.
Working in a research team made mostly of engineers, this is my
experience too. Virtually all of my engineer co
Hi Sergey,
On Sun, May 9, 2010 at 10:15 AM, Sergey Bochkanov
wrote:
> Hello, Francesco.
>
> I know about expression templates, but even with templates sometimes
> creation of temporary is the only way to calculate value of a complex
> expression like "x = ((a+b)*(c+d)-e)/(f+3)". Am I wrong
Hi Sergey,
On Sun, May 9, 2010 at 7:32 PM, Sergey Bochkanov
wrote:
> I am talking about non-vectorized form of the expression. And I can't
> imagine how (a+b)*(c+d) can be calculated without temporaries :) Can
> you give an example?
My bad, for some strange reason I had assumed we were talkin
Hi Bill,
in my own experience Kronecker substitution can be effective in a
number of situations. It would also automatically handle the case you
mention about working only on a subset of variables (i.e., the ones
involved in the multiplication).
I have the description of my implementation and som
Hi Bill,
On Fri, May 14, 2010 at 3:28 PM, Bill Hart wrote:
> If I make a couple of simplifications, namely assume that the output
> fits into two limbs, and that none of the polynomials has length >
> 2^32 - 1, etc, I get pretty good times, certainly better than reported
> in Francesco's paper. I
Hello list,
I just noticed on the website that the next SAGE days will be held in
Leiden. I'm currently working as a research fellow at the European
Space Agency establishment ESTEC in Noordwijk (~10 km from Leiden). I
was wondering if there is any interest in giving a presentation about
SAGE to m
[possibly OT] Out of curiosity, what was the rationale for going for
SAGE on Cygwin instead of MinGW?
Cheers,
Francesco.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more opt
On Sat, Jul 17, 2010 at 11:03 AM, Thierry Dumont
wrote:
> 2) For the ODEs, the best and the most *modern* methods are there:
> http://www.unige.ch/~hairer/software.html
> H. Hairer, G. Wanner, C. Lubich are among the best specialist of numerical
> methods for ODE and their programs (even if writte
Hello Stefan,
thanks for the explanations, this all looks really interesting to me.
On 19 July 2014 22:10, Stefan Karpinski wrote:
>
> This can be pretty straightforwardly handled with multiple dispatch
> promotion in a parametric type system. Similar things are done in real code
> regularly in
On 25 August 2014 12:27, Jean-Pierre Flori wrote:
> PARI/GP is definitely not native.
> It is Cygwin or MinGW.
>
MinGW and Cygwin are two completely different things. I don't know what you
mean with "native", but MinGW is as native on Windows as, e.g., the Intel
compiler is.
--
You received th
On 25 August 2014 15:04, Dima Pasechnik wrote:
>
> cause M$ is unwilling to release specifications of kernel
> calls needed to make a good modern implementation of fork().
>
> It is a constant fight against a fundamentally shaky fork()
> as implemented in Cygwin :-(
>
Is the fork() implementation
On 25 August 2014 16:28, Dima Pasechnik wrote:
>
> apparently it's better, but it's only supported on certain more
> expensive versions of Windows 7 and Windows Server 2008.
>
> to quote:
>
> Supported Operating Systems: Windows Server 2008 R2; Windows 7 Enterprise;
> Windows 7 Enterprise 64-bit e
There is again this point cropping up in the comments:
"But Sage's mission is to be a viable alternative to Mathematica"
This is being discussed tangentially in another sage-devel thread, but I
think it's something to be considered carefully. There is a difference
between saying "it is ok for Sag
On 27 August 2014 22:29, Volker Braun wrote:
> 𝙶𝑟℮𝖺𝔱 ℹ𝟃ℯ𝕒!
>
>
> On Wednesday, August 27, 2014 8:43:30 PM UTC+1, maldun wrote:
>>
>> With Ibus you can simply type every UTF-8 Character with ease like: ∞, Σ,
>> ∫ｆ(α)ｄα using the well known latex commands =D
>> 今晩は皆さ
>>
>
My browser was actually ca
I don't have any direct experience with EU funding, but I did work at a
European-level institution (ESA) for a few years and I must say that what
Bill says rings true to my ears. You have to understand that anything
"European" is really undertaken by a patchwork of different nations pulling
towards
Probably you know this already, but Valgrind will not normally detect
errors related to memory allocated on the stack. If Valgrind comes out
clean but the program crashes, I'd start looking into function-local or
global non-dynamic arrays.
On 4 September 2014 00:41, Dima Pasechnik wrote:
> On 2
What you want is called "cross-compilation", and in general is a
non-trivial thing to do. You have to set up a toolchain on your x86 boxes
able to compile for ARM, use it to compile SAGE and finally move the binary
over to the Raspberry.
I mucked around with it on Gentoo a long time ago (I think i
That's too bad. How about using distcc from the PI to leverage the
cross-compiler on the x86 machines though?
On 12 September 2014 11:57, Jean-Pierre Flori wrote:
>
>
> On Friday, September 12, 2014 11:15:19 AM UTC+2, bluescarni wrote:
>>
>> What you want is called "cross-compilation", and in ge
On 13 September 2014 11:00, Dr. David Kirkby (Kirkby Microwave Ltd) <
drkir...@kirkbymicrowave.co.uk> wrote:
> 5) I do agree with much of what is written about portability and the
> ***ing GNU compiler. People now write in "GNU C", which is a
> constantly changing like the wind direction.
>
> I my
On 1 October 2014 10:59, Nathann Cohen wrote:
>
> Twenty-four years later, the vast majority of the world’s pure mathematicians
> do in fact use *Mathematica* in one way or another.
>>
>>
> The vast majority of world's pure mathematicians ?..
>
> Beware boy, you seem to reject on principle the i
Hi,
On 1 October 2014 17:59, Simon King wrote:
>
> There are famous results obtained by computer-assisted proofs, such as
> Four Colour Theorem; but I don't know if a specific software was needed.
>
Yes I had read about it, that was one of the things I had in mind :)
> And there are of course
I ran exactly into this some time ago while sanity-checking some
high-precision MPFR computations with the results of Wolfram Alpha (which
also wraps real literals into its own, I presume exact, representation).
On 3 October 2014 11:42, Volker Braun wrote:
> Real literals are wrapped in their ow
On 5 October 2014 02:59, Jakob Kroeker wrote:
> There should be also resources for maintenance in addition of grants for
> the 'new fancy stuff'.
> Probably all of you would agree that at a certain point building on top of
> broken software
> is just stupid and leads to nowhere. But this happens
On 24 October 2014 05:30, kcrisman wrote:
>
>It was an interesting read. The article (at potential risk of starting
>> a firestorm) does seem to suggest that open-source software like Sage is
>> more trustworthy for computational proofs as one can (in principle) verify
>> the code's logic and
Nice to see that C++11 is gaining wider acceptance.
On 11 November 2014 14:45, John Cremona wrote:
> -- Forwarded message --
> From: Victor Shoup
> Date: 8 November 2014 17:43
> Subject: NTL v7 -- thread safety
> To: nmbrt...@listserv.nodak.edu
>
>
> I'd like to announce a new r
OOM exception handling is gonna be hard to implement, as GMP does not
provide any mechanism to recover from memory errors. You can replace the
GMP memory management functions but the usual problem with that approach is
that you might be potentially interacting with other packages which might
also w
Looks like this might be the root:
https://gcc.gnu.org/gcc-4.9/porting_to.html
Unformatted quoting:
"""
Header changes
The header was updated for C++11 support and this breaks some
libraries which misuse macros meant for internal use by GCC only. For
instance with GMP versions up to 5.1.3, yo
On 23 November 2014 at 18:07, Volker Braun wrote:
>
> C++ std::sort will be able to inline the comparator.
>
+1
std::sort() will do exactly what you describe, only in a type-safe and
compiler-checked automatic way.
--
You received this message because you are subscribed to the Google Groups
"
On 23 November 2014 at 19:05, Thierry Dumont
wrote:
>
> Is gprof enough powerful with modern architectures on such programs? from
> my point of view, no.
> There are non free, commercial, tools like vtune which can do fantastic
> measurement job. Vtune shows, for example, that a call to std::copy
On 23 November 2014 at 20:41, Thierry Dumont
wrote:
> But what about the quick sort? is it sure that the implementation cannot
> degenerate? it is well known all the efficiency can be lost if the "key"
> used for partition is not chosen as it should be... What about replacing
> the quick sort by
icc is a pretty garbage C++ compiler, unless you are doing exactly the type
of linear algebra operations that they optimise to death (on Intel
processors at least :) for benchmarketing.
On 23 November 2014 at 21:53, Thierry Dumont
wrote:
> Le 23/11/2014 20:53, Jeroen Demeyer a écrit :
>
>> On 20
For what it's worth I spent some time earlier this year experimenting with
multivariate poly GCD in piranha (e.g., here's the PSR_SR implementation
https://github.com/bluescarni/piranha/blob/master/src/polynomial.hpp#L197).
It's alpha-quality experimental code which I am about to remove for the
tim
On 4 November 2016 at 14:33, 'Bill Hart' via sage-devel <
sage-devel@googlegroups.com> wrote:
>
> There are many completely incorrect published algorithms for GCD, even in
> the univariate and integer case. Dan Bernstein has a hilarious rant about
> this somewhere online. It's tempting to completel
Interesting timings, they give me some motivation to revisit the dense
multiplication algorithm in piranha :)
As an aside (and apologies if this is a slight thread hijack?), I have been
spending some time in the last few weeks decoupling the multiprecision
arithmetic bits from piranha into its own
In the benchmarks I use the C++ interfaces of FLINT and
Boost.Multiprecision only for ease of initialization/destruction. The bulk
of the operations is performed using directly the C API of FLINT and GMP.
mp++ itself has some moderate template metaprogramming in place, but for
instance it is curren
mppp also uses a small value optimisation. The number of limbs that can be
stored without dynamic memory allocation can be selected at compile time,
and the benchmarks on the website are done using 1 limb (64 bits) of static
storage.
I can think of a few things that might influence positively mppp
FWIW that's what Piranha does as well:
polynomial x{"x"};
// This will print "1".
std::cout << std::is_same>::value << '\n';
On 1 October 2015 at 21:35, Bill Page wrote:
> In FriCAS
>
> (1) -> x:Polynomial(Integer)
>Type:
> V
On 5 October 2015 at 13:13, Victor Shoup wrote:
>
> I hesitate somewhat to get involved in SIMD game, as all the assembly code
> / intrinsics stuff is a huge time sink that
> will yield code that will probably be obsolete in 10 years. Multicore, on
> the other hand, seems like a better
> investme
Some random thoughts:
- I am not so convinced the strategy of automatic long -> long long
patching is actually feasible, I think in practice this is gonna be a big
can of worms. Pushing upstream to fix their code is a much better long-term
solution IMO (and I'd rather have nothing to do with proje
>
>
>> * PARI which assumes that sizeof(long) == sizeof(void*), there is an
>> experimental branch fixing this:
>> http://pari.math.u-bordeaux.fr/archives/pari-dev-1505/msg00021.html
>>
>
> I am using Pari (not GP) today on Windows 64. It was minimal effort on my
> part to do so. I am not using a s
>
> I agree that's better if they will allow it. But I'm not sure some of the
> things SageMath depends on are even still maintained, let alone do all
> projects have the resources to keep maintaining such things, which is
> eventually what they get asked to do. Moreover, not all developers feel
>
PARI requires (required?) sizeof(mp_limb_t)==sizeof(void*), which is not
guaranteed and not enforceable by PARI (as it's up to GMP to decide what
exactly an mp_limb_t is).
On 7 October 2015 at 19:03, Bill Hart wrote:
>
>
> On Wednesday, 7 October 2015 18:37:41 UTC+2, Jean-Pierre Flori wrote:
>>
Practically, it's an architecture that supports "natively" 64 bit ints but
the pointers are 32 bits wide. AFAIK, this is supposed to improve
performance for pointer-heavy workloads that do not need to allocate much
RAM but still benefit from the 64 bit ints.
On 7 October 2015 at 19:54, Bill Hart
I think in FLINT you also have the issue that you are using tagged pointers
(last time I checked anyway).
On 7 October 2015 at 20:03, Bill Hart wrote:
>
>
> On Wednesday, 7 October 2015 19:48:54 UTC+2, bluescarni wrote:
>>
>> PARI requires (required?) sizeof(mp_limb_t)==sizeof(void*), which is n
On 7 October 2015 at 20:13, Bill Hart wrote:
> I could be wrong, but this doesn't sound like it includes SageMath. :-)
>
Probably :)
I am not sure about the allocation limit, as the limit might only apply to
large contiguous allocations. Or there might be other memory addressing
tricks at play.
It's somewhat refreshing to see that the idea that one should not use black
box software in science is finally starting to sink in.
On 20 January 2016 at 13:30, William Stein wrote:
> There's a big thread on Hacker News about math software in which Sage
> is mentioned a few times:
>
> https:
I am not a Mathematica user, so I cannot really comment about Mathematica's
flaws
(Incidentally, I remember some years ago someone built a system to feed
random input to CASes, with which he found many mathematical bugs in the
big Ms. I wonder if he's still doing it?)
But the fact that it is a bl
Ah thanks for the pointer, it took some google fu to get finally to his
website. In case anyone is interested:
http://www.cas-testing.org/
On 28 January 2016 at 18:39, William Stein wrote:
> On Thu, Jan 28, 2016 at 9:17 AM, Francesco Biscani
> wrote:
> > I am not a Mathematic
You could also try distcc + cross compiler on a beefy machine. I almost got
it working on my Raspberry PI before losing interest. IMO this would be the
best solution if you can manage to make it work. Good luck!
https://wiki.gentoo.org/wiki/Raspberry_Pi/Cross_building
http://archlinuxarm.org/devel
I think your points are very important. Competing with a commercial CAS (or
with any commercial software really) is much more about boring aspects of
software development rather than exciting ones. In my experience the FLOSS
community can excel at solving technically challenging problem, but it
oft
On 11 March 2016 at 14:50, Michael Orlitzky wrote:
> Start over with "let's figure out how to do cross-platform source-based
> package management." Why isn't it a fair comparison? Gentoo prefix, Nix,
> and Conda all do the same thing.
>
I have been a Gentoo user for more than 12 years now, and I
I remember that you mentioned some time ago that you were working on a
solving (or working around) GMP's horrid error handling (especially with
respect to memory errors). Did you make any progress on that front?
Cheers,
Francesco.
On 12 March 2016 at 22:32, Victor Shoup wrote:
> Just release
On the theme of hell freezing over, this also happened:
https://blogs.msdn.microsoft.com/vcblog/2016/03/30/visual-c-for-linux-development/
On 31 March 2016 at 02:17, 'Bill Hart' via sage-devel <
sage-devel@googlegroups.com> wrote:
> It's almost a year since I predicted Microsoft would do somethi
On 29 March 2016 at 20:41, Dima Pasechnik wrote:
> (this is perhaps not quite the same as the "proper" cygwin patch - MSYS2
> is a fork of Cygwin,
> which is sort of more developer-friendly --- perhaps we should consider
> switching to it)
>
As far as I know MSYS2 is not a fork of cygwin, it is
On 5 April 2016 at 10:59, Dima Pasechnik wrote:
>
> MSYS2 has a mingw toolchain and a Cygwin toolchain.
>
> http://stackoverflow.com/questions/25019057/how-are-msys-msys2-and-msysgit-related-to-each-other
>
I did not know that msys2 also had a cygwin toolchain. But then, I don't
want to touch cy
On 14 April 2016 at 15:51, Erik Bray wrote:
> I disagree that Sage is all that special. Or at least, I don't
> believe there's any need for it to be, whether or not it is currently.
>
If the past is any indication, you will find some cultural resistance about
this point in the Sage community. S
It does not have to be a black and white matter. C++11 is not 100%
compatible with C++03, for instance, but the transition in practice has
been widely painless and successful (to the point that many prominent
projects today *require* C++11).
While I personally use and enjoy Python 3, I've heard a
On 25 July 2016 at 17:21, Erik Bray wrote:
> The GIL is an implementation detail and has nothing to do with the
> language. It could (in principle) be removed at any time without
> breaking existing code, and does not exist in other implementations.
Fair enough. At the same time though I do be
>
> That would be difficult to substantiate I think.
>
If you look at languages with "true" multithreading, what they provide are
not only the basic building blocks which Python also has (threads, locks,
mutexes, condition variables, etc.), but also a whole conceptual model of
how a multi-threaded
Consider pybind11 as a (probably better) alternative to Boost Python:
https://pybind11.readthedocs.io/en/stable/
You will need a C++11 capable compiler, but the gains in terms of ease of
use, compilation speed and memory usage are IMO well worth it.
On 18 October 2017 at 16:31, Eric Gourgoulhon
http://scip.zib.de/academic.txt
"""
1. This license applies to you only if you are a member of a noncommercial
and academic institution, e.g., a university. The license expires as
soon as you are no longer a member of this institution.
"""
So basically these acedemics, I imagine funded with
On 13 April 2018 at 11:25, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> On 13/04/2018 11:20, Francesco Biscani wrote:
>
>> http://scip.zib.de/academic.txt
>>
>> """
>> 1. This license applies to you only if you are a member of a non
On 14 April 2018 at 17:59, jplab wrote:
> Hi,
>
> Maybe I just give my basic knowledge about SCIP and ZIB.
>
> Le vendredi 13 avril 2018 11:20:25 UTC+2, bluescarni a écrit :
>>
>> http://scip.zib.de/academic.txt
>>
>> """
>> 1. This license applies to you only if you are a member of a
>> noncomme
On 5 December 2014 at 21:45, maldun wrote:
> I agree with you that it is not that important as it was some years ago.
> Nevertheless be aware that many professional users in engineering
> and research can't go online that simply, because of security reasons, and
> company policies (I know that fr
On 5 December 2014 at 20:48, 'Martin R' via sage-devel <
sage-devel@googlegroups.com> wrote:
>
> A famous example is
>
> integrate(x/sqrt(x^4+10*x^2+-96*x-71),x)
>
> which Mathematica won't do, although it is elementary, i.e., has a
> solution in terms of elementary functions:
>
>
> log((x^6+15*x^4
On 6 February 2015 at 14:47, Jeroen Demeyer wrote:
>
> Not true. Building a package using autotools doesn't require autotools.
> Autotools generates files like configure which are shipped with the
> sources. Executing those files does not require autotools.
But it requires some sort of GNU envir
On 19 February 2015 at 18:05, Julien Puydt wrote:
>
> All distributions have thousands of packages, and deps are not a big
> issue. Sage-the-distribution has about a hundred, and it's a big issue.
>
This is something I have failed to understand so far. What is it that makes
Sage require such spec
Hello William,
On 20 February 2015 at 01:22, William Stein wrote:
>
> This has been discussed over and over again and it plainly doesn't
> work. The Sage in Debian does not pass doctests, not even close. In
> general the combinatorial explosion of configurations to debug is way
> too large and it
Hello Bill,
On 2 April 2015 at 18:06, Bill Hart wrote:
>
> We are very deliberately targeting the leading/bleeding edge because there
> is just so much amazing, useful stuff in the works that we really can't
> ignore (dramatically improved gc, much better C struct support, staged
> functions, C++
>
> Or at least it is not hard to write modern C++ that is very difficult for
> others to work on.
>
Isn't it true for most languages? I have seen nested list comprehension
one-liners in Python that make my skin crawl.
--
You received this message because you are subscribed to the Google Groups
:)
Francesco.
On 11 June 2015 at 18:50, William Stein wrote:
> (off topic)
>
> On Thu, Jun 11, 2015 at 8:58 AM, Francesco Biscani
> wrote:
> >> Or at least it is not hard to write modern C++ that is very difficult
> for
> >> others to work on.
> >
>
On 11 June 2015 at 20:13, Travis Scrimshaw wrote:
>Difficult-to-dechiper can be considered a pro by bigger businesses with
> proprietry software to help prevent reverse-engineering (although from what
> I've been told, they typically run it through a scrambler before compiling
> the code for
Bravo, that was pretty good :)
On 11 June 2015 at 21:10, William Stein wrote:
> On Thu, Jun 11, 2015 at 11:55 AM, Francesco Biscani
> wrote:
> > On 11 June 2015 at 20:13, Travis Scrimshaw wrote:
> >>
> >>Difficult-to-dechiper can be considered a p
Wait, so Apple does not support an OS which came out in late 2013?
On 14 June 2015 at 11:05, Volker Braun wrote:
> I don't think more testing is the answer. Really, the problems boil down
> to
>
> a) OSX users running outdated and usupported OSX versions (i.e. anything <
> 10.10); Do you want to
On 19 June 2015 at 10:12, Volker Braun wrote:
> Yeah but Apple, in their infinite wisdom, has decided to put
> /usr/local/include at place #2 in the header include path. Even before
> /usr/include. So there is that.
>
Oh boy.
--
You received this message because you are subscribed to the Googl
For exposing C++ to Python I personally dislike solutions which require
external tools. I have been using Boost.Python for years and I very
satisfied with it:
http://www.boost.org/doc/libs/1_59_0/libs/python
If you are reasonably comfortable working with modern C++, that would be me
first choice.
On 5 September 2015 at 18:10, William Stein wrote:
> With sip/swig, I think it's much more automated, since on
> the Python side you get normal Python classes, which support multiple
> inheritance.
>
With Boost Python you also get the original C++ class as a Python class. It
also supports inheri
On 13 September 2015 at 20:31, William Stein wrote:
> I think pip is good enough these to support
> install/uninstall/versions/dependencies/c++ code, etc.
>
I think the situation is still dire for c/c++ extensions. Compiled wheels
seem to be viable for platforms like OSX and Windows, but for so
FWIW, here's my experience with various C++11 compilers:
- GCC >= 4.8 is C++11 feature complete (core language, not necessarily
library-wise) and quite usable (this includes MinGW);
- clang >= 3.3 is C++11 feature complete and in general slightly better for
standard-conformance and stability than
>
> Exactly. And also the mission statement: viable alternative to the Ma's -
> that is tricky!
>
I have always felt a tad confused and mislead by this statement.
As someone who has interacted over the years with physicists and engineers
using daily Mathematica, Maple and Matlab, I see very litt
On 28 September 2015 at 19:37, William Stein wrote:
>
> 1. Magma is also an Ma. Magma's incredibly good at pure mathematics.
> You seem to be leaving out Magma above.
>
I admit I know basically nothing about Magma (I did not know it even
existed before joining this list :).
> 2. You say "...
On Fri, 9 Jun 2023 at 02:02, Matthias Koeppe
wrote:
> On Thursday, June 8, 2023 at 4:40:06 PM UTC-7 Michael Orlitzky wrote:
>
> Pip [...] can't do anything with the non-python software on which sage
> subsists.
> To make sage-via-pip work, we'll have to maintain a new pseudo-
> distribution on py
(Apologies for reviving this old thread, but since I saw a couple of
mentions of ODE integration via Taylor's method in the mailing list
archive, I thought that some people might be interested)
We just released the latest version of our Taylor integrator heyoka.py:
https://github.com/bluescarni/h
99 matches
Mail list logo
