3 * Collection of all flags used through the GiNaC framework. */
6 * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 #ifndef __GINAC_FLAGS_H__
24 #define __GINAC_FLAGS_H__
28 class expand_options {
31 expand_trigonometric = 0x0001
35 /** Flags to control series expansion. */
36 class series_options {
39 suppress_branchcut = 0x0001
43 /** Switch to control algorithm for determinant computation. */
44 class determinant_algo {
47 automatic, ///< Let the system choose
48 gauss, ///< Gauss elimiation
49 divfree, ///< Division-free elimination
50 laplace, ///< Laplace (or minor) elimination
51 bareiss ///< Bareiss fraction-free elimination
55 /** Switch to control algorithm for linear system solving. */
59 automatic, ///< Let the system choose
60 gauss, ///< Gauss elimiation
61 divfree, ///< Division-free elimination
62 bareiss ///< Bareiss fraction-free elimination
66 /** Flags to store information about the state of an object.
67 * @see basic::flags */
71 dynallocated = 0x0001, ///< Heap-allocated (i.e. created by new if we want to be clever and bypass the stack)
72 evaluated = 0x0002, ///< .eval() has already done its job
73 expanded = 0x0004, ///< .expand() has already done its job
74 hash_calculated = 0x0008 ///< .calchash() has already done its job
78 /** Possible attributes an object can have. */
82 // answered by class numeric
99 // answered by class relation
104 relation_less_or_equal,
106 relation_greater_or_equal,
108 // answered by class symbol
111 // answered by class lst
114 // answered by class exprseq
117 // answered by classes numeric, symbol, add, mul, power
122 crational_polynomial,
126 // answered by class indexed
127 indexed, // class can carry indices
128 has_indices, // object has at least one index
130 // answered by class idx
133 // answered by class coloridx
136 // answered by class lorentzidx
146 noncommutative_composite
159 /** Strategies how to clean up the function remember cache.
160 * @see remember_table */
161 class remember_strategies {
164 delete_never, ///< Let table grow undefinitely
165 delete_lru, ///< Least recently used
166 delete_lfu, ///< Least frequently used
167 delete_cyclic ///< First (oldest) one in list
173 #endif // ndef __GINAC_FLAGS_H__