C / C++ / MFC

arshadkc wrote:

This seems to work only if i dont use xp style.

#include <afx.h>
#include <iostream>

using namespace std;

void Recurse(LPCTSTR pstr)
{
   CFileFind finder;
 
   // build a string with wildcards
   CString strWildcard(pstr);
   strWildcard += _T("\\*.*");
 
   // start working for files
   BOOL bWorking = finder.FindFile(strWildcard);
 
   while (bWorking)
   {
      bWorking = finder.FindNextFile();
 
<code>      // skip . and .. files; otherwise, we'd
      // recur infinitely!</code>

<code>      if (finder.IsDots())
         continue;</code>
 
      // if it's a directory, recursively search it
 
      if (finder.IsDirectory())
      {
         CString str = finder.GetFilePath();
         cout << (LPCTSTR) str << endl;
         Recurse(str);
      }
   }
 
   finder.Close();
}

void main()
{
   if (!AfxWinInit(GetModuleHandle(NULL), NULL, GetCommandLine(), 0)
      cout << "panic!" << endl;
   else
      Recurse(_T("C:"));
}

Lord Kixdemp wrote:

Is there any way to do this without MFC and C++ (just plain C & Win32)?

BOOL CFileFind::IsDots() const
{
	ASSERT(m_hContext != NULL);
	ASSERT_VALID(this);

	// return TRUE if the file name is "." or ".." and
	// the file is a directory

	BOOL bResult = FALSE;
	if (m_pFoundInfo != NULL && IsDirectory())
	{
		LPWIN32_FIND_DATA pFindData = (LPWIN32_FIND_DATA) m_pFoundInfo;
		if (pFindData->cFileName[0] == '.')
		{
			if (pFindData->cFileName[1] == '\0' ||
				(pFindData->cFileName[1] == '.' &&
				 pFindData->cFileName[2] == '\0'))
			{
				bResult = TRUE;
			}
		}
	}

	return bResult;
}

Yustme wrote:

c < &letters[sizeof(letters)]

char array[] = {1,2,3};
int size = sizeof(array)/sizeof(array[0]);

jumble eraop

<br />
void permute(char *v, const int start, const int n);<br />
void print(const char *v, const int size);<br />
<br />
int main(int argc, char* argv[])<br />
{<br />
	char v[] = {'a', 'v', 'e', 'd', 'k', 'u', 'r', 'n', 'e'};<br />
  permute(v, 0, sizeof(v)/sizeof(char));<br />
	<br />
	system("pause");<br />
	return 0;<br />
}<br />
<br />
void print(const char *v, const int size)<br />
{<br />
  if (v != 0) <br />
	{<br />
    for (int i = 0; i < size; i++) <br />
    {<br />
			cout << v[i];<br />
    }<br />
		cout << endl;<br />
  }<br />
} // print<br />
<br />
<br />
void permute(char *v, const int start, const int n)<br />
{  <br />
  if (start == n-1)<br />
    print(v, n);<br />
  <br />
	else <br />
	{<br />
    for (int i = start; i < n; i++) <br />
		{<br />
      char tmp = v[i];<br />
      <br />
      v[i] = v[start];<br />
      v[start] = tmp;<br />
      permute(v, start+1, n);<br />
      v[start] = v[i];<br />
      v[i] = tmp;<br />
    }<br />
  }<br />
}<br />