I am trying to get all available logical drive information using WMI services. If a partition is under extended partition, I am getting wrong startingOffset although getting correct startingoffset in case non extended partition.
The assert fails because the CWnd* does not point to an object that contains a valid Window handle. Something in your code has not been initiailised correctly, or you are calling Create from outside of a Window class. What class is Show_storage?
CMFCPropertyGridProperty* level1Group = new CMFCPropertyGridProperty(_T("Level1"), 0, TRUE );
CMFCPropertyGridProperty* subLevel1 = new CMFCPropertyGridProperty(_T("subLevel1"), _T("subLevel1"), _T("subLevel1") );
CMFCPropertyGridProperty* level2Group = new CMFCPropertyGridProperty(_T("Level2"), 0, TRUE );
CMFCPropertyGridProperty* subLevel21 = new CMFCPropertyGridProperty(_T("SubLevel2.1"), _T("SubLevel2.1"), _T("SubLevel2.1") );
CMFCPropertyGridProperty* subLevel22= new CMFCPropertyGridProperty(_T("SubLevel2.2"), _T("SubLevel2.2"), _T("SubLevel2.2") );
CMFCPropertyGridProperty* subLevel23 = new CMFCPropertyGridProperty(_T("SubLevel2.3"), _T("SubLevel2.3"), _T("SubLevel2.3") );
I tried inheriting my own CMFCPropertyGridProperty class and overwrite the OnDrawName but because of many protected members in the base class. (see CMFCPropertyGridProperty::OnDrawName in afxpropertygridctrl.cpp )
Now, I did overwrite the OnDrawName method, but removed lot of code that was in the base method that did not compile (access to protected members); but it seems to be OK.
As is well known when using switch (expression), thus:
"The expression must be of an integral type or of a class type for which there is an unambiguous conversion to integral type".
If the switch contains a number of case / 2 to 4 /, then there is no problem.
Well, if you say case is 30 pieces, then dostura to 29 in a row case, the compiler must make 29 comparisons.
Below is a one of the solutions to this problem.
And so the program as expression must transmit the index number to any array, containing the address points
transition operator goto.
Notes: Of course array must contain the called function.
Have a gander here[^]. Pay particular attention to #11.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment
"Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst
"I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
I'm developing a simple tracking game using two haptic devices as controllers.
Haptic rendering is executed in a high priority thread.
During the experiment, force experienced will depends on the position of each player, it's calculated as follows:
I have 100 trials of tracking tasks and I have to calculate the average interaction force during each trial. How it can be done? my issue is: this manipulation have to be done in a thread with execution rate of around 8KHz
Thank you!. I have already seen some implementation of moving average. But I'm not sure about how to implement for my application. Since it's in a thread which is executing at 8Khz, I'm wondering how to store forces trial by trial and to take avareage?
The fastest solution would be a ring buffer and a total sum variable (untested):
int items = 0;
int ndx = 0;
// May need floating point here when max. value * buffer_size >= INT_MAXint sum = 0;
int get_av(int val)
if (items >= buffer_size)
sum -= buffer[ndx];
sum += val;
buffer[ndx] = val;
if (++ndx >= buffer_size)
ndx = 0;
return sum / items;
You are allocating 4 bytes (on 32 bit platform) instead of approximatively 60 bytes.
The following line is also incorrect:
Since you are Inside a function, the pointer is passed by value and a change inside the function has no effect outside of it. You need to have a pointer to a pointer to be able to update the pointer at the caller location.
You don't initialized new list to NULL so first insertion might fails because the pointer is garbage.