Managed C++/CLI

19-May-08 23:32

Hai

Thanks for reply

I want to know want key is pressed by user.
I think KeyData will provide that user pressed keydata but it returns key.
I dont know how to store the return value as string.

So i used this keyvalue .
i wrote like this

int ^ keyvalue = e->KeyValue;
String ^data = keyvalue->ToString();

Can you tell me how to store the keydata as string. I am using .net framework 2.0 version(windows form application);

thanks,

Re: keyeventargs

rose19620-May-08 0:38

create an Event to a TreeView

20-May-08 0:38

Hai

Thanks, The problem is solved.

sabeeshcs19-May-08 2:42

sabeeshcs

19-May-08 2:42

Hello,
I have a class in MFC and I want to use this class in Windows forms. For that I create a .dll file using the MFC class and load that .dll file in to CLR project and draw that object in Windows form. But now I want to add an event to that new control. How can I do this?
eg:
I have a ctreeview in MFC and I create a .dll file using that MFC class and open a CLR project in VC++2008 and add a form to that project and load that .dll file. Then I can access that MFC class in my new Windows form ( in CLR project ). and it is working. But my current problem is that, I want to read selected node value from that tree node to my Windows forms's text entry. How can I do this? I think, for that we need to add an event ( After select ) to that control. But that control is loaded from .dll file.
How can I solve this problem?
Please help me.

Re: create an Event to a TreeView

led mike19-May-08 4:31

led mike

19-May-08 4:31

This is the second time you have posted this question. There are many details involved in building mixed mode applications. Far more than can be imparted to you in a simple forum reply.

However you are in luck because there are many resources on MSDN web site and here on Code Project in the form of articles and example code on this subject. It also seems you do not yet understand basic constructs like how events work, spend some time on this as well.

I strongly suggest you stop typing messages into forums and start reading and researching the subject.

led mike

How to expose mixed class as COM class [modified typo rectified]

jayart18-May-08 23:50

jayart

18-May-08 23:50

I am at an initial stage of converting a mixed class to make it COM class. (and eventually a complete project)
I googled a bit but have found information only for managed(C#) class.
Typically the mixed class would look like

// (in .h file)
namespace MyNameSpace
{
public __gc class CPoint
{
public:
       CPoint();
       ~CPoint();
       CPoint(float x, float y, float z);
     __property void  set_X(float x){ m_pPoint->m_x = x; }
     __property float get_X() {return m_pPoint->m_x;}
public private: 
 // some functions here
};

I have to expose this class as a COM class. I need an interface too.
But not sure how to do this. Any link or information will be very helpful.

modified on Monday, May 19, 2008 5:59 AM

Re: How to expose mixed class as COM class [modified typo rectified]

jayart19-May-08 0:15

jayart

19-May-08 0:15

Looks like I have to implement CCW (COM Collable wrapper) for the mixed class.
Any examples or links in this regard wil be great.

keyword color change

rose19618-May-08 23:38

problem using Standard Template Libarary List using eclipse

18-May-08 23:38

Hai,

I just want to change the color of certain keyword, while typing itself, for that i am using the rtf format. For this which event handler shall i use. if i use textchange event it shows the error as follows.

An unhandled exception of type 'System.StackOverflowException' occurred in System.Windows.Forms.dll

My code is as follows.

private: System::Void lettertyped(System::Object^ sender, System::EventArgs^ e)
{
array<String^>^ keyword = gcnew array<String^>{"#include","#define","struct","int","char","void","float","double","longint","long","if","else","true","false","return"};
int length = keyword->Length;
String ^ strRTF = this->richTextBox1->Rtf;
int iCTableStart = strRTF->IndexOf("colortbl;");
if (iCTableStart != -1)
{
int iCTableEnd = strRTF->IndexOf('}', iCTableStart);
strRTF = strRTF->Remove(iCTableStart, iCTableEnd - iCTableStart);
strRTF = strRTF->Insert(iCTableStart,
"colortbl ;\\red255\\green0\\blue0;\\red0\\green128\\blue0;\\red0\\green0\\blue255;}");
}
else
{
int iRTFLoc = strRTF->IndexOf("\\rtf");
int iInsertLoc = strRTF->IndexOf('{', iRTFLoc);
if (iInsertLoc == -1) iInsertLoc = strRTF->IndexOf('}', iRTFLoc) - 1;
strRTF = strRTF->Insert(iInsertLoc,
"{\\colortbl ;\\red128\\green0\\blue0;\\red0\\green128\\blue0;\\red0\\green0\\blue255;}");
}
int len = strRTF->Length;
String^ tempst;
String^ result;
String ^key;
//String ^strReplace;
String ^slash = "/*";
String ^endslash = "*/";
String ^commentlinestr = "//";
char startquots = '"';
char endquots = '"';
int keylen;
int iRTFLoc;
int intslash;
int stquotes;
//int endquotes;
int commentline;
bool found = false;
bool spacefound = false;
bool starcomment = true;
bool slashcomment = false;
bool endquot = false;
int nlen = strRTF->Length;
for(int nchRTF = 0;nchRTF < nlen;nchRTF++)
{
if(strRTF[nchRTF] == ' ' || strRTF[nchRTF] == '\n' || strRTF[nchRTF] == '"' || strRTF[nchRTF] == ';' || strRTF[nchRTF] == '(' || strRTF[nchRTF] == ',' /*|| strRTF[nchRTF] == '*' */)
{
//Keyword
for(int nkeyword = 0;nkeyword<length;nkeyword++)
{
key = keyword[nkeyword];
keylen = key->Length;
iRTFLoc = tempst->IndexOf(keyword[nkeyword]);
if(/*iRTFLoc >= 0*/ tempst->Contains(key))
{
found = true;
break;
}
}
if(found)
{
if(starcomment)
{
int location = 4+iRTFLoc+keylen+1;
tempst = tempst->Insert( iRTFLoc,"\\cf3 ");
tempst = tempst->Insert( location,"\\cf0 ");
}
found = false;
}

tempst = String::Concat(tempst, strRTF[nchRTF]);

//Single Comment line

if(strRTF[nchRTF] == '\n')
{

if(slashcomment)
{
int newlen = tempst->Length;
tempst = tempst->Insert(newlen,"\\cf0");
slashcomment = false;
}
}

commentline = tempst->IndexOf(commentlinestr);
if(commentline >= 0)
{
tempst = tempst->Insert( commentline,"\\cf2 ");
slashcomment = true;
}

// Quotes

if(strRTF[nchRTF] == '"')
{
if(endquot)
{
int quoteslen = tempst->Length;
tempst = tempst->Insert(quoteslen,"\\cf0");
endquot = false;
}
else
stquotes = tempst->IndexOf(startquots);
if(stquotes >= 0)
{
tempst = tempst->Insert( stquotes,"\\cf1");
endquot = true;
}
}
//Group comment line

intslash = tempst->IndexOf(slash);
if(intslash >= 0)
{
starcomment = false;
tempst = tempst->Insert( intslash,"\\cf2 ");
}

int intslashend = tempst->IndexOf(endslash);
if(intslashend >= 0)
{
tempst = tempst->Insert( intslashend + 2 ,"\\cf0 ");
starcomment = true;
}

//Concat the string

result = String::Concat(result,tempst);
tempst = String::Empty;
}
else
{
tempst = String::Concat(tempst,strRTF[nchRTF] );
}
}
result = String::Concat(result,tempst);
tempst = String::Empty;
this->richTextBox1->Rtf = result;
this->richTextBox1->SelectionStart = this->richTextBox1->Text->Length;

}
in this code is working fine while opening the file.

Thanks
Mani,

cronos4d16-May-08 14:42

cronos4d

16-May-08 14:42

I am using eclipse for C++ and powerpc-apple-darwin9-gcc-4.0.1 as my compiler.

I am trying to compile a code example, butI am running into the following problem with an include of a standard library.

here is the main program:

[code]
// File: prg3_1.cpp
// the program compares the efficiency of the sequential
// and binary search by timing algorithm execution using the
// timer class. two integer arrays list1 and list2
// of size ARRAY_SIZE are initialized with the same random
// integers in the range 0 to 999,999. initialize the array
// targetList having TARGET_SIZE elements to contain other
// random numbers in the same range. time the selection sort
// as it sorts list2 and output the result. using the
// elements in array targetList as target values for the
// sequential and binary searches, time each algorithm and
// output the results

#include <iostream>

#include "d_search.h"	// generic sequential and binary searches
#include "d_sort.h"		// generic selection sort
#include "d_random.h"	// random number generation
#include "d_timer.h"		// time events

using namespace std;

int main()
{	const int ARRAY_SIZE = 100000, TARGET_SIZE = 50000;

	// arrays for the search
   int list1[ARRAY_SIZE], list2[ARRAY_SIZE], targetList[TARGET_SIZE];
	int i;

	// t used for timing the search algorithms
	timer t;
	// random number object
	randomNumber rnd;

	// initialize the arrays with random numbers in the
   // range 0 to 999,999 
   for (i = 0; i < ARRAY_SIZE; i++)
		list1[i] = list2[i] = rnd.random(1000000);

	// initialize targetList with random numbers in the
   // same range 0 to 999,999 
	for (i=0;i < TARGET_SIZE; i++)
		targetList[i] = rnd.random(1000000);

	// sort list2
   cout << "Timing the Selection Sort" << endl;
	t.start();		// start timer
	selectionSort(list2,ARRAY_SIZE);
	t.stop();		// stop timer
	cout << "Selection Sort takes " << t.time()
		  << " seconds." << endl;

   cout << endl << "Timing the Sequential Search" << endl;
	t.start();		// start timer
	// perform sequential search with elements from list2
 	for (i = 0; i < TARGET_SIZE; i++)
		seqSearch(list1,0,ARRAY_SIZE,targetList[i]);
	t.stop();		// stop timer
	cout << "Sequential Search takes " << t.time()
		  << " seconds." << endl;

	cout << endl << "Timing the Binary Search" << endl;
	t.start();		// start timer
	// perform binary search with elements from list1
 	for (i = 0; i < TARGET_SIZE; i++)
		binSearch(list2,0,ARRAY_SIZE,targetList[i]);
	t.stop();		// stop timer
	cout << "Binary Search takes " << t.time()
		  << " seconds." << endl;

	return 0;
}

/*
Run:

Timing the Selection Sort
Selection Sort takes 126.912 seconds.

Timing the Sequential Search
Sequential Search takes 132.889 seconds.

Timing the Binary Search
Binary Search takes 0.08 seconds.
*/

[/code] </iostream>

here is the included header file:

[code]
#ifndef SEARCH_FUNCTIONS
#define SEARCH_FUNCTIONS

#include <vector>
#include <list>

using namespace std;

// perform a sequential search of an integer array for a target
// in the index range [first, last). return the index of a
// match or last if the target is not in arr
int seqSearch(const int arr[], int first, int last, int target);

// perform  asequential search for a target in the index range
// [first, last).  return the index of a match or last if the
// target is not in arr
template <typename t="">
int seqSearch(const T arr[], int first, int last, const T& target);

// perform a binary search of an integer array for a target
// in the index range [first, last). return the index of a
// match or last if the target is not in arr
int binSearch(const int arr[], int first, int last, int target);

// perform a binary search of an array for a target
// in the index range [first, last). return the index of a
// match or last if the target is not in arr
template <typename t="">
int binSearch(const T arr[], int first, int last, const T& target);

// vector version of the sequential search
template <typename t="">
int seqSearch(const vector<t>& v, int first, int last, const T& target);

// vector version of the binary search
template <typename t="">
int binSearch(const vector<t>& v, int first, int last, const T& target);

// perform the sequential search for target in the list
// iterator range [first, last). return an iterator pointing
// at the target in the list or last if target is not found
template <typename t="">
list<t>::iterator seqSearch(list<t>::iterator first,
									 list<t>::iterator last, const T& target);

// perform the sequential search for target in the container
// iterator range [first, last). return an iterator pointing
// at the target in the container or last if target is not
// found
template <typename iterator,="" typename="" t="">
Iterator find(Iterator first, Iterator last, const T& target);

// ***********************************************************
//      search function implementations
// ***********************************************************

int seqSearch(const int arr[], int first, int last, int target)
{
	int i;

   // scan indices in the range first <= i < last
	for(i=first; i < last; i++)
		if (arr[i] == target)
			return i;				// immediately return on a match

	return last;					// return last if target not found
}

template <typename t="">
int seqSearch(const T arr[], int first, int last, const T& target)
{
	int i;

   // scan indices in the range first <= i < last
	for(i=first; i < last; i++)
		if (arr[i] == target)	// assume T has the "==" operator
			return i;				// immediately return on a match

	return last;					// return last if target not found
}

int binSearch(const int arr[], int first, int last, int target)
{
	int mid;						// index of the midpoint
	int midValue;				// object that is assigned arr[mid]
	int origLast = last;		// save original value of last
	
	while (first < last)		// test for nonempty sublist
	{
		mid = (first+last)/2;
		midValue = arr[mid];
		if (target == midValue)
			return mid;			// have a match
      // determine which sublist to search
		else if (target < midValue)
			last = mid;			// search lower sublist. reset last
		else
			first = mid+1;		// search upper sublist. reset first
	}

	return origLast;			// target not found
}

template <typename t="">
int binSearch(const T arr[], int first, int last, const T& target)
{
	int mid;						// index of the midpoint
	T midValue;					// object that is assigned arr[mid]
	int origLast = last;		// save original value of last
	
	while (first < last)		// test for nonempty sublist
	{
		mid = (first+last)/2;
		midValue = arr[mid];
		if (target == midValue)
			return mid;			// have a match
      // determine which sublist to search
		else if (target < midValue)
			last = mid;			// search lower sublist. reset last
		else
			first = mid+1;		// search upper sublist. reset first
	}

	return origLast;			// target not found
}

template <typename t="">
int seqSearch(const vector<t>& v, int first, int last, const T& target)
{
	int i;

   // scan indices in the range first <= i < last
	for(i=first; i < last; i++)
		if (v[i] == target)		// assume T has the "==" operator
			return i;				// immediately return on a match

	return last;					// otherwise return last
}

template <typename t="">
int binSearch(const vector<t>& v, int first, int last, const T& target)
{
	int mid;						// index of the midpoint
	T midvalue;					// object that is assigned v[mid]
	int origLast = last;		// save original value of last
	
	while (first < last)		// test for nonempty sublist
	{
		mid = (first+last)/2;
		midvalue = v[mid];
		if (target == midvalue)
			return mid;			// have a match
      // determine which sublist to search
		else if (target < midvalue)
			last = mid;			// search lower sublist. reset last
		else
			first = mid+1;		// search upper sublist. reset first
	}

	return origLast;			// target not found
}

template <typename t="">
list<t>::iterator seqSearch(list<t>::iterator first,
									 list<t>::iterator last, const T& target)
{
	// start at location first
	list<t>::iterator iter = first;

	// compare list elements with item until either
	// we arrive at last or locate item 
	while(iter != last && !(*iter == target))
		iter++;

	// iter either points at item or is last
	return iter;
}

template <typename iterator,="" typename="" t="">
Iterator find(Iterator first, Iterator last, const T& target)
{
	Iterator iter = first;

	// scan iterator range [first, last), stopping
	// if the loop locates target
	while (iter != last && *iter != target)
		iter++;

	// if target located, iter points at it; otherwise
	// is has value last
	return iter;
}

#endif   // SEARCH_FUNCTIONS

[/code]</typename></t></t></t></t></typename></t></typename></t></typename></typename></typename></typename></t></t></t></typename></t></typename></t></typename></typename></typename></list></vector>

the error seems to be when I call the list template. the syntax check in eclipse says
"expected constructor, destructor, or type conversion before 'seqSearch'

here is the error output of the build:

[code]
make all 
Building file: ../source/prg3_1.cpp
Invoking: GCC C++ Compiler
g++ -O0 -g3 -Wall -c -fmessage-length=0 -MMD -MP -MF"source/prg3_1.d" -MT"source/prg3_1.d" -o"source/prg3_1.o" "../source/prg3_1.cpp"
"../source/d_search.h:43: error: expected constructor, destructor, or type conversion before 'seqSearch'
"../source/d_search.h:164: error: expected constructor, destructor, or type conversion before 'seqSearch'
"../source/d_sort.h: In function 'void distribute(const std::vector<int, std::allocator<int=""> >&, std::queue<int, std::deque<int,="" std::allocator<int=""> > >*, int)':
"../source/d_sort.h:234: warning: comparison between signed and unsigned integer expressions
make: *** [source/prg3_1.o] Error 1

[/code]</int,></int,>

any help is appreciated

thanks in advance.

Re: problem using Standard Template Libarary List using eclipse

Christian Graus19-May-08 21:56

Christian Graus

19-May-08 21:56

C++/CLI is the .NET extensions to C++, which Eclipse does not support. I know it's not as clear as it could be, but the visual C++ forum is the place to ask this.

Memory leak detection

s196675m15-May-08 19:00

s196675m

15-May-08 19:00

In my Form application, I have created several object pointer using new operator. These objects are of Templated class and classed are exist in a separate lib (native c++ but compiled with /clr). I found my application is leaking momory. I tried to track all new and delete pair but still there is memery leak exist.

I search for memory leak detector but most free tools are for native c++.

How can I delect the memery leak in managed form which are due to new and delete pair.

Any idea or links to right tool will be highly appreciated.
Thank you

caret

rose19614-May-08 23:17

14-May-08 23:17

Hai

I am using .net windows form application, richtextbox control for creating a text editor. I don't know how to get caret position. Is there any command available to get the caret position. Can you tell me & give example.

Thanks in advance
Mani.

Giorgi Dalakishvili15-May-08 2:01

15-May-08 2:01

Here you go: Get the position of the caret[^]

In .Net Framework 3.0 there RichTextBox class has a property called CaretPosition

Giorgi Dalakishvili

#region signature
my articles
#endregion

Re: caret [modified]

rose19615-May-08 16:51

15-May-08 16:51

Hai

Thanks for reply,

Here i am using .Net Framework 2.0,Mc++. Is here any command like caretposition.
can you tell me.

Thanks

modified on Thursday, May 15, 2008 10:58 PM

Giorgi Dalakishvili15-May-08 22:22

15-May-08 22:22

Did you have a look at the link I suggested?

Giorgi Dalakishvili

#region signature
my articles
#endregion

rose19616-May-08 0:39

16-May-08 0:39

Hai

Thanks for reply.

I saw that, actually what i want is i want to move the cursor position to the end of the file. while open the file. For that i want to know how to move the caret from one place to another place.

your attached document is very helpful for me.

Thanks again,
Mani,

Giorgi Dalakishvili16-May-08 4:44

16-May-08 4:44

Do you want to move caret to the end of the text in a textbox or do you want to move cursor position in the stream you are reading from?

Giorgi Dalakishvili

#region signature
my articles
#endregion

rose19618-May-08 18:36

18-May-08 18:36

Hai

Thanks for reply

I want to move the caret position to end of the textbox.

Thanks,
Mani,

Giorgi Dalakishvili18-May-08 21:30

18-May-08 21:30

Here you go: cursor position in textbox [^]

Giorgi Dalakishvili

#region signature
my articles
#endregion

Thank you

rose19618-May-08 22:35

18-May-08 22:35

Hai

Thank you very much your answers are very helpful to me.

Thanks again,
Mani,

Re: Thank you

Giorgi Dalakishvili19-May-08 8:37