dev-cpp-users Mailing List for Dev-C++

Psymaster ??????? wrote:
> Well, I link with -lmingw32 -lSDLmain -lSDL -mwindows

Then I got no idea. The linker errors say, that you don't have a 
WinMain, and sdl_init. Do the compiler finds those libs?

--
Greetings,
   Balázs

>
>Do you link with libSDL.a (or something similar) and the windows
>subsystem (-mwindows)?
>
>--
>Greetings,
>    Balázs
>

Well, I link with -lmingw32 -lSDLmain -lSDL -mwindows

_________________________________________________________________
The new MSN 8: advanced junk mail protection and 2 months FREE* 
http://join.msn.com/?page=features/junkmail

I am sure this has got to be simple, but I have yet to find any
documetation....

How can you print to the printer instead of the screen in C++

Thanks for any help,
Jay

On Sat, Jun 07, 2003 at 09:38:34PM +0200, Per Westermark wrote:
> [...]
> 
> I know it's a bit extra noisy with dual indirection, but since the code
> is C and not C++, slstore() can't take references to pointers.
> 
> /Per W

Probably, he could have avoided the double indirection using
something like:

  struct slist
  {
     struct address *start;
     struct address *last;
  };

so that a pointer to "struct slist" would be used, still allowing
all changes to "start" and "last" to be made.

-- 
>> gisan >>

The code below should work ok for a copy constructor. My note about
assigning to a non-empty tree is based on the assumption that you would
like to use copyTree() to implement an assignment operator too, an then
the target BST might already contain a tree.

/Per W

On Sun, 8 Jun 2003, Socha, David F wrote:

> Would a copy constructor as such work:
>
>
> template <typename T> BST<T>::BST(const BST& origTree){     //copy constructor
>
>
> 		if(origTree.root){
>
> 				copyTree(origTree.root, root);
>
> 		}
>
> 		else{
>
> 				root = NULL;
>
> 		}
>
> }
>
>
> also, what do you mean by assigning to a non-empty tree.  I would think that the copy constructor would simply make a fresh (new) copy of the tree.  I dont understand why you would have to worry about releasing memory for a non empty tree
>
> thanks,
>
> David Socha
>
> here is the copy tree code again
>
>
> > > /****************************************************************************
> > >
> > > copyTree function
> > >
> > > Used by the copy constructor to copy the tree
> > >
> > > Sent: pointer to the original node, pointer to the node being copied to
> > >
> > > Returns: Nothing
> > >
> > > Works by: Creating a new node on the tree being copied, copy the data to the
> > >
> > > node, checks to see if a left node exists on the tree, if yes
> > >
> > > repeat the process using on the left node, if not, do nothing.  Then checks
> > >
> > > the right, if it exists repeat process on the right side, if not, do nothing
> > >
> > >  NOTE: This function is a recursive process
> > >
> > > ****************************************************************************/
> > >
> > >
> > >
> > > template<typename T> void BST<T>::copyTree(Node* origNode, Node* copyNode){
> > >
> > >      copyNode = new Node(origNode->data);
> > >
> > >
> > >
> > >      if(origNode->left){
> > >
> > >           copyTree(origNode->left, copyNode->left);
> > >
> > >      }
> > >
> > >
> > >
> > >      if(origNode->right){
> > >
> > >           copyTree(origNode->right, copyNode->right);
> > >
> > >      }
> > >
> > > }
> > >
> > > //End copyTree
>
>
>
>
> -------------------------------------------------------
> This SF.net email is sponsored by:  Etnus, makers of TotalView, The best
> thread debugger on the planet. Designed with thread debugging features
> you've never dreamed of, try TotalView 6 free at www.etnus.com.
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> TO UNSUBSCRIBE: http://www.noicys.cjb.net/devcpp/ub.htm
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
>

Could someone who remembers send me a reminder of how
to unsubscribe? 

__________________________________
Do you Yahoo!?
Yahoo! Calendar - Free online calendar with sync to Outlook(TM).
http://calendar.yahoo.com

Psymaster ??????? wrote:
> Could you please help me? I have tried dev-c++ packages and it always 
> gives an error about "winmain@16" or "SDL_init" something. I think I'm 
> doing everything right, I've added the compiler command-line options, 
> and sdl.dll in /system32 but no go.

Do you link with libSDL.a (or something similar) and the windows 
subsystem (-mwindows)?

--
Greetings,
   Balázs

Would a copy constructor as such work:
=20

template <typename T> BST<T>::BST(const BST& origTree){     //copy =
constructor

	=09
		if(origTree.root){

				copyTree(origTree.root, root);

		}

		else{

				root =3D NULL;

		}

}


also, what do you mean by assigning to a non-empty tree.  I would think =
that the copy constructor would simply make a fresh (new) copy of the =
tree.  I dont understand why you would have to worry about releasing =
memory for a non empty tree

thanks,

David Socha

here is the copy tree code again


> > =
/************************************************************************=
****
> >
> > copyTree function
> >
> > Used by the copy constructor to copy the tree
> >
> > Sent: pointer to the original node, pointer to the node being copied =
to
> >
> > Returns: Nothing
> >
> > Works by: Creating a new node on the tree being copied, copy the =
data to the
> >
> > node, checks to see if a left node exists on the tree, if yes
> >
> > repeat the process using on the left node, if not, do nothing.  Then =
checks
> >
> > the right, if it exists repeat process on the right side, if not, do =
nothing
> >
> >  NOTE: This function is a recursive process
> >
> > =
*************************************************************************=
***/
> >
> >
> >
> > template<typename T> void BST<T>::copyTree(Node* origNode, Node* =
copyNode){
> >
> >      copyNode =3D new Node(origNode->data);
> >
> >
> >
> >      if(origNode->left){
> >
> >           copyTree(origNode->left, copyNode->left);
> >
> >      }
> >
> >
> >
> >      if(origNode->right){
> >
> >           copyTree(origNode->right, copyNode->right);
> >
> >      }
> >
> > }
> >
> > //End copyTree

Slight clarification.

Your copy constructor doesn't have to be prepared to release any old
memory - but should be prepared to assign NULL values.

However, if you want to use copyTree() to implement an assignment
operator, then you must also think about releasing an old tree.

/Per W

On Sun, 8 Jun 2003, Per Westermark wrote:

> Your copy constructor - and your copyTree() method - would not work.
>
> What if you make assign to a non-empty tree. In that case, you have to
> release the old tree before assigning the new.
>
> Also, you only handle the case where origTree does contain anything. If it
> doesn't, then the target tree should have the same pointer set to NULL.
>
> /Per W
>
> On Sun, 8 Jun 2003, Socha, David F wrote:
>
> >  I am using the most current version of DEV C++
> >
> > This is the code I am currently using for copy constructor on my Binary Search Tree code.  I don't believe this should cause any problems but if anyone can give me help on this I would greatly appricate it.  Keep in mind that the copy Tree function works on a recursive basis
> >
> >
> >
> > template <typename T> BST<T>::BST(const BST& origTree){     //copy constructor
> >
> >      if(origTree.root){
> >
> >           copyTree(origTree.root, root);
> >
> >      }
> >
> > }
> >
> >
> >
> >
> >
> > /****************************************************************************
> >
> > copyTree function
> >
> > Used by the copy constructor to copy the tree
> >
> > Sent: pointer to the original node, pointer to the node being copied to
> >
> > Returns: Nothing
> >
> > Works by: Creating a new node on the tree being copied, copy the data to the
> >
> > node, checks to see if a left node exists on the tree, if yes
> >
> > repeat the process using on the left node, if not, do nothing.  Then checks
> >
> > the right, if it exists repeat process on the right side, if not, do nothing
> >
> >  NOTE: This function is a recursive process
> >
> > ****************************************************************************/
> >
> >
> >
> > template<typename T> void BST<T>::copyTree(Node* origNode, Node* copyNode){
> >
> >      copyNode = new Node(origNode->data);
> >
> >
> >
> >      if(origNode->left){
> >
> >           copyTree(origNode->left, copyNode->left);
> >
> >      }
> >
> >
> >
> >      if(origNode->right){
> >
> >           copyTree(origNode->right, copyNode->right);
> >
> >      }
> >
> > }
> >
> > //End copyTree
> >
> > Thanks for all the help,
> >
> > David Socha
> >
> >
> >
> > -------------------------------------------------------
> > This SF.net email is sponsored by:  Etnus, makers of TotalView, The best
> > thread debugger on the planet. Designed with thread debugging features
> > you've never dreamed of, try TotalView 6 free at www.etnus.com.
> > _______________________________________________
> > Dev-cpp-users mailing list
> > Dev...@li...
> > TO UNSUBSCRIBE: http://www.noicys.cjb.net/devcpp/ub.htm
> > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> >
>
>
>
> -------------------------------------------------------
> This SF.net email is sponsored by:  Etnus, makers of TotalView, The best
> thread debugger on the planet. Designed with thread debugging features
> you've never dreamed of, try TotalView 6 free at www.etnus.com.
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> TO UNSUBSCRIBE: http://www.noicys.cjb.net/devcpp/ub.htm
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
>

Your copy constructor - and your copyTree() method - would not work.

What if you make assign to a non-empty tree. In that case, you have to
release the old tree before assigning the new.

Also, you only handle the case where origTree does contain anything. If it
doesn't, then the target tree should have the same pointer set to NULL.

/Per W

On Sun, 8 Jun 2003, Socha, David F wrote:

>  I am using the most current version of DEV C++
>
> This is the code I am currently using for copy constructor on my Binary Search Tree code.  I don't believe this should cause any problems but if anyone can give me help on this I would greatly appricate it.  Keep in mind that the copy Tree function works on a recursive basis
>
>
>
> template <typename T> BST<T>::BST(const BST& origTree){     //copy constructor
>
>      if(origTree.root){
>
>           copyTree(origTree.root, root);
>
>      }
>
> }
>
>
>
>
>
> /****************************************************************************
>
> copyTree function
>
> Used by the copy constructor to copy the tree
>
> Sent: pointer to the original node, pointer to the node being copied to
>
> Returns: Nothing
>
> Works by: Creating a new node on the tree being copied, copy the data to the
>
> node, checks to see if a left node exists on the tree, if yes
>
> repeat the process using on the left node, if not, do nothing.  Then checks
>
> the right, if it exists repeat process on the right side, if not, do nothing
>
>  NOTE: This function is a recursive process
>
> ****************************************************************************/
>
>
>
> template<typename T> void BST<T>::copyTree(Node* origNode, Node* copyNode){
>
>      copyNode = new Node(origNode->data);
>
>
>
>      if(origNode->left){
>
>           copyTree(origNode->left, copyNode->left);
>
>      }
>
>
>
>      if(origNode->right){
>
>           copyTree(origNode->right, copyNode->right);
>
>      }
>
> }
>
> //End copyTree
>
> Thanks for all the help,
>
> David Socha
>
>
>
> -------------------------------------------------------
> This SF.net email is sponsored by:  Etnus, makers of TotalView, The best
> thread debugger on the planet. Designed with thread debugging features
> you've never dreamed of, try TotalView 6 free at www.etnus.com.
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> TO UNSUBSCRIBE: http://www.noicys.cjb.net/devcpp/ub.htm
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
>

If the list is non-empty, then *last is non-NULL. In that case, the OLD
last entry should have it's next pointer pointing at the NEW last entry.

It doesn't matter if the list was empty or not. After an insert - the
insert is always at the end of the list - *last should be set to point to
the NEW last entry. Without this last line, LAST would always be NULL, and
you wouldn't get a linked list.

/Per W

On Sun, 8 Jun 2003, Ioannis Vranos wrote:

> > -----Original Message-----
> > From: Per Westermark [mailto:pw...@ia...]
> > Sent: Saturday, June 07, 2003 10:39 PM
> > To: Ioannis Vranos
> > Cc: 'Dev-Cpp-Users'
> > Subject: RE: [Dev-C++] Single Linked List-IV
> >
> >
> > The slstore() function DOES need it's last line, or else the
> > list will not
> > get a pointer to the last element. The pointer to the last
> > element is used
> > to allow insert of new elements last, without having to
> > iterate throught
> > the list.
>
>
> Perhaps I am missing something but as I understand it the statement
>
>  *last_arg=i;
>
> makes the preceding statement
>
> else
>          (*last_arg)->next=i;
>
>
> redundant.
>
>
>
> >
> > I know it's a bit extra noisy with dual indirection, but
> > since the code
> > is C and not C++, slstore() can't take references to pointers.
>
>
> And? double pointers occupy space themselves too.
>
>
>
>
> Ioannis Vranos
>
> * Programming pages: http://www.noicys.freeurl.com
> * Alternative URL 1: http://run.to/noicys
> * Alternative URL 2: http://www.noicys.cjb.net
>
>
>
>
> -------------------------------------------------------
> This SF.net email is sponsored by:  Etnus, makers of TotalView, The best
> thread debugger on the planet. Designed with thread debugging features
> you've never dreamed of, try TotalView 6 free at www.etnus.com.
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> TO UNSUBSCRIBE: http://www.noicys.cjb.net/devcpp/ub.htm
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
>

Could you please help me? I have tried dev-c++ packages and it always gives 
an error about "winmain@16" or "SDL_init" something. I think I'm doing 
everything right, I've added the compiler command-line options, and sdl.dll 
in /system32 but no go.

_________________________________________________________________
MSN 8 helps eliminate e-mail viruses. Get 2 months FREE*. 
http://join.msn.com/?page=features/virus

 I am using the most current version of DEV C++
=20
This is the code I am currently using for copy constructor on my Binary =
Search Tree code.  I don't believe this should cause any problems but if =
anyone can give me help on this I would greatly appricate it.  Keep in =
mind that the copy Tree function works on a recursive basis

=20

template <typename T> BST<T>::BST(const BST& origTree){     //copy =
constructor

     if(origTree.root){

          copyTree(origTree.root, root);

     }

}

=20

=20

/************************************************************************=
****

copyTree function

Used by the copy constructor to copy the tree

Sent: pointer to the original node, pointer to the node being copied to

Returns: Nothing

Works by: Creating a new node on the tree being copied, copy the data to =
the

node, checks to see if a left node exists on the tree, if yes

repeat the process using on the left node, if not, do nothing.  Then =
checks

the right, if it exists repeat process on the right side, if not, do =
nothing

 NOTE: This function is a recursive process

*************************************************************************=
***/

=20

template<typename T> void BST<T>::copyTree(Node* origNode, Node* =
copyNode){

     copyNode =3D new Node(origNode->data);

    =20

     if(origNode->left){

          copyTree(origNode->left, copyNode->left);

     }

    =20

     if(origNode->right){

          copyTree(origNode->right, copyNode->right);

     }

}

//End copyTree

Thanks for all the help,

David Socha

 -----Original Message-----
> From: dev...@li... 
> [mailto:dev...@li...] On Behalf 
> Of Socha, David F
> Sent: Sunday, June 08, 2003 2:06 PM
> To: Dev C++ Mailing List
> Subject: [Dev-C++] Pointers and copy constructors
> 


Please define language, C or C++.



 
> item 1: Are pointers passed by value or by reference


In C by value, in C++ can be passed in both ways (by reference using
templates).


  
> item 2: Would it be a problem if in my copy constructor I 
> called a function to recursivly move through a binary search 
> tree and copy the data, keep in mind my BST is made of a 
> series of linked, dynamically alocated pointers.


If it is an external function no, provided that you will not run out of
memory.





Ioannis Vranos
 
* Programming pages: http://www.noicys.freeurl.com
* Alternative URL 1: http://run.to/noicys
* Alternative URL 2: http://www.noicys.cjb.net

> -----Original Message-----
> From: Per Westermark [mailto:pw...@ia...] 
> Sent: Saturday, June 07, 2003 10:39 PM
> To: Ioannis Vranos
> Cc: 'Dev-Cpp-Users'
> Subject: RE: [Dev-C++] Single Linked List-IV
> 
> 
> The slstore() function DOES need it's last line, or else the 
> list will not
> get a pointer to the last element. The pointer to the last 
> element is used
> to allow insert of new elements last, without having to 
> iterate throught
> the list.


Perhaps I am missing something but as I understand it the statement

 *last_arg=i;

makes the preceding statement

else
         (*last_arg)->next=i;


redundant.



> 
> I know it's a bit extra noisy with dual indirection, but 
> since the code
> is C and not C++, slstore() can't take references to pointers.


And? double pointers occupy space themselves too.




Ioannis Vranos
 
* Programming pages: http://www.noicys.freeurl.com
* Alternative URL 1: http://run.to/noicys
* Alternative URL 2: http://www.noicys.cjb.net

item 1: Are pointers passed by value or by reference
=20
item 2: Would it be a problem if in my copy constructor I called a =
function to recursivly move through a binary search tree and copy the =
data, keep in mind my BST is made of a series of linked, dynamically =
alocated pointers.
=20
Thanks for all the help
David Socha

Hi,

So I just found out that I can use GCC/MingGW to do closed source
applications: <<
http://www.fsf.org/licenses/gpl-faq.html#CanIUseGPLToolsForNF >>

But can I use the c lib (stdio,string, time and others) for closed source
applications?? Or should I download and use the MS C lib?

I would like to stay with DevCPP and use wxwindows + stl + clib and develop
someday closed source applications next to open source.