Thank for your answer :) If so, I cannot understand that "ECLiPSe Integers can be as large as fits into memory, e.g.: 123 0 -27 393423874981724" <http://gki.informatik.uni-freiburg.de/teaching/ws1415/csp/csp11.pdf>, but Wikipedia says <https://en.wikipedia.org/wiki/ECLiPSe> that:
ECLiPSe interfaces to external solvers, in particular the Gecode solver library How *just* an interface can be able to have numbers bigger than underlying library? 2017-08-02 0:24 GMT+04:00 Christian Schulte <cschu...@kth.se>: > Hi, unfortunately there is no support for this. We know that this is high > on the wish list of many but… I think somebody has tried, if I recall > correctly, though. Guido, do you have any details. > > > > Cheers > > Christian > > > > -- > > Christian Schulte, www.gecode.org/~schulte > > Professor of Computer Science, KTH, cschu...@kth.se > > Expert Researcher, SICS, cschu...@sics.se > > > > *From:* users-boun...@gecode.org [mailto:users-boun...@gecode.org] *On > Behalf Of *Slav > *Sent:* Tuesday, August 1, 2017 20:23 > *To:* users@gecode.org > *Subject:* [gecode-users] Arbitrary big numbers? > > > > Hello. I am modeling algorithm to hardware mapping with *Gecode*. > Standard *Int::Limits::max* is too small because I want to target systems > with more than 2^31 memory. > > Is there a way to get use of arbitrary-precision arithmetic with Gecode or > at least 64-bits integers? > > I know that Gecode can be built with *MPIR* or *GMP* support, but seems > those are just for trigonometric operations? > > Thanks in advance :) >
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
