function calendar_userapi_next($args = array())
{
xarVarFetch('cal_sdow', 'int:0:7', $cal_sdow, 0);
// what function are we in
xarVarFetch('func', 'str::', $func);
extract($args);
unset($args);
if (!isset($cal_interval)) {
$cal_interval = 1;
}
xarVarValidate('int::', $cal_date);
xarVarValidate('int:1:', $cal_interval);
xarVarValidate('str::', $cal_type);
$y = substr($cal_date, 0, 4);
$m = substr($cal_date, 4, 2);
$d = substr($cal_date, 6, 2);
switch (strtolower($cal_type)) {
case 'day':
$d += $cal_interval;
break;
case 'week':
$d += 7 * $cal_interval;
break;
case 'month':
$m += $cal_interval;
break;
case 'year':
$y += $cal_interval;
break;
}
$new_date = gmdate('Ymd', gmmktime(0, 0, 0, $m, $d, $y));
return xarModURL('calendar', 'user', strtolower($func), array('cal_date' => $new_date, 'cal_sdow' => $cal_sdow));
}
function calendar_userapi_getMonthNameLong($args)
{
extract($args);
unset($args);
if (!isset($month)) {
$month = date('m');
}
// make sure we have a valid month value
if (!xarVarValidate('int:1:12', $month)) {
return;
}
$c = xarMod::apiFunc('calendar', 'user', 'factory', 'calendar');
return $c->MonthLong($month);
}
/**
* Wrapper for the dayIs method of the calendar class
* @author Roger Raymond <*****@*****.**>
* @version $Id: dayis.php,v 1.2 2003/06/24 21:23:06 roger Exp $
* @param int $day 0 - 6 [Sun - Sat]
* @param int $date valid date YYYYMMDD
* @return bool true/false depending on day looking for and the date
*/
function calendar_userapi_dayIs($args)
{
extract($args);
unset($args);
// make sure we have a valid day value
if (!xarVarValidate('int:0:7', $day)) {
return;
}
// TODO: Revisit this later and make a new validator for it
// make sure we have a valid date
if (!xarVarValidate('int::', $date)) {
return;
}
$c = xarMod::apiFunc('calendar', 'user', 'factory', 'calendar');
return $c->dayIs($day, $date);
}
function calendar_userapi_getmonthstructure($args = array())
{
extract($args);
unset($args);
if (!isset($month)) {
return;
}
if (!isset($year)) {
return;
}
xarVarValidate('int:1:12', $month);
xarVarValidate('int::', $year);
xarVarFetch('cal_sdow', 'int:0:6', $cal_sdow, 0);
$c = xarMod::apiFunc('calendar', 'user', 'factory', 'calendar');
$c->setStartDayOfWeek($cal_sdow);
// echo the content to the screen
return $c->getCalendarMonth($year . $month);
}
function publications_treeapi_insertprep($args)
{
// An insertion point (an ID in the table) is required.
// Special insertion point ID is 0, which refers to the
// virtual root of all trees. An item can not be
// inserted on the same level as the virtual root.
extract($args);
// TODO: validate params: insertpoint, offset, tablename, idname
// Default operation is 'before' - i.e. put the new item in the place
// of the insertpoint and move everything to the right one place.
if (!xarVarValidate('enum:before:after:firstchild:lastchild', $offset, true)) {
$offset = 'firstchild';
}
if (!isset($insertpoint)) {
$insertpoint = 0;
}
if (!isset($idname)) {
$idname = 'xar_id';
}
// Cannot insert on the same level as the virtual root.
if ($insertpoint == 0) {
if ($offset == 'before') {
$offset = 'firstchild';
}
if ($offset == 'after') {
$offset = 'lastchild';
}
}
$dbconn = xarDB::getConn();
$result = xarMod::apiFunc('publications', 'tree', 'getleftright', array('tablename' => $tablename, 'idname' => $idname, 'id' => $insertpoint));
if (!$result) {
return;
}
extract($result);
// Locate the new insert point.
if ($offset == 'before') {
$shift = $left;
}
if ($offset == 'after') {
$shift = $right + 1;
}
if ($offset == 'firstchild') {
$shift = $left + 1;
$parent = $insertpoint;
}
if ($offset == 'lastchild') {
$shift = $right;
$parent = $insertpoint;
}
// Create a space of two traversal points.
// The new item will not have children, so the traversal
// points will be sequential.
$query = 'UPDATE ' . $tablename . ' SET xar_left = xar_left + 2 ' . ' WHERE xar_left >= ?';
$result = $dbconn->execute($query, array($shift));
if (!$result) {
return;
}
$query = 'UPDATE ' . $tablename . ' SET xar_right = xar_right + 2 ' . ' WHERE xar_right >= ?';
$result = $dbconn->execute($query, array($shift));
if (!$result) {
return;
}
// Return the new parent/left/right values
return array('parent' => $parent, 'left' => $shift, 'right' => $shift + 1);
}
/**
* Sets the day the calendar starts on (0=Sunday through 6=Saturday)
* @param int $d day of week the calendar should start on
*/
function setStartDayOfWeek($d)
{
// validate the input
if (!xarVarValidate('int:0:6', $d)) {
// we'll just leave it as is then
return true;
}
$this->startDayOfWeek =& $d;
return true;
}
function publications_userapi_getpages($args)
{
extract($args);
if (!xarVarValidate('enum:id:index:name:left:right', $key, true)) {
$key = 'index';
}
// Define if we are looking for the number of pages or the pages themselves
$count = empty($count) ? false : true;
// Assemble the query
sys::import('xaraya.structures.query');
$xartable = xarDB::getTables();
$q = new Query();
$q->addtable($xartable['publications'], 'tpages');
$q->addtable($xartable['publications_types'], 'pt');
$q->join('pt.id', 'tpages.pubtype_id');
if ($count) {
$q->addfield('COUNT(*)');
} else {
$q->setdistinct(true);
$q->addfield('tpages.id AS id');
$q->addfield('tpages.name AS name');
$q->addfield('tpages.title AS title');
$q->addfield('tpages.pubtype_id AS ptid');
$q->addfield('tpages.parent_id AS base_id');
$q->addfield('tpages.sitemap_flag AS sitemap_flag');
$q->addfield('tpages.menu_flag AS menu_flag');
$q->addfield('tpages.locale AS locale');
$q->addfield('tpages.leftpage_id AS leftpage_id');
$q->addfield('tpages.rightpage_id AS rightpage_id');
$q->addfield('tpages.parentpage_id AS parentpage');
$q->addfield('tpages.access AS access');
$q->addfield('tpages.state AS status');
$q->addfield('pt.description AS pubtype_name');
}
if (isset($baseonly)) {
$q->eq('tpages.parent_id', 0);
}
if (isset($name)) {
$q->eq('tpages.name', (string) $name);
}
if (isset($status)) {
// If a list of statuses have been provided, then select for any of them.
if (strpos($status, ',') === false) {
$numeric_status = convert_status($status);
$q->eq('tpages.state', strtoupper($status));
} else {
$statuses = explode(',', strtoupper($status));
$numeric_statuses = array();
foreach ($statuses as $stat) {
$numeric_statuses[] = convert_status($stat);
}
$q->in('tpages.state', $numeric_statuses);
}
}
if (isset($id)) {
$q->eq('tpages.id', (int) $id);
$where[] = 'tpages.id = ?';
$bind[] = (int) $id;
} elseif (!empty($ids)) {
$addwhere = array();
foreach ($ids as $myid) {
if (!empty($myid) && is_numeric($myid)) {
$addwhere[] = (int) $myid;
}
}
$q->in('tpages.state', $addwhere);
}
if (isset($itemtype)) {
$q->eq('tpages.pubtype_id', (int) $itemtype);
}
if (isset($parent)) {
$q->eq('tpages.parentpage_id', (int) $parent);
}
// Used to retrieve descendants.
if (isset($left_range) && is_array($left_range)) {
$q->between('tpages.leftpage_id', $left_range);
}
// Used to prune a single branch of the tree.
if (isset($left_exclude) && is_array($left_exclude)) {
//'tpages.leftpage_id NOT between ? AND ?' - does not work on some databases
$c[] = $q->plt('tpages.leftpage_id', (int) $left_exclude[0]);
$c[] = $q->pgt('tpages.leftpage_id', (int) $left_exclude[1]);
$q->qor($c);
unset($c);
}
// Used to retrieve ancestors.
if (isset($wrap_range) && is_numeric($wrap_range)) {
$c[] = $q->ple('tpages.leftpage_id', (int) $wrap_range[0]);
$c[] = $q->pge('tpages.leftpage_id', (int) $left_range[1]);
// can't be right: this is an array
$q->qand($c);
unset($c);
}
// If the request is to fetch a tree that *contains* a particular
// page, then add the extra sub-queries in here.
if (!empty($tree_contains_id) || !empty($tree_contains_name)) {
$q->addtable($xartable['publications'], 'tpages_member');
if (!empty($tree_contains_id)) {
$q->eq('tpages_member.id', (int) $tree_contains_id);
}
if (!empty($tree_contains_name)) {
$q->eq('tpages_member.name', (int) $tree_contains_name);
}
if (!empty($tree_ancestors)) {
// We don't want the complete tree for the matching pages - just
// their ancestors. This is useful for checking paths, without
// fetching complete trees.
$q->between('tpages_member.leftpage_id', 'expr:tpages.leftpage_id AND tpages.rightpage_id');
} else {
// Join to find the root page of the tree containing the required page.
// This matches the complete tree for the root under the selected page.
$q->addtable($xartable['publications'], 'tpages_root');
$q->le('tpages_root.leftpage_id', 'expr:tpages_member.leftpage_id');
$q->ge('tpages_root.rightpage_id', 'expr:tpages_member.rightpage_id');
$q->between('tpages.leftpage_id', 'expr:tpages_root.leftpage_id AND tpages_root.rightpage_id');
$q->eq('tpages_root.parentpage_id', 0);
}
}
// This ordering cannot be changed
// We want the pages in the order of the hierarchy.
if (empty($count)) {
$q->setorder('tpages.leftpage_id', 'ASC');
}
// $q->qecho();
$q->run();
if ($count) {
$pages = count($q->output());
} else {
$index = 0;
$id2key = array();
$pages = array();
// Get all the page type details.
$pagetypes = xarMod::apiFunc('publications', 'user', 'get_pubtypes', array('key' => 'id'));
foreach ($q->output() as $row) {
$id = (int) $row['id'];
// At this point check the privileges of the page fetched.
// To prevent broken trees, if a page is not assessible, prune
// (ie discard) descendant pages of that page. Descendants will have
// a left value between the left and right values of the
// inaccessible page.
if (!empty($prune_left)) {
if ($row['leftpage_id'] <= $prune_left) {
// The current page is still a descendant of the unprivileged page.
continue;
} else {
// We've reached a non-descendant - stop pruning now.
$prune_left = 0;
}
}
// JDJ 2008-06-11: now only need ViewPublicationsPage to be able to select the page,
// but ReadPublicationsPage to actually read it.
// The lowest privilege will be inherited, so one page with only View privilege
// will cause all descendent pages to have, at most, view privilege.
// We still need to fetch full details of these view-only pages, but we must flag
// then up in some way (status?). Displaying any of these pages would instead just
// show the 'no privs' page.
// Define admin access
sys::import('modules.dynamicdata.class.properties.master');
$accessproperty = DataPropertyMaster::getProperty(array('name' => 'access'));
$typename = $pagetypes[$row['ptid']]['name'];
$args = array('instance' => $row['name'] . ":" . $typename, 'level' => 800);
$adminaccess = $accessproperty->check($args);
$info = unserialize($row['access']);
if (!empty($info['view_access'])) {
// Decide whether the current user can create blocks of this type
$args = array('module' => 'publications', 'component' => 'Page', 'instance' => $name . ":" . $typename, 'group' => $info['view_access']['group'], 'level' => $info['view_access']['level']);
if (!$accessproperty->check($args)) {
// Save the right value. We need to skip all subsequent
// pages until we get to a page to the right of this one.
// The pages will be in 'left' order, so the descendants
// will be contiguous and will immediately follow this page.
$prune_left = $rightpage_id;
// Don't get this unless you are an admin
if (!$adminaccess) {
continue;
}
}
}
if (!empty($overview_only_left) && $row['leftpage_id'] <= $overview_only_left) {
// We have got past the overview-only page, so can reset the flag.
$overview_only_left = 0;
}
if (!empty($info['display_access'])) {
$args = array('module' => 'publications', 'component' => 'Page', 'instance' => $name . ":" . $typename, 'group' => $info['display_access']['group'], 'level' => $info['display_access']['level']);
if (!$accessproperty->check($args)) {
// We have reached a page that allows only overview access.
// Flag all pages with the restricted view until we get past this page.
$overview_only_left = $row['rightpage_id'];
// Don't get this unless you are an admin
if (!$adminaccess) {
continue;
}
}
}
if (!xarSecurityCheck('ReadPublications', 0, 'Page', $row['name'] . ':' . $typename, 'publications')) {
// We have reached a page that allows only overview access.
// Flag all pages with the restricted view until we get past this page.
$overview_only_left = $row['rightpage_id'];
}
// Note: ['parent_id'] is the parent page ID,
// but ['parent'] is the parent item key in the
// pages array.
$id2key[(int) $id] = ${$key};
if ($key == 'id') {
$parent_key = (int) $row['parentpage'];
} else {
if (isset($id2key[$row['parentpage']])) {
$parent_key = $id2key[$row['parentpage']];
} else {
$parent_key = 0;
}
}
$row['key'] = ${$key};
$row['access'] = $info;
$row['parent_key'] = (int) $parent_key;
$row['left'] = (int) $row['leftpage_id'];
$row['right'] = (int) $row['rightpage_id'];
unset($row['leftpage_id']);
unset($row['rightpage_id']);
$pages[${$key}] = $row;
$index += 1;
}
}
return $pages;
}
