-  
modify callers list    shuffle = random.shuffle    for _ in repeat(None):        shuffle(it)        yield it[0]  broker_failover_strategy = random_failover_strategy  broker_heartbeat  pyamqp  Default: 120 add fails if the key already exists    status = cache.add(lock_id, oid, LOCK_EXPIRE)    try:        yield status    finally:        # memcache delete is very slow, but we have to use it to take        # advantage      yield connection    else:        # must've new connection, and also close the connection        # after the block returns        with create_new_connection() as connection:            yield connection
 0 码力 |
          2309 页 |
          2.13 MB
          | 1 年前 3
  -  
modify callers list    shuffle = random.shuffle    for _ in repeat(None):        shuffle(it)        yield it[0]  broker_failover_strategy = random_failover_strategy  broker_heartbeat  pyamqp  Default: 120 add fails if the key already exists    status = cache.add(lock_id, oid, LOCK_EXPIRE)    try:        yield status    finally:        # memcache delete is very slow, but we have to use it to take        # advantage      yield connection    else:        # must've new connection, and also close the connection        # after the block returns        with create_new_connection() as connection:            yield connection
 0 码力 |
          2313 页 |
          2.13 MB
          | 1 年前 3
  -  
modify callers list    shuffle = random.shuffle    for _ in repeat(None):        shuffle(it)        yield it[0]  broker_failover_strategy = random_failover_strategy  broker_heartbeat  pyamqp  Default: 120 add fails if the key already exists    status = cache.add(lock_id, oid, LOCK_EXPIRE)    try:        yield status    finally:        # memcache delete is very slow, but we have to use it to take        # advantage      yield connection    else:        # must've new connection, and also close the connection        # after the block returns        with create_new_connection() as connection:            yield connection
 0 码力 |
          2313 页 |
          2.14 MB
          | 1 年前 3
  -  
modify callers list    shuffle = random.shuffle    for _ in repeat(None):        shuffle(it)        yield it[0]  broker_failover_strategy = random_failover_strategy  broker_heartbeat  pyamqp  Default: 120 add fails if the key already exists    status = cache.add(lock_id, oid, LOCK_EXPIRE)    try:        yield status    finally:        # memcache delete is very slow, but we have to use it to take        # advantage      yield connection    else:        # must've new connection, and also close the connection        # after the block returns        with create_new_connection() as connection:            yield connection
 0 码力 |
          2315 页 |
          2.14 MB
          | 1 年前 3
  -  
modify callers list    shuffle = random.shuffle    for _ in repeat(None):        shuffle(it)        yield it[0]  broker_failover_strategy = random_failover_strategy  broker_heartbeat  transports supported: add fails if the key already exists    status = cache.add(lock_id, oid, LOCK_EXPIRE)    try:        yield status    finally:        # memcache delete is very slow, but we have to use it to take        # advantage      yield connection    else:        # must've new connection, and also close the connection        # after the block returns        with create_new_connection() as connection:            yield connection
 0 码力 |
          2110 页 |
          2.23 MB
          | 1 年前 3
  -  
modify callers list    shuffle = random.shuffle    for _ in repeat(None):        shuffle(it)        yield it[0]  broker_failover_strategy = random_failover_strategy  broker_heartbeat  transports supported: add fails if the key already exists    status = cache.add(lock_id, oid, LOCK_EXPIRE)    try:        yield status    finally:        # memcache delete is very slow, but we have to use it to take        # advantage      yield connection    else:        # must've new connection, and also close the connection        # after the block returns        with create_new_connection() as connection:            yield connection
 0 码力 |
          2106 页 |
          2.23 MB
          | 1 年前 3
  -  
(stable)  CELERYD_PREFETCH_MULTIPLIER  The number of concurrent workers is multipled by this number to 
yield the wanted AMQP QoS message prefetch count.  CELERYD_POOL  Name of the task pool class used by the "Earth")  celery.utils.repeatlast(it)  Iterate over all elements in the iterator, and when its exhausted 
yield the last value infinitely.  celery.utils.retry_over_time(fun, catch, args=[], kwargs={}, errback=
 0 码力 |
          123 页 |
          400.69 KB
          | 1 年前 3
 -  
used.  CELERYD_PREFETCH_MULTIPLIER  The number of concurrent workers is multipled by this number to 
yield the wanted AMQP QoS message prefetch count.  CELERYD_POOL  Name of the task pool class used by the "Earth")  celery.utils.repeatlast(it)  Iterate over all elements in the iterator, and when its exhausted 
yield the last value infinitely.  celery.utils.retry_over_time(fun, catch, args=[], kwargs={}, errback=
 0 码力 |
          221 页 |
          283.64 KB
          | 1 年前 3
 -  
conf.CELERYD_PREFETCH_MULTIPLIER  The number of concurrent workers is multipled by this number to 
yield the wanted AMQP QoS message prefetch count. Default is: 4  celery.conf.CELERYD_POOL  Name of the task evaluate()  celery.utils.repeatlast(it)  Iterate over all elements in the iterator, and when its exhausted 
yield the last value infinitely.  celery.utils.retry_over_time(fun, catch, args=[], kwargs={}, errback=
 0 码力 |
          165 页 |
          492.43 KB
          | 1 年前 3
 -  
conf.CELERYD_PREFETCH_MULTIPLIER  The number of concurrent workers is multipled by this number to 
yield the wanted AMQP QoS message prefetch count. Default is: 4  celery.conf.CELERYD_POOL  Name of the task evaluate()  celery.utils.repeatlast(it)  Iterate over all elements in the iterator, and when its exhausted 
yield the last value infinitely.  celery.utils.retry_over_time(fun, catch, args=[], kwargs={}, errback=
 0 码力 |
          284 页 |
          332.71 KB
          | 1 年前 3