When i plot in the chart, i found chart speed is slower than other soft. Now i think chartarea refresh is cost most of time, but some times i don't need to refresh background series, just need to use invalidate to call paint function.
So is there any method to stop backgound series refresh ,not refresh paint function content?
No, there isn't, and YES, you HAVE TO PAINT THE BACKGROUND, which means painting the entire chart area. It's the only way to "undo" the previous painting of your rectangle so it can be repainted with it's new coordinates and size.
The language used doesn't matter at all. What does matter is the design of your graphing component, which you didn't write. You're trying to adapt a graphing component that isn't designed to do the job you want to do.
If you make your own graphing component that also supports drawing boxes on it and is OPTIMIZED to support what you want to do, then you can get the speed out of it.
i want is that, when i fetch data from database then labels dynamically added to my form.
i have a code but this show only one data, i want total result of query generate automatically label and set data into label.
my code is .
DataTable table = new DataTable();
string sqlText = "SELECT DATEDIFF(DAY, [meas_duedate], GETDATE()) , meas_id, client_id FROM tlb_meas_master"
SqlCommand cmd = new SqlCommand(sqlText, con);
SqlDataReader dr = cmd.ExecuteReader();
lbl_date.Text = dr.GetValue(0).ToString();
lbl_mea_id.Text = dr.GetValue(1).ToString();
lbl_cli_id.Text = dr.GetValue(2).ToString();
catch (Exception ex)
MessageBox.Show(ex.Message + "\n" + ex.Message);
`please help me....
When I change the data in the cells of the DataGridView, and I debug, the values that are shown are the new ones, but at the end the DataGridView is not updated. Can you please give an example of possible code to complete what I already have? Thanks.
Hi, all friends:
i want to get a efficient function to sort array, and return a old array index .
For example: double a=[5,4,1,3,2];
how can i get b is [1,2,3,4,5],and index array c is [2,4,3,1,0]?
i want a efficent and quick method...
There is no built in method that will do that for you - the index to the previous array is what causes the problem - and you can't "retrospectively" find it because in the event of duplicates, you don;t know which value to use.
What I would probably do is package the value you want to sort into a struct together with it's original index and sort that, using a comparator that looked only at the values.
The resulting sorted info would include the original array index, and it would be pretty trivial to split them back up if you needed to.
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...