X-Git-Url: https://ginac.de/ginac.git//ginac.git?a=blobdiff_plain;f=ginac%2Fpolynomial%2Fprimes_factory.h;h=36cb72086dfb902185f3a6f0618477ea947c5eb1;hb=052d2da5b41ac82855d3578050125aa21caf1003;hp=1efb9716e7cb5848f83d7fd8dd570b463f83a2d4;hpb=cca88b51436e4b654d16a4d60cd0d1c66fcf5dd6;p=ginac.git

diff --git a/ginac/polynomial/primes_factory.h b/ginac/polynomial/primes_factory.h
index 1efb9716..36cb7208 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-2014 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2022 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()