• golang 实现线程池


    package main
    
    import (
    	"fmt"
    	"time"
    )
    
    type Pool struct {
    	Queue chan func() error;
    	RuntineNumber int;
    	Total int;
    
    	Result chan error;
    	FinishCallback func();
    }
    
    //初始化
    func (self *Pool) Init(runtineNumber int,total int)  {
    	self.RuntineNumber = runtineNumber;
    	self.Total = total;
    	self.Queue = make(chan func() error, total);
    	self.Result = make(chan error, total);
    }
    
    func (self *Pool) Start()  {
    	//开启 number 个goruntine
    	for i:=0;i<self.RuntineNumber;i++ {
    		go func() {
    			for {
    				task,ok := <-self.Queue
    				if !ok {
    					break;
    				}
    				err := task();
    				self.Result <- err;
    			}
    		}();
    	}
    
    	//获取每个任务的处理结果
    	for j:=0;j<self.RuntineNumber;j++ {
    		res,ok := <-self.Result;
    		if !ok {
    			break;
    		}
    		if res != nil {
    			fmt.Println(res);
    		}
    	}
    
    	//结束回调函数
    	if self.FinishCallback != nil {
    		self.FinishCallback();
    	}
    }
    
    //关闭
    func (self *Pool) Stop()  {
    	close(self.Queue);
    	close(self.Result);
    }
    
    func (self *Pool) AddTask(task func() error)  {
    	self.Queue <- task;
    }
    
    func (self *Pool) SetFinishCallback(fun func())  {
    	self.FinishCallback = fun;
    }
    
    
    func main()  {
    	var p Pool;
    	url := []string{"11111","22222","33333","444444","55555","66666","77777","88888","999999"};
    	p.Init(9, len(url));
    
    	for i := range url {
    		u := url[i];
    		p.AddTask(func() error {
    			return Download(u);
    		});
    	}
    
    	p.SetFinishCallback(DownloadFinish);
    	p.Start();
    	p.Stop();
    }
    
    func Download(url string) error {
    	time.Sleep(1*time.Second);
    	fmt.Println("Download " + url);
    	return nil;
    }
    
    func DownloadFinish()  {
    	fmt.Println("Download finsh");
    }
    

      

  • 相关阅读:
    BugkuCtf-pwn2-exp
    Python 基础知识(一)
    C++基本语法的部分总结
    Ububtu 14.04 安装 Hadoop 2.7.3
    leetcode-Evaluate the value of an arithmetic expression in Reverse Polish Notation
    leetcode-Given a binary tree, find its minimum depth
    Java 实现 AES 加解密
    git fork代码并修改胡提交到自己的git仓库
    git使用记录_备忘
    java awt 中文乱码 显示为 方块
  • 原文地址:https://www.cnblogs.com/hanyouchun/p/6369736.html
Copyright © 2020-2023  润新知