Bounjour Dominique,
I only have xcode 4.6.2 with clang-3.2svn. Using that didn't
reproduce the compile error, nor did using clang-3.3 from llvm33.
There was a thread on Oct 23 on the ginac mailing list about this very
same problem. Attached is the patch that should fix it. Could you (or
anyone) please test it for me on xcode 5?
Fang
Installing ginac2-1.6.1-2 fails on
Package manager version: 0.36.0
Distribution version: selfupdate-rsync Sun Nov 10 13:41:46 2013, 10.9, x86_64
Trees: local/main stable/main
Xcode.app: 5.0.1
Xcode command-line tools: 5.0.1.0.1.1382131676
Max. Fink build jobs: 1
with
/bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I.
-I../config -I/sw64/include -I/sw64/include -g -O2 -MT inifcns_nstdsums.lo
-MD -MP -MF .deps/inifcns_nstdsums.Tpo -c -o inifcns_nstdsums.lo
inifcns_nstdsums.cpp
libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../config -I/sw64/include
-I/sw64/include -g -O2 -MT inifcns_nstdsums.lo -MD -MP -MF
.deps/inifcns_nstdsums.Tpo -c inifcns_nstdsums.cpp -fno-common -DPIC -o
.libs/inifcns_nstdsums.o
inifcns_nstdsums.cpp:2604:18: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return e * (-H(lst(0),1/arg).hold());
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2635:16: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return e * H(lst(1),1-arg).hold();
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2667:34: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
ex addzeta = convert_H_to_zeta(lst(-1));
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2668:28: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return (e * (addzeta - H(lst(-1),1/arg).hold())).expand();
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2699:17: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return (e * H(lst(-1),(1-arg)/(1+arg)).hold()).expand();
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2730:17: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return (e * H(lst(1),(1-arg)/(1+arg)).hold()).expand();
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2809:17: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
ex res = H(lst(1), arg).hold() *
H(newparameter, arg).hold();
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2873:27: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return
unify((pow(H(lst(-1),1/arg).hold() - H(lst(0),1/arg).hold(), parameter.nops())
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2873:53: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return
unify((pow(H(lst(-1),1/arg).hold() - H(lst(0),1/arg).hold(), parameter.nops())
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2885:27: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return
unify((pow(H(lst(1),1/arg).hold() + H(lst(0),1/arg).hold() + H_polesign,
parameter.nops())
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2885:52: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return
unify((pow(H(lst(1),1/arg).hold() + H(lst(0),1/arg).hold() + H_polesign,
parameter.nops())
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2928:17: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
ex res = H(lst(1), arg).hold() *
H(newparameter, arg).hold();
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2984:28: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return
unify((pow(-H(lst(1),(1-arg)/(1+arg)).hold() -
H(lst(-1),(1-arg)/(1+arg)).hold(), param...
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2984:63: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return
unify((pow(-H(lst(1),(1-arg)/(1+arg)).hold() -
H(lst(-1),(1-arg)/(1+arg)).hold(), param...
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:2996:36: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return unify((pow(log(2) -
H(lst(-1),(1-arg)/(1+arg)).hold(), parameter.nops())
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:3008:37: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return unify((pow(-log(2) -
H(lst(0),(1-arg)/(1+arg)).hold() + H(lst(-1),(1-arg)/(1+arg)).hold...
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:3008:72: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
return unify((pow(-log(2) -
H(lst(0),(1-arg)/(1+arg)).hold() + H(lst(-1),(1-arg)/(1+arg)).hold...
^~~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
inifcns_nstdsums.cpp:3051:17: error: ambiguous conversion for functional-style cast
from 'int' to 'lst' (aka 'container<std::list>')
ex res = H(lst(1), arg).hold() *
H(newparameter, arg).hold();
^~~~~
./container.h:145:2: note: candidate constructor
container(STLT const & s, bool discardable = false)
^
./container.h:167:11: note: candidate constructor
explicit container(const ex & p1)
^
18 errors generated.
make[2]: *** [inifcns_nstdsums.lo] Error 1
make[1]: *** [all] Error 2
make: *** [all-recursive] Error 1
### execution of make failed, exit code 2
### execution of /tmp/fink.pabJ_ failed, exit code 2
Removing runtime build-lock...
Removing build-lock package...
/sw64/bin/dpkg-lockwait -r fink-buildlock-ginac2-1.6.1-2
(Reading database ... 184819 files and directories currently installed.)
Removing fink-buildlock-ginac2-1.6.1-2 ...
Failed: phase compiling: ginac2-1.6.1-2 failed
TIA
Dominique
------------------------------------------------------------------------------
November Webinars for C, C++, Fortran Developers
Accelerate application performance with scalable programming models. Explore
techniques for threading, error checking, porting, and tuning. Get the most
from the latest Intel processors and coprocessors. See abstracts and register
http://pubads.g.doubleclick.net/gampad/clk?id=60136231&iu=/4140/ostg.clktrk
_______________________________________________
Fink-users mailing list
Fink-users@lists.sourceforge.net
List archive:
http://news.gmane.org/gmane.os.macosx.fink.user
Subscription management:
https://lists.sourceforge.net/lists/listinfo/fink-users
--
David Fang
http://www.csl.cornell.edu/~fang/
diff --git a/ginac/inifcns_nstdsums.cpp b/ginac/inifcns_nstdsums.cpp
index f3e4f19..5f5949b 100644
--- a/ginac/inifcns_nstdsums.cpp
+++ b/ginac/inifcns_nstdsums.cpp
@@ -2601,7 +2601,7 @@ ex trafo_H_1tx_prepend_zero(const ex& e, const ex& arg)
ex addzeta = convert_H_to_zeta(newparameter);
return e.subs(h == (addzeta-H(newparameter,
h.op(1)).hold())).expand();
} else {
- return e * (-H(lst(0),1/arg).hold());
+ return e * (-H(lst(ex(0)),1/arg).hold());
}
}
@@ -2632,7 +2632,7 @@ ex trafo_H_prepend_one(const ex& e, const ex& arg)
newparameter.prepend(1);
return e.subs(h == H(newparameter, h.op(1)).hold());
} else {
- return e * H(lst(1),1-arg).hold();
+ return e * H(lst(ex(1)),1-arg).hold();
}
}
@@ -2664,8 +2664,8 @@ ex trafo_H_1tx_prepend_minusone(const ex& e, const ex&
arg)
ex addzeta = convert_H_to_zeta(newparameter);
return e.subs(h == (addzeta-H(newparameter,
h.op(1)).hold())).expand();
} else {
- ex addzeta = convert_H_to_zeta(lst(-1));
- return (e * (addzeta - H(lst(-1),1/arg).hold())).expand();
+ ex addzeta = convert_H_to_zeta(lst(ex(-1)));
+ return (e * (addzeta - H(lst(ex(-1)),1/arg).hold())).expand();
}
}
@@ -2696,7 +2696,7 @@ ex trafo_H_1mxt1px_prepend_minusone(const ex& e, const
ex& arg)
newparameter.prepend(-1);
return e.subs(h == H(newparameter, h.op(1)).hold()).expand();
} else {
- return (e * H(lst(-1),(1-arg)/(1+arg)).hold()).expand();
+ return (e * H(lst(ex(-1)),(1-arg)/(1+arg)).hold()).expand();
}
}
@@ -2727,7 +2727,7 @@ ex trafo_H_1mxt1px_prepend_one(const ex& e, const ex& arg)
newparameter.prepend(1);
return e.subs(h == H(newparameter, h.op(1)).hold()).expand();
} else {
- return (e * H(lst(1),(1-arg)/(1+arg)).hold()).expand();
+ return (e * H(lst(ex(1)),(1-arg)/(1+arg)).hold()).expand();
}
}
@@ -2806,7 +2806,7 @@ struct map_trafo_H_1mx : public map_function
// leading one
map_trafo_H_1mx recursion;
map_trafo_H_mult unify;
- ex res = H(lst(1), arg).hold() *
H(newparameter, arg).hold();
+ ex res = H(lst(ex(1)), arg).hold() *
H(newparameter, arg).hold();
std::size_t firstzero = 0;
while (parameter.op(firstzero) == 1) {
firstzero++;
@@ -2870,7 +2870,7 @@ struct map_trafo_H_1overx : public map_function
}
if (allthesame) {
map_trafo_H_mult unify;
- return
unify((pow(H(lst(-1),1/arg).hold() - H(lst(0),1/arg).hold(), parameter.nops())
+ return
unify((pow(H(lst(ex(-1)),1/arg).hold() - H(lst(ex(0)),1/arg).hold(),
parameter.nops())
/
factorial(parameter.nops())).expand());
}
} else {
@@ -2882,7 +2882,7 @@ struct map_trafo_H_1overx : public map_function
}
if (allthesame) {
map_trafo_H_mult unify;
- return
unify((pow(H(lst(1),1/arg).hold() + H(lst(0),1/arg).hold() + H_polesign,
parameter.nops())
+ return
unify((pow(H(lst(ex(1)),1/arg).hold() + H(lst(ex(0)),1/arg).hold() +
H_polesign, parameter.nops())
/
factorial(parameter.nops())).expand());
}
}
@@ -2925,7 +2925,7 @@ struct map_trafo_H_1overx : public map_function
// leading one
map_trafo_H_1overx recursion;
map_trafo_H_mult unify;
- ex res = H(lst(1), arg).hold() *
H(newparameter, arg).hold();
+ ex res = H(lst(ex(1)), arg).hold() *
H(newparameter, arg).hold();
std::size_t firstzero = 0;
while (parameter.op(firstzero) == 1) {
firstzero++;
@@ -2981,7 +2981,7 @@ struct map_trafo_H_1mxt1px : public map_function
}
if (allthesame) {
map_trafo_H_mult unify;
- return
unify((pow(-H(lst(1),(1-arg)/(1+arg)).hold() -
H(lst(-1),(1-arg)/(1+arg)).hold(), parameter.nops())
+ return
unify((pow(-H(lst(ex(1)),(1-arg)/(1+arg)).hold() -
H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops())
/
factorial(parameter.nops())).expand());
}
} else if (parameter.op(0) == -1) {
@@ -2993,7 +2993,7 @@ struct map_trafo_H_1mxt1px : public map_function
}
if (allthesame) {
map_trafo_H_mult unify;
- return unify((pow(log(2) -
H(lst(-1),(1-arg)/(1+arg)).hold(), parameter.nops())
+ return unify((pow(log(2) -
H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops())
/
factorial(parameter.nops())).expand());
}
} else {
@@ -3005,7 +3005,7 @@ struct map_trafo_H_1mxt1px : public map_function
}
if (allthesame) {
map_trafo_H_mult unify;
- return unify((pow(-log(2) -
H(lst(0),(1-arg)/(1+arg)).hold() + H(lst(-1),(1-arg)/(1+arg)).hold(),
parameter.nops())
+ return unify((pow(-log(2) -
H(lst(ex(0)),(1-arg)/(1+arg)).hold() + H(lst(ex(-1)),(1-arg)/(1+arg)).hold(),
parameter.nops())
/
factorial(parameter.nops())).expand());
}
}
@@ -3048,7 +3048,7 @@ struct map_trafo_H_1mxt1px : public map_function
// leading one
map_trafo_H_1mxt1px recursion;
map_trafo_H_mult unify;
- ex res = H(lst(1), arg).hold() *
H(newparameter, arg).hold();
+ ex res = H(lst(ex(1)), arg).hold() *
H(newparameter, arg).hold();
std::size_t firstzero = 0;
while (parameter.op(firstzero) == 1) {
firstzero++;
------------------------------------------------------------------------------
November Webinars for C, C++, Fortran Developers
Accelerate application performance with scalable programming models. Explore
techniques for threading, error checking, porting, and tuning. Get the most
from the latest Intel processors and coprocessors. See abstracts and register
http://pubads.g.doubleclick.net/gampad/clk?id=60136231&iu=/4140/ostg.clktrk
_______________________________________________
Fink-users mailing list
Fink-users@lists.sourceforge.net
List archive:
http://news.gmane.org/gmane.os.macosx.fink.user
Subscription management:
https://lists.sourceforge.net/lists/listinfo/fink-users
