C / C++ / MFC Discussion Boards

Re: Worker Thread GUI

Eugen Podsypalnikov16-Apr-10 2:15

Eugen Podsypalnikov

16-Apr-10 2:15

Try the following Smile | :)

:
0. Repair the state of your project (see your starting post)
1. Place the new context class at the top of your cpp, after the include block
2. Modify your OnClick function
3. Modify your ThreadLoop function

virtual void BeHappy() = 0;

Re: Worker Thread GUI

MsmVc16-Apr-10 2:40

MsmVc

16-Apr-10 2:40

Sorry it's not working for me.
But i want to say once again Thanks for Discussion.

Re: Worker Thread GUI

Keith Worden19-Apr-10 3:34

Keith Worden

19-Apr-10 3:34

Don't use a thread to do this use a timer.

ListView Drag event ----LVN_BEGINDRAG

arun_pk15-Apr-10 22:04

arun_pk

15-Apr-10 22:04

OnNotify(HWND hDlg, int idCtrl, NMHDR *pnmh)
{
switch(pnmh->code)
{
case LVN_BEGINDRAG:
{
}
}
}

My code is like this
even after the dragging column of ListView i m not able catch the drag event inside case LVN_BEGINDRAG
am i missing something??

thanks in advance

any Concepto

Yonathan111115-Apr-10 21:24

Yonathan1111

15-Apr-10 21:24

Hello world,

I don't have any idea how do to make connection to a database using the language C. I preserve if it would be to SQL server.

Thanks

Re: any Concepto

CPallini15-Apr-10 21:49

CPallini

15-Apr-10 21:49

You may use, for instance ODBC, there are a lot of articles, here at CodeProject, in the database section [^].
Smile | :)

If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.

This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke

[My articles]

Re: any Concepto

Adam Roderick J15-Apr-10 22:19

Adam Roderick J

15-Apr-10 22:19

If you are using mysql then just have a look with the APIs provided by mysql
[^]

Величие не Бога может быть недооценена.

Re: any Concepto

«_Superman_»16-Apr-10 7:20

«_Superman_»

16-Apr-10 7:20

Take a look at documentation for the CDatabase and CRecordset MFC classes.
I believe this will be the easiest for a beginner.
In particular look at the CDatabase::Open[^] method.

«_Superman_»
I love work. It gives me something to do between weekends.

Microsoft MVP (Visual C++)

How could I write my xml document with indention By MSMXL

m_code15-Apr-10 21:17

m_code

15-Apr-10 21:17

Hi How could I write my xml document with indention By MSMXL6
Is there any way to cofigure this
a sample code my clear the case
regards

Re: How could I write my xml document with indention By MSMXL

Maximilien16-Apr-10 2:48

Maximilien

16-Apr-10 2:48

The only way i've been able to do this was to apply a XSL transform to the XML before saving it using the transformNodeToObject method of MSXML.

Good luck.

M.

Watched code never compiles.

Resorce file ....Custom Cursor

ForNow15-Apr-10 21:09

ForNow

15-Apr-10 21:09

Hi,

would any one where I can download or define a cursor such as the one in VIsual Studio uses when stepping thru code ???

also that round bullet used to signify breakpoint is nice dont know if that something I can define and or Load from my resource file

thankx

How to uninstall all modified files from previous setup installation

Chesnokov Yuriy15-Apr-10 20:08

Chesnokov Yuriy

15-Apr-10 20:08

The ordinary VS project setup that installs some application on computer does not delete files that were changed during program usage.

If installing that setup again on the same computer those files are not replaced with those from setup either.

How to enable setup to remove all files from and folders in spite the files were changed or added others?

Чесноков

About pointer assignment [modified]

milestanley15-Apr-10 15:31

milestanley

15-Apr-10 15:31

a.h: static ClassOne *one;
a.cpp: ClassOne::one = this; //So, can I do it like this?
But an error has occured: "expected constructor, destructor, or type conversion before '=' token"

modified on Thursday, April 15, 2010 9:54 PM

Re: About pointer assignment [modified]

Richard Andrew x6415-Apr-10 16:31

Richard Andrew x64

15-Apr-10 16:31

~~In a.cpp, try:~~

ClassOne *one = this;

What was I thinking?

modified on Thursday, April 15, 2010 10:44 PM

Re: About pointer assignment

Gwenio15-Apr-10 16:31

Gwenio

15-Apr-10 16:31

If I understand what you are asking, then it should be something like this:

- a.h

class ClassOne {
    //stuff
    void SetRef();
    //more stuff
};
static ClassOne* one;

- a.cpp

one(0);
inline void ClassOne::SetRef() {one = this;}

Your problems are:
- "this" is only valid inside class member methods.
- You do not need to have "ClassOne::" infront of "one" unless it is a static member of the class (it is declared within the scope of the class).

If "one" is a static member, this a.cpp would be as follows:

ClassOne * ClassOne::one(0);
inline void ClassOne::SetRef() {ClassOne::one = this;}

Re: About pointer assignment

Emilio Garavaglia15-Apr-10 20:46

Emilio Garavaglia

15-Apr-10 20:46

It seems you are confusing classes with instances (that is the same as confusing types with variables) local and global scope and linkage.

Assuming the declaration you provided are at file scope (that is, not enclosed in some other braces) one is a pointer to a ClassOne object. It exist at global level (the pointer!) and have only local visibility (local in respect to the cpp file that "sees" it, that are all the cpp files that include the h file - in other words, static has very few sense in h files)

ClassOne::one does not exist, since one is global, and not a part of ClassOne (hence the compiler doesn't know what to do), and than, this is meaningless since you are not inside a member function body.

At this point we cannot correct, since we cannot figure out what you where trying to do.

2 bugs found.
> recompile ...
65534 bugs found.
D'Oh! | :doh:

Re: About pointer assignment

KarstenK15-Apr-10 21:49

KarstenK

15-Apr-10 21:49

if you need a global object create one. If not you dont need a global pointer.

Press F1 for help or google it.
Greetings from Germany

Binary Tree Help-how to display a tree hierarchy

Member 382253215-Apr-10 14:35

Member 3822532

15-Apr-10 14:35

I have to display the contents of a binary tree in its "tree" form rather than a string of numbers.
I have a solution(i think) on how I'm suppose to display it.

My problem is that I keep getting a link error that looks like this:
"b11.obj : error LNK2001: unresolved external symbol "public: void __thiscall AVLTreeType<int>::rnl_inorderTraversal(void (__cdecl*)(int ..."

I know its the display hierarchy component of the program specifically, but I don't know what.
I'm using Visual Studio 08.
Thanks in advance.

and sorry for the long post.
I just thought people would at least want the functional parts of the binary tree class code.

here's most of the binary tree class code:
at the very bottom is the rnl_inorderTraversal function I'm having trouble with.

//file name avlTree.h
#include <iostream>
using namespace std;

template<class T>  //class element type T
struct AVLNode
{
	T info;
	int bfactor;               // balance factor
	AVLNode<T> *llink;
	AVLNode<T> *rlink;
};
template <class T>
class AVLTreeType
{
  public:

	void insert(const T &newItem);

    void postorderTraversal(void (*visit)(T&) );
   
	void rnl_inorderTraversal(void (*visit)(T&,int));
	
	int treeHeight();
    int treeNodeCount();
    int treeLeavesCount();
    void destroyTree();
    AVLTreeType();  //default constructor
	
  private:
    AVLNode<T>* root;
	
	
	
	//associated with insert
    void rotateToLeft(AVLNode<T>* &root);
    void rotateToRight(AVLNode<T>* &root);
    void balanceFromLeft(AVLNode<T>* &root);
    void balanceFromRight(AVLNode<T>* &root);
    void insertIntoAVL(AVLNode<T>* &root,AVLNode<T>  *newNode, bool& isTaller);

	void rnl_inorder(AVLNode<T> *p,void(*visit)(T&,int),int);

   
    void postorder(AVLNode<T> *p, void (*visit)(T&) );
    
    void destroy(AVLNode<T>* &p);
};



template<class T>
void AVLTreeType<T>::rotateToLeft(AVLNode<T>* &root)
{
     AVLNode<T> *p; //pointer to the root of the
                           //right subtree of root
     if(root == NULL)
        cerr<<"Error in the tree."<<endl;
     else
        if(root->rlink == NULL)
           cerr<<"Error in the tree:"
               <<" No right subtree to rotate."<<endl;
        else
        {
            p = root->rlink;
            root->rlink = p->llink; //the left subtree of p 
                             //becomes the right subtree of root
            p->llink = root; 
            root = p;	//make p the new root node
        }
}//end rotateTOLeft

template<class T>
void AVLTreeType<T>::rotateToRight(AVLNode<T>* &root)
{
     AVLNode<T> *p;  //pointer to the root of	
                            //the left subtree of root

     if(root == NULL)
        cerr<<"Error in the tree."<<endl;
     else
        if(root->llink == NULL)
           cerr<<"Error in the tree:"
               <<" No left subtree to rotate."<<endl;
        else
        {
           p = root->llink;
           root->llink = p->rlink; //the right subtree of p 
                           //becomes the left subtree of root
           p->rlink = root; 
           root = p;	//make p the new root node
        }
}//end rotateToRight

template<class T>
void AVLTreeType<T>::balanceFromLeft(AVLNode<T>* &root)
{
     AVLNode<T> *p;
     AVLNode<T> *w;

     p = root->llink;   //p points to the left subtree of root

     switch(p->bfactor)
     {
     case -1: root->bfactor = 0;
              p->bfactor = 0;
              rotateToRight(root);
              break;
     case 0:  cerr<<"Error: Cannot balance from the left."<<endl;
              break;
     case 1:  w = p->rlink;
              switch(w->bfactor)  //adjust the balance factors
              {
              case -1: root->bfactor = 1;
                       p->bfactor = 0;
                       break;
              case 0:  root->bfactor = 0;
                       p->bfactor = 0;
                       break; 
              case 1:  root->bfactor = 0;
                       p->bfactor = -1;
              }//end switch

              w->bfactor = 0;	
              rotateToLeft(p);
              root->llink = p;
              rotateToRight(root);
     }//end switch;
}//end balanceFromLeft

template<class T>
void AVLTreeType<T>::balanceFromRight(AVLNode<T>* &root)
{
     AVLNode<T> *p;
     AVLNode<T> *w;

     p = root->rlink;   //p points to the right subtree of root

     switch(p->bfactor)
     {
     case -1: w = p->llink;
              switch(w->bfactor)  //adjust the balance factors
              {
              case -1: root->bfactor = 0;
                       p->bfactor = 1;
                       break;
              case 0:  root->bfactor = 0;
                       p->bfactor = 0;
                       break;		
              case 1:  root->bfactor = -1;
                       p->bfactor = 0;
              }//end switch

              w->bfactor = 0;	
              rotateToRight(p);
              root->rlink = p;
              rotateToLeft(root);
              break;
     case 0:  cerr<<"Error: Cannot balance from the right."<<endl;
              break;
     case 1:  root->bfactor = 0;
              p->bfactor = 0;
              rotateToLeft(root);
     }//end switch;
}//end balanceFromRight


template<class T>
void AVLTreeType<T>::insert(const T &newItem)
{
     bool isTaller = false;
     AVLNode<T>  *newNode;

     newNode = new AVLNode<T>;
     newNode->info = newItem;
     newNode->bfactor = 0;
     newNode->llink = NULL;
     newNode->rlink = NULL;

     insertIntoAVL(root, newNode, isTaller);
}//end insert



template<class T>
void AVLTreeType<T>::insertIntoAVL(AVLNode<T>* &root, 
			   AVLNode<T>  *newNode, 
			   bool& isTaller)
{
    if(root == NULL)
    {
       root = newNode;
       isTaller = true;
    }
	else 
		if(root->info == newNode->info)
          cerr<<"No duplicates are allowed."<<endl;
	else 
		if(root->info > newNode->info) //newItem goes in 
                                         //the left subtree
          {
             insertIntoAVL(root->llink, newNode, isTaller);

             if(isTaller)             //after insertion, the 
                                      //subtree grew in height
                switch(root->bfactor)
                {
                case -1: balanceFromLeft(root);
                         isTaller = false;
                         break;
                case 0:  root->bfactor = -1;
                         isTaller = true;
                         break;
                case 1:  root->bfactor = 0;
                         isTaller = false;
                }//end switch
          }//end if
          else
          {
             insertIntoAVL(root->rlink, newNode, isTaller);

             if(isTaller)              //after insertion, the 
                                       //subtree grew in height
                switch(root->bfactor)
                {
                case -1: root->bfactor = 0;
                         isTaller = false;
                         break;
                case 0:  root->bfactor = 1;
                         isTaller = true;
                         break;
                case 1:  balanceFromRight(root);
                         isTaller = false;
                }//end switch
          }//end else
}//end insertIntoAVL

template <class T> 
void AVLTreeType<T>::postorderTraversal(void (*visit)(T& item) )
{
	postorder(root, *visit);
}

template <class T> 
void AVLTreeType<T>::postorder(AVLNode<T> *p, 
                             void (*visit)(T& item) )
{
        if(p != NULL)
        {
                postorder(p->llink, *visit);
         
                postorder(p->rlink, *visit);
      (*visit)(p->info);      //function in client file
	 } 
}


template <class T> 
void AVLTreeType<T>::destroy(AVLNode<T>* &p) 
{    
        if(p != NULL)
        {
                destroy(p->llink);
                destroy(p->rlink);
                delete p;
                p = NULL;
        }
}

template <class T>
void  AVLTreeType<T>::destroyTree()
{
        destroy(root);
}

template<class T>
AVLTreeType<T>::AVLTreeType()
{
	root=NULL;
}


template<class T>
void rnl_inorderTraversal(void(*visit)(T&,int))
{
int iLevel=0;
rnl_inorder(root,*visit,iLevel);
}


template<class T>
void rnl_inorder(AVLNode<T> *p,void(*visit)(T&,int),int)
{
	if(p != NULL)
        {
               
				iLevel+1;	
				rnl_inorder(p->rlink,*visit,iLevel);
                (*visit)(p->info);      //function in client file
                rnl_inorder(p->llink,*visit,iLevel)
		} 
}

here's the code for main.
specifically, the areas which rnl_inorderTraversal is used.

#include <iostream>  
#include <iomanip>   
#include"avlTree.h"
#include <fstream>
                     
using namespace std;
//function prototype 
template<class T> 
void displayHierarchial(T& anItem, int level);


int main()
{

AVLTreeType<int> cTree1;
cTree1.insert(1);
cTree1.insert(2);
cTree1.insert(4);
cTree1.rnl_inorderTraversal(displayHierarchial);



return 0;
//function definition 
template<class T>    
void displayHierarchial (T& anItem, int level)
{
  cout <<level<<".) "<< anItem<<' '; //display number from binary tree
}

Re: Binary Tree Help-how to display a tree hierarchy

Gwenio15-Apr-10 15:23

Gwenio

15-Apr-10 15:23

template<class T>
void rnl_inorder(AVLNode<T> *p,void(*visit)(T&,int),int){
	if(p != NULL)
        {
               	iLevel+1;
		rnl_inorder(p->rlink,*visit,iLevel);
                (*visit)(p->info);      //function in client file
                rnl_inorder(p->llink,*visit,iLevel)
	}
 }

Should be:

template<class T>
void AVLTreeType<T>::rnl_inorder(AVLNode<T> *p,void(*visit)(T&,int),int){
	if(p != NULL)
        {
               	iLevel+1;
		rnl_inorder(p->rlink,*visit,iLevel);
                (*visit)(p->info);      //function in client file
                rnl_inorder(p->llink,*visit,iLevel);
	}
 }

To fix the error you posted. You forgot to tell it that this is the definition for a method of that class. Also I put in a missing semicolon.

Re: Binary Tree Help-how to display a tree hierarchy

Member 382253215-Apr-10 15:52

Member 3822532

15-Apr-10 15:52

The whole time I thought it was something else, I didn't think to even question my syntax.
Thanks a lot!

WinHelp for Mobile Windows CE 6.0

Software200715-Apr-10 8:55

Software2007

15-Apr-10 8:55

CWinApp::WinHelp doesn't work for Mobile CE 6.0 target apps ( VS 2009), neither does the HTML Help. Anyone with experience on how to launch help from Pocket PC apps?

Re: WinHelp for Mobile Windows CE 6.0

Eugen Podsypalnikov15-Apr-10 20:17

Eugen Podsypalnikov

15-Apr-10 20:17

You could use CHtmlView or IE to open *.html.
You have also to split your *.chm (if any) to the *.html firstly Smile | :)

virtual void BeHappy() = 0;

How to combine Menu and toolbar to one line?

Software200715-Apr-10 6:05

Software2007

15-Apr-10 6:05

I would like to combine a simple menu of two items and a simple toolbarof two icons as well into same bar.
right now m_wndCommandBar.InsertMenuBar(IDR_MAINFRAME) and m_wndToolBar.LoadToolBar(IDR_MAINFRAME) will create them on two different bars? How can I combine?
Note, I used to be able to do this in previous versions of Visual Studio by ::InsertButtons(...)
Thanks

Re: How to combine Menu and toolbar to one line?

Iain Clarke, Warrior Programmer15-Apr-10 6:16

Iain Clarke, Warrior Programmer

15-Apr-10 6:16

Is this article any help to you?

http://www.datamekanix.com/articles/side-by-side/[^]

This assumes your menu is one of them new fangled floaty dock-y type things.

Iain.

I have now moved to Sweden for love (awwww).

Re: How to combine Menu and toolbar to one line?

«_Superman_»15-Apr-10 7:08

«_Superman_»

15-Apr-10 7:08

Take a look here - A set of classes to create the IE-style GUI[^]

«_Superman_»
I love work. It gives me something to do between weekends.

Microsoft MVP (Visual C++)

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.