nodequeue.module in Nodequeue 6.2

Same filename and directory in other branches

Maintains queues of nodes in arbitrary order.

File

nodequeue.module

View source

<?php

/**
 * @file
 * Maintains queues of nodes in arbitrary order.
 */
define('NODEQUEUE_OK', 0);
define('NODEQUEUE_INVALID_POSITION', 1);
define('NODEQUEUE_INVALID_NID', 2);
define('NODEQUEUE_DUPLICATE_POSITION', 3);

/* --- HOOKS ---------------------------------------------------------------- */

/**
 * Implementation of hook_perm
 */
function nodequeue_perm() {
  return array(
    'manipulate queues',
    'administer nodequeue',
    'manipulate all queues',
  );
}

/**
 * Implementation of hook_menu
 */
function nodequeue_menu() {
  $items = array();
  $admin_access = array(
    'administer nodequeue',
  );

  // administrative items
  $items['admin/content/nodequeue'] = array(
    'title' => 'Nodequeue',
    'page callback' => 'nodequeue_view_queues',
    'access callback' => '_nodequeue_access_admin_or_manipulate',
    'description' => 'Create and maintain simple nodequeues.',
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_NORMAL_ITEM,
  );
  $items['admin/content/nodequeue/list'] = array(
    'title' => 'List',
    'page callback' => 'nodequeue_view_queues',
    'access callback' => '_nodequeue_access_admin_or_manipulate',
    'file' => 'includes/nodequeue.admin.inc',
    'weight' => -1,
    'type' => MENU_DEFAULT_LOCAL_TASK,
  );
  $items['admin/content/nodequeue/settings'] = array(
    'title' => 'Settings',
    'page callback' => 'drupal_get_form',
    'page arguments' => array(
      'nodequeue_admin_settings',
    ),
    'access arguments' => $admin_access,
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_LOCAL_TASK,
  );
  $items['nodequeue/autocomplete'] = array(
    'title' => 'Autocomplete',
    'page callback' => 'nodequeue_autocomplete',
    'access callback' => '_nodequeue_access_admin_or_manipulate',
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_CALLBACK,
  );
  $info = nodequeue_api_info();
  foreach ($info as $key => $data) {
    $items['admin/content/nodequeue/add/' . $key] = array(
      'title' => 'Add @type',
      'title arguments' => array(
        '@type' => strtolower($data['title']),
      ),
      'page callback' => 'drupal_get_form',
      'page arguments' => array(
        'nodequeue_edit_queue_form',
        $key,
      ),
      'access arguments' => $admin_access,
      'file' => 'includes/nodequeue.admin.inc',
      'type' => MENU_LOCAL_TASK,
    );
  }
  $items['node/%node/nodequeue'] = array(
    'title' => '@tab',
    'title arguments' => array(
      '@tab' => variable_get('nodequeue_tab_name', 'Nodequeue'),
    ),
    'page callback' => 'nodequeue_node_tab',
    'page arguments' => array(
      1,
    ),
    'access callback' => 'nodequeue_node_tab_access',
    'access arguments' => array(
      1,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'weight' => 5,
    'type' => MENU_LOCAL_TASK,
  );

  // Administrative items for an individual queue.
  $items['admin/content/nodequeue/%nodequeue'] = array(
    'page callback' => 'nodequeue_admin_view',
    'page arguments' => array(
      3,
    ),
    'access callback' => 'nodequeue_queue_access',
    'access arguments' => array(
      3,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_CALLBACK,
  );
  $items['admin/content/nodequeue/%nodequeue/view'] = array(
    'title' => 'View',
    'page callback' => 'nodequeue_admin_view',
    'page arguments' => array(
      3,
    ),
    'access callback' => 'nodequeue_queue_access',
    'access arguments' => array(
      3,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'weight' => -10,
    'type' => MENU_DEFAULT_LOCAL_TASK,
  );
  $items['admin/content/nodequeue/%nodequeue/view/%subqueue'] = array(
    'title' => 'View',
    'page callback' => 'nodequeue_admin_view',
    'page arguments' => array(
      3,
      5,
    ),
    'access callback' => 'nodequeue_queue_access',
    'access arguments' => array(
      3,
      5,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'weight' => -10,
    'tab parent' => 'admin/content/nodequeue/%',
    'type' => MENU_LOCAL_TASK,
  );

  // Actual administrative items.
  $items['admin/content/nodequeue/%nodequeue/edit'] = array(
    'title' => 'Edit queue',
    'page callback' => 'drupal_get_form',
    'page arguments' => array(
      'nodequeue_edit_queue_form',
      3,
    ),
    'access arguments' => $admin_access,
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_LOCAL_TASK,
  );
  $items['admin/content/nodequeue/%nodequeue/delete'] = array(
    'title' => 'Delete',
    'page callback' => 'drupal_get_form',
    'page arguments' => array(
      'nodequeue_admin_delete',
      3,
    ),
    'access arguments' => $admin_access,
    'file' => 'includes/nodequeue.admin.inc',
    'weight' => 5,
    'type' => MENU_CALLBACK,
  );
  $items["admin/content/nodequeue/%nodequeue/add/%subqueue/%node"] = array(
    'page callback' => 'nodequeue_admin_add_node',
    'page arguments' => array(
      3,
      5,
      6,
    ),
    'access callback' => 'nodequeue_node_and_queue_access',
    'access arguments' => array(
      6,
      3,
      5,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_CALLBACK,
  );
  $items["admin/content/nodequeue/%nodequeue/remove-node/%subqueue/%node"] = array(
    'page callback' => 'nodequeue_admin_remove_node',
    'page arguments' => array(
      3,
      5,
      6,
    ),
    'access callback' => 'nodequeue_node_and_queue_access',
    'access arguments' => array(
      6,
      3,
      5,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_CALLBACK,
  );
  $items["admin/content/nodequeue/%nodequeue/clear/%subqueue"] = array(
    'title' => 'Clear',
    'page callback' => 'drupal_get_form',
    'page arguments' => array(
      'nodequeue_clear_confirm',
      3,
      5,
    ),
    'access callback' => 'nodequeue_queue_access',
    'access arguments' => array(
      3,
      5,
    ),
    'file' => 'includes/nodequeue.admin.inc',
    'type' => MENU_CALLBACK,
  );
  return $items;
}

/**
 * Implementation of hook_nodeapi().
 */
function nodequeue_nodeapi(&$node, $op, $teaser = NULL, $page = NULL) {
  switch ($op) {
    case 'delete':

      // If a node is being deleted, ensure it's also removed from any queues.
      $result = db_query("SELECT qid, sqid FROM {nodequeue_nodes} WHERE nid = %d", $node->nid);
      while ($obj = db_fetch_object($result)) {

        // If the queue is being tracked by translation set and the node is part
        // of a translation set, don't delete the queue record.
        // Instead, data will be updated in the 'translation_change' op, below.
        $queues = nodequeue_load_queues(array(
          $obj->qid,
        ));
        $queue = array_shift($queues);
        if (!$queue->i18n || isset($node->tnid) && empty($node->tnid)) {

          // This removes by nid, not position, because if we happen to have a
          // node in a queue twice, the 2nd position would be wrong.
          nodequeue_subqueue_remove_node($obj->sqid, $node->nid);
        }
      }
      break;
    case 'translation_change':
      if (isset($node->translation_change)) {

        // If there is only one node remaining, track by nid rather than tnid.
        // Otherwise, use the new tnid.
        $content_id = $node->translation_change['new_tnid'] == 0 ? $node->translation_change['remaining_nid'] : $node->translation_change['new_tnid'];
        db_query("UPDATE {nodequeue_nodes} SET nid = %d WHERE nid = %d", $content_id, $node->translation_change['old_tnid']);
      }
  }
}

/**
 * Implementation of hook_link().
 */
function nodequeue_link($type, $node = NULL, $teaser = FALSE) {
  $links = array();
  if ($type == 'node' && variable_get('nodequeue_links', FALSE) && user_access('manipulate queues')) {
    $queues = nodequeue_load_queues_by_type($node->type, 'links');
    $subqueues = nodequeue_get_subqueues_by_node($queues, $node);
    if (empty($subqueues)) {
      return;
    }

    // resort the subqueues to retain consistent ordering:
    ksort($subqueues);

    // Due to caching, we can accidentally get positions leftover
    // from previous iterations on teaser list pages, so we must
    // remove any existing positions here.
    foreach ($subqueues as $id => $subqueue) {
      unset($subqueues[$id]->position);
    }
    if (!module_exists('translation')) {
      nodequeue_set_subqueue_positions($subqueues, $node->nid);
    }
    foreach ($subqueues as $subqueue) {
      $queue = $queues[$subqueue->qid];
      $id = nodequeue_get_content_id($queue, $node);
      if (module_exists('translation')) {
        $subqueue = array(
          $subqueue->sqid => $subqueue,
        );
        nodequeue_set_subqueue_positions($subqueue, $id);
        $subqueue = array_shift($subqueue);
      }
      $query_string = nodequeue_get_query_string($id, TRUE);
      $class = 'nodequeue-ajax-toggle nodequeue-toggle-q-' . $queue->qid . ' nodequeue-toggle-sq-' . $subqueue->sqid . ' nodequeue-toggle-ref-' . $subqueue->reference;
      if (!isset($subqueue->position)) {
        $links[$class] = array(
          'title' => nodequeue_title_substitute($queue->link, $queue, $subqueue),
          'href' => "admin/content/nodequeue/{$queue->qid}/add/{$subqueue->sqid}/{$id}",
          'attributes' => array(
            'class' => $class . ' toggle-add',
          ),
          'query' => $query_string,
          'purl' => array(
            'disabled' => TRUE,
          ),
        );
      }
      elseif ($queue->link_remove) {
        $links[$class] = array(
          'title' => nodequeue_title_substitute($queue->link_remove, $queue, $subqueue),
          'href' => "admin/content/nodequeue/{$queue->qid}/remove-node/{$subqueue->sqid}/{$id}",
          'attributes' => array(
            'class' => $class . ' toggle-remove',
          ),
          'query' => $query_string,
          'purl' => array(
            'disabled' => TRUE,
          ),
        );
      }
    }
    drupal_add_js(drupal_get_path('module', 'nodequeue') . '/nodequeue.js');
    drupal_add_css(drupal_get_path('module', 'nodequeue') . '/nodequeue.css');
  }
  return $links;
}

/**
 * Implementation of hook_forms().
 */
function nodequeue_forms($form_id) {
  $forms = array();
  if (strpos($form_id, 'nodequeue_arrange_subqueue_form_') === 0) {
    $forms[$form_id] = array(
      'callback' => 'nodequeue_arrange_subqueue_form',
    );
  }
  return $forms;
}

/**
 * Implementation of hook_action_info().
 */
function nodequeue_action_info() {
  return array(
    'nodequeue_add_action' => array(
      'type' => 'node',
      'description' => t('Add to Nodequeues'),
      'configurable' => TRUE,
      'hooks' => array(
        'nodeapi' => array(
          'insert',
          'update',
        ),
      ),
    ),
    'nodequeue_remove_action' => array(
      'type' => 'node',
      'description' => t('Remove from Nodequeues'),
      'configurable' => TRUE,
      'hooks' => array(
        'nodeapi' => array(
          'insert',
          'update',
        ),
      ),
    ),
  );
}

/**
 * Implementation of hook_theme().
 */
function nodequeue_theme() {
  return array(
    'nodequeue_arrange_subqueue_form' => array(
      'arguments' => array(
        'form',
      ),
    ),
    'nodequeue_subqueue_empty_text' => array(
      'arguments' => array(),
    ),
    'nodequeue_subqueue_full_text' => array(
      'arguments' => array(),
    ),
    'nodequeue_subqueue_count_text' => array(
      'arguments' => array(),
    ),
  );
}

/**
 * Implementation of hook_elements().
 */
function nodequeue_elements() {
  $type = array();
  $type['position'] = array(
    '#input' => TRUE,
    '#delta' => 10,
    '#default_value' => 0,
    '#process' => array(
      'process_position',
      'form_expand_ahah',
    ),
  );
  return $type;
}

/**
 * Expand position elements into selects. Works like the weight element, except
 * only positive values are allowed.
 */
function process_position($element) {
  for ($n = 1; $n <= $element['#delta']; $n++) {
    $positions[$n] = $n;
  }
  $element['#options'] = $positions;
  $element['#options']['r'] = t('Remove');
  $element['#type'] = 'select';

  // add default properties for the select element
  $element += _element_info('select');
  return $element;
}

/**
 * If no default value is set for position select boxes, use 1.
 */
function position_value(&$form) {
  if (isset($form['#default_value'])) {
    $form['#value'] = $form['#default_value'];
  }
  else {
    $form['#value'] = 1;
  }
}

/**
 * Implementation of hook_views_api()
 */
function nodequeue_views_api() {
  return array(
    'api' => 2,
    'path' => drupal_get_path('module', 'nodequeue') . '/includes/views',
  );
}

/**
 * Implementation of hook_form_FORM_ID_alter().
 */
function nodequeue_form_apachesolr_search_bias_form_alter(&$form, $form_state) {

  // setup for the form building
  $weights = drupal_map_assoc(array(
    '21.0',
    '13.0',
    '8.0',
    '5.0',
    '3.0',
    '2.0',
    '1.0',
    '0.8',
    '0.5',
    '0.3',
    '0.2',
    '0.1',
  ));
  $weights['0'] = t('Normal');
  $queues = nodequeue_load_subqueues_by_queue(array_keys(nodequeue_get_all_qids()));

  // build the form
  $form['biasing']['nodequeue_boost'] = array(
    '#type' => 'fieldset',
    '#title' => t('Nodequeue Biasing'),
    '#weight' => -5,
    '#collapsible' => TRUE,
    '#collapsed' => TRUE,
  );
  $form['biasing']['nodequeue_boost']['nodequeue_apachesolr_boost'] = array(
    '#type' => 'item',
    '#description' => t("Specify to bias the search result when a node is in a queue. Any value except <em>Normal</em> will increase the socre for the given queue in the search results"),
  );
  foreach ($queues as $sqid => $queue) {
    $boost = variable_get("nodequeue_apachesolr_boost_{$sqid}", 0);

    // add in setting for each queue
    $form['biasing']['nodequeue_boost']['nodequeue_apachesolr_boost']["nodequeue_apachesolr_boost_{$sqid}"] = array(
      '#type' => 'select',
      '#title' => t('Weight for %title nodequeue', array(
        '%title' => $queue->title,
      )),
      '#options' => $weights,
      '#default_value' => $boost,
    );
  }
}

/**
 * Implementation of hook_apachesolr_update_index().
 */
function nodequeue_apachesolr_update_index(&$document, $node) {
  if (empty($document)) {
    return;
  }
  $queues = nodequeue_load_queues(array_keys(nodequeue_get_all_qids()));
  $subqueues = nodequeue_get_subqueues_by_node($queues, $node);
  nodequeue_set_subqueue_positions($subqueues, $node->nid);
  if (is_array($subqueues)) {
    foreach ($subqueues as $sqid => $subqueue) {
      if (!empty($subqueue->position)) {
        $key = _nodequeue_solr_qid_key();
        $document
          ->setMultiValue($key, $sqid);
      }
    }
  }
}

/**
 * return the apachesolr index key for group id
 */
function _nodequeue_solr_qid_key() {
  $qid_key = array(
    'index_type' => 'sint',
    'multiple' => TRUE,
    'name' => "nodequeue",
  );
  return apachesolr_index_key($qid_key);
}

/**
 * Implementation of hook_apachesolr_modify_query().
 */
function nodequeue_apachesolr_modify_query($query, &$params, $caller) {
  $queues = nodequeue_load_subqueues_by_queue(array_keys(nodequeue_get_all_qids()));
  $added = FALSE;
  foreach ($queues as $sqid => $queue) {
    $boost = variable_get("nodequeue_apachesolr_boost_{$sqid}", 0);
    if (!empty($boost)) {
      $params['bq'][] = _nodequeue_solr_qid_key() . ":{$sqid}^{$boost}";
      if (!$added) {

        // Only want to add the facet.field once. no need to repeat it
        $params['facet.field'][] = _nodequeue_solr_qid_key();
        $added = TRUE;
      }
    }
  }
}

// --------------------------------------------------------------------------
// Nodequeue manipulation API.

/**
 * @defgroup nodequeue_api
 * @{
 * Access to the internals of nodequeues are handled primarily through these
 * API functions. They allow easy loading of queues for manipulation.
 */

/**
 * The nodequeue queue class; the constructor makes it so we don't have to
 * always check to see if our variables are empty or not.
 */
class nodequeue_queue {
  var $title = '';
  var $size = 0;
  var $link = '';
  var $link_remove = '';
  var $roles = array();
  var $types = array();
  var $show_in_links = TRUE;
  var $show_in_tab = TRUE;
  var $show_in_ui = TRUE;
  var $reference = 0;
  var $i18n = 0;
  var $subqueue_title = '';
  var $reverse = 0;

  // runtime
  var $subqueues = array();
  var $subqueue = NULL;
  var $current = NULL;
  function nodequeue_queue($type) {
    $this->owner = $type;
  }

}

/**
 * Fetch a list of available queues for a given location. These queues
 * will be fully loaded and ready to go.
 */
function nodequeue_load_queues_by_type($type, $location = NULL, $account = NULL, $bypass_cache = FALSE) {
  $qids = nodequeue_get_qids($type, $account, $bypass_cache);
  if ($location) {
    nodequeue_filter_qids($qids, $location);
  }
  return nodequeue_load_queues(array_keys($qids), $bypass_cache);
}

/**
 * Return a queue by its machine name. This is obviously not ideal due to the
 * extra queries, but probably preferable to changing current API calls.
 *
 * @param $name
 *   The queue machine name
 *
 * @return
 *   The queue definition, or an empty array if no queue was found with the
 *   given machine name.
 */
function nodequeue_load_queue_by_name($name) {
  $map = nodequeue_get_qid_map();
  if (isset($map[$name])) {
    $queues = nodequeue_load_queues(array(
      $map[$name],
    ));
    if ($queues) {
      return current($queues);
    }
  }
  return array();
}

/**
 * Return a map of queue name to qid values to aid in various lookups.
 *
 * @return array
 *   A array of qids, keyed by machine name.
 */
function nodequeue_get_qid_map() {
  static $map = array();
  if (!$map) {
    $result = db_query("SELECT qid, name FROM {nodequeue_queue}");
    while ($get = db_fetch_object($result)) {
      $map[$get->name] = $get->qid;
    }
  }
  return $map;
}

/**
 * Filter a list of qids returned by nodequeue_get_qids to a location.
 *
 * @param $qids
 *   An array of $qids from @see nodequeue_get_qids()
 * @param $location
 *   One of:
 *   - 'links': Only check for queues that have node links.
 *   - 'tab': Only check for queues that appear on the node tab.
 *   - 'ui': Only check for queues that appear in the UI.
 */
function nodequeue_filter_qids(&$qids, $location) {
  $var = "show_in_{$location}";
  foreach ($qids as $qid => $info) {
    if (empty($info->{$var})) {
      unset($qids[$qid]);
    }
  }
}

/**
 * Get an array of qids applicable to this node type.
 *
 * @param $type
 *   The node type.
 * @param $account
 *   The account to test against. Defaults to the currently logged in user.
 *
 * @return $qids
 *   An array in the format: @code { array($qid => array('qid' => $qid, 'show_in_tab' '
 *   => true/false, 'show_in_links' => true/false }
 *
 * @param $bypass_cache
 *  Boolean value indicating whether to bypass the cache or not.
 */
function nodequeue_get_qids($type, $account = NULL, $bypass_cache = FALSE) {
  if (!isset($account)) {
    global $user;
    $account = $user;
  }
  static $cache = array();
  if ($bypass_cache || !isset($cache[$type])) {
    $roles_join = $roles_where = '';
    $roles = array();

    // superuser always has access.
    if (!user_access('manipulate all queues', $account)) {
      $roles_join = "INNER JOIN {nodequeue_roles} nr ON nr.qid = nq.qid ";
      $roles = array_keys((array) $account->roles) + array(
        DRUPAL_AUTHENTICATED_RID,
      );
      $roles_where .= "AND nr.rid IN (" . db_placeholders($roles, 'int') . ")";
    }
    $sql = 'SELECT nq.qid, nq.show_in_tab, nq.show_in_links, nq.show_in_ui, nq.i18n ' . 'FROM {nodequeue_queue} nq ' . 'INNER JOIN {nodequeue_types} nt ON nt.qid = nq.qid ' . $roles_join . "WHERE nt.type = '%s' " . $roles_where;
    $result = db_query($sql, array_merge(array(
      $type,
    ), $roles));
    $qids = array();
    while ($qid = db_fetch_object($result)) {
      $qids[$qid->qid] = $qid;
    }
    $cache[$type] = $qids;
  }
  return $cache[$type];
}

/**
 * Get an array of qids using the pager query. This administrative list
 * does no permission checking, so should only be available to users who
 * have passed the 'administer queues' check.
 *
 * @param $page_size
 *   The page size to use. If this is 0 or NULL, all queues will be returned.
 *   Defaults to 0.
 * @param $pager_element
 *   In the rare event this should use another pager element, set this..
 * @param $bypass_cache
 *   Boolean value indicating whether to bypass the cache or not.
 *
 * @return $qids
 *   An array in the format: @code { array($qid => $qid) }
 */
function nodequeue_get_all_qids($page_size = 0, $pager_element = 0, $bypass_cache = FALSE) {
  static $cache = array();
  if ($bypass_cache || empty($cache[$page_size])) {
    $sql = 'SELECT nq.qid ' . 'FROM {nodequeue_queue} nq ' . 'WHERE nq.show_in_ui = 1 ';
    $count_sql = 'SELECT COUNT(q.qid) FROM {nodequeue_queue} q WHERE q.show_in_ui = 1 ';
    if ($page_size) {
      $result = pager_query($sql, $page_size, $pager_element, $count_sql);
    }
    else {
      $result = db_query($sql, $count_sql);
    }
    $qids = array();
    while ($qid = db_fetch_object($result)) {
      $qids[$qid->qid] = $qid->qid;
    }
    $cache[$page_size] = $qids;
  }
  return $cache[$page_size];
}

/**
 * Load an array of $qids.
 *
 * This exists to provide a way of loading a bunch of queues with
 * the fewest queries. Loading 5 queues results in only 4 queries,
 * not 20. This also caches queues so that they don't get loaded
 * repeatedly.
 *
 * @param $qids
 *   An array of queue IDs to load.
 *
 * @param $bypass_cache
 *   Boolean value indicating whether to bypass the cache or not.
 */
function nodequeue_load_queues($qids = array(), $bypass_cache = FALSE) {
  static $cache = array();
  $to_load = $loaded = array();
  foreach ($qids as $qid) {
    if ($bypass_cache || !isset($cache[$qid])) {
      $to_load[] = $qid;
    }
  }
  if (!empty($to_load)) {
    $placeholders = db_placeholders($to_load, 'int');
    $result = db_query("SELECT q.*, (SELECT count(*) FROM {nodequeue_subqueue} s WHERE q.qid = s.qid) AS subqueues FROM {nodequeue_queue} q WHERE q.qid IN ({$placeholders})", $to_load);
    while ($queue = db_fetch_object($result)) {
      $loaded[$queue->qid] = $queue;

      // ensure valid defaults:
      $loaded[$queue->qid]->types = array();
      $loaded[$queue->qid]->roles = array();
      $loaded[$queue->qid]->count = 0;
    }
    $result = db_query("SELECT qid, rid FROM {nodequeue_roles} WHERE qid IN ({$placeholders})", $to_load);
    while ($obj = db_fetch_object($result)) {
      $loaded[$obj->qid]->roles[] = $obj->rid;
    }
    $result = db_query("SELECT qid, type FROM {nodequeue_types} WHERE qid IN ({$placeholders})", $to_load);
    while ($obj = db_fetch_object($result)) {
      $loaded[$obj->qid]->types[] = $obj->type;
    }
    drupal_alter('nodequeue', $loaded, 'load_queues');
  }
  if ($bypass_cache) {
    return $loaded;
  }
  else {
    if (!empty($loaded)) {
      $cache += $loaded;
    }
    $queues = array();
    foreach ($qids as $qid) {
      if (isset($cache[$qid])) {
        $queues[$qid] = $cache[$qid];
      }
    }
    return $queues;
  }
}

/**
 * Load a nodequeue.
 *
 * @param $qid
 *   The qid of the queue to load.
 */
function nodequeue_load($qid) {
  $queues = nodequeue_load_queues(array(
    $qid,
  ));
  return !empty($queues) ? array_shift($queues) : array();
}

/**
 * This function exists so that %subqueue will work in hook_menu.
 */
function subqueue_load($sqid) {
  if (!$sqid) {
    return NULL;
  }
  $queues = nodequeue_load_subqueues(array(
    $sqid,
  ));
  return !empty($queues) ? array_shift($queues) : array();
}

/**
 * Load a list of subqueues
 *
 * This exists to provide a way of loading a bunch of queues with
 * the fewest queries. Loading 5 queues results in only 4 queries,
 * not 20. This also caches queues so that they don't get loaded
 * repeatedly.
 *
 * @param $sqids
 *   An array of subqueue IDs to load.
 * @param $bypass_cache
 *   Boolean value indicating whether to bypass the cache or not.
 */
function nodequeue_load_subqueues($sqids, $bypass_cache = FALSE) {
  static $cache = array();
  $to_load = array();
  foreach ($sqids as $sqid) {
    if ($bypass_cache || !isset($cache[$sqid])) {
      $to_load[] = $sqid;
    }
  }
  if (!empty($to_load)) {
    $placeholders = db_placeholders($to_load, 'int');
    $result = db_query("SELECT s.*, (SELECT count(*) FROM {nodequeue_nodes} n WHERE n.sqid = s.sqid) AS count FROM {nodequeue_subqueue} s WHERE s.sqid IN ({$placeholders})", $to_load);
    while ($obj = db_fetch_object($result)) {

      // Sometimes we want to get to subqueues by reference, sometimes by sqid.
      // sqid is always unique, but reference is sometimes more readily available.
      $cache[$obj->sqid] = $obj;
    }
  }
  foreach ($sqids as $sqid) {
    if (isset($cache[$sqid])) {
      $subqueues[$sqid] = $cache[$sqid];
    }
  }
  return $subqueues;
}

/**
 * Load a single subqueue.
 *
 * @param $sqid
 *   The subqueue ID to load.
 * @param $bypass_cache
 *   Boolean value indicating whether to bypass the cache or not.
 */
function nodequeue_load_subqueue($sqid, $bypass_cache = FALSE) {
  $subqueues = nodequeue_load_subqueues(array(
    $sqid,
  ), $bypass_cache);
  if ($subqueues) {
    return array_shift($subqueues);
  }
}

/**
 * Load the entire set of subqueues for a queue.
 *
 * This will load the entire set of subqueues for a given queue (and can
 * respect the pager, if desired). It does NOT cache the subqueues like
 * nodequeue_load_subqueues does, so beware of this mixed caching.
 *
 * @param $qids
 *   A $qid or array of $qids
 * @param $page_size
 *   If non-zero, use the pager_query and limit the page-size to the parameter.
 */
function nodequeue_load_subqueues_by_queue($qids, $page_size = 0) {
  if (is_numeric($qids)) {
    $qids = array(
      $qids,
    );
  }
  if (empty($qids)) {
    return array();
  }
  $query = "SELECT s.*, (SELECT count(*) FROM {nodequeue_nodes} n WHERE n.sqid = s.sqid) AS count FROM {nodequeue_subqueue} s WHERE s.qid IN (" . db_placeholders($qids, 'int') . ")";
  if ($page_size) {
    $result = pager_query($query, $page_size, 0, $qids);
  }
  else {
    $result = db_query($query, $qids);
  }
  $subqueues = array();
  while ($subqueue = db_fetch_object($result)) {
    $subqueues[$subqueue->sqid] = $subqueue;
  }
  return $subqueues;
}

/**
 * Load a set of subqueues by reference.
 *
 * This can be used to load a set of subqueues by reference; it will primarily
 * be used by plugins that are managing subqueues.
 *
 * @param $references
 *   A keyed array of references to load. The key is the $qid and each value
 *   is another array of references.
 */
function nodequeue_load_subqueues_by_reference($references, $bypass_cache = FALSE) {
  static $cache = array();
  $subqueues = array();
  if ($bypass_cache) {
    $cache = array();
  }

  // build strings for the query based upon the qids and references.
  $keys = $values = array();
  foreach ($references as $qid => $qid_references) {
    $keys[$qid] = array();
    $qid_values = array();
    foreach ($qid_references as $reference) {

      // If we already have this qid/reference combo cached, don't add it to
      // our little list.
      if (isset($cache[$qid][$reference])) {
        $subqueues[$cache[$qid][$reference]->sqid] = $cache[$qid][$reference];
      }
      else {
        $keys[$qid][] = "'%s'";

        // Substitution strings
        $qid_values[] = $reference;

        // Values to substitute
      }
    }
    if (!empty($keys[$qid])) {
      $values = array_merge($values, array(
        $qid,
      ), $qid_values);
    }
    else {
      unset($keys[$qid]);
    }
  }
  if (!empty($keys)) {
    $where = '';
    foreach ($keys as $key_list) {
      if ($where) {
        $where .= ' OR ';
      }
      $where .= 's.qid = %d AND s.reference IN (' . implode(', ', $key_list) . ')';
    }
    $result = db_query("SELECT s.*, (SELECT count(*) FROM {nodequeue_nodes} n WHERE n.sqid = s.sqid) AS count FROM {nodequeue_subqueue} s WHERE " . $where, $values);
    while ($subqueue = db_fetch_object($result)) {
      $cache[$subqueue->qid][$subqueue->reference] = $subqueues[$subqueue->sqid] = $subqueue;
    }
  }
  return $subqueues;
}

/**
 * Save a nodequeue. This does not save subqueues; those must be added separately.
 */
function nodequeue_save(&$queue) {
  if (!isset($queue->qid)) {
    db_query("INSERT INTO {nodequeue_queue} (title, name, subqueue_title, size, link, link_remove, owner, show_in_links, show_in_tab, show_in_ui, i18n, reverse, reference) VALUES ('%s', '%s', '%s', %d, '%s', '%s', '%s', %d, %d, %d, %d, %d, '%s')", $queue->title, $queue->name, $queue->subqueue_title, $queue->size, $queue->link, $queue->link_remove, $queue->owner, $queue->show_in_links, $queue->show_in_tab, $queue->show_in_ui, $queue->i18n, $queue->reverse, $queue->reference);
    $queue->qid = db_last_insert_id('nodequeue_queue', 'qid');
    if (function_exists('views_invalidate_cache')) {
      views_invalidate_cache();
    }
  }
  else {

    // Allow nodequeue to save and not update the name unless supplied
    if (isset($queue->name) && !empty($queue->name)) {
      db_query("UPDATE {nodequeue_queue} SET size = %d, title = '%s', subqueue_title = '%s', link = '%s', link_remove = '%s', owner = '%s', show_in_links = %d, show_in_tab = %d, show_in_ui = %d, i18n = %d, reverse = %d, reference = '%s' WHERE qid = %d", $queue->size, $queue->title, $queue->subqueue_title, $queue->link, $queue->link_remove, $queue->owner, $queue->show_in_links, $queue->show_in_tab, $queue->show_in_ui, $queue->i18n, $queue->reverse, $queue->reference, $queue->qid);
    }
    else {
      db_query("UPDATE {nodequeue_queue} SET size = %d, title = '%s', name = '%s', subqueue_title = '%s', link = '%s', link_remove = '%s', owner = '%s', show_in_links = %d, show_in_tab = %d, show_in_ui = %d, i18n = %d, reverse = %d, reference = '%s' WHERE qid = %d", $queue->size, $queue->title, $queue->name, $queue->subqueue_title, $queue->link, $queue->link_remove, $queue->owner, $queue->show_in_links, $queue->show_in_tab, $queue->show_in_ui, $queue->i18n, $queue->reverse, $queue->reference, $queue->qid);
    }
    db_query("DELETE FROM {nodequeue_roles} WHERE qid = %d", $queue->qid);
    db_query("DELETE FROM {nodequeue_types} WHERE qid = %d", $queue->qid);
  }
  if (is_array($queue->roles)) {
    foreach ($queue->roles as $rid) {
      db_query("INSERT INTO {nodequeue_roles} (qid, rid) VALUES (%d, %d)", $queue->qid, $rid);
    }
  }
  if (is_array($queue->types)) {
    foreach ($queue->types as $type) {
      db_query("INSERT INTO {nodequeue_types} (qid, type) VALUES (%d, '%s')", $queue->qid, $type);
    }
  }

  // set our global that tells us whether or not we need to activate hook_link
  if (db_result(db_query("SELECT COUNT(*) FROM {nodequeue_queue} WHERE link <> ''"))) {
    variable_set('nodequeue_links', TRUE);
  }
  else {
    variable_set('nodequeue_links', FALSE);
  }
  if (isset($queue->add_subqueue) && is_array($queue->add_subqueue)) {
    foreach ($queue->add_subqueue as $reference => $title) {

      // If reference is unset it should be set to the qid; this is generally
      // used for a single subqueue; setting the reference to the qid makes
      // it easy to find that one subqueue.
      if ($reference == 0) {
        $reference = $queue->qid;
      }
      nodequeue_add_subqueue($queue, $title, $reference);
    }
  }
  return $queue->qid;
}

/**
 * Delete a nodequeue.
 */
function nodequeue_delete($qid) {
  db_query("DELETE FROM {nodequeue_queue} WHERE qid = %d", $qid);
  db_query("DELETE FROM {nodequeue_roles} WHERE qid = %d", $qid);
  db_query("DELETE FROM {nodequeue_types} WHERE qid = %d", $qid);
  db_query("DELETE FROM {nodequeue_nodes} WHERE qid = %d", $qid);
  db_query("DELETE FROM {nodequeue_subqueue} WHERE qid = %d", $qid);

  // Invoke a hook to notify other modules that a nodequeue has been deleted.
  module_invoke_all('nodequeue_delete', $qid);
}

/**
 * Add a new subqueue to a queue.
 *
 * @param $queue
 *   The queue object that is the parent of this subqueue.
 * @param $title
 *   The title of the subqueue.
 * @param $reference
 *   A reference that uniquely identifies this subqueue. If NULL it will
 *   be assigned the sqid.
 */
function nodequeue_add_subqueue(&$queue, $title, $reference = NULL) {
  if (empty($reference)) {
    $insert_reference = "";
  }
  else {
    $insert_reference = $reference;
  }
  $subqueue = new stdClass();
  $subqueue->reference = $reference;
  $subqueue->qid = $queue->qid;
  $subqueue->title = $title;
  db_query("INSERT INTO {nodequeue_subqueue} (qid, reference, title) VALUES (%d, '%s', '%s')", $queue->qid, $insert_reference, $title);
  $subqueue->sqid = db_last_insert_id('nodequeue_subqueue', 'sqid');

  // If somehow the $reference is null, here we set it to the sqid.
  // We have to do it here, because before the insert we don't know what the sqid will be.
  if (empty($reference)) {
    db_query("UPDATE {nodequeue_subqueue} SET reference = '%s' WHERE sqid = %d", $subqueue->sqid, $subqueue->sqid);
  }
  return $subqueue;
}

/**
 * Change the title of a subqueue.
 *
 * Note that only the title of a subqueue is changeable; it can change to
 * reflect updates in taxonomy term names, for example.
 */
function nodequeue_subqueue_update_title($sqid, $title) {
  db_query("UPDATE {nodequeue_subqueue} SET title = '%s' WHERE sqid = %d", $title, $sqid);
}

/**
 * Remove a subqueue.
 */
function nodequeue_remove_subqueue($sqid) {
  nodequeue_queue_clear($sqid);
  db_query("DELETE FROM {nodequeue_subqueue} WHERE sqid = %d", $sqid);
}

// --------------------------------------------------------------------------
// Queue position control

/**
 * Add a node to a queue.
 *
 * @param $queue
 *   The parent queue of the subqueue. This is required so that we can
 *   pop nodes out if the queue breaks size limits.
 * @param $subqueue
 *   The subqueue to add the node to.
 * @param $nid
 *   The node ID
 */
function nodequeue_subqueue_add($queue, &$subqueue, $nid) {
  if (!empty($nid)) {
    db_query("INSERT INTO {nodequeue_nodes} (sqid, qid, nid, position, timestamp) VALUES (%d, %d, %d, COALESCE((SELECT MAX(position)+1 FROM (SELECT * from {nodequeue_nodes} WHERE sqid = %d) as nn), 1), %d)", $subqueue->sqid, $queue->qid, $nid, $subqueue->sqid, time());
    $subqueue->count = db_result(db_query("SELECT count(nid) FROM {nodequeue_nodes} WHERE sqid = %d", $subqueue->sqid));

    // If adding this would make the queue too big, pop the front node
    // (or nodes) out.
    if (!empty($queue->size)) {

      // 0 means infinity so never do this if FALSE.
      nodequeue_check_subqueue_size($queue, $subqueue, $queue->size);
    }
    if (module_exists('apachesolr')) {
      if (function_exists('apachesolr_mark_node')) {
        apachesolr_mark_node($nid);
      }
      else {
        apachesolr_mark_entity('node', $nid);
      }
    }

    // Invoke the hook to notify other modules of the node addition.
    module_invoke_all('nodequeue_add', $subqueue->sqid, $nid);
  }
}

/**
 * Remove a node from the queue. If a node is in the queue more than once,
 * only the first (closest to 0 position, or the front of the queue) will
 * be removed.
 *
 * @param $sqid
 *   The subqueue to remove nodes from.
 * @param $nid
 *   The node to remove.
 */
function nodequeue_subqueue_remove_node($sqid, $nid) {
  if ($pos = nodequeue_get_subqueue_position($sqid, $nid)) {
    nodequeue_subqueue_remove($sqid, $pos);
    if (module_exists('apachesolr')) {
      if (function_exists('apachesolr_mark_node')) {
        apachesolr_mark_node($nid);
      }
      else {
        apachesolr_mark_entity('node', $nid);
      }
    }
  }
}

/**
 * Remove a node or node(s) from a nodequeue by position.
 *
 * If you know the nid but but not the position, use
 * @see nodequeue_subqueue_remove_node() instead.
 *
 * @param $sqid
 *   The subqueue to remove nodes from.
 * @param $start
 *   The first position (starting from 1) to remove.
 * @param $end
 *   The last position to remove. If NULL or equal to $start,
 *   only one node will be removed. Thus if $start is 1 and $end is 2,
 *   the first and second items will be removed from the queue.
 *
 */
function nodequeue_subqueue_remove($sqid, $start, $end = NULL) {
  if (!isset($end)) {
    $end = $start;
  }

  // Retrieve the nodes that are being removed.
  $result = db_query("SELECT nid FROM {nodequeue_nodes} WHERE sqid = %d AND position >= %d AND position <= %d", $sqid, $start, $end);
  $diff = $end - $start + 1;
  db_query("DELETE FROM {nodequeue_nodes} WHERE sqid = %d AND position >= %d AND position <= %d", $sqid, $start, $end);
  db_query("UPDATE {nodequeue_nodes} SET position = position - %d WHERE sqid = %d AND position > %d", $diff, $sqid, $end);

  // Invoke the hook to let other modules know that the nodes were removed.
  while ($node = db_fetch_object($result)) {
    module_invoke_all('nodequeue_remove', $sqid, $node->nid);
  }
}

/**
 * Empty a subqueue.
 *
 * @param $sqid
 *   The sqid to empty.
 */
function nodequeue_queue_clear($sqid) {
  db_query("DELETE FROM {nodequeue_nodes} WHERE sqid = %d", $sqid);
}

/**
 * Guarantee that a subqueue has not gotten too big. It's important to call
 * this after an operation that might have reduced a queue's maximum size.
 * It stores the count to save a query if this is to be followed by an add
 * operation.
 *
 * @param $queue
 *   The queue object.
 * @param $reference
 *   The subqueue to check.
 *
 */
function nodequeue_check_subqueue_size($queue, &$subqueue, $size = NULL) {
  if (!isset($size)) {
    $size = $queue->size;
  }
  if ($queue->size && $subqueue->count > $size) {
    nodequeue_subqueue_remove($subqueue->sqid, 1, $subqueue->count - $size);
    $subqueue->count = $size;
  }
}

/**
 * Guarantee that all subqueues are within the size constraints set
 * by $queue->size.
 */
function nodequeue_check_subqueue_sizes($queue) {

  // Don't check if size is 0, as that means infinite size.
  if (!$queue->size) {
    return;
  }
  $subqueues = nodequeue_load_subqueues_by_queue($queue->qid);
  foreach ($subqueues as $subqueue) {
    nodequeue_check_subqueue_size($queue, $subqueue);
  }
}

/**
 * Swap two positions within a subqueue.
 */
function nodequeue_queue_swap($subqueue, $pos1, $pos2) {

  // Grab the nid off one of the positions so we can more easily swap.
  $nid = db_result(db_query("SELECT nid FROM {nodequeue_nodes} WHERE sqid = %d AND position = %d", $subqueue->sqid, $pos1));
  if (!$nid) {
    return;
  }
  db_query("UPDATE {nodequeue_nodes} SET position = %d WHERE position = %d AND sqid = %d", $pos1, $pos2, $subqueue->sqid);
  db_query("UPDATE {nodequeue_nodes} SET position = %d WHERE nid = %d AND sqid = %d", $pos2, $nid, $subqueue->sqid);

  // notify other modules of the swap
  module_invoke_all('nodequeue_swap', $subqueue->sqid, $nid);
}

/**
 * Move a position within a subqueue up by one.
 */
function nodequeue_queue_up($subqueue, $position) {
  if ($position < 2 || $position > $subqueue->count) {
    return;
  }
  nodequeue_queue_swap($subqueue, $position - 1, $position);
}

/**
 * Move a position within a subqueue down by one.
 */
function nodequeue_queue_down($subqueue, $position) {
  if ($position < 1 || $position >= $subqueue->count) {
    return;
  }
  nodequeue_queue_swap($subqueue, $position + 1, $position);
}

/**
 * Move an item to the front of the queue.
 */
function nodequeue_queue_front($subqueue, $position) {
  if ($position < 2 || $position > $subqueue->count) {
    return;
  }
  $entry = db_fetch_object(db_query("SELECT * FROM {nodequeue_nodes} WHERE sqid= %d AND position = %d", $subqueue->sqid, $position));
  db_query("DELETE FROM {nodequeue_nodes} WHERE sqid = %d AND position = %d", $subqueue->sqid, $position);
  db_query("UPDATE {nodequeue_nodes} SET position = position + 1 WHERE sqid= %d AND position < %d", $subqueue->sqid, $position);
  db_query("INSERT INTO {nodequeue_nodes} (qid, sqid, nid, position, timestamp) VALUES (%d, %d, %d, 1, %d)", $entry->qid, $subqueue->sqid, $entry->nid, $entry->timestamp);
}

/**
 * Move an item to the back of the queue.
 */
function nodequeue_queue_back($subqueue, $position) {
  if ($position < 1 || $position >= $subqueue->count) {
    return;
  }
  $entry = db_fetch_object(db_query("SELECT * FROM {nodequeue_nodes} WHERE sqid = %d AND position = %d", $subqueue->sqid, $position));
  db_query("DELETE FROM {nodequeue_nodes} WHERE sqid = %d AND position = %d", $subqueue->sqid, $position);
  db_query("UPDATE {nodequeue_nodes} SET position = position - 1 WHERE sqid = %d AND position > %d", $subqueue->sqid, $position);
  db_query("INSERT INTO {nodequeue_nodes} (qid, sqid, nid, position, timestamp) VALUES (%d, %d, %d, %d, %d)", $entry->qid, $subqueue->sqid, $entry->nid, $subqueue->count, $entry->timestamp);
}

/**
 * Get the position of a node in a subqueue, or 0 if not found.
 */
function nodequeue_get_subqueue_position($sqid, $nid) {

  // We use MIN to make sure we always get the closes to the front of the
  // queue in case the queue has nodes in it multiple times.
  $pos = db_result(db_query("SELECT MIN(position) FROM {nodequeue_nodes} WHERE sqid = %d AND nid = %d", $sqid, $nid));
  return $pos;
}

/**
 * Get the position of a node in several subqueues.
 */
function nodequeue_set_subqueue_positions(&$subqueues, $nid) {
  if (empty($subqueues)) {
    return;
  }
  $placeholders = db_placeholders($subqueues, 'int');
  $args = array_keys($subqueues);
  $args[] = $nid;
  $result = db_query("SELECT sqid, MIN(position) AS position FROM {nodequeue_nodes} WHERE sqid IN ({$placeholders}) AND nid = %d GROUP BY sqid", $args);
  while ($obj = db_fetch_object($result)) {
    $subqueues[$obj->sqid]->position = $obj->position;
  }
}

/**
 * Get a list of valid subqueues for a node, along with the position of the node.
 *
 * @param $queues
 *   An array of fully loaded queue objects.
 * @param $node
 *   A fully loaded node object.
 *
 */
function nodequeue_get_subqueues_by_node($queues, $node) {

  // Determine which subqueues are valid for each queue.
  $references = array();
  static $last_nid = 0;
  foreach ($queues as $queue) {
    if ($result = nodequeue_api_subqueues($queue, $node)) {
      $references[$queue->qid] = is_array($result) ? $result : array(
        $result,
      );
    }
  }
  if (empty($references)) {
    return array();
  }

  // only allow the static cache to be used if the nid is the same as the last
  $subqueues = nodequeue_load_subqueues_by_reference($references, $last_nid != $node->nid);
  $last_nid = $node->nid;
  return $subqueues;
}

/**
 * Get a textual representation of a nodequeue's queue size.
 */
function nodequeue_subqueue_size_text($max, $count, $long = TRUE) {
  if (empty($count)) {
    $message = theme('nodequeue_subqueue_empty_text');
  }
  elseif ($count == $max) {
    $message = theme('nodequeue_subqueue_full_text');
  }
  else {
    if ($long) {
      $message = theme('nodequeue_subqueue_count_text', $count);
    }
    else {
      $message = $count;
    }
  }
  return $message;
}

/**
 * Substitute the subqueue title into some other string.
 *
 * This function does NOT check_plain the title! The output MUST be checked
 * after this is complete.
 */
function nodequeue_title_substitute($text, $queue, $subqueue) {
  if (empty($text)) {
    return $subqueue->title;
  }
  $text = str_replace('%subqueue', $subqueue->title, $text);
  return $text;
}

/**
 * Shuffle a queue.
 *
 * @param $subqueue
 *   The subqueue to shuffle. May be a sqid or the loaded object.
 */
function nodequeue_subqueue_shuffle($subqueue) {

  // Load the queue
  if (!is_object($subqueue)) {
    $subqueue = nodequeue_load_subqueue($subqueue);
  }
  if (empty($subqueue)) {
    return;
  }
  $count = $subqueue->count;

  // Swap each item with another randomly picked one.
  foreach (range(1, $count) as $i) {
    nodequeue_queue_swap($subqueue, $i, rand(1, $count));
  }
}

/**
 * @} End of defgroup "nodequeue_api"
 */

// --------------------------------------------------------------------------
// Hooks to implement the default nodequeue type.

/**
 * Implementation of hook_nodequeue_info()
 */
function nodequeue_nodequeue_info() {
  return array(
    'nodequeue' => array(
      'title' => t('Simple queue'),
      'description' => t('Simple queues have just one subqueue. Nodes put into a queue are added to the back of the queue; when a node is added to a full queue, the node in the front of the queue will be popped out to make room.'),
    ),
  );
}

/**
 * Implementation of hook_nodequeue_form_submit()
 */
function nodequeue_nodequeue_form_submit(&$queue, $form_state) {

  // This will add a single subqueue to our new queue.
  if (!isset($queue->qid) && !isset($queue->add_subqueue)) {

    // A 0 will set the reference to the sqid of the queue.
    $queue->add_subqueue = array(
      0 => $queue->title,
    );
  }

  //If the qid is set at this point, we're saving an existing queue.
  if (isset($queue->qid)) {

    //We don't check to see if the title has been updated since the $queue object already matches $form_state['values'].
    db_query("UPDATE {nodequeue_subqueue} SET title = '%s' WHERE qid = %d", array(
      $form_state['values']['title'],
      $queue->qid,
    ));
  }
}

// --------------------------------------------------------------------------
// External queue fetching

/**
 * in general it's preferable to use Views for this functionality.
 */
function nodequeue_node_titles($sqid, $title = '', $backward = TRUE, $from = 0, $count = 0, $published_only = TRUE) {
  $orderby = $backward ? "DESC" : "ASC";
  $published_sql = '';
  if ($published_only) {
    $published_sql = 'AND n.status = 1';
  }
  $sql = db_rewrite_sql("SELECT n.nid, n.title FROM {node} n LEFT JOIN {nodequeue_nodes} nn ON n.nid = nn.nid WHERE nn.sqid = %d " . $published_sql . " ORDER BY nn.position " . $orderby);
  if ($count) {
    $result = db_query_range($sql, $sqid, $from, $count);
  }
  else {
    $result = db_query($sql, $sqid);
  }
  return node_title_list($result, $title);
}

/**
 * Get node_view output from a nodequeue
 */
function nodequeue_view_nodes($sqid, $backward = TRUE, $teaser = TRUE, $links = TRUE, $from = 0, $count = 0) {
  $nodes = nodequeue_load_nodes($sqid, $backward, $from, $count);
  foreach ($nodes as $node) {
    $output .= node_view($node, $teaser, FALSE, $links);
  }
  return $output;
}

/**
 * Load an array of node objects belonging to a particular nodequeue.
 */
function nodequeue_load_nodes($sqid, $backward = FALSE, $from = 0, $count = 5, $published_only = TRUE) {
  $orderby = $backward ? "DESC" : "ASC";
  $published_sql = '';
  if ($published_only) {
    $published_sql = 'AND n.status = 1';
  }
  $sql = db_rewrite_sql("SELECT n.nid FROM {node} n INNER JOIN {nodequeue_nodes} nn ON n.nid = nn.nid WHERE nn.sqid = %d " . $published_sql . " ORDER BY nn.position " . $orderby);
  if ($count) {
    $result = db_query_range($sql, $sqid, $from, $count);
  }
  else {
    $result = db_query($sql, $sqid);
  }
  $nodes = array();
  while ($nid = db_fetch_object($result)) {
    $nodes[] = node_load($nid->nid);
  }
  return $nodes;
}

/**
 * Load the first node of a queue
 */
function nodequeue_load_front($sqid) {
  return array_shift(nodequeue_load_nodes($sqid, FALSE, 0, 1));
}

/**
 * Load the last node of a queue
 */
function nodequeue_load_back($sqid, $teaser = TRUE, $links = TRUE) {
  return array_shift(nodequeue_load_nodes($sqid, TRUE, 0, 1));
}

/**
 * View a random node from a queue
 */
function nodequeue_view_random_node($sqid, $teaser = TRUE, $links = TRUE) {
  $count = db_result(db_query(db_rewrite_sql("SELECT COUNT(n.nid) FROM {node} n INNER JOIN {nodequeue_nodes} nn ON n.nid = nn.nid WHERE nn.sqid = %d AND n.status = 1"), $sqid));
  return nodequeue_view_nodes($sqid, FALSE, $teaser, $links, rand(0, $count - 1), 1);
}

/**
 * Load a random node object from a queue
 */
function nodequeue_load_random_node($sqid) {
  $count = db_result(db_query(db_rewrite_sql("SELECT COUNT(n.nid) FROM {node} n INNER JOIN {nodequeue_nodes} nn ON n.nid = nn.nid WHERE nn.sqid = %d AND n.status = 1"), $sqid));
  return array_shift(nodequeue_load_nodes($sqid, TRUE, rand(0, $count - 1), 1));
}

/**
 * Get the position of a node in a subqueue, or FALSE if not found.
 */
function nodequeue_subqueue_position($sqid, $nid) {
  return db_result(db_query("SELECT position FROM {nodequeue_nodes} WHERE sqid = %d AND nid = %d", $sqid, $nid));
}

/**
 * Get the position of a node in a queue; this queue MUST have only one
 * subqueue or the results of this function will be unpredictable.
 */
function nodequeue_queue_position($qid, $nid) {
  $sqid = db_result(db_query_range("SELECT sqid FROM {nodequeue_subqueue} WHERE qid = %d", $qid, 0, 1));
  return nodequeue_subqueue_position($sqid, $nid);
}

// --------------------------------------------------------------------------
// API for modules implementing subqueues.

/**
 * Send the nodequeue edit form to the owning module for modification.
 *
 * @param $queue
 *   The queue being edited.
 * @param &$form
 *   The form. This may be modified.
 */
function nodequeue_api_queue_form($queue, &$form) {
  $function = $queue->owner . "_nodequeue_form";
  if (function_exists($function)) {
    $function($queue, $form);
  }
}

/**
 * Validate the nodequeue edit form.
 *
 * @param $queue
 *   The queue being edited.
 * @param $form_state
 *   The form values that were submitted.
 * @param &$form
 *   The actual form object. This may be modified.
 */
function nodequeue_api_queue_form_validate($queue, &$form_state, &$form) {
  $function = $queue->owner . "_nodequeue_form_validate";
  if (function_exists($function)) {
    $function($queue, $form_state, $form);
  }
}

/**
 * Send the nodequeue edit form to the owning module upon submit.
 *
 * @param &$queue
 *   The queue being edited. This may be modified prior to being
 *   saved.
 * @param $form_state
 *   The form values that were submitted.
 */
function nodequeue_api_queue_form_submit(&$queue, &$form_state) {
  $function = $queue->owner . "_nodequeue_form_submit";
  if (function_exists($function)) {
    $function($queue, $form_state);
  }
}

/**
 * Send the nodequeue edit form to the owning module after the queue
 * has been saved.
 *
 * @param &$queue
 *   The queue being edited. This may be modified prior to being
 *   saved.
 * @param $form_state
 *   The form values that were submitted.
 */
function nodequeue_api_queue_form_submit_finish($queue, &$form_state) {
  $function = $queue->owner . "_nodequeue_form_submit_finish";
  if (function_exists($function)) {
    $function($queue, $form_state);
  }
}

/**
 * Fetch a list of subqueues that are valid for this node from
 * the owning module.
 *
 * @param $queue
 *   The queue being edited.
 * @param $node
 *   The loaded node object being checked.
 *
 * @return
 *   An array of subqueues. This will be keyed by $sqid.
 */
function nodequeue_api_subqueues(&$queue, $node) {
  $function = $queue->owner . "_nodequeue_subqueues";

  // This will return an array of references.
  if (function_exists($function)) {
    return $function($queue, $node);
  }
  else {
    return $queue->qid;
  }
}

/**
 * Fetch a list of nodes available to a given subqueue
 * for autocomplete.
 *
 * @param $queue
 *   The queue that owns the subqueue
 * @param $subqueue
 *   The subqueue
 * @param $string
 *   The string being matched.
 *
 * @return
 *   An keyed array $nid => $title
 */
function nodequeue_api_autocomplete($queue, $subqueue, $string) {
  $matches = array();
  if (empty($string)) {
    return $matches;
  }
  $where_args = array();
  global $user;
  if (!user_access('administer nodes', $user)) {
    $where = '(n.status = 1 || n.uid = %d) AND ';
    $where_args = array(
      $user->uid,
    );
  }
  $where .= "n.type IN (" . db_placeholders($queue->types, 'varchar') . ')';
  $where_args = array_merge($where_args, $queue->types);

  // Run a match to see if they're specifying by nid.
  $preg_matches = array();
  $match = preg_match('/\\[nid: (\\d+)\\]/', $string, $preg_matches);
  if (!$match) {
    $match = preg_match('/^nid: (\\d+)/', $string, $preg_matches);
  }
  if ($match) {

    // If it found a nid via specification, reduce our resultset to just that nid.
    $where .= " AND n.nid = %d";
    array_push($where_args, $preg_matches[1]);
  }
  else {

    // Build the constant parts of the query.
    $where .= " AND LOWER(n.title) LIKE LOWER('%%%s%%')";
    array_push($where_args, $string);
  }

  // Call to the API.
  $function = $queue->owner . "_nodequeue_autocomplete";
  if (function_exists($function)) {
    return $function($queue, $subqueue, $string, $where, $where_args);
  }
  else {

    // Disable language selection temporarily, enable it again later.
    if (module_exists('i18n')) {
      i18n_selection_mode('off');
    }
    $result = db_query_range(db_rewrite_sql("SELECT n.nid, n.title, n.tnid FROM {node} n WHERE " . $where), $where_args, 0, variable_get('nodequeue_autocomplete_limit', 10));
    if (module_exists('i18n')) {
      i18n_selection_mode('reset');
    }
    while ($node = db_fetch_object($result)) {
      $id = nodequeue_get_content_id($queue, $node);
      $matches[$id] = check_plain($node->title) . " [nid: {$id}]";
    }
  }
  return $matches;
}

/**
 * Collect info about all of the possible nodequeue types from owning
 * modules.
 */
function nodequeue_api_info() {
  return module_invoke_all('nodequeue_info');
}
function nodequeue_api_queue_access($queue, $account = NULL) {
  if (!$account) {
    global $user;
    $account = $user;
  }
  if ($queue->owner != 'nodequeue') {

    // Avoids an infinite loop.
    $function = $queue->owner . '_queue_access';
    if (function_exists($function)) {
      $access = $function($queue, $account);
    }
  }
  if (!isset($access)) {
    $access = TRUE;
  }
  return $access;
}

/**
 * Allows the owning module of a subqueue to restrict access to viewing and
 * manipulating the queue.
 */
function nodequeue_api_subqueue_access($subqueue, $account = NULL, $queue = NULL) {
  if (!$account) {
    global $user;
    $account = $user;
  }
  if (!$queue) {
    $queue = nodequeue_load($subqueue->qid);
  }
  $function = $queue->owner . '_subqueue_access';
  if (function_exists($function)) {
    $access = $function($subqueue, $account, $queue);
  }
  if (!isset($access)) {
    $access = TRUE;
  }
  return $access;
}

/**
 * Generate a query string to use on nodequeue's private links.
 *
 * @param $seed
 *   The seed to use when generating a token. If NULL no token will
 *   be generated.
 * @param $destination
 *   The destination to use. If FALSE one won't be used; if TRUE
 *   one will be generated from drupal_get_destination().
 * @param $query
 *   An array of additional items to add to the query.
 *
 * @return
 *   The query string suitable for use in the l() function.
 */
function nodequeue_get_query_string($seed, $destination = FALSE, $query = array()) {
  if ($dest = drupal_get_destination()) {
    $query[] = $dest;
  }
  if (isset($seed)) {
    $query[] = nodequeue_get_token($seed);
  }
  return implode('&', $query);
}

/**
 * Get a private token used to protect nodequeue's links from spoofing.
 */
function nodequeue_get_token($nid) {
  return 'token=' . drupal_get_token($nid);
}

/**
 * Check to see if the token generated from seed matches.
 */
function nodequeue_check_token($seed) {
  return drupal_get_token($seed) == $_GET['token'];
}

/* --- UTILITY -------------------------------------------------------------- */

/**
 * Helper function - since hook_menu now takes a function instead of a boolean,
 * this function is used to compute the user's access.
 *
 * @return boolean
 */
function _nodequeue_access_admin_or_manipulate() {
  return user_access('administer nodequeue') || user_access('manipulate queues') || user_access('manipulate all queues');
}

/**
 * Used by menu system to determine access to the node and the queue in question.
 *
 * No, this isn't some odd hook_access implementation.
 *
 * @param unknown_type $node
 * @param unknown_type $queue
 * @return unknown
 */
function nodequeue_node_and_queue_access($node, $queue, $subqueue = NULL) {
  return nodequeue_node_access($node->type) && nodequeue_queue_access($queue, $subqueue);
}

/**
 * Return TRUE if $user can queue(s) for this node.
 *
 * @param $type
 *   The node type.
 * @param $location
 *   Optional argument. May be one of:
 *   - 'links': Only check for queues that have node links.
 *   - 'tab': Only check for queues that appear on the node tab.
 *   - 'ui': Only check for queues that appear in the UI.
 */
function nodequeue_node_access($type, $location = NULL, $account = NULL) {
  $qids = nodequeue_get_qids($type, $account);
  if ($location) {
    nodequeue_filter_qids($qids, $location);
  }
  return !empty($qids);
}

/**
 * Return TRUE If the specified account has access to manipulate this queue.
 */
function nodequeue_queue_access($queue, $subqueue = NULL, $account = NULL) {
  if (!$account) {
    global $user;
    $account = $user;
  }

  // Automatically true if all queues.
  if (user_access('manipulate all queues', $account)) {
    return TRUE;
  }

  // Automatically false if they can't manipulate queues at all.
  if (!user_access('manipulate queues', $account) || empty($queue->roles)) {
    return FALSE;
  }
  if ($subqueue) {
    return nodequeue_api_subqueue_access($subqueue, $account);
  }
  if (!nodequeue_api_queue_access($queue, $account)) {
    return FALSE;
  }
  $roles = array_keys((array) $account->roles) + array(
    DRUPAL_AUTHENTICATED_RID,
  );
  return (bool) array_intersect($roles, $queue->roles);
}
function nodequeue_node_tab_access($node) {
  if (!variable_get('nodequeue_use_tab', 1) || !user_access('manipulate queues')) {

    // For performance reasons: If the menu tab is disabled or the user can't
    // manipulate queues, there is no reason to run the rest of these queries.
    return FALSE;
  }
  $queues = nodequeue_load_queues_by_type($node->type, 'tab');
  $subqueues = nodequeue_get_subqueues_by_node($queues, $node);
  if (empty($subqueues)) {
    return FALSE;
  }
  foreach ($subqueues as $subqueue) {
    if (nodequeue_api_subqueue_access($subqueue)) {
      return TRUE;
    }
  }
  return FALSE;
}

/**
 * Print the JSON output for our AJAX calls.
 */
function nodequeue_js_output($label, $href, $count = NULL, $sqid = NULL) {
  $return = new stdClass();
  $return->status = 1;
  $return->label = check_plain($label);
  $return->href = $href;
  if (isset($count)) {
    $return->count = $count;
  }
  if (isset($sqid)) {
    $return->sqid = $sqid;
  }
  drupal_json($return);
  exit;
}

/**
 * Return content id based on i18n settings
 */
function nodequeue_get_content_id($queue, $node) {
  return $queue->i18n && !empty($node->tnid) ? $node->tnid : $node->nid;
}

/*
 * Get the list of nodes in the subqueue, taking into account node access restrictions.
 */
function nodequeue_nids_visible($sqid = -1, $account = NULL) {
  $node_status_sql = '';
  if (!$account) {
    global $user;
    $account = $user;
  }
  $nids_visible = array();
  if (!user_access('administer nodes', $account)) {
    $node_status_sql = ' AND (n.status = 1 || n.uid = %d)';
  }

  // Disable language selection temporarily, enable it again later.
  if (module_exists('i18n') && arg(0) == 'admin') {
    i18n_selection_mode('off');
  }
  $query_restricted = db_query(db_rewrite_sql("SELECT DISTINCT(n.nid), nq.position FROM {node} n LEFT JOIN {nodequeue_nodes} nq ON nq.nid = n.nid WHERE nq.sqid = %d " . $node_status_sql . " ORDER BY nq.position ASC"), $sqid, $account->uid);
  while ($result_restricted = db_fetch_object($query_restricted)) {
    $nids_visible[$result_restricted->nid] = $result_restricted->nid;
  }
  if (module_exists('i18n') && arg(0) == 'admin') {
    i18n_selection_mode('reset');
  }
  return $nids_visible;
}

/**
 * Determine if the machine name is in use.
 */
function nodequeue_machine_name_available($machine_name, $qid = NULL) {

  // Find all existing records for the given machine_name
  $result = db_query("SELECT qid FROM {nodequeue_queue} WHERE `name` LIKE '%s'", $machine_name);
  $existing_queues = array();
  while ($record = db_fetch_object($result)) {
    $existing_queues[] = $record->qid;
  }
  if (count($existing_queues) == 0) {

    // Creating a new machine name queue
    return TRUE;
  }
  elseif (count($existing_queues) == 1 && !empty($qid) && $qid == $existing_queues[0]) {

    // Checking an existing queue that has not changed its name.
    return TRUE;
  }
  return FALSE;
}

/* --- ACTIONS -------------------------------------------------------------- */

/**
 * Action to add a node to a queue.
 */
function nodequeue_add_action($node, $context) {
  $queues = nodequeue_load_queues($context['qids'], TRUE);

  // Filter out queues by node type. We choose not to use nodequeue_get_qids() because it checks for access control which only matters if we administering a queue.
  $eligible_queues = array();
  foreach ($queues as $queue) {
    if (in_array($node->type, $queue->types)) {
      $eligible_queues[$queue->qid] = $queue;
    }
  }
  if (!empty($eligible_queues)) {

    // Remove the node from the eligible queues (if needed).
    nodequeue_remove_action($node, array(
      'qids' => array_keys($eligible_queues),
    ));

    // Use API to get the eligible subqueues
    $eligible_subqueues = nodequeue_get_subqueues_by_node($eligible_queues, $node);

    // Add node to each subqueue.
    foreach ($eligible_subqueues as $subqueue) {
      nodequeue_subqueue_add($queues[$subqueue->qid], $subqueue, $node->nid);
    }
  }
}

/**
 * Configuration form for Add to Nodequeues action.
 */
function nodequeue_add_action_form($context) {

  // Default values for form.
  if (!isset($context['qids'])) {
    $context['qids'] = '';
  }
  $queues = nodequeue_load_queues(nodequeue_get_all_qids(0, 0, TRUE), TRUE);
  foreach ($queues as $qid => $queue) {
    $options[$qid] = $queue->title;
  }
  $form = array();
  if (count($options)) {

    // Add form components.
    $form['qids'] = array(
      '#type' => 'select',
      '#title' => t("Queue"),
      '#default_value' => $context['qids'],
      '#multiple' => TRUE,
      '#options' => $options,
      '#required' => TRUE,
      '#description' => t('Specify the queues into which the node should be submitted. If the queue is a smartqueue, the node shall be placed into every subqueue for which it is eligible.'),
    );
  }
  else {
    drupal_set_message(t('Please <a href="@url">create</a> a nodequeue first.', array(
      '@url' => url('admin/content/nodequeue'),
    )));
  }
  return $form;
}

/**
 * Submit handler for Add to Nodequeues action configuration.
 */
function nodequeue_add_action_submit($form, &$form_state) {
  return array(
    'qids' => $form_state['values']['qids'],
  );
}

/**
 * Action to remove a node from a queue.
 */
function nodequeue_remove_action($node, $context) {
  $qids = $context['qids'];

  // If a node is being deleted, ensure it's also removed from any queues.
  $placeholders = implode(',', array_fill(0, count($qids), '%d'));
  $args = $qids;
  $args[] = $node->nid;
  $result = db_query("SELECT * FROM {nodequeue_nodes} WHERE qid IN ({$placeholders}) AND nid = %d", $args);
  while ($obj = db_fetch_object($result)) {

    // This removes by nid, not position, because if we happen to have a
    // node in a queue twice, the 2nd position would be wrong.
    nodequeue_subqueue_remove_node($obj->sqid, $node->nid);
  }
}

/**
 * Configuration form for Remove from Nodequeues action.
 */
function nodequeue_remove_action_form($context) {

  // Default values for form.
  if (!isset($context['qids'])) {
    $context['qids'] = array();
  }
  $queues = nodequeue_load_queues(nodequeue_get_all_qids(0, 0, TRUE), TRUE);
  foreach ($queues as $qid => $queue) {
    $options[$qid] = $queue->title;
  }

  // Add form components.
  $form['qids'] = array(
    '#type' => 'select',
    '#title' => t("Queues"),
    '#default_value' => $context['qids'],
    '#multiple' => TRUE,
    '#decription' => t('Specify the queues from which the node should be removed. If the queue is a smartqueue, the node shall be removed from all subqueues.'),
    '#required' => TRUE,
    '#options' => $options,
  );
  return $form;
}

/**
 * Submit handler for Remove from Nodequeues action configuration.
 */
function nodequeue_remove_action_submit($form, &$form_state) {
  return array(
    'qids' => $form_state['values']['qids'],
  );
}

/* --- THEME ---------------------------------------------------------------- */

/**
 * Theme the subqueue overview as a sortable list.
 *
 * @ingroup themeable
 */
function theme_nodequeue_arrange_subqueue_form($form) {
  $output = '';
  $subqueue = $form['#subqueue'];

  // Get css to hide some of the help text if javascript is disabled.
  drupal_add_css(drupal_get_path('module', 'nodequeue') . '/nodequeue.css');
  $table_id = 'nodequeue-dragdrop-' . $subqueue['sqid'];
  $table_classes = array(
    'nodequeue-dragdrop',
    'nodequeue-dragdrop-qid-' . $subqueue['qid'],
    'nodequeue-dragdrop-sqid-' . $subqueue['sqid'],
    'nodequeue-dragdrop-reference-' . $subqueue['reference'],
  );
  drupal_add_tabledrag($table_id, 'order', 'sibling', 'node-position');
  drupal_add_js(drupal_get_path('module', 'nodequeue') . '/nodequeue_dragdrop.js');
  $reverse[str_replace('-', '_', $table_id)] = (bool) $form['#queue']['reverse'];
  drupal_add_js(array(
    'nodequeue' => array(
      'reverse' => $reverse,
    ),
  ), 'setting');

  // Render form as table rows.
  $rows = array();
  $counter = 1;
  foreach (element_children($form) as $key) {
    if (isset($form[$key]['title'])) {
      $row = array();
      $row[] = drupal_render($form[$key]['title']);
      $row[] = drupal_render($form[$key]['author']);
      $row[] = drupal_render($form[$key]['date']);
      $row[] = drupal_render($form[$key]['position']);
      $row[] = !empty($form[$key]['edit']) ? drupal_render($form[$key]['edit']) : '&nbsp;';
      $row[] = drupal_render($form[$key]['remove']);
      $row[] = array(
        'data' => $counter,
        'class' => 'position',
      );
      $rows[] = array(
        'data' => $row,
        'class' => 'draggable',
      );
    }
    $counter++;
  }
  if (empty($rows)) {
    $rows[] = array(
      array(
        'data' => t('No nodes in this queue.'),
        'colspan' => 7,
      ),
    );
  }

  // Render the main nodequeue table.
  $header = array(
    t('Title'),
    t('Author'),
    t('Post Date'),
    t('Position'),
    array(
      'data' => t('Operations'),
      'colspan' => 2,
    ),
    t('Position'),
  );
  $output .= theme('table', $header, $rows, array(
    'id' => $table_id,
    'class' => implode(' ', $table_classes),
  ));

  // Render the autocomplete field for adding a node to the table.
  $output .= '<div class="container-inline">';
  $output .= drupal_render($form['add']['nid']);
  $output .= drupal_render($form['add']['submit']);
  $output .= '</div>';

  // Render the remaining form elements.
  $output .= drupal_render($form);
  return $output;
}

/**
 * Return a "queue is empty" message.
 *
 * @ingroup themeable
 */
function theme_nodequeue_subqueue_empty_text() {
  return t('Queue empty');
}

/**
 * Return a "queue is full" message.
 *
 * @ingroup themeable
 */
function theme_nodequeue_subqueue_full_text() {
  return t('Queue full');
}

/**
 * Return a count of elements in the queue.
 *
 * @ingroup themeable
 */
function theme_nodequeue_subqueue_count_text($count) {
  return t('@count in queue', array(
    '@count' => $count,
  ));
}

Functions

Name	Description
nodequeue_action_info	Implementation of hook_action_info().
nodequeue_add_action	Action to add a node to a queue.
nodequeue_add_action_form	Configuration form for Add to Nodequeues action.
nodequeue_add_action_submit	Submit handler for Add to Nodequeues action configuration.
nodequeue_add_subqueue	Add a new subqueue to a queue.
nodequeue_apachesolr_modify_query	Implementation of hook_apachesolr_modify_query().
nodequeue_apachesolr_update_index	Implementation of hook_apachesolr_update_index().
nodequeue_api_autocomplete	Fetch a list of nodes available to a given subqueue for autocomplete.
nodequeue_api_info	Collect info about all of the possible nodequeue types from owning modules.
nodequeue_api_queue_access
nodequeue_api_queue_form	Send the nodequeue edit form to the owning module for modification.
nodequeue_api_queue_form_submit	Send the nodequeue edit form to the owning module upon submit.
nodequeue_api_queue_form_submit_finish	Send the nodequeue edit form to the owning module after the queue has been saved.
nodequeue_api_queue_form_validate	Validate the nodequeue edit form.
nodequeue_api_subqueues	Fetch a list of subqueues that are valid for this node from the owning module.
nodequeue_api_subqueue_access	Allows the owning module of a subqueue to restrict access to viewing and manipulating the queue.
nodequeue_check_subqueue_size	Guarantee that a subqueue has not gotten too big. It's important to call this after an operation that might have reduced a queue's maximum size. It stores the count to save a query if this is to be followed by an add operation.
nodequeue_check_subqueue_sizes	Guarantee that all subqueues are within the size constraints set by $queue->size.
nodequeue_check_token	Check to see if the token generated from seed matches.
nodequeue_delete	Delete a nodequeue.
nodequeue_elements	Implementation of hook_elements().
nodequeue_filter_qids	Filter a list of qids returned by nodequeue_get_qids to a location.
nodequeue_forms	Implementation of hook_forms().
nodequeue_form_apachesolr_search_bias_form_alter	Implementation of hook_form_FORM_ID_alter().
nodequeue_get_all_qids	Get an array of qids using the pager query. This administrative list does no permission checking, so should only be available to users who have passed the 'administer queues' check.
nodequeue_get_content_id	Return content id based on i18n settings
nodequeue_get_qids	Get an array of qids applicable to this node type.
nodequeue_get_qid_map	Return a map of queue name to qid values to aid in various lookups.
nodequeue_get_query_string	Generate a query string to use on nodequeue's private links.
nodequeue_get_subqueues_by_node	Get a list of valid subqueues for a node, along with the position of the node.
nodequeue_get_subqueue_position	Get the position of a node in a subqueue, or 0 if not found.
nodequeue_get_token	Get a private token used to protect nodequeue's links from spoofing.
nodequeue_js_output	Print the JSON output for our AJAX calls.
nodequeue_link	Implementation of hook_link().
nodequeue_load	Load a nodequeue.
nodequeue_load_back	Load the last node of a queue
nodequeue_load_front	Load the first node of a queue
nodequeue_load_nodes	Load an array of node objects belonging to a particular nodequeue.
nodequeue_load_queues	Load an array of $qids.
nodequeue_load_queues_by_type	Fetch a list of available queues for a given location. These queues will be fully loaded and ready to go.
nodequeue_load_queue_by_name	Return a queue by its machine name. This is obviously not ideal due to the extra queries, but probably preferable to changing current API calls.
nodequeue_load_random_node	Load a random node object from a queue
nodequeue_load_subqueue	Load a single subqueue.
nodequeue_load_subqueues	Load a list of subqueues
nodequeue_load_subqueues_by_queue	Load the entire set of subqueues for a queue.
nodequeue_load_subqueues_by_reference	Load a set of subqueues by reference.
nodequeue_machine_name_available	Determine if the machine name is in use.
nodequeue_menu	Implementation of hook_menu
nodequeue_nids_visible
nodequeue_nodeapi	Implementation of hook_nodeapi().
nodequeue_nodequeue_form_submit	Implementation of hook_nodequeue_form_submit()
nodequeue_nodequeue_info	Implementation of hook_nodequeue_info()
nodequeue_node_access	Return TRUE if $user can queue(s) for this node.
nodequeue_node_and_queue_access	Used by menu system to determine access to the node and the queue in question.
nodequeue_node_tab_access
nodequeue_node_titles	in general it's preferable to use Views for this functionality.
nodequeue_perm	Implementation of hook_perm
nodequeue_queue_access	Return TRUE If the specified account has access to manipulate this queue.
nodequeue_queue_back	Move an item to the back of the queue.
nodequeue_queue_clear	Empty a subqueue.
nodequeue_queue_down	Move a position within a subqueue down by one.
nodequeue_queue_front	Move an item to the front of the queue.
nodequeue_queue_position	Get the position of a node in a queue; this queue MUST have only one subqueue or the results of this function will be unpredictable.
nodequeue_queue_swap	Swap two positions within a subqueue.
nodequeue_queue_up	Move a position within a subqueue up by one.
nodequeue_remove_action	Action to remove a node from a queue.
nodequeue_remove_action_form	Configuration form for Remove from Nodequeues action.
nodequeue_remove_action_submit	Submit handler for Remove from Nodequeues action configuration.
nodequeue_remove_subqueue	Remove a subqueue.
nodequeue_save	Save a nodequeue. This does not save subqueues; those must be added separately.
nodequeue_set_subqueue_positions	Get the position of a node in several subqueues.
nodequeue_subqueue_add	Add a node to a queue.
nodequeue_subqueue_position	Get the position of a node in a subqueue, or FALSE if not found.
nodequeue_subqueue_remove	Remove a node or node(s) from a nodequeue by position.
nodequeue_subqueue_remove_node	Remove a node from the queue. If a node is in the queue more than once, only the first (closest to 0 position, or the front of the queue) will be removed.
nodequeue_subqueue_shuffle	Shuffle a queue.
nodequeue_subqueue_size_text	Get a textual representation of a nodequeue's queue size.
nodequeue_subqueue_update_title	Change the title of a subqueue.
nodequeue_theme	Implementation of hook_theme().
nodequeue_title_substitute	Substitute the subqueue title into some other string.
nodequeue_views_api	Implementation of hook_views_api()
nodequeue_view_nodes	Get node_view output from a nodequeue
nodequeue_view_random_node	View a random node from a queue
position_value	If no default value is set for position select boxes, use 1.
process_position	Expand position elements into selects. Works like the weight element, except only positive values are allowed.
subqueue_load	This function exists so that %subqueue will work in hook_menu.
theme_nodequeue_arrange_subqueue_form	Theme the subqueue overview as a sortable list.
theme_nodequeue_subqueue_count_text	Return a count of elements in the queue.
theme_nodequeue_subqueue_empty_text	Return a "queue is empty" message.
theme_nodequeue_subqueue_full_text	Return a "queue is full" message.
_nodequeue_access_admin_or_manipulate	Helper function - since hook_menu now takes a function instead of a boolean, this function is used to compute the user's access.
_nodequeue_solr_qid_key	return the apachesolr index key for group id

Constants

Name	Description
NODEQUEUE_DUPLICATE_POSITION
NODEQUEUE_INVALID_NID
NODEQUEUE_INVALID_POSITION
NODEQUEUE_OK	@file Maintains queues of nodes in arbitrary order.

Classes

Name	Description
nodequeue_queue	The nodequeue queue class; the constructor makes it so we don't have to always check to see if our variables are empty or not.

You are here

nodequeue.module in Nodequeue 6.2

File

Functions

Constants

Classes

API Navigation