beanstalk python操作

来源:互联网 发布:哪些排序算法不稳定 编辑:程序博客网 时间:2024/05/17 08:14
#!/usr/bin/python #-*- coding: utf-8 -*-'''Created on 2015年6月16日'''import beanstalkcimport pickleclass BSQueueC(object):        def __init__(self, host, port=11300):        self.host = host        self.port = port        self.__conn = beanstalkc.Connection(host, port)            def __del__(self):        self.__conn.close()            def put(self,tube, body, priority=2**31, delay=0, ttr=120):        self.__conn.use(tube)        return self.__conn.put(body, priority, delay, ttr)        def reserve(self, tube, timeout=20):        for t in self.__conn.watching():            self.__conn.ignore(t)        self.__conn.watch(tube)        return self.__conn.reserve(timeout)        def clear(self, tube):        try:            while 1:                job = self.reserve(tube, 1)                if job is None:                    break                else:                    job.delete()        except Exception, e:            print e

0 0
原创粉丝点击