I have One Dialog with Five tabs. Each Tab having so many controls like Edit boxes,buttons and all.
My problem is When u enter some Data in any control of that particular tab,the ASTERIK should be added to the Tab Name.(Same as when we write aome Data in wordpad the asterik will add to the Document Name).
So, How can i Do that...
My IDEA is ::: OnKillfocus() and "change" event of every Control we maintain one varible.but there are so many Controls..!!!!!
The controls send notifications to the parent whenever changes are made.
These notifications are typically sent via WM_COMMAND or WM_NOTIFY
Assuming MFC here (you could do similar using straight Win32):
You could override OnCommand() and OnNotify() in the parent dialog
and in your overrides, look for the change notifications, and if one
is received, take the appropriate action. Make sure you call the base
class method so proper MFC command/notification processing gets done.
For a list of the possible notifications and how they are sent, see
the Windows Controls[^] documentation for the types of controls
Rajesh, do you know of any good implementations of BigNum that are not Gnu based, i.e. use MS tools like MASM? I have Googled "multi precision math" and went through all of the hits, and the results (there were 97) were all about BigNum, or proprietary for sale products, or for Java, or were white papers. Nothing there about a PC based MS implementation. I even searched the CP articles and found no hits.
I downloaded the GMP version and started looking at the ASM source, but without the GCC compiler and its tools, the code is not complete. It needs to be expanded by the Gnu M4 macros and assembled by GAS (Gnu Assembler?), and even then I don't know whether or not it produces anything like a .LST file that would actually indicate exactly what instructions are executing at which locations to gain their reported speed by taking advantage of cashing, etc. I really don't want to go this route, I want to stick with MS tools and don't even want the C++ front end, strictly MASM.
I do have an integer implementation of a multi precision math library and was thinking of expanding it to a floating point version and was looking to see how it stacked up with "the best". As far as I could easily determine, the BigNum algorithms matched mine. Mine were home brew - what worked fastest, theirs were based on the experts like Knuth. I went to my library and cracked open Knuth, Vol 2, for the first time to see what the expert had to say. Enlightening. I have also done a thorough read of the AMD specs on my Athlon and have used many of their suggestions.
I am not able to suggest something readily that might suit you. Further to that, I have not worked too much on this front. I have forwarded this query to a few people that might possibly give a fruitful reply.
I'll write to you if I hear something from them.
It is a crappy thing, but it's life -^Carlo Pallini
A number with 1000000000 digits is the largest number? Cool,
that simplifies my life considerably!
is there any data type is which I can store the 1 billion digit numbe
You can easily make your own type.
Assuming you only need to work with digits 0-9, you only need
four bits per digit. That means two digits will fit in a byte.
Write a class to wrap a 500000000 byte array and cross your fingers
that you are actually able to allocate that much in one chunk.
A backing store on the harddrive may help here - perhaps a memory
mapped file. In the class, provide whatever methods you need to access