C / C++ / MFC Discussion Boards

prasad_som6-Dec-06 18:03

6-Dec-06 18:03

This method is called during call to OnCreate. Returning FALSE from it indicates failure in creation. Hence message is like that.

Prasad
Notifier using ATL | Operator new[],delete[][^]

Re: Failed to create empty document

rp_suman6-Dec-06 18:36

rp_suman

6-Dec-06 18:36

Thanks for help!
I am trying to avoid creation of new document without any message.
Thanks & Regards,
Suman

Re: Failed to create empty document

prasad_som6-Dec-06 18:52

prasad_som

6-Dec-06 18:52

Best place I feel, you can handle is in CWinApp::OnFileNew.
Your code could look like this,

void CMDIApp::OnFileNew() 
{
  //do your validations,
  if (success)		
 {
   CWinApp::OnFileNew();
 }
 else
 {
   //do nothing
 }
}

Prasad
Notifier using ATL | Operator new[],delete[][^]

Re: Failed to create empty document

rp_suman6-Dec-06 21:30

rp_suman

6-Dec-06 21:30

Thank you very much for great help!!
Best Regards,
Suman

Converting projetc to unicode support

Atul236-Dec-06 17:05

Atul23

6-Dec-06 17:05

Hi
I want my application to convert to unicode support so for this is it necessary to convert all char data type to TCHAR and after conversion my application will it support ASCII characters?

Thanks and Regards
M.Atul

M.Atul

Re: Converting projetc to unicode support

Leah_Garrett6-Dec-06 17:44

Leah_Garrett

6-Dec-06 17:44

To convert a C++ applicaiton to Unicode define UNICODE (add it the list where you have DEBUG etc).

We used the generic text _TCHAR because we wanted to be able to make non-Unicode builds.

Check out:
http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vccore98/HTML/_core_unicode_programming_tasks.asp[^]

Re: Converting projetc to unicode support

Stephen Hewitt6-Dec-06 19:24

Stephen Hewitt

6-Dec-06 19:24

You should define both UNICODE and _UNICODE. The former is for the Windows include files and the latter for the CRT. See here[^].

Steve

Re: Converting projetc to unicode support

Mark Salsbery6-Dec-06 18:01

Mark Salsbery

6-Dec-06 18:01

To add to Leah_Garrett's reply...

If you use TCHAR types and the associated string functions (_tcscpy(), _tcscmp(), etc.) you'll
be able to use the same code for both unicode and non-unicode builds.
You can still use single-byte ASCII ("char" type) in a unicode build but you'll need to use the
type explicitly.

Mark

Find Merge Sort time

lzzluca6-Dec-06 12:37

lzzluca

6-Dec-06 12:37

Hi to all,
i'm new of that forum, it's my first post!
well, i have an array (of integer) with only 8 elements: i need to use merge sort on this array, to find merge sort order time! Sure it's very very small..! I try to use this code:
#include "time.h";
clock_t start, end; double time;
...
start = clock();
mergesort(...);
end = clock();
time = end - start /CLOCKS_PER_SEC;

on VC++ 2005 but the vaue of var. time is 0 (can merge sort be too fast to find order time by this code??).
I can't enlarge array (to have a bigger order time), so how i can do to find order time?

Thanks a lot,
Luca

Re: Find Merge Sort time

Richard Andrew x646-Dec-06 13:14

Richard Andrew x64

6-Dec-06 13:14

I think it is better to use the Win32 function GetTickCount() .

--------------------------------

"All that is necessary for the forces of evil to win in the world is for enough good men to do nothing" -- Edmund Burke

Re: Find Merge Sort time

Mark Salsbery6-Dec-06 13:24

Mark Salsbery

6-Dec-06 13:24

I think GetTickCount() has the same resolution as clock(). Alot of sorting can get done in
1 millisecond.

Re: Find Merge Sort time

Richard Andrew x646-Dec-06 13:33

Richard Andrew x64

6-Dec-06 13:33

My apologies. I'll go slink back into my hole. Smile | :)

--------------------------------

"All that is necessary for the forces of evil to win in the world is for enough good men to do nothing" -- Edmund Burke

Re: Find Merge Sort time

Mark Salsbery6-Dec-06 13:45

Mark Salsbery

6-Dec-06 13:45

Richie308 wrote:
I'll go slink back into my hole.

Nah....just pokin fun Poke tongue | ;-P

I wish I knew how to do this actually. I suppose you'd need to be able to get the CPU clock rate
for the machine, which processor type, how many cycles each machine code instruction used takes,
and how many iterations of those codes for the given sort. My head hurts thinking about it!

Cheers,
Mark

Re: Find Merge Sort time

Mark Salsbery6-Dec-06 13:42

Mark Salsbery

6-Dec-06 13:42

It's tough to measure that small of a time span on a PC.

If your platform is Windows, you could check out GetThreadTimes() API. This will be more accurate
because time spent on other threads isn't included. I'm not sure what the true accuracy is though.
I'm pretty sure there are no clocks on a PC with enough accuracy to measure your sort time.
10ms to 55ms is about the best precision, and that's a mighty long time in CPU cycles these days.

Mark

Re: Find Merge Sort time [modified]

Mark Salsbery6-Dec-06 14:01

Mark Salsbery

6-Dec-06 14:01

Also

QueryPerformanceFrequency() and QueryPerformanceCounter() if your machine supports it.

-- modified at 20:07 Wednesday 6th December, 2006

*Edit* QueryPerformanceFrequency() returns 3192270000 counts/sec on my machine. That sounds
pretty accurate Smile | :)

Re: Find Merge Sort time

lzzluca6-Dec-06 15:01

lzzluca

6-Dec-06 15:01

thanks to all, but i don't know where to find functions in yours answers ( as GetThreadTimes() API )! I'm using C++ but i know only C... How i have to set VC++ to use them??
p.s.: my OS is win XP

Re: Find Merge Sort time

Mark Salsbery6-Dec-06 15:10

Mark Salsbery

6-Dec-06 15:10

I guess you never said you were using Windows.

clock() is in the C runtime (time.h) so doesn't need Windows.

The others are part of Windows:
QueryPerformance functions and GetTickCount() are in windows.h/Kernel32.lib.

Mark

p.s. Thanks to whoever posted the QueryPerformance function link here a while back.
After rambling here about PCs not having the resolution I remembered the post and had to dig
through my favorites/bookmarks (which I now remember need a serious organizing).

Re: Find Merge Sort time

David Crow6-Dec-06 17:13

David Crow

6-Dec-06 17:13

Mark Salsbery wrote:
I guess you never said you were using Windows.

Does VS2005 exist on any other platform?

"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15

"Judge not by the eye but by the heart." - Native American Proverb

Re: Find Merge Sort time

Mark Salsbery6-Dec-06 17:55

Mark Salsbery

6-Dec-06 17:55

DavidCrow wrote:
Does VS2005 exist on any other platform?

Beats me, but I try not to assume, even though I do all the time.

Re: Find Merge Sort time

David Crow6-Dec-06 17:17

David Crow

6-Dec-06 17:17

lzzluca wrote:
can merge sort be too fast to find order time by this code??).

Any sort is fast when only eight items are involved.

lzzluca wrote:
I can't enlarge array (to have a bigger order time), so how i can do to find order time?

Why exactly do you need it? A sorting algorithm's time is only relevant on a particular machine. Move to a faster machine and the performance improves, but the number of comparisons/swaps does not change.

"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15

"Judge not by the eye but by the heart." - Native American Proverb

Re: Find Merge Sort time

lzzluca7-Dec-06 1:51

lzzluca

7-Dec-06 1:51

I'm a student! My teacher gave me a project to do for an examination: i have to compare merge sort and quicksort, using an 8 elements array... So, seems good to have order time of merge and quick sort on the same array! Or not?

Re: Find Merge Sort time

David Crow7-Dec-06 2:36

David Crow

7-Dec-06 2:36

lzzluca wrote:
So, seems good to have order time of merge and quick sort on the same array! Or not?

No, time is not a very useful number, especially when comparing sorting algorithms. Consider the result if you ran merge sort on computer A, and quicksort on computer B. Unless the two computer were identical, your results would obviously be skewed.

Surely your teacher has gone over big-O notation in the context of "benchmarking" algorithms. Those numbers do not change no matter what computer platform you use.

In any case, if you still need to time them, you'll need to explain to your teacher that the smallest resolution Windows will give you is 10ms, so both algorithms, sorting 8 items, will appear to complete in 0 seconds.

"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15

"Judge not by the eye but by the heart." - Native American Proverb

Re: Find Merge Sort time

S Douglas9-Dec-06 1:26

S Douglas

9-Dec-06 1:26

This isn't of a whole lot of help but more food for thought.

Time is the Simplest Thing...[^]

I'd love to help, but unfortunatley I have prior commitments monitoring the length of my grass. :Andrew Bleakley:

Naming a Proxy

Richard Andrew x646-Dec-06 11:59

Richard Andrew x64

6-Dec-06 11:59

What determines the Name property of a proxy server that I am developing in Win32?

For instance, the proxy settings in Internet Explorer ask for a Name and port number. Well, the port number depends upon which port I bind my listening socket to, but what determines the "Name?"

--------------------------------

"All that is necessary for the forces of evil to win in the world is for enough good men to do nothing" -- Edmund Burke

Re: Naming a Proxy

User 5838526-Dec-06 12:08

User 583852

6-Dec-06 12:08

Richie308 wrote:
but what determines the "Name?

I guess its the IP address or DNS name of the machine running the proxy

System.IO.Path.IsPathRooted() does not behave as I would expect

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