zoukankan      html  css  js  c++  java
  • 线程池及线程带参数

    后台代码:

    private void button1_Click(object sender, EventArgs e)
    {
    ParameterizedThreadStart start = new ParameterizedThreadStart(DownLoadHtml);
    Thread thread = new Thread(start);
    thread.Start();
    }

    private void DownLoadHtml(object obj)
    {
    for (int i = 30000; i < 30010; i++)
    {
    using (WebClient client = new WebClient())
    {
    try
    {
    client.DownloadFile(@"http://job.cnblogs.com/offer/" + i + "/", @"E:html" + i + ".html");
    this.Invoke(new Action(delegate() {
    this.textBox1.AppendText("第"+i+"个帖子下载完成! ");
    }));
    }
    catch (Exception)
    {


    }
    }
    }
    Action action = new Action(msg);
    this.Invoke(action);
    }

    private void msg()
    { MessageBox.Show("下载完成!"); }

    private void button2_Click(object sender, EventArgs e)
    {
    ParameterizedThreadStart start = new ParameterizedThreadStart(mianji);
    Thread thread = new Thread(start);
    thread.Start(5);
    }

    private void mianji(object r)
    {
    double result = Math.PI * Convert.ToDouble(r) * Convert.ToDouble(r);
    MessageBox.Show(result.ToString());
    }

    private void button3_Click(object sender, EventArgs e)
    {
    WaitCallback wait = new WaitCallback(DownLoadHtml);
    ThreadPool.QueueUserWorkItem(wait);
    }

    private void button4_Click(object sender, EventArgs e)
    {
    for (int i = 30000; i < 30020; i++)
    {
    WaitCallback wait = new WaitCallback(DownLoadHtml1);
    ThreadPool.QueueUserWorkItem(wait,i);
    }
    //this.Invoke(new Action(delegate()
    //{
    // MessageBox.Show("下载完成!");
    //}));
    }

    private void DownLoadHtml1(object i)
    {
    try
    {
    WebClient client = new WebClient();
    client.DownloadFile(@"http://job.cnblogs.com/offer/" + i + "/", @"E:html" + i + ".html");
    this.Invoke(new Action(delegate()
    {
    this.textBox1.AppendText("第" + i + "个帖子下载完成! ");
    }));

    }
    catch (Exception)
    {


    }
    }

  • 相关阅读:
    leetcode Lowest Common Ancestor of a Binary Tree
    leetcode 141、Linked list cycle
    leetcode 136、Single Number
    tensorflow使用
    c++ priority_queue
    python语法
    CSS基础之选择器
    并发编程的一些理解
    封装的绑定与多态
    继承与派生
  • 原文地址:https://www.cnblogs.com/qiqiBoKe/p/3146954.html
Copyright © 2011-2022 走看看