zoukankan      html  css  js  c++  java
  • C#线程

    using System;
    using System.Threading;
    namespace test
    {
        public class ThreadWork
        {
            public static void DoWork()        //创建一个函数类似于DWORD Thread1Proc(LPVOID lpParameter);
            {
                for (int i = 0; i < 3; i++)
                {
                    Console.WriteLine("working thread---");
                    Thread.Sleep(1000);   //线程睡眠100ms
                }
            }
        }
        class ThreadTest
        {
            public static void Main()
            {
                Console.WriteLine("Main Start--");
                ThreadStart myThreadDelegate = new ThreadStart(ThreadWork.DoWork);
                Thread myThread = new Thread(myThreadDelegate); //相当于HThread hThread=CreateThread(NULL,0,Thread1Proc,NULL,0,NULL);
                myThread.Start();//启动线程
                for (int i = 0; i < 3; i++)
                {
                    Console.WriteLine("In main");
                    Thread.Sleep(100);   //主线程睡眠100ms
                }
                myThread.Join();      //如果线程没有完成则无限阻塞直至完成
                Console.WriteLine("Main Join");
            }
        }
    }
    //上述代码可以改写成下面的代码
    using System;
    using System.Threading;
    namespace test
    {
        public class ThreadWork
        {
            public static void DoWork()        //创建一个函数类似于DWORD Thread1Proc(LPVOID lpParameter);
            {
                for (int i = 0; i < 3; i++)
                {
                    Console.WriteLine("working thread---");
                    Thread.Sleep(1000);   //线程睡眠100ms
                }
            }
        }
        class ThreadTest
        {
            public static void Main()
            {
               
                Thread myThread = new Thread(ThreadWork.DoWork); //相当于HThread hThread=CreateThread(NULL,0,Thread1Proc,NULL,0,NULL);
                myThread.Start();//启动线程
                Console.WriteLine("这是第一个线程");
            }
        }
    }

  • 相关阅读:
    Wannafly挑战赛21A
    luoguP4000 斐波那契数列
    关于斐波那契数模意义下的循环节问题
    Codeforces Round #501 (Div. 3) F. Bracket Substring
    1257: [CQOI2007]余数之和
    51nod1380 夹克老爷的逢三抽一
    51nod1423 最大二"货" 单调栈
    51nod1624 取余最长路 前缀和 + set
    51nod1437 迈克步 单调栈
    51nod1515 明辨是非 并查集 + set
  • 原文地址:https://www.cnblogs.com/zztong/p/6695206.html
Copyright © 2011-2022 走看看