|
It is enough to refresh the label.
label.Text = i.ToString() + "%";
label.Refresh();
|
|
|
|
|
thanks.
this is working.
erfan
|
|
|
|
|
hi all,
i store date as text format in ms access. (for example: '18.07.2006' is stored in a text field in my database)
but when i want to do some search according to date i want to use records in that field as date ???
i convert data (user entered dates to compare with the dates in my database in order to do some search) entered in textboxes into datetime but dont know how to tell the my program to behave as if the dates (which hold in text fields) in my database also are 'date'.
hope that i am clear enough.
thanks in advance and bye.
|
|
|
|
|
|
Hello there,
I'm looking for a method to convert an object to Guid type and vise versa.
Thanks.
|
|
|
|
|
???
object can be everything. but guid is only a number with a format
"{15B37BBE-CE65-4a4c-83BD-79906975D223}".
What kind of object do you want to convert ?
|
|
|
|
|
hi frnds i need a windows application project on hr/payroll in C#
if any one can help me
|
|
|
|
|
|
Try to write the software of your own.
|
|
|
|
|
Are you asking for someone to write it? Email me, we'll discuss contract terms
|
|
|
|
|
Best Regards,
Apurva Kaushal
|
|
|
|
|
I do have an hourly rate.
A man said to the universe:
"Sir I exist!"
"However," replied the Universe, "The fact has not created in me A sense of obligation."
-- Stephen Crane
|
|
|
|
|
hello,
I'm french so excuse my english
I am developping an application which can take photos from a webcam with WIA
and send it to a ftp.
but I saw one big bug => all photos taken from webcam have been saved to
svchost
svchost become big => more than 100mo if I let the program run
I don't know how to release memory
I have tried to release memory :
-----------------------------------------------------------------------------------------
item.ExecuteCommand(WIA.CommandID.wiaCommandDeleteAllItems);
item = video.Device.ExecuteCommand(WIA.CommandID.wiaCommandDeleteAllItems);
-----------------------------------------------------------------------------------------
and to capture some image :
-----------------------------------------------------------------------------------------
item =
video.Device.ExecuteCommand(WIA.CommandID.wiaCommandTakePicture);
imagefile = item.Transfer(WIA.FormatID.wiaFormatBMP) as
WIA.ImageFile;
imagefile.SaveFile("./" + bmpf);
imagefile = null;
-----------------------------------------------------------------------------------------
item as WIA.Item
imagefile as WIA.ImageFile
video as AxWIA.AxVideoPreview
thanks
I hope you able to help me
|
|
|
|
|
How about item = "" or item = null?
|
|
|
|
|
Where can I find a good link for all the tricky questions asked on interviews on Programming??
|
|
|
|
|
|
|
Can we replace recursion by looping for example using a for loop or a while loop?
|
|
|
|
|
Yes.
Complexity increase.
regards,
Divyang Mithaiwala
System Engineer & Software Developer
|
|
|
|
|
You may don`t use loops at all roo. There are some languages (eg. Erlang), where u dont have any loops, just a recursion.
So its definitely possible, but weird, complex and nasty
|
|
|
|
|
You're basically asking if it's possible to put corners back on the wheel. The answer is yes, but the correct question is why would you want to? Recursion only simplifies code, maintenence, readability, processing, debuging, performance, stability and reliability.
Try code model generation tools at BoneSoft.com.
|
|
|
|
|
What's the best complexity of an Algorithm and what's the worst?
What do we mean by Polynomial Algorithms..(if that actually exists)?
|
|
|
|
|
Hi Nada,
the best complexity of an algorithm that can be achieved is O(1). This means that an algorithm needs constant time, and is independent from its input. The best complexity of an algorithm depends on what you want to compute, for example the best complexity for an input-dependent sorting algorithm is O(n*log(n)), there is a really theoritical prove of it.
Hmm, and the worst? There are no real limitations...
Polynomial algorithms are algorithms which needs polynomial time to compute something (e.g. O(n^2) or O(n^3)). A non-polynomial algorithm (or better exponential) are algorithms which have a really bad runtime (depending on input) (e.g. O(2 ^ n) or O(3 ^ n)).
For further information about this topic take a look at the topic "Computational complexity theory" hosted by Wikipedia. (Also information about complexity classes and O-Notation).
Hope this helps a bit
Regards
Sebastian
|
|
|
|
|
What's the difference between the 2 types
|
|
|
|
|
By value the parm is a copy of, by reference, a pointer-to is passed.
|
|
|
|