function views_handler_argument_term_node_tid_depth_join::query
Overrides views_handler_argument::query
File
-
modules/
taxonomy/ views_handler_argument_term_node_tid_depth_join.inc, line 99
Class
- views_handler_argument_term_node_tid_depth_join
- Argument handler for taxonomy terms with depth.
Code
public function query($group_by = FALSE) {
$this->ensure_my_table();
if (!empty($this->options['break_phrase'])) {
$tids = new stdClass();
$tids->value = $this->argument;
$tids = views_break_phrase($this->argument, $tids);
if ($tids->value == array(
-1,
)) {
return FALSE;
}
if (is_array($tids->value) && count($tids->value) > 1) {
$operator = 'IN';
}
else {
$operator = '=';
}
$tids = $tids->value;
}
else {
$operator = "=";
$tids = $this->argument;
}
// The tids variable can be an integer or an array of integers.
$tids = is_array($tids) ? $tids : array(
$tids,
);
if ($this->options['depth'] > 0) {
// When the depth is positive search the children.
foreach ($tids as $tid) {
// The term must be loaded to get vid for use in taxonomy_get_tree().
if ($term = taxonomy_term_load($tid)) {
// For every tid argument find all the children down to the depth set
// in the options and save the tids for the condition.
$tree = taxonomy_get_tree($term->vid, $term->tid, (int) $this->options['depth']);
$tids = array_merge($tids, array_map('_taxonomy_get_tid_from_term', $tree));
}
}
}
elseif ($this->options['depth'] < 0) {
// When the depth is negative search the parents.
foreach ($tids as $tid) {
// For every tid argument find all the parents up to the depth set
// in the options and add the tids into the array. Since there is
// no taxonomy function to get all parents with a depth limit it
// is done here building a multidimensional array.
if ($term = taxonomy_term_load($tid)) {
// A variable is needed to track the current depth level.
$n = 0;
// Initialise our depth based parents array with the leaf term.
$parents[$n--][] = $term;
while ($n >= $this->options['depth']) {
// At each depth find the parents of the current terms.
// It is important to note that it is possible for a term to have
// multiple parents so get the parents of every parent and so on.
$parents[$n] = array();
foreach ($parents[$n + 1] as $term) {
$parents[$n] += taxonomy_get_parents($term->tid);
}
// Save all the tids for the condition.
$tids = array_merge($tids, array_map('_taxonomy_get_tid_from_term', $parents[$n]));
$n--;
}
}
}
}
// Check the size of the array and set the operator accordingly.
if (count($tids) > 1) {
$operator = 'IN';
}
else {
$tids = current($tids);
$operator = '=';
}
// Join on taxonomy index table.
$join = new views_join();
$join->table = 'taxonomy_index';
$join->field = 'nid';
$join->left_table = $this->table_alias;
$join->left_field = $this->real_field;
$join->type = 'INNER';
$join->extra = array(
array(
'field' => 'tid',
'value' => $tids,
'operator' => $operator,
),
);
// Distinct is required to prevent duplicate rows.
$this->query->distinct = TRUE;
}