1. 20 Jun, 2009 1 commit
  2. 16 Jun, 2009 1 commit
  3. 11 Jun, 2009 1 commit
  4. 08 Jun, 2009 1 commit
  5. 06 Jun, 2009 1 commit
  6. 05 Jun, 2009 1 commit
  7. 04 Jun, 2009 1 commit
  8. 03 Jun, 2009 1 commit
  9. 29 May, 2009 1 commit
  10. 27 May, 2009 4 commits
  11. 26 May, 2009 1 commit
  12. 25 May, 2009 1 commit
  13. 22 May, 2009 2 commits
  14. 21 May, 2009 2 commits
  15. 16 May, 2009 1 commit
  16. 14 May, 2009 1 commit
  17. 12 May, 2009 2 commits
  18. 06 May, 2009 1 commit
    • Dries's avatar
      - Patch #391340 by chx, dww, neclimdul, Crell, alex_b, et al: job queue API. · 4ef77a59
      Dries authored
      The queue system allows placing items in a queue and processing them later.  The system tries to ensure that only one consumer can process an item.
      
      Before a queue can be used it needs to be created by DrupalQueueInterface::createQueue().
      
      Items can be added to the queue by passing an arbitrary data object to DrupalQueueInterface::createItem().
      
      To process an item, call DrupalQueueInterface::claimItem() and specify how long you want to have a lease for working on that item. When finished processing, the item needs to be deleted by calling DrupalQueueInterface::deleteItem(). If the consumer dies, the item will be made available again by the DrapalQueueInterface implementation once the lease expires. Another consumer will then be able to receive it when calling DrupalQueueInterface::claimItem().
      
      The $item object used by the DrupalQueueInterface can contain arbitrary metadata depending on the implementation. Systems using the interface should only rely on the data property which will contain the information passed to DrupalQueueInterface::createItem(). The full queue item returned by DrupalQueueInterface::createItem() needs to be passed to DrupalQueueInterface::deleteItem() once processing is completed.
      
      While the queue system makes a best effort to preserve order in messages, due to the pluggable nature of the queue, there is no guarantee that items will be delivered on claim in the order they were sent. For example, some implementations like beanstalkd or others with distributed back-ends like Amazon SQS will be managing jobs for a large set of producers and consumers where a strict FIFO ordering will likely not be preserved.
      
      The system also makes no guarantees about a task only being executed once: callers that have non-idempotent tasks either need to live with the possiblity of the task being invoked multiple times in cases where a claim lease expires, or need to implement their own transactions to make their tasks idempotent.
      4ef77a59
  19. 30 Apr, 2009 1 commit
  20. 29 Apr, 2009 1 commit
  21. 26 Apr, 2009 4 commits
  22. 25 Apr, 2009 1 commit
  23. 22 Apr, 2009 1 commit
  24. 21 Apr, 2009 1 commit
  25. 19 Apr, 2009 1 commit
  26. 15 Apr, 2009 1 commit
  27. 13 Apr, 2009 1 commit
  28. 11 Apr, 2009 1 commit
  29. 25 Mar, 2009 2 commits
  30. 20 Mar, 2009 1 commit