Changeset d101b1 in git for libpolys/polys/monomials/monomials.h
- Timestamp:
- Jan 10, 2013, 12:25:13 PM (11 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 8836a9f43c10a0aea1e3ab6a8d9ecf52fe6a9128
- Parents:
- 5fdf7adfacd151eb7c448b03ce681f70b7211e79
- git-author:
- Oleksandr Motsak <http://goo.gl/mcpzY>2013-01-10 12:25:13+01:00
- git-committer:
- Oleksandr Motsak <http://goo.gl/mcpzY>2013-01-10 16:45:07+01:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/polys/monomials/monomials.h
r5fdf7a rd101b1 150 150 //void p_SetRingOfLeftv(leftv l, ring r); 151 151 #else 152 #define p_SetRingOfLm(p, r) ((void)0)153 //#define p_SetRingOfLeftv(l, r) ((void)0)152 #define p_SetRingOfLm(p, r) do {} while (0) 153 //#define p_SetRingOfLeftv(l, r) do {} while (0) 154 154 #endif 155 155 156 156 #else // ! defined(PDEBUG) 157 #define pFalseReturn(cond) ((void)0)158 #define pAssume(cond) ((void)0)159 #define pPolyAssume(cond) ((void)0)160 #define _pPolyAssume(cond, p,r) ((void)0)161 #define pAssumeReturn(cond) ((void)0)162 #define pPolyAssumeReturn(cond) ((void)0)163 #define _pPolyAssumeReturn(cond,p,r) ((void)0)164 #define p_SetRingOfLm(p, r) ((void)0)165 //#define p_SetRingOfLeftv(l, r) ((void)0)157 #define pFalseReturn(cond) do {} while (0) 158 #define pAssume(cond) do {} while (0) 159 #define pPolyAssume(cond) do {} while (0) 160 #define _pPolyAssume(cond, p,r) do {} while (0) 161 #define pAssumeReturn(cond) do {} while (0) 162 #define pPolyAssumeReturn(cond) do {} while (0) 163 #define _pPolyAssumeReturn(cond,p,r) do {} while (0) 164 #define p_SetRingOfLm(p, r) do {} while (0) 165 //#define p_SetRingOfLeftv(l, r) do {} while (0) 166 166 #endif // defined(PDEBUG) 167 167 … … 177 177 #define pIfThen1 pIfThen 178 178 #else 179 #define pAssume1(cond) ((void)0)180 #define pPolyAssume1(cond) ((void)0)181 #define _pPolyAssume1(cond,p,r) ((void)0)182 #define pAssumeReturn1(cond) ((void)0)183 #define pPolyAssumeReturn1(cond) ((void)0)184 #define _pPolyAssumeReturn1(cond,p,r) ((void)0)185 #define p_LmCheckPolyRing1(p,r) ((void)0)186 #define p_CheckRing1(r) ((void)0)187 #define pIfThen1(cond, check) ((void)0)179 #define pAssume1(cond) do {} while (0) 180 #define pPolyAssume1(cond) do {} while (0) 181 #define _pPolyAssume1(cond,p,r) do {} while (0) 182 #define pAssumeReturn1(cond) do {} while (0) 183 #define pPolyAssumeReturn1(cond) do {} while (0) 184 #define _pPolyAssumeReturn1(cond,p,r)do {} while (0) 185 #define p_LmCheckPolyRing1(p,r) do {} while (0) 186 #define p_CheckRing1(r) do {} while (0) 187 #define pIfThen1(cond, check) do {} while (0) 188 188 #endif // PDEBUG >= 1 189 189 … … 199 199 #define pIfThen2 pIfThen 200 200 #else 201 #define pAssume2(cond) ((void)0)202 #define pPolyAssume2(cond) ((void)0)203 #define _pPolyAssume2(cond,p,r) ((void)0)204 #define pAssumeReturn2(cond) ((void)0)205 #define pPolyAssumeReturn2(cond) ((void)0)206 #define _pPolyAssumeReturn2(cond,p,r) ((void)0)207 #define p_LmCheckPolyRing2(p,r) ((void)0)208 #define p_CheckRing2(r) ((void)0)209 #define pIfThen2(cond, check) ((void)0)201 #define pAssume2(cond) do {} while (0) 202 #define pPolyAssume2(cond) do {} while (0) 203 #define _pPolyAssume2(cond,p,r) do {} while (0) 204 #define pAssumeReturn2(cond) do {} while (0) 205 #define pPolyAssumeReturn2(cond) do {} while (0) 206 #define _pPolyAssumeReturn2(cond,p,r)do {} while (0) 207 #define p_LmCheckPolyRing2(p,r) do {} while (0) 208 #define p_CheckRing2(r) do {} while (0) 209 #define pIfThen2(cond, check) do {} while (0) 210 210 #endif // PDEBUG >= 2 211 211
Note: See TracChangeset
for help on using the changeset viewer.