|
IVMRMixerBitmap::SetAlphaBitmap() sets a new bitmap, replacing the previous one.
You can, however, combine your bitmaps into one bitmap 
Mark
"Posting a VB.NET question in the C++ forum will end in tears." Chris Maunder
|
|
|
|
|
ah yes... that was in my mind too... ^^
but I need the position of my bitmaps in the video to be independently changed anytime I want.
is there any way to do this? I was also failed by using CDC in the same picture control with the vmr video (the CDC drawing is overlapped by the video...) -_-
thanks
-Houari
|
|
|
|
|
houari_id wrote: but I need the position of my bitmaps in the video to be independently changed anytime I want.
You'd need to redraw the offscreen bitmap each time the bitmaps change position.
If you're experienced with DirectDraw (I personally am not) you can also use the
VMR Renderless Playback Mode (Custom Allocator-Presenters)[^].
The alternative I chose was to make my own renderer filter so I had complete control over all the
drawing. That certanly isn't a necessary solution however.
houari_id wrote: I was also failed by using CDC in the same picture control with the vmr video (the CDC drawing is overlapped by the video...)
Yeah, that won't work well.. That's why mixing is necessary 
Mark
"Posting a VB.NET question in the C++ forum will end in tears." Chris Maunder
|
|
|
|
|
Hi,
How could i code this fast in C++ by using classes:
I want to output the work days between two dates (start and end date input by user).
I thought through it but dont know how to code it.
My thoughts:
1) calculate (count up) the absolute days between the two dates (with using time.h and week modulo to find out the free Sundays)
2) make a class with holidays
3) calculate the holidays with the Gauss easter algorithm (found it on wikipedia and some other site, see bottom of post)
4) substract the holidays from the absolute days
5) "cout" the absolute days and the count up of holidays and the final work days
Carl Friedrich Gauß (1777 - 1854):
a = YYYY mod 19
b = YYYY mod 4
c = YYYY mod 7
d = (19a + M) mod 30
e = (2b + 4c + 6d + N) mod 7
YYYY: the year with 4 digits
M and N:
for 1583 - 1599 -> M=22, N=2
1600 - 1699 -> 22, 2
1700 - 1799 -> 23, 3
1800 - 1899 -> 23, 4
1900 - 1999 -> 24, 5
2000 - 2099 -> 24, 5
2100 - 2199 -> 24, 6
2200 - 2299 -> 25, 0
2300 - 2399 -> 26, 1
2400 - 2499 -> 25, 1
taking the above easter sunday should be: (22 + d + e).March or (d + e - 9).April
and there are 2 annomalies:
1) if the result of the above falls on the 26th of April -> easter sunday will be held on the 19th of April instead
2) If a > 10 and d = 28 and the result the 25. April, -> easter sunday be corrected to the 18. April.
but how to code this?
HELP
thx a lot
berni2k
|
|
|
|
|
berni2k wrote: but how to code this?
Indeed. That sound like a very interesting class assignment. Good luck.
|
|
|
|
|
thx, I am on the way and will post the code if i can manage to do it
|
|
|
|
|
Hello, I have two questions about the stack.
1st)In MS visual studio the stack is 1MB as far as I now.
I found that using a recursive function the stack overflows at depth ~4900.
Why does this happen?
2nd)If someone has a linked list with thousand of elements how he can
reach the whole list using a recursive function?
thanks.
|
|
|
|
|
Lord_Vader wrote: 1st)In MS visual studio the stack is 1MB as far as I now.
Lord_Vader wrote: Why does this happen?
When you reach the limit, regardless of what that is, you get the overflow error. What is so hard to understand about that?
Lord_Vader wrote: 2nd)If someone has a linked list with thousand of elements how he can
reach the whole list using a recursive function?
Why would you want to do that?
|
|
|
|
|
1st)Its not hard to understand that.
But I want someone to explain specifically what happens, for example how much stack
memory one function call consumes why...
2nd)Because I have a linked list with thousand elements and I wondering if it is
possible to go through it using recursive functions.
|
|
|
|
|
Why would you iterate through a linked list with a recursive function? You already figured out the answer to your question: it is not possible unless you increase the stack size, since you seem to top at around 4900.
Just call the next pointer until you reach the end of the list. It only takes a single function.
|
|
|
|
|
Ok thanks,I was going to do that,
but I posted mainly to learn the details behind a functions call..
|
|
|
|
|
Stack memory is generally required for the function call information (return values and return address), as well as for the automatic variables in the function being called. One function may consume only 32 bytes of stack while another consumes more than 8KB of stack.
It is possible to recursively iterate over any size list... Given you have enough stack space and your environment supports it. Realistically, this depends on (1) how much stack is consumed by the recursive function, (2) how many elements are in the list, and (3) how much free stack space you have remaining at the time you start recursion (just because you have 1MB of stack by default in Win32, that does not mean that by the time your function is first called that you will have much of it left).
Iteration is generally better done using loops instead of recursion. It is also easier to debug, because you can more easily break at a certain loop counter than a certain recursion depth.
Peace!
-=- James Please rate this message - let me know if I helped or not!<HR>If you think it costs a lot to do it right, just wait until you find out how much it costs to do it wrong!
Avoid driving a vehicle taller than you and remember that Professional Driver on Closed Course does not mean your Dumb Ass on a Public Road!
See DeleteFXPFiles
|
|
|
|
|
Thanks,
Here is another one.
I additionally have a bin tree with many thousands of elements.
I use recursive functions to walk through the leafs because its more intuitive.
Will it be faster if I use loops instead?
|
|
|
|
|
It may be faster to use loops, depending on the setup required for the recursive function call (stack frame setup, construction/destruction of any local objects, exception handling setup if used, etc.). If your function uses poor coding habits, like using a CString instead of a local buffer for simple formatting, using the loop will very likely be faster than recursion, because you can eliminate the overhead of allocating/deallocating the memory for the string. (You may not notice a difference when only calling the function 100 or so times, but when you start hitting the 1000+ ranges, you may.)
A (well-balanced) binary tree is likely to have less recursive demand, whereas a list is a linear structure so your recursion level would be equal to the number of items in the list. Trees tend to have less depth when used/populated correctly.
Peace!
-=- James Please rate this message - let me know if I helped or not!<HR>If you think it costs a lot to do it right, just wait until you find out how much it costs to do it wrong!
Avoid driving a vehicle taller than you and remember that Professional Driver on Closed Course does not mean your Dumb Ass on a Public Road!
See DeleteFXPFiles
|
|
|
|
|
Thanks,Specifically I am working on a graphics algorithm which uses a binary tree
to draw triangles(which are the leafs) on the screen. Now if you consider that I would
like to have ~60000 leafs displayed every frame using a recursive function,
this is quite cumbersome.Additionally the tree may not be so balanced, but the maximum
depth of the tree wont be larger than ~14.Thats why I asked.
|
|
|
|
|
Each function call in a recursive loop consumes stack space. If you're passing parameters, that consumes even more stack space. I thought the max stack space for a given app was limited to 64k...
Of course, I'm old, so it may have changed since I last checked it out.
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass..." - Dale Earnhardt, 1997
-----
"...the staggering layers of obscenity in your statement make it a work of art on so many levels." - Jason Jystad, 10/26/2001
|
|
|
|
|
In general, using recursion in pure imperative languages such as C++ is a bad idea - it can lead to stack overflows and also tends to be slower than iteration.
Functional languages such as OCaml are able to internaly convert recursion (at least tail recursion) to iteration and then it is OK to use recursion.
|
|
|
|
|
Well, I think there are definitely some very good uses of recursion in C++ such as generically printing out the data in an XML DOM tree, where there is no absolutely defined node structure. I'm not sure how you'd go about doing that otherwise. That said, DOM tree hierarchies typically don't go down that many levels -- that would be both a memory usage and usability nightmare.
|
|
|
|
|
Hi
I create new process (exe) with CreateProcess function.
now Iv got a handle (hProcess) and would like to know whether or not the process is alive?
|
|
|
|
|
Here's one way...
if (WAIT_OBJECT_0 != ::WaitForSingleObject(hProcess, 0))
{
// process is still active
}
"Posting a VB.NET question in the C++ forum will end in tears." Chris Maunder
|
|
|
|
|
|
Hello!
We have 2D array, Data[20][10], it contains some values, want some suggestions on how to count the distinct values in the array, without getting into 19 loops from 0 to 19 checking against each value!!!
We are using VC++ 6.
Thanks
Adeel
--
|
|
|
|
|
What is the range of your values? If it's not a huge range (more than 0-1000000), you can use a bucket sort technique, which is to basically initialize an array of bools of size 1000000, and set all initial values to false (I'm not sure what values they default to). Then, iterate through all the data in your 2D array and for each value, check if the bool array entry corresponding to the value is true. If it is, then you know you have duplicate values. If it's false, then set the bool array entry to true, so next time, it will detect a duplicate value.
Example: If the current iteration of your 2D array gives you a value of 5, you set boolArray[5] = true.
If you wish to count the values, then you can use an int array instead of a bool array and just increment as you go.
|
|
|
|
|
madeelch1986 wrote: We have 2D array, Data[20][10], it contains some values, want some suggestions on how to count the distinct values in the array
Stealing from Cyrilix, here's one way...
char Data[20][10];
bool Flags[256];
memset(Flags, 0, sizeof(Flags));
int UniqueCount = 0;
for (int i = 0; i < 20; i++)
{
for (int j = 0; j < 10; j++)
{
if (false == Flags[(unsigned char)Data[i][j]])
{
Flags[(unsigned char)Data[i][j]] = true;
++UniqueCount;
}
}
}
"Posting a VB.NET question in the C++ forum will end in tears." Chris Maunder
|
|
|
|
|
Completely newbie to this site (and Visual C++) so please be gentle if I am doing something wrong.
I am attempting to modify someone else's code and am not sure what I am doing wrong. The project setting indicated "not MFC" and "Win32 debug" which I didn't understand but couldn't find anything in the search. Without changing anything else, I just wanted to add a combo box with a list of items which can be selected. I dropped a combo box control on the dialog form and added 3 items to the data tab and recompile to see if the box displayed properly. The combo box is on the form but nothing is in the drop down list? What might I be doing wrong? I tried creating a new dialog project and the combo box is working fine. Any help would be appreciated.
David
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
