|
John Simmons / outlaw programmer wrote: If you're even halfway talented as a programmer, this shouldn't be a hard task.
Nice Quote!
"Opinions are neither right nor wrong. I cannot change your opinion. I can, however, change what influences your opinion." - David Crow
cheers,
Alok Gupta
VC Forum Q&A :- I/ IV
Support CRY- Child Relief
|
|
|
|
|
Hi all,
What function can I use to get a hold of all sub-direcories (of a certain directory)
Thanks in advance
Regards,
The only programmers that are better that C programmers are those who code in 1's and 0's
Programm3r
My Blog: ^_^
|
|
|
|
|
You need to use FindFirstFile(), FindNextFile() recursively.
Something like (pseudo code only):
void Recursive(std::string startingFolder)
{
found = FindFirstFile(startingFolder\*.*)
if(found)
{
do
{
if((folder.attributes & FOLDER) && (folder != '.') && (folder != '..'))
Recursive(folder);
cout << "FolderName: " << folder << "\r\n";
}
FindNextFile()
}
}
regards,
|
|
|
|
|
|
Programm3r wrote: does not comply with the functions standard ?
Hence why I said it was only pseudocode and not C++
What you need to do with this line is once you know a folders name, you append "\*.*" to it and pass that back to the recursive function so that it starts it's search from that location.
so using a std::string and C++ for example, the code becomes something like this (may not compile, but should be close enough):
void Delete::Recursive(const string szPath, const string szFileSpec)
{
WIN32_FIND_DATA obFindData;
memset(&obFindData, 0, sizeof(WIN32_FIND_DATA));
string searchPath;
const HANDLE hFind = FindFirstFile((szPath + _T("*.*")).c_str(), &obFindData);
if(hFind != INVALID_HANDLE_VALUE)
{
do
{
if(obFindData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)
{
if((_tcsicmp(obFindData.cFileName, ".") != 0) && (_tcsicmp(obFindData.cFileName, "..") != 0))
{
const string szFolderName = szPath + obFindData.cFileName + _T("\\");
Recursive(szFolderName, szFileSpec);
cout << szFolderName;
}
}
}
while(FindNextFile(hFind, &obFindData) != FALSE);
FindClose(hFind);
}
and you call it like this:
Recursive("c:\\", "*.*");
Hope that's a bit more obvious.
Note: This is a severely truncated version of some code I wrote a while ago, I have removed everything you do not need, but it may not compile as is, but should give you a clue anyway.
regards,
|
|
|
|
|
|
|
|
My mainframe window did not get closed when i click close button.
Even i have OnClose() function in my Mainfrm class.
Whats the problem?
Anu
|
|
|
|
|
|
Anu_Bala wrote: Even i have OnClose() function in my Mainfrm class.
And what is it doing?
"A good athlete is the result of a good and worthy opponent." - David Crow
"To have a respect for ourselves guides our morals; to have deference for others governs our manners." - Laurence Sterne
|
|
|
|
|
Yes, Thts my doubt.
My window does not get closed. When i have break point in my OnClose(),when debugging does not got that break point.
Now im closing my application by having short cut keys(ctrl + del)I set keys like that to close the window.But i have to close by clicking close button..
Anu
|
|
|
|
|
Anu_Bala wrote: When i have break point in my OnClose()...
What does this function look like?
"A good athlete is the result of a good and worthy opponent." - David Crow
"To have a respect for ourselves guides our morals; to have deference for others governs our manners." - Laurence Sterne
|
|
|
|
|
Hello friends,
I’m going to develop some application using C++, Linux platform. I need information about mathematics libraries which have following features –
1) Matrix manipulation –
a) It should support Matrix multiplication, Inverse, Transpose, etc functionality on large data set say 1 million rows and columns.
b) Finding Min or Max element by row or column.
2) Providing sort function which would sort matrix.
3) Algorithm used for sorting of matrix is most important because as per my knowledge Heap sort gives the best performance over larger dataset.
4) Any functionality to sort a data set which accepts a row / column from a matrix. i.e. Sorting function receives row / column of a matrix as parameter & returns sorted set of elements or sorted set of indices of that matrix.
Thnx & regards,
Shashikant
|
|
|
|
|
check this[^] matrix class
|
|
|
|
|
|
Hi everybody,
i use the SourceForge Project "Console", it's an application which starts new processes and
"redirect the display of the startet programm into a view"
Keystrokes were send via Message WM_KEYDOWN, that works fine.
I need to start my own Win32-DOS-Application into this application, but the Mouse-clicks
won't work ( even if i send the correct messages )
I found a strange solution: i send a Key "46" to the DOS-application there in, the Key-Code 46
performs a simulated Mouse-Click via CURSES.
It also works, but i need to specify the coordinates of the click.
Therefor i need GetWindowRect, to determine where the DOS-Applic is ...
In a normal DOS Application i get the Window-Handle via FindWindow for example, which works
But in the Console-Project, the process runs "without a Frame/ConsoleFrame"
Big big thanks for any help
|
|
|
|
|
You can install a message hook which is able to catch mouse messages and consequently mouse coordinates.
|
|
|
|
|
hai,
any one pls tell me, is ther any difference in range of value can be stored the following two variables..
int a ;
long b ;
|
|
|
|
|
Ya,
int data type can store 4 bytes of integer, i.e, 2^32 = 4294967296 numbers. half of it +ve and half of it -ve.
long data type can store 8 bytes of integer, i.e, 2^64 = 18446744073709551616 numbers. half of it +ve and half of it -ve.
That's it.
After modification:
I mean to say that Range for int is: -(2^32)/2 to +(2^32)/2 - 1.
Range for long is: -(2^64)/2 to +(2^64)/2 - 1.
-- modified at 7:19 Wednesday 1st August, 2007
Anurag Gandhi.
http://www.softgandhi.co.nr
|
|
|
|
|
This is not strictly correct.
An int must be 'at least' 16bits (2 bytes) in size but can be 4 or more.
A long must be 'at least' 32bits (4 bytes) in size.
Also,
sizeof(unsigned long) = sizeof(long)
and
sizeof(unsigned int) = sizeof(int)
Range:
int -32767 - 32767 (Assuming 2 byte int, else –2,147,483,648 to 2,147,483,647 for 4 byte int)
unsigned int 0 - 65535 (Assuming 2 byte int, else 4,294,967,295 for 4 byte int)
long –2,147,483,648 to 2,147,483,647
unsigned long 0 - 4,294,967,295
regards,
-- modified at 7:29 Wednesday 1st August, 2007
Added range information.
|
|
|
|
|
Thanks for correction.
Anurag Gandhi.
http://www.softgandhi.co.nr
|
|
|
|
|
Jonathan [Darka] wrote: This is not strictly correct.
An int must be 'at least' 16bits (2 bytes) in size but can be 4 or more.
A long must be 'at least' 32bits (4 bytes) in size.
That's not correct either.
An int only has to be larger or equal to the size of a short int.
A long only has to be larger or equal to the size of an int.
The actual size is entirely compiler specific.
Mark
Mark Salsbery
Microsoft MVP - Visual C++
|
|
|
|
|
The standard defines a *minimum* size for these variables. In Visual C++, they are both the same size.
Christian Graus - Microsoft MVP - C++
"I am working on a project that will convert a FORTRAN code to corresponding C++ code.I am not aware of FORTRAN syntax" ( spotted in the C++/CLI forum )
|
|
|
|
|
With Visual Studio, check the limits.h file.
"A good athlete is the result of a good and worthy opponent." - David Crow
"To have a respect for ourselves guides our morals; to have deference for others governs our manners." - Laurence Sterne
|
|
|
|