I have record a video avi, but some time I get a blank frame at first. I need to removethis but I don't know how to check if bitmap frame is blank or not. Please help me with checking for this.
Thanks in advance!
As developing an NT service I've come across a little problem that I'm no able to sort it out. The problem is as follows:
My service is running on local system account (as it is natural) and one of its chores is to launch a particular process in a particular session and with the privileges of a particular user(impersonation). I think I do everything I am supposed to:
- Retrieve environment block of the user.
- Retrieve access token of the user we try to impersonate.
- Convert the token into a primary one.
- Stablish the session for the token.
- Fill in STARTUPINFO structure with the window station and desktop information
-Finally I call CreateProcessAsUserW this way:
Well, the code I have in my service works perfectly well in any platform save for the case when I try to create a new process in a terminal session of windows 2003 Server (64 bits) where I get error code 6 (Handle not valid). Any suggestion? Thanks in advance.
Is this destruction of the Window and object the correct way to do it?
Destroys the Windows window attached to the CWnd object. The DestroyWindow member function sends appropriate messages to the window to deactivate it and remove the input focus. It also destroys the window’s menu, flushes the application queue, destroys outstanding timers, removes Clipboard ownership, and breaks the Clipboard-viewer chain if CWnd is at the top of the viewer chain. It sends WM_DESTROY and WM_NCDESTROY messages to the window. It does not destroy the CWnd object.
So whatever I am doing is correct. I have one question though. As you can see from my example above, I have created a cMainFrame Pointer to the CMainFrame class. Now, lets say that cMainFrame is a private data member of class A. So, it is a who is creating cMainFrame and calling cMainFrame->CreateWindow().
Now my question is, if a user closes the window from the close button on the Window Title bar, I would have to notify class A so that it may do the required cleaning up like delete cMainFrame and stuff. So, when do I notify A then the window is destroyed? Lets say, that I am notifying A during WM_DESTROY. The implementation in A would be as follows:
I am using the Win32API. No MFC. Could you tell me which Windows message is equivalent to CWnd::PostNcDestroy?
WM_NCDESTROY is the last message for a window.
The MFC implementation goes like this. MFC does some clean up in OnNcDestroy and then calls PostNcDestroy. The default implementation does nothing. So you will have to implement something like this.
From MSDN about PostNcDestroy:
The default implementation of CWnd::PostNcDestroy does nothing which is appropriate for window objects allocated on the stack frame or embedded in other objects. This is not appropriate for window objects that are designed to be allocated by themselves on the heap (not embedded in other C++ object).
Those classes that are designed to be allocated by themselves on the heap override the PostNcDestroy member function to perform a "delete this". This statement will free any C++ memory associated with the C++ object. Even though the default CWnd destructor calls DestroyWindow if m_hWnd is non-NULL, this does not lead to infinite recursion since the handle will be detached and NULL during the cleanup phase.
i have two questions about Programs, first is:
How to change the Text in the Titlebar when the program is minimized SW_MINIMIZE!
and second is:
How to make an TrayIcon, i want to show my application as TryIcon on the right side from the taskbar,
for example right from the clock in the task bar!? confused:
I need to compute the intersection of two (or more) sets. I will use C or C++, but STL algorithms are not enabled to be used. I have Googled, but it seems that there are only union algorithms and no intersection algorithms.
It is not my homework, and it is my interest to improve the application I am working on now. Does anyone have any reference materials or any ideas of how to design the intersection operation of sets efficiently.
Now you can compare the items in the first set with the items in the second set, making a note of the matches. If the current item in the first set is less than the current item in the second set, go to the next item in the first set. If the current item in the first set is greater than the current item in the second set, go to the next item in the second set. Otherwise the two numbers match so add the item to the third (output) set, and go to the next item in both the other two sets. Make sense?
"The largest fire starts but with the smallest spark." - David Crow
Your method is great! I am wondering whether I can do some further improvements. I think we can check the size of each set, then we can use the elements in smaller set to find the matched ones in the bigger set (or vice versa?), which can improve the performnace -- but I am not sure about it. Do you have any comments?
Last Visit: 31-Dec-99 18:00 Last Update: 21-Sep-23 20:13