* of any interest to the user of the library. */
/*
- * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2009 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
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#ifndef __GINAC_UTILS_H__
-#define __GINAC_UTILS_H__
+#ifndef GINAC_UTILS_H
+#define GINAC_UTILS_H
+#include "assertion.h"
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
-#include <string>
#include <functional>
#ifdef HAVE_STDINT_H
#include <stdint.h> // for uintptr_t
#endif
-
-#include "assertion.h"
+#include <string>
namespace GiNaC {
{
// This function works much better when fast arithmetic with at
// least 64 significant bits is available.
-#if SIZEOF_LONG >= 8
+ if (sizeof(long) >= 8) {
// So 'long' has 64 bits. Excellent! We prefer it because it might be
// more efficient than 'long long'.
unsigned long l = n * 0x4f1bbcddUL;
return (unsigned)l;
-#elif SIZEOF_LONG_LONG >= 8
+ }
+#ifdef HAVE_LONG_LONG
+ else if (sizeof(long long) >= 8) {
// This requires 'long long' (or an equivalent 64 bit type)---which is,
// unfortunately, not ANSI-C++-compliant.
// (Yet C99 demands it, which is reason for hope.)
unsigned long long l = n * 0x4f1bbcddULL;
return (unsigned)l;
-#else
+ }
+#endif
// Without a type with 64 significant bits do the multiplication manually
// by splitting n up into the lower and upper two bytes.
const unsigned n0 = (n & 0x0000ffffU);
const unsigned n1 = (n & 0xffff0000U) >> 16;
return (n0 * 0x0000bcddU) + ((n1 * 0x0000bcddU + n0 * 0x00004f1bU) << 16);
-#endif
}
/* Compute the sign of a permutation of a container, with and without an
sign = -sign;
} else if (!(*other < *i))
return 0;
- --i; --other;
+ --i;
+ if (i != first)
+ --other;
}
if (!swapped)
return sign;
sign = -sign;
} else if (!(*i < *other))
return 0;
- ++i; ++other;
+ ++i;
+ if (i != last)
+ ++other;
}
if (!swapped)
return sign;
sign = -sign;
} else if (!comp(*other, *i))
return 0;
- --i; --other;
+ --i;
+ if (i != first)
+ --other;
}
if (!swapped)
return sign;
sign = -sign;
} else if (!comp(*i, *other))
return 0;
- ++i; ++other;
+ ++i;
+ if (i != last)
+ ++other;
}
if (!swapped)
return sign;
flag = other;
swapped = true;
}
- --i; --other;
+ --i;
+ if (i != first)
+ --other;
}
if (!swapped)
return;
flag = other;
swapped = true;
}
- ++i; ++other;
+ ++i;
+ if (i != last)
+ ++other;
}
if (!swapped)
return;
// Helper macros for class implementations (mostly useful for trivial classes)
#define DEFAULT_CTOR(classname) \
-classname::classname() : inherited(&classname::tinfo_static) { setflag(status_flags::evaluated | status_flags::expanded); }
-
-#define DEFAULT_UNARCHIVE(classname) \
-ex classname::unarchive(const archive_node &n, lst &sym_lst) \
-{ \
- return (new classname(n, sym_lst))->setflag(status_flags::dynallocated); \
-}
-
-#define DEFAULT_ARCHIVING(classname) \
-classname::classname(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst) {} \
-DEFAULT_UNARCHIVE(classname) \
-void classname::archive(archive_node &n) const \
-{ \
- inherited::archive(n); \
-}
+classname::classname() { setflag(status_flags::evaluated | status_flags::expanded); }
#define DEFAULT_COMPARE(classname) \
int classname::compare_same_type(const basic & other) const \
} // namespace GiNaC
-
-#endif // ndef __GINAC_UTILS_H__
+#endif // ndef GINAC_UTILS_H