+- HP Forums (https://www.hpmuseum.org/forum)
+-- Forum: HP Calculators (and very old HP Computers) (/forum-3.html)
+--- Forum: HP Prime (/forum-5.html)
+--- Thread: CAS: log of large integers? (/thread-3930.html)
Pages: 1 2
RE: CAS: log of large integers? - kharpster - 05-24-2015 07:10 PM
Thank you Joe! Time to start my own programming addendum document :-)
RE: CAS: log of large integers? - parisse - 05-25-2015 05:38 AM
5 stands for multivariate polynomials, 9 sparse univariate series expansion, 11 for algebraic extensions. They are intended for internal use, you can access them from Xcas but some commands to manipulate them are not available on the Prime.
The complete list of giac types is in dispatch.h:
Code:
enum gen_unary_types {
// immediate type (without mem allocation) should be < _ZINT
_INT_= 0, // int val
_DOUBLE_= 1, // double _DOUBLE_val
// all type below or equal to _DOUBLE_ must be non pointers
_ZINT= 2, // mpz_t * _ZINTptr
_REAL= 3, // mpf_t * _REALptr
// all type strictly below _CPLX must be real types
_CPLX= 4, // gen * _CPLXptr
_POLY= 5, // polynome * _POLYptr
_IDNT= 6, // identificateur * _IDNTptr
_VECT= 7, // vecteur * _VECTptr
_SYMB= 8, // symbolic * _SYMBptr
_SPOL1= 9, // sparse_poly1 * _SPOL1ptr
_FRAC= 10, // fraction * _FRACptr
_EXT= 11, // gen * _EXTptr
_STRNG= 12, // string * _STRNGptr
_FUNC= 13, // unary_fonction_ptr * _FUNCptr
_ROOT= 14, // real_complex_rootof *_ROOTptr
_MOD= 15, // gen * _MODptr
_USER= 16, // gen_user * _USERptr
_MAP=17, // map<gen.gen> * _MAPptr
_EQW=18, // eqwdata * _EQWptr
_GROB=19, // grob * _GROBptr
_POINTER_=20, // void * _POINTER_val
_FLOAT_=21 // immediate, _FLOAT_val
} ;RE: CAS: log of large integers? - Joe Horn - 05-25-2015 07:20 AM
(05-25-2015 05:38 AM)parisse Wrote: 5 stands for multivariate polynomials, 9 sparse univariate series expansion, 11 for algebraic extensions. They are intended for internal use, you can access them from Xcas but some commands to manipulate them are not available on the Prime.
The complete list of giac types is in dispatch.h: ...
Awesome! Thanks, Bernard!