ATL / WTL / STL

#include "HashimportFwd.h"

#import "libid:00020813-0000-0000-C000-000000000046" version("1.6") auto_search no_dual_interfaces rename("DialogBox", "excelDialogBox") rename("RGB", "excelRGB") rename("DocumentProperties", "excelDocumentProperties") rename("SearchPath", "excelSearchPath") rename("CopyFile", "excelCopyFile") rename("ReplaceText", "excelReplaceText")

struct ITest : public Excel::_Application {};

Stone Free wrote:

I'm trying to come up with some macros to make it configurable, but the inability to redefine a #define as part of another #define doesn't seem to be possible.

ERLN wrote:

Is it possible without .Net interface

class A
{
public:
   A(int i) : pi_(new int(i)) {}
   A(const A& a) : pi_(new int(*a.pi_)) {}
   A& operator=(const A& a)
   {
      *pi_ = *a.pi_;
   }
   ~A() { delete pi_; }
private:
   int* pi_;
};

#include <iostream>
#include <vector>

class Test
{
public:
   Test() { std::cout << "Test::Test()\n"; }
   Test( Test const& ) { std::cout << "Test::Test( Test const& )\n"; }
   Test& operator=( Test const& ) { std::cout << "Test::operator=( Test const& )\n"; return *this; }
   ~Test() { std::cout << "Test::~Test()\n"; }
};

int main (int argc, char const* argv[])
{
   std::vector<Test> a;
   std::cout << "push_back\n";
   a.push_back(Test());
   a.push_back(Test());
   a.push_back(Test());
   std::cout << "iterator\n";
   std::vector<Test>::iterator it = a.begin();
   ++it;
   std::cout << "erase\n";
   a.erase(it);
   return 0;
}

push_back
Test::Test()
Test::Test( Test const& )
Test::~Test()
Test::Test()
Test::Test( Test const& )
Test::Test( Test const& )
Test::~Test()
Test::~Test()
Test::Test()
Test::Test( Test const& )
Test::Test( Test const& )
Test::Test( Test const& )
Test::~Test()
Test::~Test()
Test::~Test()
iterator
erase
Test::operator=( Test const& )
Test::~Test()
Test::~Test()
Test::~Test()

mjackson11 wrote:

Constructing large vectors (200-500) entries is what's taking up so much time

AbhijitAkude wrote:

I am using IWebBrowser2 interface

template<class Type, int LowerBound, int HigherBound>
class TempClass { ... };

template<class lowerBoundType, class upperBoundType>
Class TempClass
{
…
};

template<typename lowerBoundType, typename upperBoundType>
Class TempClass
{
…
};

TempClass<float, float>* pT1.
TempClass<double, double>* pT1.
TempClass<int, int>* pT1.

template<typename boundryType>
Class TempClass
{
…
};

TempClass<float>* pT1. 

<div class="ForumSig">INTP
"Program testing can be used to show the presence of bugs, but never to show their absence."Edsger Dijkstra</div>