3 * Interface to several small and furry utilities needed within GiNaC but not
4 * of any interest to the user of the library. */
7 * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24 #ifndef __GINAC_UTILS_H__
25 #define __GINAC_UTILS_H__
31 #include "assertion.h"
35 /** Exception class thrown by classes which provide their own series expansion
36 * to signal that ordinary Taylor expansion is safe. */
39 /** Exception class thrown when a singularity is encountered. */
40 class pole_error : public std::domain_error {
42 explicit pole_error(const std::string& what_arg, int degree);
43 int degree(void) const;
48 // some compilers (e.g. cygwin) define a macro log2, causing confusion
50 unsigned log2(unsigned n);
53 /** Compare two pointers (just to establish some sort of canonical order).
54 * @return -1, 0, or 1 */
55 inline int compare_pointers(const void * a, const void * b)
64 /** Rotate lower 31 bits of unsigned value by one bit to the left
65 * (upper bit gets cleared). */
66 inline unsigned rotate_left_31(unsigned n)
68 // clear highest bit and shift 1 bit to the left
69 n = (n & 0x7FFFFFFFU) << 1;
71 // overflow? clear highest bit and set lowest bit
73 n = (n & 0x7FFFFFFFU) | 0x00000001U;
75 GINAC_ASSERT(n<0x80000000U);
80 /** Golden ratio hash function for the 31 least significant bits. */
81 inline unsigned golden_ratio_hash(unsigned n)
83 // This function requires arithmetic with at least 64 significant bits
85 // So 'long' has 64 bits. Excellent! We prefer it because it might be
86 // more efficient than 'long long'.
87 unsigned long l = n * 0x4f1bbcddL;
88 return (l & 0x7fffffffU) ^ (l >> 32);
89 #elif SIZEOF_LONG_LONG >= 8
90 // This requires 'long long' (or an equivalent 64 bit type)---which is,
91 // unfortunately, not ANSI-C++-compliant.
92 // (Yet C99 demands it, which is reason for hope.)
93 unsigned long long l = n * 0x4f1bbcddL;
94 return (l & 0x7fffffffU) ^ (l >> 32);
95 #elif SIZEOF_LONG_DOUBLE > 8
96 // If 'long double' is bigger than 64 bits, we assume that the mantissa
97 // has at least 64 bits. This is not guaranteed but it's a good guess.
98 // Unfortunately, it may lead to horribly slow code.
99 const static long double golden_ratio = .618033988749894848204586834370;
100 long double m = golden_ratio * n;
101 return unsigned((m - int(m)) * 0x80000000);
103 #error "No 64 bit data type. You lose."
107 /* Compute the sign of a permutation of a container, with and without an
108 explicitly supplied comparison function. If the sign returned is 1 or -1,
109 the container is sorted after the operation. */
111 int permutation_sign(It first, It last)
122 It i = last, other = last;
124 bool swapped = false;
127 std::iter_swap(other, i);
131 } else if (!(*other < *i))
141 i = first; other = first;
146 std::iter_swap(i, other);
150 } else if (!(*i < *other))
158 } while (first != last);
163 template <class It, class Cmp, class Swap>
164 int permutation_sign(It first, It last, Cmp comp, Swap swapit)
175 It i = last, other = last;
177 bool swapped = false;
179 if (comp(*i, *other)) {
184 } else if (!comp(*other, *i))
194 i = first; other = first;
198 if (comp(*other, *i)) {
203 } else if (!comp(*i, *other))
211 } while (first != last);
216 /* Implementation of shaker sort, only compares adjacent elements. */
217 template <class It, class Cmp, class Swap>
218 void shaker_sort(It first, It last, Cmp comp, Swap swapit)
228 It i = last, other = last;
230 bool swapped = false;
232 if (comp(*i, *other)) {
245 i = first; other = first;
249 if (comp(*other, *i)) {
260 } while (first != last);
263 /* In-place cyclic permutation of a container (no copying, only swapping). */
264 template <class It, class Swap>
265 void cyclic_permutation(It first, It last, It new_first, Swap swapit)
267 unsigned num = last - first;
269 if (first == new_first || num < 2)
272 unsigned num1 = new_first - first, num2 = last - new_first;
274 It a = first, b = new_first;
285 It a = new_first, b = last;
289 } while (a != first);
297 // Collection of `construct on first use' wrappers for safely avoiding
298 // internal object replication without running into the `static
299 // initialization order fiasco'. This chest of numbers helps speed up
300 // the library but should not be used outside it since it is
301 // potentially confusing.
306 const numeric & _num_120(void); // -120
307 const ex & _ex_120(void);
308 const numeric & _num_60(void); // -60
309 const ex & _ex_60(void);
310 const numeric & _num_48(void); // -48
311 const ex & _ex_48(void);
312 const numeric & _num_30(void); // -30
313 const ex & _ex_30(void);
314 const numeric & _num_25(void); // -25
315 const ex & _ex_25(void);
316 const numeric & _num_24(void); // -24
317 const ex & _ex_24(void);
318 const numeric & _num_20(void); // -20
319 const ex & _ex_20(void);
320 const numeric & _num_18(void); // -18
321 const ex & _ex_18(void);
322 const numeric & _num_15(void); // -15
323 const ex & _ex_15(void);
324 const numeric & _num_12(void); // -12
325 const ex & _ex_12(void);
326 const numeric & _num_11(void); // -11
327 const ex & _ex_11(void);
328 const numeric & _num_10(void); // -10
329 const ex & _ex_10(void);
330 const numeric & _num_9(void); // -9
331 const ex & _ex_9(void);
332 const numeric & _num_8(void); // -8
333 const ex & _ex_8(void);
334 const numeric & _num_7(void); // -7
335 const ex & _ex_7(void);
336 const numeric & _num_6(void); // -6
337 const ex & _ex_6(void);
338 const numeric & _num_5(void); // -5
339 const ex & _ex_5(void);
340 const numeric & _num_4(void); // -4
341 const ex & _ex_4(void);
342 const numeric & _num_3(void); // -3
343 const ex & _ex_3(void);
344 const numeric & _num_2(void); // -2
345 const ex & _ex_2(void);
346 const numeric & _num_1(void); // -1
347 const ex & _ex_1(void);
348 const numeric & _num_1_2(void); // -1/2
349 const ex & _ex_1_2(void);
350 const numeric & _num_1_3(void); // -1/3
351 const ex & _ex_1_3(void);
352 const numeric & _num_1_4(void); // -1/4
353 const ex & _ex_1_4(void);
354 const numeric & _num0(void); // 0
355 const ex & _ex0(void);
356 const numeric & _num1_4(void); // 1/4
357 const ex & _ex1_4(void);
358 const numeric & _num1_3(void); // 1/3
359 const ex & _ex1_3(void);
360 const numeric & _num1_2(void); // 1/2
361 const ex & _ex1_2(void);
362 const numeric & _num1(void); // 1
363 const ex & _ex1(void);
364 const numeric & _num2(void); // 2
365 const ex & _ex2(void);
366 const numeric & _num3(void); // 3
367 const ex & _ex3(void);
368 const numeric & _num4(void); // 4
369 const ex & _ex4(void);
370 const numeric & _num5(void); // 5
371 const ex & _ex5(void);
372 const numeric & _num6(void); // 6
373 const ex & _ex6(void);
374 const numeric & _num7(void); // 7
375 const ex & _ex7(void);
376 const numeric & _num8(void); // 8
377 const ex & _ex8(void);
378 const numeric & _num9(void); // 9
379 const ex & _ex9(void);
380 const numeric & _num10(void); // 10
381 const ex & _ex10(void);
382 const numeric & _num11(void); // 11
383 const ex & _ex11(void);
384 const numeric & _num12(void); // 12
385 const ex & _ex12(void);
386 const numeric & _num15(void); // 15
387 const ex & _ex15(void);
388 const numeric & _num18(void); // 18
389 const ex & _ex18(void);
390 const numeric & _num20(void); // 20
391 const ex & _ex20(void);
392 const numeric & _num24(void); // 24
393 const ex & _ex24(void);
394 const numeric & _num25(void); // 25
395 const ex & _ex25(void);
396 const numeric & _num30(void); // 30
397 const ex & _ex30(void);
398 const numeric & _num48(void); // 48
399 const ex & _ex48(void);
400 const numeric & _num60(void); // 60
401 const ex & _ex60(void);
402 const numeric & _num120(void); // 120
403 const ex & _ex120(void);
406 // Helper macros for class implementations (mostly useful for trivial classes)
408 #define DEFAULT_COPY(classname) \
409 void classname::copy(const classname & other) \
411 inherited::copy(other); \
414 #define DEFAULT_DESTROY(classname) \
415 void classname::destroy(bool call_parent) \
418 inherited::destroy(call_parent); \
421 #define DEFAULT_CTORS(classname) \
422 classname::classname() : inherited(TINFO_##classname) \
424 debugmsg(#classname " default constructor", LOGLEVEL_CONSTRUCT); \
426 DEFAULT_COPY(classname) \
427 DEFAULT_DESTROY(classname)
429 #define DEFAULT_UNARCHIVE(classname) \
430 ex classname::unarchive(const archive_node &n, const lst &sym_lst) \
432 return (new classname(n, sym_lst))->setflag(status_flags::dynallocated); \
435 #define DEFAULT_ARCHIVING(classname) \
436 classname::classname(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst) \
438 debugmsg(#classname " constructor from archive_node", LOGLEVEL_CONSTRUCT); \
440 DEFAULT_UNARCHIVE(classname) \
441 void classname::archive(archive_node &n) const \
443 inherited::archive(n); \
446 #define DEFAULT_COMPARE(classname) \
447 int classname::compare_same_type(const basic & other) const \
449 /* by default, the objects are always identical */ \
453 #define DEFAULT_PRINT(classname, text) \
454 void classname::print(const print_context & c, unsigned level) const \
456 debugmsg(#classname " print", LOGLEVEL_PRINT); \
457 if (is_a<print_tree>(c)) \
458 inherited::print(c, level); \
463 #define DEFAULT_PRINT_LATEX(classname, text, latex) \
464 void classname::print(const print_context & c, unsigned level) const \
466 debugmsg(#classname " print", LOGLEVEL_PRINT); \
467 if (is_a<print_tree>(c)) \
468 inherited::print(c, level); \
469 else if (is_a<print_latex>(c)) \
477 #endif // ndef __GINAC_UTILS_H__