cl_{GV,SV}: use std::size_t for size of vectors (instead of obscure uintC).

[cln.git] / include / cln / GV_modinteger.h

diff --git a/include/cln/GV_modinteger.h b/include/cln/GV_modinteger.h
index ac4aa97ac7c6d4a1fd4a6ee58bd32629f124a52a..b86575a1f4ce376c82e75e634326fc514f5a12aa 100644 (file)
--- a/include/cln/GV_modinteger.h
+++ b/include/cln/GV_modinteger.h
@@ -11,9 +11,7 @@ namespace cln {
 // A vector of modular integers (over the same modular integer ring)
 // is just a normal vector of integers, with maxbits() operation.
 
-#ifdef HAVE_TEMPLATE_NULL
 template <>
-#endif
 struct cl_heap_GV<_cl_MI> : cl_heap {
        cl_GV_inner<_cl_MI> v;
        // here room for the elements
@@ -26,11 +24,11 @@ public:
        cl_GV_MI ();
        cl_GV_MI (const cl_GV_MI&);
        // Create a vector of modular integers.
-       cl_GV_MI (uintL len, cl_heap_modint_ring* R);
+       cl_GV_MI (std::size_t len, cl_heap_modint_ring* R);
        // Assignment operators.
        cl_GV_MI& operator= (const cl_GV_MI&);
        // Number m of bits allowed per element (-1 if unconstrained).
-       sintL maxbits () const
+       sintC maxbits () const
        {
                return ((const cl_heap_GV_I *) pointer)->maxbits();
        }
@@ -39,7 +37,7 @@ inline cl_GV_MI::cl_GV_MI (const cl_GV_MI& x) : cl_GV<_cl_MI,cl_GV_any> (as_cl_p
 CL_DEFINE_ASSIGNMENT_OPERATOR(cl_GV_MI,cl_GV_MI)
 inline cl_GV_MI::cl_GV_MI ()
        : cl_GV<_cl_MI,cl_GV_any> ((cl_heap_GV_MI*) (cl_heap_GV_I*) cl_null_GV_I) {}
-inline cl_GV_MI::cl_GV_MI (uintL len, cl_heap_modint_ring* R)
+inline cl_GV_MI::cl_GV_MI (std::size_t len, cl_heap_modint_ring* R)
        : cl_GV<_cl_MI,cl_GV_any> ((cl_heap_GV_MI*) cl_make_heap_GV_I(len,R->bits)) {}
 
 // Copy a vector.