|
Hi everyone!
I used AfxGetApp()->LoadCursor() to load cursors from resource. It worked well when I build project using 'Use MFC in a Static Library'.
But when I build it using 'Use MFC in a Shared DLL' - LoadCursor() returnes NULL and GetLastError() returnes ERROR_RESOURCE_TYPE_NOT_FOUND.
But LoadCursor(hInstance, MAKEINTRESOURCE(...)) works as well.
What it can be?
Something similar are happen with menues. CMenu::LoadMenu(...) became unsuccess.
Thanks for help.
-- modified at 14:54 Monday 17th October, 2005
|
|
|
|
|
My test program doesn't seem to work properly. Meaning I'am having trouble calling the functions. I have written an implementation file defining all the member functions of the header-file, yet when I try to call my functions in my test program i get some syntax error. Can anyone please help me. Below I have included 3 pieces of my code all in respect to project
(SparseMatrix.cpp, SparseMatrix.h, and MatrixTest.cpp) please make any adjustments to current code where see necessary.
<code></code>
//The class sparseMatrix uses double-lined list to perform basic
//matrix operations.
//File: SparseMatrix.cpp (implementation file of class SparseMatrix)
#include "SparseMatrix.h"
#include <string>
#include <fstream>
#include <iostream>
using namespace std;
SparseMatrix::SparseMatrix();
//default constructor, creates
//an empty matrix of dimensions 0 x 0
{
numRows = 0;
numCols = 0;
horIter = NULL;
verIter = NULL;
SparseMatrix::SparseMatrix(ifstream &inputFile);
//constructor:
//creates a double-linked list for
//matrix stored in the inputFile
{
//inputFile.open("Matrix1.txt");
//inputFile.open("Matrix2.txt");
listNode* horIter;//declares a pointer variable horIter of type listNode
listNode * verIter;//declares a pointer variable verIter of type listNode
int arow, acol, avalue;
inputFile >> numRows;
inputFile >> numCols;
listNode * previous;
//creating the first node - need to update horIter
listNode * current = new listNode;// this will hold the address of the current node
inputFile >> arow >> acol >> avalue;
current -> row = arow;
current -> col = acol;
current -> value = avalue;
horIter = current;
previous = current;
//from the second node... the rest
while(inputFile >> arow >> acol >> avalue && !inputFile.eof())
{
current = new listNode;// this will hold the address of
// the current node
current-> row = arow;
current-> col = acol;
current-> value = avalue;
current-> hor = NULL;
previous -> hor = current;
previous = current;
}//end while
node * last = current;
current = current -> hor;
current -> col = last -> col;
last -> ver = current;
current = verLinks();//returns the pointer to the first node in the column-by-column order
//verIter = verLinks();//Takes the list with horizontal links
//pointed by horIter and updates it by adding vertical links.
//Returns the pointer to the first node in the order column-by-column.
}
SparseMatrix::~SparseMatrix() //destructor
{
nodeType *temp; // pointer to deallocate the memory occupied by the node
while (horIter != NULL) // while there are nodes in the list
{
temp = horIter; // set temp to the current node
horIter = horIter->hor; // advance first to the next node
delete temp; // deallocate the memory occupied by temp
}
verIter = NULL;
numRows = 0;
numCols = 0;
//delete listNode;
//destroyList();
}
/*inline int SparseMatrix::getNumRows() const
{
return numRows; //returns the number of rows of the matrix
}
inline int SparseMatrix::getNumCols() const
{
return numCols; //returns the number of columns of the matrix
}*/
SparseMatrix SparseMatrix::addMat(const SparseMatrix & M) const;
//returns a new object that is the sum
//of two sparse matrices: this one and M
{
node *face1, *face2;
int pt;
int m =numRows; //rows1 and cols1 are stored size of matrix 1 when call init_matrix1
int n =numCols;
int m1 = M.numRows;
int n1 = M.numCols;
/*if ((m!=m1) || (n!=n1))
{
box_str("Size of matrices is not the same !!");
return;
}*/
matrix a(numRows,numCols);
for (int i=0;i<m;i++) // matrix M
{
for (int j=0;j<n;j++)
pt=0;
if (horIter[i]->ver! = NULL)
{
face1 = horIter[i]->ver;
while (lead1! = NULL)
{
if ((face1->row == (i+1)) && (face1->col == (j+1)))
pt = pt + face1->value;
face1 = face1->ver;
}
}
if (M.horIter[i]->ver! = NULL)
{
face2 = M.horIter[i]->ver;
while (face2!= NULL)
{
if ((face2->row ==(i+1)) && (face2->col ==(j+1)))
pt = pt + face2->value;
face2 = lead2->ver;
}
}
}
return T;
}
SparseMatrix SparseMatrix::multiplyMat(const SparseMatrix & M) const;
//returns a new object that is the product
//of two sparse matrices: this one and M
//if two matrices have incompatible sizes,
//returns an empty matrix of dimensions 0 x 0
{
node *face1, *face2;
int pt, m1,n1;
int m = numRows; //rows1 and cols1 are stored size of matrix 1 when call init_matrix1
int n = M.numCols;
/*if (numCols! = M.numRows)
{
box_str("Sizes of matrices are not allow for multiplication...");
return;
}*/
matrix T(numRows,M.numCols);
for (int i=0;i<m;i++)
{
if (horIter[i]->ver!=NULL)
for(int k=0;k<n;k++)
{
pt=0;
face1=horIter[i]->ver;
while (face1!=NULL)
{
face2 = M.verIter[k]->hor;
while (face2!=NULL)
{
if (face1->col==face2->row)
pt = pt + face1->value*face2->value;
face2=face2->hor;
}
}
face1=face1->ver;
}
}
return T;
}
void SparseMatrix::printMatrix(ostream &outStream) const
//prints the matrix row by row to the output
//stream outStream
//to print to stdout use: printMatrix(cout)
{
listNode * current //declares a pointer variable current to hold the address
current = horIter //of the current node
while(current!=NULL) //there is a least one node
{
outStream << current ->row->col->value <<" ";//display matrix row by row
outStream = outStream -> hor; //process the next node in list
}
outStream << endl;
}
listNode * makeNode(int row, int col, int value)
{
listNode * p;//declares a pointer variable p of listNode
p = row; //allocates a single node, p with the row
p = col; //allocates a single node, p with the row
p = value; //allocates a single node, p with the row
return p; //returns a pointer to the node
}
listNode * verLinks()
{
listNode * verIter; //declares a pointer variable verIter of type listNode
//(pointer to the list traversing row by row)
inputFile >> m; //rows
numRows = m;
inputFile >> n; //cols
numCols = n;
listNode * previous;
//creating the first node - need to update verIter
listNode * current = new listNode;// this will hold the address of the current node
inputFile >> arow >> acol >> avalue;
current -> row = arow;
current -> col = acol;
current -> value = avalue;
verIter = current;
previous = current;
//from the second node... the rest
while(inputFile >> arow >> acol >> avalue && !inputFile.eof())
{
current = new listNode;// this will hold the address of
// the current node
current-> row = arow;
current-> col = acol;
current-> value = avalue;
current-> ver = NULL;
previous -> ver = current;
previous = current;
}//end while
return current;
}
<code></code>
<code></code>
//In particular, program must accept two command-line arguments that are names of two
//files containing the entries of the corresponding matrices
//(with the same format as used in the files Matrix1 and Matrix2).
//program must produce the sum of the two matrices on the standard output
//(or write the phrase Incompatible sizes if the two matrices cannot be added).
//Also program must ADDITIONALLY produce the product of the two matrices on the
//standard output (or write the phrase Incompatible sizes if the two matrices cannot be multiplied).
//File: MatrixTest.cpp
#include "SparseMatrix.h"
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream inputFile;
ofstream outStream;
inputFile.open("Matrix1.txt");
inputFile.open("Matrix2.txt");
cout <<inputFile<<endl;
SparseMatrix T; //declares an object of the class SparseMatrix
????????????????
//ifstream & inputFile //char fn[LGMAX+1];
//gotoxy(5,24);
//cout<<"Write to file:";
//gotoxy(7,25);
//gets(inputFile);
//T.write_file(inputFile);
//T.write_file1(inputfile);
//gotoxy(22,2);
cout<<"The first matrix is "<<endl;
//getch();
//gotoxy(22,2);
cout<<"The second matrix is "<<endl;
//M.display();
//getch();
//gotoxy(22,2);
cout<<"The result of addition of Matrice is "<<endl;
printMatrix(); ???? get syntax error why
cout<<"The result of multiplication of Matrice is "<<endl;
inputFile.close();
system("PAUSE");
}
<code></code>
<code></code>
//The class sparseMatrix uses double-lined list to perform basic
//matrix operations.
#ifndef SparseMatrix_H //preprocessor directives
#define SparseMatrix_H //to avoid multiple inclusions
#include <string>
#include <fstream>
#include <iostream>
using namespace std;
struct listNode
{
int row; //row index
int col; //column index
int value; //entry of the matrix for (row,col)
listNode *hor; //pointer for the horizonal traverse(hor is the link)
listNode *ver; //pointer for the vertical traverse(ver is the link)
};//struct listNode
class SparseMatrix
{
public:
SparseMatrix();
//default constructor, creates
//an empty matrix of dimensions 0 x 0
SparseMatrix(ifstream & inputFile);
//constructor:
//creates a double-linked list for
//matrix stored in the inputFile
~SparseMatrix(); //destructor
inline int getNumRows() const { return numRows; }
//returns the number of rows of the matrix
inline int getNumCols() const { return numCols; }
//returns the number of columns of the matrix
SparseMatrix addMat(const SparseMatrix & M) const;
//returns a new object that is the sum
//of two sparse matrices: this one and M
SparseMatrix multiplyMat(const SparseMatrix & M) const;
//returns a new object that is the product
//of two sparse matrices: this one and M
//if two matrices have incompatible sizes,
//returns an empty matrix of dimensions 0 x 0
void printMatrix(ostream & outStream) const;
//prints the matrix row by row to the output
//stream outStream
//to print to stdout use: printMatrix(cout)
private:
listNode* makeNode(int row, int col, int value);
//returns the pointer to a node with
//initialized entries or NULL if failed
listNode* verLinks();
//Takes the list with horizontal links
//pointed by horIter and updates it by
//adding vertical links.
//Returns the pointer to the first node
//in the order column-by-column.
int numRows; //number of rows in the matrix
int numCols; //number of columns in the matrix
listNode* horIter; //pointer to the list traversing row by row
listNode* verIter; //pointer to the list traversing column by column
};//class SparseMatrix
#endif
<code></code>
|
|
|
|
|
|
After reading some articles I convinced that C# (.NET 2003)is not good enough yet for heavy array operations. Therefore, I want to use VC++ 6.0 for array operations and C# for GUI applications. How can I use them together?
Thank you in advance
Nuray
|
|
|
|
|
Would it be simpler to use VC++ 2003 (native) for both?
My programming blahblahblah blog. If you ever find anything useful here, please let me know to remove it.
|
|
|
|
|
nuray wrote: After reading some articles I convinced that C# (.NET 2003)is not good enough yet for heavy array operations.
Why ?
nuray wrote: Therefore, I want to use VC++ 6.0 for array operations and C# for GUI applications. How can I use them together?
I think this is a dumb idea, but COM interop is the way to do this, just write your C++ code as a COM dll and import it into your C# app.
Christian Graus - Microsoft MVP - C++
|
|
|
|
|
Dear Christian,
My original code uses templates extensively. This features is available in VS 2005 (as C# Generics) not in 2003. I don't have it. That's why I want to use VC++ & .NET 2003 together.
What is the basic difference between COM DLL and DLL? Any reference?
If I create a project as WIN32 DLL and build it and then adding the DLL as a reference in C# project would it be correct?
Thank you in advance.
Nuray
|
|
|
|
|
Nuray wrote: My original code uses templates extensively.
So you had C++ to start with ? Why on earth do you want to move at all then ? Why do you need C# ?
Nuray wrote: This features is available in VS 2005 (as C# Generics) not in 2003.
Unless you used templates in a really basic manner, C# probably does not support your C++ code at all, actually.
Nuray wrote: That's why I want to use VC++ & .NET 2003 together.
But why are you moving to C# at all ? If you need to support .NET, why not MC++ ?
Nuray wrote: What is the basic difference between COM DLL and DLL?
One supports COM, the other is just a dll. COM was the answer to dll hell before .NET came along ( .NET is also the answer to dll hell )
Nuray wrote: Any reference?
google.
Nuray wrote: If I create a project as WIN32 DLL and build it and then adding the DLL as a reference in C# project would it be correct?
You can' add a normal dll, but you could use import functions from a normal dll into a C# app. My core question would remain, why ? If you have a code base already, how does it work now, and why are you so keen to do part of it in C# ?
Christian Graus - Microsoft MVP - C++
|
|
|
|
|
(1) Why do I move from C++ to C#?
I started with C++ because I hate C. I use C# because
I dislike C++.
- MFC is difficult unnecessarily.
- the use of DLL is complicated you need to modify the code accordingly.
- Just one more minor point; All C/C++ users are familiar with pointers
but C# user don't bother knowing it. I think new generation is more
lucky than us.
(2) Why not MC++ ?
- Good things about MC++: it supports templates and belongs to .Net
- I didn't like the notation for keywords __gc or __value etc.
- There are similarities between MC++ and C#. It is not a big deal
switching from one to another but windows applications are very easy
in C# compared to MFC. MFC opens a lot of files that you need to know
very well in detail. C# opens two files one is code view and the
other is code view. Very natural. Very organized. It hides the
generated code for the application. C# has great editor. The Outlining
feature is essential for the applications having many classes and
functions.
(3) Why C#
GUI applications is easy. I don't like doing things the hard way any
more.
(4) Why .Net ?
It is a platform for web based applications. I want to run my C++
code on the web. MC++ is an option but it is difficult. C# is my
favourite option but VS.NET 2003 is not good enough for my needs.
|
|
|
|
|
Nuray wrote: I started with C++ because I hate C.
Fair enough. Who uses C now for Windows anyhow ?
Nuray wrote: I use C# because
I dislike C++.
Sounds like you will move to VB because you hate C#. What's wrong with C++ ?
Nuray wrote: MFC is difficult unnecessarily.
Rubbish.
Nuray wrote: the use of DLL is complicated you need to modify the code accordingly.
True. COM is easier overall than a standard dll, I think, but it's still messy and complex.
Nuray wrote: Just one more minor point; All C/C++ users are familiar with pointers
but C# user don't bother knowing it. I think new generation is more
lucky than us.
Well, it would help to know about pointers so you know what C# is doing. The new generation is unlucky, they will never learn the stuff that we just know through having to.
Nuray wrote: I didn't like the notation for keywords __gc or __value etc.
I don't like it either, but at some point you will need to choose a language, and use it.
Nuray wrote: There are similarities between MC++ and C#. It is not a big deal
switching from one to another but windows applications are very easy
in C# compared to MFC.
I've done a lot of both, I don't think either is that much easier than the other, if you know what you're doing.
Nuray wrote: MFC opens a lot of files that you need to know
very well in detail. C# opens two files one is code view and the
other is code view.
Wrong. MFC has three files, and that only because C++ has a header and a cpp file.
Nuray wrote: It hides the
generated code for the application.
Barely.
Nuray wrote: C# has great editor. The Outlining
feature is essential for the applications having many classes and
functions.
None of this fluff is 'essential', and I fear it becomes a way of not having to learn to organise your own code.
Nuray wrote: GUI applications is easy. I don't like doing things the hard way any
more.
Then do your entire app in C#, if you like it so much.
Nuray wrote: It is a platform for web based applications.
True, but your winforms app won't run on the web any more than your MFC app will. You need WinFX for that.
Nuray wrote: I want to run my C++
code on the web.
You can, via COM interop and ASP.NET or even just asp.
Nuray wrote: C# is my
favourite option but VS.NET 2003 is not good enough for my needs.
Because it's C# 1.1 ? Like I said, C# 2.0 generics are very much templates lite. There's a lot of C++ stuff in templates that generics do not support.
Christian Graus - Microsoft MVP - C++
|
|
|
|
|
(1) Who uses C?
Matlab users need to know C to understand some stuff. I use
fuzzy logic source code of it which is public and written in C
unfortunately. C survives like Fortran 77 and/or 90 due to some public
useful codes.
(2)What's wrong with C++ ?
I should admit that it works amazingly. I am very satisfied with it for
database programming(not ADO). It is a good tool for scientific
programming. But this doesn't mean that I never look for better one.
(3)Which language new generation should start with?
Let me repeat some points that you know very well for the sake of our
discussion. C++ is a low-level programming language like C. C# is high-
level programming language due to managed environment. That means you can
drive a car without knowing how it works. For example, no need to worry
about where to create the object in the memory(stack or heap?).NET
handles it. Perhaps C++ users might know both unmanaged and managed C++
in .Net environment. I think C# can attract more beginners. It is not as
powerful as C++ for the time being but eventually will catch up.
(4)Importance of editors
In Net C# and C++ don't have similar editor. Managed C++ have the similar
editor of Visual C++. Very disappointing. All good features are reserved
for C#. It has very intelligent editor. C++ users can't imagine what
they miss. You can notice your errors before compiling. It understands
when a class is created and helps to write its components with pup-op menu.
I think in later versions of C# the editor can create UML files of the
code. Not a bad idea.
(5) What am I going to do after all our discussion which is quite useful
for anybody not only for me?
I have decided to convert my old code in C++ to a web application using COM
and ASP. NET as you suggested. But I have to stop developing the code
using C++, it sounds as if I kill my baby, what a bad mother I am. I will
redevelop the code from scratch using C# so that I can add new classes
using a nice editor with the benefit of .NET features.
Of course, using C# will not solve all the dilemma of programmers but at
least Microsoft is good at advertising .NET technology to convince
dinosaurs like me to move from C++ to C#.
Yours
Nuray
|
|
|
|
|
Nuray wrote: (1) Who uses C?
I actually asked 'who uses C for windows programming'. I'm sure some people do, but not many.
Nuray wrote: But this doesn't mean that I never look for better one.
That's fair enough
Nuray wrote: I think C# can attract more beginners. It is not as powerful as C++ for the time being but eventually will catch up.
It will never catch up, in terms of raw power. We just won't care because our processors will get bigger and bigger. It's certainly catching up in terms of the language itself, I agree there.
I agree that the C# editor continues to have more features than the C++ editor.
Christian Graus - Microsoft MVP - C++
|
|
|
|
|
|
http://msdn.microsoft.com/library/default.asp?url=/library/en-us/sysinfo/base/registry.asp
All about windows registry and how to use.
|
|
|
|
|
|
this is a simple question, i think there is probably a simple answer. im a newb with c
i looked on google but couldnt find out what my problem was.
i have this code
for(i=0; i < something; i++) {
sprintf(filename, "%i", i);
f = fopen(filename, "w");
}
how can i make it open files like
filename1
filename2
filename3
filename4
...etc?
thanks.
|
|
|
|
|
I hope this can do it:
sprintf(filename,"filename%i",i);
this is this.
|
|
|
|
|
Write a routine that does the following: for a given value N, create and initialize an N*N matrix. deduce the initialization algorithm from the following examples.
Example1: N=2
1 2
4 3
Example2:N=3
1 2 3
8 9 4
7 6 5
Example3: N=4
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7
|
|
|
|
|
I doubt this is even remotely optimized, but here is a qad solution:
#define UP (UCHAR)0
#define DOWN (UCHAR)1
#define LEFT (UCHAR)2
#define RIGHT (UCHAR)3
UCHAR **Matrix( UCHAR n )
{
UCHAR **Result = new UCHAR *[n];
for ( UCHAR i = 0; i < n ; i++ )
{
Result[i] = new UCHAR[n];
memset( Result[i], 0, sizeof(UCHAR)*n );
}
UCHAR r, c;
UCHAR Dir;
UCHAR cc;
r = 0;
c = 0;
i = 1;
Dir = RIGHT;
while ( true )
{
cc = Result[c][r];
if ( cc != 0 )
{
if ( Dir == RIGHT )
{
if ( Result[c-1][r+1] == 0 )
{
Dir = DOWN;
c--;
r++;
}
else
{
break;
}
}
else
if ( Dir == DOWN )
{
if ( Result[c-1][r-1] == 0 )
{
Dir = LEFT;
c--;
r--;
}
else
{
break;
}
}
else
if ( Dir == LEFT )
{
if ( Result[c+1][r-1] == 0 )
{
Dir = UP;
r--;
c++;
}
else
{
break;
}
}
else
if ( Dir == UP )
{
if ( Result[c+1][r+1] == 0 )
{
Dir = RIGHT;
c++;
r++;
}
else
{
break;
}
}
}
Result[c][r] = i;
switch ( Dir )
{
case RIGHT:
if ( c == n - 1 )
{
r++;
Dir = DOWN;
}
else
{
c++;
}
break;
case DOWN:
if ( r == n - 1 )
{
c--;
Dir = LEFT;
}
else
{
r++;
}
break;
case LEFT:
if ( c == 0 )
{
r--;
Dir = UP;
}
else
{
c--;
}
break;
case UP:
if ( r == 0 )
{
c++;
Dir = RIGHT;
}
else
{
r--;
}
break;
}
i++;
}
for ( r = 0; r < n; r++ )
{
for ( c = 0; c < n; c++ )
{
printf( "%3u ", Result[c][r] );
}
printf( "\n" );
}
return Result;
}
int main(int argc, char* argv[])
{
Matrix( 5 );
return 0;
}
viola.
|
|
|
|
|
|
Hi I was reading Modern C++ Design by Andrei Alexandrescu. The author mentions an interesting technique in chapter 2 where you can use template specialization to select between the overloaded functions. To try it out I had written the following code
template <int v="">
struct Int2Type
{
enum { value = v };
};
enum { SimpleDispatch = 1, ComplexDispatch = 2 };
class Dispatcher
{
private:
int m_iDispatchType;
protected:
void DoDispatch(Int2Type<simpledispatch>)
{
AfxMessageBox("Simple Dispatch called");
}
void DoDispatch(Int2Type<complexdispatch>)
{
AfxMessageBox("Complex Dispatch called");
}
public:
Dispatcher() : m_iDispatchType(SimpleDispatch)
{}
Dispatcher(int iDispatchType):
m_iDispatchType(iDispatchType)
{}
void DoDispatch()
{
DoDispatch(Int2Type<m_idispatchtype>()); -------- [1]
switch(m_iDispatchType)
{
case SimpleDispatch:
DoDispatch(Int2Type<simpledispatch>());
break;
case ComplexDispatch:
DoDispatch(Int2Type<complexdispatch>());
break;
}
}
};
unfortunately unless I comment out line marked [1] the class does not compile, to make the class compile I had to use to switch alternative. So my question is why can't I write a above code. In the book the author has taken a bool variable example which is passed as a template variable.
I am missing something here? Doesn't the use of switch makes the code behave like the standard way, I mean If I have to use switch then I do not need template specialization here.
Any help is appriciated.
Thanks
|
|
|
|
|
|
Yep I am using VC++ 6.0.
Did microsoft fixed it in VC++ 7.0 or VC++ 7.1 ??
|
|
|
|
|
Hello!
I'm working on ARM embedded device. I have Flash device mapped into memory space trough which I controll it. I have the following problem:
I have to write some 32bit data to some address in memory. When I write to the location that is not modulo of number 4, I get exception;
example:
0x01000000 - ok
0x01000001 - exception
0x01000002 - exception
0x01000003 - exception
0x01000004 - ok
How to overcome this? Is it possible to write 32 bit data in atomic way and not first upper and then lower 2 bytes?
Rostfrei
-- modified at 3:30 Thursday 20th October, 2005
|
|
|
|
|
pragma pack 1 ? Haven't really thought this thru, but worth trying ~
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
