X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fpolynomial%2Fprimes_factory.h;h=803c56730f7c63d55111c8670d8226f674adf04c;hp=f24edf0b0e9820811a8cf46f34b53423c1072b4d;hb=8cffcdf13d817a47f217f1a1043317d95969e070;hpb=c28e61da33905ddc69abf893aaffec98aa30d053;ds=sidebyside

diff --git a/ginac/polynomial/primes_factory.h b/ginac/polynomial/primes_factory.h
index f24edf0b..803c5673 100644
--- a/ginac/polynomial/primes_factory.h
+++ b/ginac/polynomial/primes_factory.h
@@ -3,7 +3,7 @@
  *  Factory for prime numbers. */
 
 /*
- *  GiNaC Copyright (C) 1999-2010 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2019 Johannes Gutenberg University Mainz, Germany
  *
  *  This program is free software; you can redistribute it and/or modify
  *  it under the terms of the GNU General Public License as published by
@@ -47,7 +47,7 @@ private:
 	// or even numeric. Eventually this will be fixed).
 	cln::cl_I last;
 	// This ensures coefficients are immediate.
-	static const int immediate_bits = 8*sizeof(void *) - __alignof__(void *);
+	static const int immediate_bits = 8*sizeof(void *) - alignof(void *);
 	static const long opt_hint = (1L << (immediate_bits >> 1)) - 1;
 public:
 	primes_factory()