|
LONG MCIWndSave(
hwnd,
szFile
);
MSDN mention that if the szFile is -1, then it will pop up a sava dialog box to let me choose the location for the wav file that i have recorded. But it never come out even though i have written... How come?
Another question is how can i disable the play button when i use MCIWndCreate? There is no option to let me disable the play button. For menu and record have, but play button don't have. (actually i just need the trackbar)
|
|
|
|
|
|
Hacking is what keeps me up nights - unit tests let me sleep at night. I ![Rose | [Rose]](https://codeproject.global.ssl.fastly.net/script/Forums/Images/rose.gif) tests!
Just wanted to share...
/ravi
My new year's resolution: 2048 x 1536
Home | Articles | Freeware | Music
ravib@ravib.com
|
|
|
|
|
Whatever works for you! But all true hackers drink gallons of coffee and never sleep :p
Bob Ciora
|
|
|
|
|
Doesn't matter. I test and test and test. Then I scream we need a seperate test group. I still wake up in the middle of the night once in a while when I realize I forgot to test some obscure case. Or when a customer discovers one bug and I realize it has a more general case that is likely to hit others.
It helps to have a seperate test group, but even when I was lucky enough to have a good one the above happened.
|
|
|
|
|
Unit tests are not a substitute for system testing! But they help identify bugs a lot sooner by focusing on specific APIs. As a matter of habit, I write unit tests for (virtually all) API calls before implementing the APIs themselves.
/ravi
My new year's resolution: 2048 x 1536
Home | Articles | Freeware | Music
ravib@ravib.com
|
|
|
|
|
hdc = GetDC (hwnd) ;<br />
hdcMem = CreateCompatibleDC (hdc) ;<br />
hBitmap = CreateCompatibleBitmap (hdc, cxTotal, cyTotal) ;<br />
ReleaseDC (hwnd, hdc) ;<br />
<br />
SelectObject (hdcMem, hBitmap) ;<br />
Rectangle (hdcMem, -1, -1, cxTotal + 1, cyTotal + 1) ;<br />
<br />
hBrush = CreateHatchBrush (HS_DIAGCROSS, 0L) ;<br />
SelectObject (hdcMem, hBrush) ;<br />
SetBkColor (hdcMem, RGB (255, 0, 255)) ;<br />
Ellipse (hdcMem, cxMove, cyMove, cxTotal - cxMove, cyTotal - cyMove) ;
================
The hwnd has a white background color, I wonder how's the preceding codes turn out to be a cyTotal * cxTotal rectangular(white bkground) and within which is a centered circle(pink bkground) painted with hatched brush. How's the code " Rectangle (hdcMem, -1, -1, cxTotal + 1, cyTotal + 1) " play a part? Could anybody give me a explanations in details
The following is the complete source code
#include <windows.h><br />
#define ID_TIMER 1<br />
<br />
LRESULT CALLBACK WndProc (HWND, UINT, WPARAM, LPARAM) ;<br />
<br />
int WINAPI WinMain (HINSTANCE hInstance, HINSTANCE hPrevInstance,<br />
PSTR szCmdLine, int iCmdShow)<br />
{<br />
static TCHAR szAppName[] = TEXT ("Bounce") ;<br />
HWND hwnd ;<br />
MSG msg ;<br />
WNDCLASS wndclass ;<br />
<br />
wndclass.style = CS_HREDRAW | CS_VREDRAW ;<br />
wndclass.lpfnWndProc = WndProc ;<br />
wndclass.cbClsExtra = 0 ;<br />
wndclass.cbWndExtra = 0 ;<br />
wndclass.hInstance = hInstance ;<br />
wndclass.hIcon = LoadIcon (NULL, IDI_APPLICATION) ;<br />
wndclass.hCursor = LoadCursor (NULL, IDC_ARROW) ;<br />
wndclass.hbrBackground = (HBRUSH) GetStockObject (WHITE_BRUSH) ;<br />
wndclass.lpszMenuName = NULL ;<br />
wndclass.lpszClassName = szAppName ;<br />
<br />
if (!RegisterClass (&wndclass))<br />
{<br />
MessageBox (NULL, TEXT ("This program requires Windows NT!"),<br />
szAppName, MB_ICONERROR) ;<br />
return 0 ;<br />
}<br />
<br />
hwnd = CreateWindow (szAppName, TEXT ("Bouncing Ball"),<br />
WS_OVERLAPPEDWINDOW,<br />
CW_USEDEFAULT, CW_USEDEFAULT,<br />
CW_USEDEFAULT, CW_USEDEFAULT,<br />
NULL, NULL, hInstance, NULL) ;<br />
<br />
ShowWindow (hwnd, iCmdShow) ;<br />
UpdateWindow (hwnd) ;<br />
<br />
<br />
while (GetMessage (&msg, NULL, 0, 0))<br />
{<br />
TranslateMessage (&msg) ;<br />
DispatchMessage (&msg) ;<br />
}<br />
return msg.wParam ;<br />
}<br />
<br />
LRESULT CALLBACK WndProc (HWND hwnd, UINT iMsg, WPARAM wParam, LPARAM lParam)<br />
{<br />
static HBITMAP hBitmap ;<br />
static int cxClient, cyClient, xCenter, yCenter, cxTotal, cyTotal,<br />
cxRadius, cyRadius, cxMove, cyMove, xPixel, yPixel ;<br />
HBRUSH hBrush ;<br />
HDC hdc, hdcMem ;<br />
int iScale ;<br />
<br />
switch (iMsg)<br />
{<br />
case WM_CREATE:<br />
hdc = GetDC (hwnd) ;<br />
xPixel = 1 ;<br />
yPixel = 1 ;<br />
ReleaseDC (hwnd, hdc) ;<br />
<br />
SetTimer (hwnd, ID_TIMER, 50, NULL) ;<br />
return 0 ;<br />
<br />
case WM_SIZE:<br />
xCenter = (cxClient = LOWORD (lParam)) / 2 ;<br />
yCenter = (cyClient = HIWORD (lParam)) / 2 ;<br />
<br />
iScale = min (cxClient, cyClient) / 16 ;<br />
<br />
cxRadius = iScale;<br />
cyRadius = iScale;<br />
<br />
cxMove = max (1, cxRadius / 2) ;<br />
cyMove = max (1, cyRadius / 2) ;<br />
<br />
cxTotal = 2 * (cxRadius + cxMove) ;<br />
cyTotal = 2 * (cyRadius + cyMove) ;<br />
<br />
if (hBitmap)<br />
DeleteObject (hBitmap) ;<br />
hdc = GetDC (hwnd) ;<br />
hdcMem = CreateCompatibleDC (hdc) ;<br />
hBitmap = CreateCompatibleBitmap (hdc, cxTotal, cyTotal) ;<br />
ReleaseDC (hwnd, hdc) ;<br />
<br />
SelectObject (hdcMem, hBitmap) ;<br />
Rectangle (hdcMem, -1, -1, cxTotal + 1, cyTotal + 1) ;<br />
<br />
hBrush = CreateHatchBrush (HS_DIAGCROSS, 0L) ;<br />
SelectObject (hdcMem, hBrush) ;<br />
SetBkColor (hdcMem, RGB (255, 0, 255)) ;<br />
Ellipse (hdcMem, cxMove, cyMove, cxTotal - cxMove, cyTotal - cyMove) ;<br />
DeleteDC (hdcMem) ;<br />
DeleteObject (hBrush) ;<br />
return 0 ;<br />
<br />
case WM_TIMER:<br />
if (!hBitmap)<br />
break ;<br />
<br />
hdc = GetDC (hwnd) ;<br />
hdcMem = CreateCompatibleDC (hdc) ;<br />
SelectObject (hdcMem, hBitmap) ;<br />
<br />
BitBlt (hdc, xCenter - cxTotal / 2,<br />
yCenter - cyTotal / 2, cxTotal, cyTotal,<br />
hdcMem, 0, 0, SRCCOPY) ;<br />
<br />
ReleaseDC (hwnd, hdc) ;<br />
DeleteDC (hdcMem) ;<br />
<br />
xCenter += cxMove ;<br />
yCenter += cyMove ;<br />
<br />
if ((xCenter + cxRadius >= cxClient) || (xCenter - cxRadius <= 0))<br />
cxMove = -cxMove ;<br />
<br />
if ((yCenter + cyRadius >= cyClient) || (yCenter - cyRadius <= 0))<br />
cyMove = -cyMove ;<br />
<br />
return 0 ;<br />
<br />
case WM_DESTROY:<br />
if (hBitmap)<br />
DeleteObject (hBitmap) ;<br />
<br />
KillTimer (hwnd, ID_TIMER) ;<br />
PostQuitMessage (0) ;<br />
return 0 ;<br />
}<br />
return DefWindowProc (hwnd, iMsg, wParam, lParam) ;<br />
}
|
|
|
|
|
According to Microsoft's documentation for Rectangle, the function draws the outline in the current pen and fills the rectangle with the current brush. Since, at the point Rectangle() is called, neither a Pen nor a Brush has been selected, I'm going to assume that the DC is using PS_NULL as the pen, and a default white brush. This would lead to the result you're describing.
Hope it helps!!
Bob Ciora
|
|
|
|
|
Thanks
But the Rectangle() seems more than just draw a rectangular. When I uncommented that line, the outcome is so different!
|
|
|
|
|
I return to the windows development community in need of some anger and frustration relieving guidance from you guru's. I have the following code :
<br />
#pragma pack(push, 1)<br />
typedef struct<br />
{<br />
u16 _id : 10;<br />
u8 _hflip : 1;<br />
u8 _vflip : 1;<br />
u8 _palettetype : 4;<br />
} MAPDATA;<br />
Correct me if I'm wrong but 10 bits + 1 bit + 1 bit + 4 bits = 16 bits which equates to 2 f**king bytes, yet #pragma pack, push, pop every blinking piece of crap that microsoft has to offer returns 3 bytes when I call sizeof(MAPDATA) ! ! ! If I use #pragma push(2) sizeof then miraculously returns with a 4 byte alignment. This is completely messing up my quantize and save algorithm and I've been up until 2am in the morning trying to figure out why gcc's __attribute__ ((packed)) works like a dream and microsoft's pants #pragma pack counts like an epileptic monkey in a bright multi-coloured jacket.
Thanks all,
and apologies for the frustration.
"When I left you I was but the learner, now I am the master" - Darth Vader
|
|
|
|
|
1. Why are you using u8 type. If you used u16 again, both compilers might do what you like.
2. I have no idea why you think the pack pragma would do anything here. Everything is being packed byte aligned.
3. The Microsoft and GNU compilers are working as expected. If you would bother to look at the C++ standard, how bitfields are stored is totally implementation defined.
Tim Smith
I'm going to patent thought. I have yet to see any prior art.
|
|
|
|
|
Hey thankyou for the tip off. It came like a dose of paracetemol to me  . Here are my answers to some of your questions.
1. Because i didn't see the point in declaring a 16 bit type with a bitfield of less than 8 bits when the 8 bit type is nearer the size i wanted (well that was the thinking).
2. I was assuming the compiler would notice it was trying to pack a 16 bit struct and therefore pack it on a 2 byte boundary as I was requesting.
3. Mmm the weird thing was that I saw that you're supposed to use the 'unsigned' declaration with no size typing so the compilers can make the same choices in their different ways. I think I was just extremely tired, either that or ignorant . I also never bother referencing the c++ standard when using a Microsoft compiler because its tends to break it at will, although the .NET 2003 Visual Studio one is much more compliant (and I'm hoping 2005 will be even better with platform independant project management yay ). I could see that the two compilers had implemented it in their different ways, I just wanted to know what I had to do to get the microsoft implementation to give me the same semantics as gcc.
I was only trying to make a tool for my blinking program, but became frustrated as I wasted the entire evening after coming home from work at 9.30pm (long day) doing something simple like this until 2am (British time). Your response solved it in two seconds. I think it is a lesson learned now though, I shall use the 'unsigned' type declaration instead of a u16 or u8 declaration and leave the packing all up to the compiler.
Thanks again though
"When I left you I was but the learner, now I am the master" - Darth Vader
|
|
|
|
|
I take it back, when I make all the struct elements of 'unsigned' type instead of specifying the size (u16), it packs them on a four byte boundary which is just absolutely crap because its soooooooo obvious i want it on a two byte boundary - not only am i specifying the bitfields upto a size of 16bits I'm also TELLING the thing via #pragma pack(2) to shove it on a 2 byte boundary and yet it still cocks it up !
It never ceases to amaze me.
"When I left you I was but the learner, now I am the master" - Darth Vader
|
|
|
|
|
In my app,I want to use the shared-memory to share the data.But this data is not certain one which can be added or deleted. So, i don't know how to do.
the API-HANDLE CreateFileMapping(
HANDLE hFile,
LPSECURITY_ATTRIBUTES lpAttributes,
DWORD flProtect,
DWORD dwMaximumSizeHigh,
DWORD dwMaximumSizeLow,
LPCTSTR lpName
);
DWORD dwMaximumSizeLow:the length of mapping data,but in my app,this length is uncertain.
|
|
|
|
|
Actually, dwMaximumSizeHigh and dwMaximumSizeLow are combined to define the 64-bit size of the block, but that's not the problem.
Although you may not be able to determine the size of the list, I'm assuming that each single element is of a fixed size. In this case, you may consider using linked blocks of File Mapped memory.
As a simple example, consider that your list is made up of DWORDs. You can define a structure of this type:
<br />
struct tagMapBlock<br />
{<br />
CHAR szBlockName[256];<br />
CHAR szPrevBlockName[256];<br />
CHAR szNextBlockName[256];<br />
DWORD dwBlockNum;<br />
DWORD dwNumBlockItems;<br />
DWORD dwBlockData[1000];<br />
} SMapBlock;<br />
A single structure of this type (e.g.) would be stored to a single block of File Mapped memory.
In this example, I've use the actual unique BlockName (the name passed to the CreateFileMapping function) for the "prev" and "next" links. I've used a size of 256 bytes arbitrarily. You may be able to use the block HANDLEs, but I'm not sure if the same handle would be valid for the processes on either side of the shared memory, so I took the safe route.
dwBlockNum is included since this may not be the first block in the
list.
dwNumBlockItems holds the number of DWORDs stored in this block. The last block in the list may have less than 1000 entries, so this value is needed.
dwBlockData is the data stored in this block.
Then you can create a File Mapping using
<br />
dwMaximumSizeHigh = 0;<br />
dwMaximumSizeLow = sizeof(SMapBlock);<br />
Since sizeof(SMapBlock) doesn't exceed what a DWORD can hold, we don't have to worry about dwMaximumSizeHigh. The "lpName" parameter that is used in the call to CreateFileMapping should be retained to be stored in the current block and in the block(s) that will be linked to this one.
You would probably want to provide helper functions to find a particular element, add an element, remove an element, etc. etc.
This is just an idea, but I hope it helps!!
Bob Ciora
|
|
|
|
|
Hello
Does anyone know how I draw a ListView frame ? (Preferrably theme compliant), I was not able to find it in uxtheme.
Thanks
|
|
|
|
|
Hi folks,
Need some serious help here. May i know how i can perform a qsort on a list of class objects I created using CList ?
I've been refering to Dr. Newcomer article on Sorting for assistance..but guess i'm pretty amateur to really understand the full concept.
Suppose I create a linked list of data type matchData called ResultList...
class matchData {
public:
matchData(CString ="", double = 0, double =0, double =0, int=0); //constructor
//set functions
void setMatchData(CString, double,double,double,int);
CString getModelName();
double getNum1();
double getNum2();
~matchData(); //destructor
private:
CString modelName;
double num1;
double num2;
int x;
};
typedef CList<matchdata*,matchdata*> matchList;
matchList Result;
how can i proceed on to qsort my Result list (assuming the list is not empty) based on num1 followed by num2? Do I have to create another class say Finalresult and put in a private data matchList inside the class ?
Please help...
Thanks alot!
|
|
|
|
|
do not know why i can't modify my message abv..
just a further clarification
My Result (list) is declared as below.
typedef CList<matchData*,matchData*> matchList;
matchList Result;
Thanks.
|
|
|
|
|
You need to provide a function for qsort to use that will compare the required fields of the objects that you want to sort by, ie, if you want to sort by num1 then the compare function would be comparing those fields and returning the result
HTH
btw the CList will be storing pointers to your objects so the compare function will be receiving 2 pointers in
|
|
|
|
|
The problem is that CList (or any linked list for that matter) doesn't lend itself well to the C runtime library's qsort() routine. qsort basically sorts an array in place, swapping entire array entries if necessary. So you first have to guarantee that all items to be sorted are in one contiguous memory block. The CList class doesn't make this guarantee.
Secondly, qsort doesn't care about the links to neighboring items. It'll just move them around blindly as it moves the object (and doesn't notify you when it does so). If qsort() moves an item referenced by another item's neighbor link, then that link is no longer valid, since it doesn't point to the original neighbor anymore. qsort doesn't care about maintaining these links...it just swaps objects blindly.
So qsort() is basically a crappy choice for linked lists.
If you're determined to use qsort(), then you'll most likely have to abandon CList as your container type in favor of something that provides a reliable array that qsort can operate on. This means that you must be sure that all elements of the array occupy one contiguous memory block. I don't think even CArray guarantees that (if you're also determined to use an MFC collection type).
So here are some things to think about if you *must* use qsort:
- If you know the maximum size the list will reach, then you can simply create a single array of that size and populate it as your program runs. You'll have to make sure to clean up "holes" when items are removed (by sliding later elements backward to fill the vacancy). This will guarantee that all sortable items will be in one contiguous block. New items get added to the end, and the list is sorted as new items are added.
- If you don't know the list's maximum size, then you'll need to develop your own resizable array class that guarantees that all items are in one contiguous memory block. The array should be able to grow (and shrink) when needed, but must always guarantee congiguous memory for qsort.
If qsort() isn't a requirement, though, then you can consider some other means of sorting the list. Linked lists, though, don't sort too well, since you can really only sort them sequentially.
However, if you're application is using num1 and num2 (and maybe x) to reference some unique CString (modelName), then you may want to consider using the CMap class instead. CMap is basically a hash table, which lends itself well to this sort of application (mapping some key value or values to a unique item). If you can provide a means to provide a unique "key" value by combining num1 and num2, you can use that key value as an index into the CMap to select the string (or entire matchData object).
For example, if you know that num1 and num2 will never exceed 10,000, then you can define your "key" value for the CMap as follows:
<br />
double CalculateKey(double num1, double num2) <br />
{ <br />
return( num1 * 10000 + num2 );<br />
}<br />
Define your CMap as follows:
<br />
typedef CMap<double, double, matchData *, const matchData *> matchList;<br />
matchList Result;<br />
Then adding a new matchData item to the list is simple:
<br />
matchData *pdataToAdd;<br />
...<br />
...<br />
double key = CalculateKey(pdataToAdd->GetNum1(), pdataToAdd->GetNum2());<br />
Result[key] = pDataToAdd;<br />
Locating an item is also simple:
<br />
double num1ToFind, num2ToFind;<br />
matchData * pfoundData;<br />
...<br />
...<br />
double key = CalculateKey(num1ToFind, num2ToFind);<br />
BOOL bFound = Result.Lookup(key, pfoundData);<br />
if( bFound )<br />
{<br />
}<br />
else<br />
{<br />
}<br />
Note that you can't use the [] operator when searching for an item. Check out the documentation for CMap over at the MSDN site. Here's the documentation for CMap
I sure hope all this helped, and good luck!!
Bob Ciora
|
|
|
|
|
Hi thanks for the replies so far. I'm aware of qsort requirement and about pointers for the comparison function.
Basically the list maximum size is not determined, but with a minimum of over hundred of matchData nodes. My intention is basically to hold matching data for an input against many models. However,the number of models may differ differently based on my experimental conditions.
My ultimate aim is to perform a multi-level sort on a linked list of matching results based on each node value, say on num1 followed by num2 if they are e same. I'm hoping to improve the overall speed by using quick sort. Thus frm the best result(top of list), i would retrieve what is the model file (my modelname).
I have looked into CMap, but I don't see the need for a hashvalue lookup cos my matchresult will differ for each model against different inputs.
Thus qsort is not a must, but apparently seems that itz one of e few choices that i can do. And also perphaps after studying e Sorting Article http://www.flounder.com/sorting.htm[^] with gives me e notion for it.
I'm still in e process of writting the codes. So not too sure if the end result will turn out fine.. 
What i'm current doing is i did another abstraction called Class SortedList where i've e sort function in it,which basically copies e content to a CArray and qsorts it.
I'm not too sure if i understand correctly but seems that the pointers are being sorted so in actual fact my original list node remains..
Or is there any better suggestion for my approach? Tks alot!
|
|
|
|
|
If you use the STL std::list container instead of CList, you can use the built-in sort() function.
|
|
|
|
|
The std::list container doesn't seem to have a way to locate an item in the list
Bob Ciora
|
|
|
|
|
Use the STL algorithm find(), it works on all STL containers.
|
|
|
|
|
Maybe a further clarification of the problem is in order. It sounds sort of like an axis sort, but I'm not sure...
- In what way do you specify uniqueness of the objects? For example, is modelName unique for each entry in the list or can multiple objects have the same modelName?
- If modelName is unique across all entries in the list, can multiple objects exist at the same (num1,num2) position? Or is this the condition you're trying to prevent?
Bob Ciora
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
