Hi Konstantin, please try the current C-Reduce and see if it's a bit
faster. It finished for me in about 2 hours, 15 minutes. Reduced
output is below.
Yang, please take a look at this output and try to figure out what
tricks can be used to make it smaller...
John
extern "C" namespace std {
template < class _TypeU> struct A { typedef _TypeU
second_type; second_type second; }; template
<class _TypeT, class _TypeU> A< _TypeU> make_pair (_TypeT , _TypeU ) ;
template <class _TypeT> class B {
public: typedef _TypeT value_type; typedef
value_type* pointer; }; template <class _TypeT, class =
B<_TypeT> > class C; template <class , class _Allocator> class C
{ typedef _Allocator allocator_type; typedef
typename allocator_type::pointer pointer; typedef pointer
iterator; iterator _C_make_iter () ; public: C
(const allocator_type &p1 = allocator_type ()) : _C_alloc (p1) {
} ~C () { begin (); }
iterator begin () { return _C_make_iter ();
} struct _C_VectorAlloc: allocator_type {
_C_VectorAlloc ( allocator_type ) : allocator_type ()
{ } } _C_alloc; }; }
template< typename ValueT >
class D { public: std::A< bool> insert(
std::A< ValueT> ) ; };
void
RewriteHeapSROALoadUser( D< std::C<int*> > &p1) {
if (p1.insert(std::make_pair(0,
std::C<int*>())).second) return; }
