|
Hi All,
I am having a FormView and i have shown the form View in Menu Click Event. Previously there was a Model Dialog for that Event. The same event is modified to CFormView.
My Doubt is.
Code
----
CMyDialog dlg;
if( dlg.DoModel()== IDOK)
{
//Some Conditions ......
}
The Code will wait untill the CDialog Box is been Closed.
The Same behaviour must be applied to CFormView.
What is the Process to do.
Regards,
Uday.
|
|
|
|
|
If you want it to be modal why not simply disable other windows and run a message pump?
Steve
|
|
|
|
|
Hi Steve,
Thank you very much for giving Idea.
Regards,
Uday.
|
|
|
|
|
Hi,
I have a question in windows base development,
I am using VS C++ is it possible to create a packet cannon that use multiple proxy servers to send the packet.
In multi i mean that the packet go from one proxy to another one and so on till the target location.
I can use one proxy server for each package that i send, but is it possible to use more then one for the same package?
Example scenario:
command:
packet_canon.exe -p plist.txt -h 3 -t [site name]/example_script.php
sending package to '[site name]/example_script.php'...
packet go into proxy server USA...
From there to Proxy server in UK...
From there to Proxy server in Japan...
From there to the target site...
the -p - is for a proxy list file
the -h - is for how many proxy to pass
the -t - is the target location (php script).
Thanks a lot for any help and your time,
Ram.
|
|
|
|
|
It might depend on the type of proxy used.
I suspect it's possible using SOCKS, but I don't quite see a way to do this via HTTP
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~<br />
Peter Weyzen<br />
Staff Engineer<br />
<a href="http://www.soonr.com">SoonR Inc -- PC Power delivered to your phone</a>
|
|
|
|
|
Hi Peter,
I will give it (SOCKS) a look....
Thanks for the reply.
Ram.
|
|
|
|
|
hi evry body
im want a program in subject:
source code car firetruck in c
please help me
thank you
|
|
|
|
|
What ?
What the hell are you talking about ?
Furthermore, nobody is going to do the work for you and provide the full source code. You have to do the work on your own and ask specific questions when you are stuck.
|
|
|
|
|
Arefeh Haghpnah wrote: source code car firetruck in c
You should choose the joke icon, though.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
[My articles]
|
|
|
|
|
Arefeh Haghpnah wrote: source code car firetruck in c
Here it is:
http://www.firetrucksourcecode.info[^]
Important before you compile the code:
#ifdef Emergency
#define WaterPressure 1
#else
#define Siren 0
#endif
Go and never darken my towels again - Groucho Marx
|
|
|
|
|
You seem to be confused, firetrucks don't have a source code but a chassis.
"I love deadlines. I like the whooshing sound they make as they fly by." (DNA)
|
|
|
|
|
Unless your firetruck hits a firewall, there will be no source code involved.
|
|
|
|
|
hi guys, i came up with a problem. I have 4 GB file(disk size) and i want to read this file in my 2 GB(primary memory) machine.
Please suggest the best method to do so?
Величие не Бога может быть недооценена.
modified on Tuesday, December 21, 2010 2:57 AM
|
|
|
|
|
You can always read data in chunks. Do you mean how to load the entire 4GB into RAM?
|
|
|
|
|
Not exactly, i want to find some data in that file.
So need to until that point is enough, but that search may be on last part.
So i need a mechanism to do so.
I believe CreateFileMapping can be used, do u think, its a good solution?
Величие не Бога может быть недооценена.
|
|
|
|
|
So you indeed need to read data in chunks as I said. Load a chunk and perform the search. Keep loading the next part of the file into the chunk until you get the data.
To do this, you may use memory mapped file or one of the various read(...) functions (Win32 API, CRT etc). Either way, you would still have to read the file in chunks.
|
|
|
|
|
Good Day, is anyone manage to convert the function to DLL? I am not a C++ or C# developer... I have no clue how am I going to convert the whole thing to vb.net version. Can you help? Thanks
|
|
|
|
|
|
Teoh Chia Wei wrote: is anyone manage to convert the function to DLL?
What function are you talking about, and why do want to convert it to a DLL?
Teoh Chia Wei wrote: I have no clue how am I going to convert the whole thing to vb.net version.
Convert from what? And what does this have to do with C/C++?
Just say 'NO' to evaluated arguments for diadic functions! Ash
|
|
|
|
|
This is a strange question. DLLs export functions, so I guess you're asking how to make a DLL that exports the function? I suggest you read up on DLLs.
Steve
|
|
|
|
|
Sorry... this is my problem... I have no experience in C++ although I understand the logic in this feature... but I want to write it in VB.net. Instead of thinking how all the Windows libraries that work similarly like C++. I was thinking of compile this C++ project into DLL so that I can import the DLL in my VB.net. Unfortunately, it doesn't work that way.
Or, you guys as experts... got any idea what should I do with this? Thanks
|
|
|
|
|
|
Hi,
I faced few interview questions in C++. I'm new to C++. Please let me know the answers for the below questions.
* Whats the lookup plan for hash table and linkedlist
* Use of Red-Black Tree
* which datastructure is preferrable to store name, address and phone values
* How mutex works internally
Thanks in advance
modified on Monday, December 20, 2010 6:58 AM
|
|
|
|
|
Rather than asking someone to give you answers to pass your interview, you would do better to buy a book on C++ and learn it before attempting such an interview.
Just say 'NO' to evaluated arguments for diadic functions! Ash
|
|
|
|
|
Some brief answers...
1. Hash tables can look up items very quickly, at the cost of more space and a fixed size. This is their main advantage. A linked list is good for unknown amounts of data; it grows as you add more data. Lookup requires going though (on the average) half the list, so is generally slow.
2. A red-black tree uses one extra bit of storage per node to avoid the worst-case binary trees (skewed). (A scapegoat tree accomplishes this without the 1-bit overhead per node.)
3. A class.
4. All mutual-exclusion mechanisms ultimately depend on an atomic test-and-set operation, which determines if another thread is accessing a critical resource, and sets a flag at the same time if the resource is free. This must be done by hardware; if this capability isn't available, no pure-software solution will be able to provide mutual exclusion.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
