X-Git-Url: https://ginac.de/CLN/cln.git//cln.git?a=blobdiff_plain;f=doc%2Fcln.texi;h=1d676decf369fd18a72c8a417ce83951678cafdd;hb=2cbb7a1fb6bf9b68901949bbfaa37ab304dc80cd;hp=d5ed502081db7f11a018f1f150d6266aeebd455b;hpb=4985c8a7895076df62758466c86cd1bc9df10438;p=cln.git diff --git a/doc/cln.texi b/doc/cln.texi index d5ed502..1d676de 100644 --- a/doc/cln.texi +++ b/doc/cln.texi @@ -36,7 +36,7 @@ Published by Bruno Haible, @code{} and Richard B. Kreckel, @code{}. Copyright (C) Bruno Haible 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008. -Copyright (C) Richard B. Kreckel 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012. +Copyright (C) Richard B. Kreckel 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2017. Copyright (C) Alexei Sheplyakov 2008, 2010. Permission is granted to make and distribute verbatim copies of @@ -73,7 +73,8 @@ by the author. @vskip 0pt plus 1filll Copyright @copyright{} Bruno Haible 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008. @sp 0 -Copyright @copyright{} Richard B. Kreckel 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011. +Copyright @copyright{} Richard B. Kreckel 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014. +@sp 0 Copyright @copyright{} Alexei Sheplyakov 2008, 2010. @sp 2 @@ -118,6 +119,7 @@ by the authors. * Customizing:: * Index:: +@detailmenu --- The Detailed Node Listing --- Installation @@ -230,6 +232,7 @@ Customizing * Customizing I/O:: * Customizing the memory allocator:: +@end detailmenu @end menu @node Introduction @@ -392,8 +395,8 @@ This section describes how to install the CLN package on your system. @node C++ compiler @subsection C++ compiler -To build CLN, you need a C++ compiler. -GNU @code{g++ 4.0.0} or newer is recommended. +To build CLN, you need a C++11 compiler. +GNU @code{g++ 4.8.1} or newer is recommended. The following C++ features are used: classes, member functions, overloading of functions and operators, @@ -481,12 +484,12 @@ Examples: $ CC="gcc" CFLAGS="-O" CXX="g++" CXXFLAGS="-O" ./configure @end example @example -$ CC="gcc -V 3.2.3" CFLAGS="-O2 -finline-limit=1000" \ - CXX="g++ -V 3.2.3" CXXFLAGS="-O2 -finline-limit=1000" \ +$ CC=gcc CFLAGS="-O2 -finline-limit=1000" \ + CXX=g++ CXXFLAGS="-O2 -finline-limit=1000" \ CPPFLAGS="-DNO_ASM" ./configure @end example @example -$ CC="gcc-4.2" CFLAGS="-O2" CXX="g++-4.2" CXXFLAGS="-O2" ./configure +$ CC="gcc-9" CFLAGS="-O2" CXX="g++-9" CXXFLAGS="-O2" ./configure @end example Note that for these environment variables to take effect, you have to set @@ -3282,17 +3285,17 @@ There is a cache table of rings, indexed by @code{R} and @code{varname}. This ensures that two calls of this function with the same arguments will return the same polynomial ring. -@itemx cl_univpoly_complex_ring find_univpoly_ring (const cl_complex_ring& R) +@item cl_univpoly_complex_ring find_univpoly_ring (const cl_complex_ring& R) @cindex @code{find_univpoly_ring ()} -@itemx cl_univpoly_complex_ring find_univpoly_ring (const cl_complex_ring& R, const cl_symbol& varname) -@itemx cl_univpoly_real_ring find_univpoly_ring (const cl_real_ring& R) -@itemx cl_univpoly_real_ring find_univpoly_ring (const cl_real_ring& R, const cl_symbol& varname) -@itemx cl_univpoly_rational_ring find_univpoly_ring (const cl_rational_ring& R) -@itemx cl_univpoly_rational_ring find_univpoly_ring (const cl_rational_ring& R, const cl_symbol& varname) -@itemx cl_univpoly_integer_ring find_univpoly_ring (const cl_integer_ring& R) -@itemx cl_univpoly_integer_ring find_univpoly_ring (const cl_integer_ring& R, const cl_symbol& varname) -@itemx cl_univpoly_modint_ring find_univpoly_ring (const cl_modint_ring& R) -@itemx cl_univpoly_modint_ring find_univpoly_ring (const cl_modint_ring& R, const cl_symbol& varname) +@item cl_univpoly_complex_ring find_univpoly_ring (const cl_complex_ring& R, const cl_symbol& varname) +@item cl_univpoly_real_ring find_univpoly_ring (const cl_real_ring& R) +@item cl_univpoly_real_ring find_univpoly_ring (const cl_real_ring& R, const cl_symbol& varname) +@item cl_univpoly_rational_ring find_univpoly_ring (const cl_rational_ring& R) +@item cl_univpoly_rational_ring find_univpoly_ring (const cl_rational_ring& R, const cl_symbol& varname) +@item cl_univpoly_integer_ring find_univpoly_ring (const cl_integer_ring& R) +@item cl_univpoly_integer_ring find_univpoly_ring (const cl_integer_ring& R, const cl_symbol& varname) +@item cl_univpoly_modint_ring find_univpoly_ring (const cl_modint_ring& R) +@item cl_univpoly_modint_ring find_univpoly_ring (const cl_modint_ring& R, const cl_symbol& varname) These functions are equivalent to the general @code{find_univpoly_ring}, only the return type is more specific, according to the base ring's type. @end table