function nodequeue_get_subqueue_position in Nodequeue 7.2

Same name and namespace in other branches

1. 5.2 nodequeue.module \nodequeue_get_subqueue_position()
2. 6.2 nodequeue.module \nodequeue_get_subqueue_position()
3. 7.3 nodequeue.module \nodequeue_get_subqueue_position()

Get the position of a node in a subqueue, or 0 if not found.

10 calls to nodequeue_get_subqueue_position()

NodequeueAPISubqueueUnitTest::testNodequeueQueueBack in tests/nodequeue.test

NodequeueAPISubqueueUnitTest::testNodequeueQueueDown in tests/nodequeue.test

NodequeueAPISubqueueUnitTest::testNodequeueQueueFront in tests/nodequeue.test

NodequeueAPISubqueueUnitTest::testNodequeueQueueSwap in tests/nodequeue.test

NodequeueAPISubqueueUnitTest::testNodequeueQueueUp in tests/nodequeue.test

... See full list

File

./nodequeue.module, line 1689

Maintains queues of nodes in arbitrary order.

Code

function nodequeue_get_subqueue_position($sqid, $nid) {

  // We use MIN to make sure we always get the closest to the front of the
  // queue in case the queue has nodes in it multiple times.
  $pos = db_query("SELECT MIN(position) FROM {nodequeue_nodes} WHERE sqid = :sqid AND nid = :nid", array(
    ':sqid' => $sqid,
    ':nid' => $nid,
  ))
    ->fetchField();
  return $pos;
}