mirror of
https://github.com/moodle/moodle.git
synced 2025-08-04 08:26:37 +02:00
599 lines
28 KiB
PHP
599 lines
28 KiB
PHP
<?php
|
|
|
|
// This file is part of Moodle - http://moodle.org/
|
|
//
|
|
// Moodle is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Moodle is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Moodle. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
/**
|
|
* Allocates the submissions randomly
|
|
*
|
|
* @package mod-workshop
|
|
* @copyright 2009 David Mudrak <david.mudrak@gmail.com>
|
|
* @license http://www.gnu.org/copyleft/gpl.html GNU GPL v3 or later
|
|
*/
|
|
|
|
defined('MOODLE_INTERNAL') || die();
|
|
|
|
global $CFG; // access to global variables during unit test
|
|
|
|
require_once(dirname(dirname(__FILE__)) . '/lib.php'); // interface definition
|
|
require_once(dirname(dirname(dirname(__FILE__))) . '/locallib.php'); // workshop internal API
|
|
require_once(dirname(__FILE__) . '/settings_form.php'); // settings form
|
|
|
|
/**
|
|
* Allocates the submissions randomly
|
|
*/
|
|
class workshop_random_allocator implements workshop_allocator {
|
|
|
|
/** constants used to pass status messages between init() and ui() */
|
|
const MSG_SUCCESS = 1;
|
|
|
|
/** constants used in allocation settings form */
|
|
const USERTYPE_AUTHOR = 1;
|
|
const USERTYPE_REVIEWER = 2;
|
|
|
|
/** workshop instance */
|
|
protected $workshop;
|
|
|
|
/** mform with settings */
|
|
protected $mform;
|
|
|
|
/**
|
|
* @param workshop $workshop Workshop API object
|
|
*/
|
|
public function __construct(workshop $workshop) {
|
|
$this->workshop = $workshop;
|
|
}
|
|
|
|
/**
|
|
* Allocate submissions as requested by user
|
|
*/
|
|
public function init() {
|
|
global $PAGE;
|
|
|
|
$customdata = array();
|
|
$customdata['workshop'] = $this->workshop;
|
|
$this->mform = new workshop_random_allocator_form($PAGE->url, $customdata);
|
|
if ($this->mform->is_cancelled()) {
|
|
redirect($PAGE->url->out(false));
|
|
} else if ($settings = $this->mform->get_data()) {
|
|
// process validated data
|
|
if (!confirm_sesskey()) {
|
|
throw new moodle_exception('confirmsesskeybad');
|
|
}
|
|
$o = array(); // list of output messages
|
|
$numofreviews = required_param('numofreviews', PARAM_INT);
|
|
$numper = required_param('numper', PARAM_INT);
|
|
$removecurrent = optional_param('removecurrent', false, PARAM_BOOL);
|
|
$assesswosubmission = optional_param('assesswosubmission', false, PARAM_BOOL);
|
|
$addselfassessment = optional_param('addselfassessment', false, PARAM_BOOL);
|
|
$musthavesubmission = empty($assesswosubmission);
|
|
|
|
$authors = $this->workshop->get_potential_authors();
|
|
$authors = $this->workshop->get_grouped($authors);
|
|
$reviewers = $this->workshop->get_potential_reviewers($musthavesubmission);
|
|
$reviewers = $this->workshop->get_grouped($reviewers);
|
|
$assessments = $this->workshop->get_all_assessments();
|
|
|
|
$newallocations = array(); // array of array(reviewer => reviewee)
|
|
|
|
if ($numofreviews) {
|
|
// TODO MDL-19870 rewrite this part to make it easier to maintain and extend.
|
|
// $removecurrent -> remove it at the beginning and stop doing the magic with unkept allocation
|
|
// (leading to possible bugs)
|
|
if ($removecurrent) {
|
|
// behave as if there were no current assessments
|
|
$curassessments = array();
|
|
} else {
|
|
$curassessments = $assessments;
|
|
}
|
|
$randomallocations = $this->random_allocation($authors, $reviewers, $curassessments, $numofreviews, $numper, $o);
|
|
$this->filter_current_assessments($randomallocations, $assessments);
|
|
$newallocations = array_merge($newallocations, $randomallocations);
|
|
$o[] = 'ok::' . get_string('numofrandomlyallocatedsubmissions', 'workshopallocation_random', count($randomallocations));
|
|
unset($randomallocations);
|
|
}
|
|
if ($addselfassessment) {
|
|
$selfallocations = $this->self_allocation($authors, $reviewers, $assessments);
|
|
$newallocations = array_merge($newallocations, $selfallocations);
|
|
$o[] = 'ok::' . get_string('numofselfallocatedsubmissions', 'workshopallocation_random', count($selfallocations));
|
|
unset($selfallocations);
|
|
}
|
|
if (empty($newallocations)) {
|
|
$o[] = 'info::' . get_string('noallocationtoadd', 'workshopallocation_random');
|
|
} else {
|
|
$this->add_new_allocations($newallocations, $authors, $reviewers);
|
|
foreach ($newallocations as $newallocation) {
|
|
list($reviewerid, $authorid) = each($newallocation);
|
|
$a = new stdclass();
|
|
$a->reviewername = fullname($reviewers[0][$reviewerid]);
|
|
$a->authorname = fullname($authors[0][$authorid]);
|
|
$o[] = 'ok::indent::' . get_string('allocationaddeddetail', 'workshopallocation_random', $a);
|
|
}
|
|
}
|
|
if ($removecurrent) {
|
|
$delassessments = $this->get_unkept_assessments($assessments, $newallocations, $addselfassessment);
|
|
// random allocator should not be able to delete assessments that have already been graded
|
|
// by reviewer
|
|
$o[] = 'info::' . get_string('numofdeallocatedassessment', 'workshopallocation_random', count($delassessments));
|
|
foreach ($delassessments as $delassessmentkey => $delassessmentid) {
|
|
$a = new stdclass();
|
|
$a->authorname = fullname((object)array(
|
|
'lastname' => $assessments[$delassessmentid]->authorlastname,
|
|
'firstname' => $assessments[$delassessmentid]->authorfirstname));
|
|
$a->reviewername = fullname((object)array(
|
|
'lastname' => $assessments[$delassessmentid]->reviewerlastname,
|
|
'firstname' => $assessments[$delassessmentid]->reviewerfirstname));
|
|
if (!is_null($assessments[$delassessmentid]->grade)) {
|
|
$o[] = 'error::indent::' . get_string('allocationdeallocategraded', 'workshopallocation_random', $a);
|
|
unset($delassessments[$delassessmentkey]);
|
|
} else {
|
|
$o[] = 'info::indent::' . get_string('assessmentdeleteddetail', 'workshopallocation_random', $a);
|
|
}
|
|
}
|
|
$this->workshop->delete_assessment($delassessments);
|
|
}
|
|
return $o;
|
|
} else {
|
|
// this branch is executed if the form is submitted but the data
|
|
// doesn't validate and the form should be redisplayed
|
|
// or on the first display of the form.
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Returns the HTML code to print the user interface
|
|
*/
|
|
public function ui() {
|
|
global $OUTPUT, $PAGE;
|
|
|
|
$m = optional_param('m', null, PARAM_INT); // status message code
|
|
$msg = new stdclass();
|
|
if ($m == self::MSG_SUCCESS) {
|
|
$msg = (object)array('text' => get_string('randomallocationdone', 'workshopallocation_random'), 'sty' => 'ok');
|
|
}
|
|
|
|
$out = '';
|
|
$out .= $OUTPUT->container_start('random-allocator');
|
|
$wsoutput = $PAGE->get_renderer('mod_workshop');
|
|
$out .= $wsoutput->status_message($msg);
|
|
// the nasty hack follows to bypass the sad fact that moodle quickforms do not allow to actually
|
|
// return the HTML content, just to display it
|
|
ob_start();
|
|
$this->mform->display();
|
|
$out .= ob_get_contents();
|
|
ob_end_clean();
|
|
$out .= $OUTPUT->container_end();
|
|
|
|
$out .= $OUTPUT->heading(get_string('stats', 'workshopallocation_random'));
|
|
// TODO
|
|
return $out;
|
|
}
|
|
|
|
/**
|
|
* Delete all data related to a given workshop module instance
|
|
*
|
|
* This plugin does not store any data.
|
|
*
|
|
* @see workshop_delete_instance()
|
|
* @param int $workshopid id of the workshop module instance being deleted
|
|
* @return void
|
|
*/
|
|
public static function delete_instance($workshopid) {
|
|
return;
|
|
}
|
|
|
|
/**
|
|
* Return an array of possible numbers of reviews to be done
|
|
*
|
|
* Should contain numbers 1, 2, 3, ... 10 and possibly others up to a reasonable value
|
|
*
|
|
* @return array of integers
|
|
*/
|
|
public static function available_numofreviews_list() {
|
|
$options = array();
|
|
$options[30] = 30;
|
|
$options[20] = 20;
|
|
$options[15] = 15;
|
|
for ($i = 10; $i >= 0; $i--) {
|
|
$options[$i] = $i;
|
|
}
|
|
return $options;
|
|
}
|
|
|
|
/**
|
|
* Allocates submissions to their authors for review
|
|
*
|
|
* If the submission has already been allocated, it is skipped. If the author is not found among
|
|
* reviewers, the submission is not assigned.
|
|
*
|
|
* @param array $authors grouped of {@see workshop::get_potential_authors()}
|
|
* @param array $reviewers grouped by {@see workshop::get_potential_reviewers()}
|
|
* @param array $assessments as returned by {@see workshop::get_all_assessments()}
|
|
* @return array of new allocations to be created, array of array(reviewerid => authorid)
|
|
*/
|
|
protected function self_allocation($authors=array(), $reviewers=array(), $assessments=array()) {
|
|
if (!isset($authors[0]) || !isset($reviewers[0])) {
|
|
// no authors or no reviewers
|
|
return array();
|
|
}
|
|
$alreadyallocated = array();
|
|
foreach ($assessments as $assessment) {
|
|
if ($assessment->authorid == $assessment->reviewerid) {
|
|
$alreadyallocated[$assessment->authorid] = 1;
|
|
}
|
|
}
|
|
$add = array(); // list of new allocations to be created
|
|
foreach ($authors[0] as $authorid => $author) {
|
|
// for all authors in all groups
|
|
if (isset($reviewers[0][$authorid])) {
|
|
// if the author can be reviewer
|
|
if (!isset($alreadyallocated[$authorid])) {
|
|
// and the allocation does not exist yet, then
|
|
$add[] = array($authorid => $authorid);
|
|
}
|
|
}
|
|
}
|
|
return $add;
|
|
}
|
|
|
|
/**
|
|
* Creates new assessment records
|
|
*
|
|
* @param array $newallocations pairs 'reviewerid' => 'authorid'
|
|
* @param array $dataauthors authors by group, group [0] contains all authors
|
|
* @param array $datareviewers reviewers by group, group [0] contains all reviewers
|
|
* @return bool
|
|
*/
|
|
protected function add_new_allocations(array $newallocations, array $dataauthors, array $datareviewers) {
|
|
global $DB;
|
|
|
|
$newallocations = $this->get_unique_allocations($newallocations);
|
|
$authorids = $this->get_author_ids($newallocations);
|
|
$submissions = $this->workshop->get_submissions($authorids);
|
|
$submissions = $this->index_submissions_by_authors($submissions);
|
|
foreach ($newallocations as $newallocation) {
|
|
list($reviewerid, $authorid) = each($newallocation);
|
|
if (!isset($submissions[$authorid])) {
|
|
throw new moodle_exception('unabletoallocateauthorwithoutsubmission', 'workshop');
|
|
}
|
|
$submission = $submissions[$authorid];
|
|
$status = $this->workshop->add_allocation($submission, $reviewerid, 1, true); // todo configurable weight?
|
|
if (workshop::ALLOCATION_EXISTS == $status) {
|
|
debugging('newallocations array contains existing allocation, this should not happen');
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Flips the structure of submission so it is indexed by authorid attribute
|
|
*
|
|
* It is the caller's responsibility to make sure the submissions are not teacher
|
|
* examples so no user is the author of more submissions.
|
|
*
|
|
* @param string $submissions array indexed by submission id
|
|
* @return array indexed by author id
|
|
*/
|
|
protected function index_submissions_by_authors($submissions) {
|
|
$byauthor = array();
|
|
if (is_array($submissions)) {
|
|
foreach ($submissions as $submissionid => $submission) {
|
|
if (isset($byauthor[$submission->authorid])) {
|
|
throw new moodle_exception('moresubmissionsbyauthor', 'workshop');
|
|
}
|
|
$byauthor[$submission->authorid] = $submission;
|
|
}
|
|
}
|
|
return $byauthor;
|
|
}
|
|
|
|
/**
|
|
* Extracts unique list of authors' IDs from the structure of new allocations
|
|
*
|
|
* @param array $newallocations of pairs 'reviewerid' => 'authorid'
|
|
* @return array of authorids
|
|
*/
|
|
protected function get_author_ids($newallocations) {
|
|
$authors = array();
|
|
foreach ($newallocations as $newallocation) {
|
|
$authorid = reset($newallocation);
|
|
if (!in_array($authorid, $authors)) {
|
|
$authors[] = $authorid;
|
|
}
|
|
}
|
|
return $authors;
|
|
}
|
|
|
|
/**
|
|
* Removes duplicate allocations
|
|
*
|
|
* @param mixed $newallocations array of 'reviewerid' => 'authorid' pairs
|
|
* @return array
|
|
*/
|
|
protected function get_unique_allocations($newallocations) {
|
|
return array_merge(array_map('unserialize', array_unique(array_map('serialize', $newallocations))));
|
|
}
|
|
|
|
/**
|
|
* Returns the list of assessments to remove
|
|
*
|
|
* If user selects "removecurrentallocations", we should remove all current assessment records
|
|
* and insert new ones. But this would needlessly waste table ids. Instead, let us find only those
|
|
* assessments that have not been re-allocated in this run of allocation. So, the once-allocated
|
|
* submissions are kept with their original id.
|
|
*
|
|
* @param array $assessments list of current assessments
|
|
* @param mixed $newallocations array of 'reviewerid' => 'authorid' pairs
|
|
* @param bool $keepselfassessments do not remove already allocated self assessments
|
|
* @return array of assessments ids to be removed
|
|
*/
|
|
protected function get_unkept_assessments($assessments, $newallocations, $keepselfassessments) {
|
|
$keepids = array(); // keep these assessments
|
|
foreach ($assessments as $assessmentid => $assessment) {
|
|
$aaid = $assessment->authorid;
|
|
$arid = $assessment->reviewerid;
|
|
if (($keepselfassessments) && ($aaid == $arid)) {
|
|
$keepids[$assessmentid] = null;
|
|
continue;
|
|
}
|
|
foreach ($newallocations as $newallocation) {
|
|
list($nrid, $naid) = each($newallocation);
|
|
if (array($arid, $aaid) == array($nrid, $naid)) {
|
|
// re-allocation found - let us continue with the next assessment
|
|
$keepids[$assessmentid] = null;
|
|
continue 2;
|
|
}
|
|
}
|
|
}
|
|
return array_keys(array_diff_key($assessments, $keepids));
|
|
}
|
|
|
|
/**
|
|
* Allocates submission reviews randomly
|
|
*
|
|
* The algorithm of this function has been described at http://moodle.org/mod/forum/discuss.php?d=128473
|
|
* Please see the PDF attached to the post before you study the implementation. The goal of the function
|
|
* is to connect each "circle" (circles are representing either authors or reviewers) with a required
|
|
* number of "squares" (the other type than circles are).
|
|
*
|
|
* @param array $authors structure of grouped authors
|
|
* @param resource $reviewers structure of grouped reviewers
|
|
* @param array $assessments currently assigned assessments to be kept
|
|
* @param mixed $numofreviews number of reviewes to be allocated to each circle
|
|
* @param mixed $numper what user type the circles represent
|
|
* @param array $o reference to an array of log messages
|
|
* @return array array of (reviewerid => authorid) pairs
|
|
*/
|
|
protected function random_allocation($authors, $reviewers, $assessments, $numofreviews, $numper, &$o) {
|
|
if (empty($authors) || empty($reviewers)) {
|
|
// nothing to be done
|
|
return array();
|
|
}
|
|
if (self::USERTYPE_AUTHOR == $numper) {
|
|
// circles are authors, squares are reviewers
|
|
$o[] = 'info::Trying to allocate ' . $numofreviews . ' review(s) per author'; // todo translate
|
|
$allcircles = $authors;
|
|
$allsquares = $reviewers;
|
|
// get current workload
|
|
list($circlelinks, $squarelinks) = $this->convert_assessments_to_links($assessments);
|
|
} elseif (self::USERTYPE_REVIEWER == $numper) {
|
|
// circles are reviewers, squares are authors
|
|
$o[] = 'info::trying to allocate ' . $numofreviews . ' review(s) per reviewer'; // todo translate
|
|
$allcircles = $reviewers;
|
|
$allsquares = $authors;
|
|
// get current workload
|
|
list($squarelinks, $circlelinks) = $this->convert_assessments_to_links($assessments);
|
|
} else {
|
|
throw new moodle_exception('unknownusertypepassed', 'workshop');
|
|
}
|
|
// $o[] = 'debug::circle links = ' . json_encode($circlelinks);
|
|
// $o[] = 'debug::square links = ' . json_encode($squarelinks);
|
|
$squareworkload = array(); // individual workload indexed by squareid
|
|
$squaregroupsworkload = array(); // group workload indexed by squaregroupid
|
|
foreach ($allsquares as $squaregroupid => $squares) {
|
|
$squaregroupsworkload[$squaregroupid] = 0;
|
|
foreach ($squares as $squareid => $square) {
|
|
if (!isset($squarelinks[$squareid])) {
|
|
$squarelinks[$squareid] = array();
|
|
}
|
|
$squareworkload[$squareid] = count($squarelinks[$squareid]);
|
|
$squaregroupsworkload[$squaregroupid] += $squareworkload[$squareid];
|
|
}
|
|
$squaregroupsworkload[$squaregroupid] /= count($squares);
|
|
}
|
|
unset($squaregroupsworkload[0]); // [0] is not real group, it contains all users
|
|
// $o[] = 'debug::square workload = ' . json_encode($squareworkload);
|
|
// $o[] = 'debug::square group workload = ' . json_encode($squaregroupsworkload);
|
|
$gmode = groups_get_activity_groupmode($this->workshop->cm, $this->workshop->course);
|
|
if (SEPARATEGROUPS == $gmode) {
|
|
// shuffle all groups but [0] which means "all users"
|
|
$circlegroups = array_keys(array_diff_key($allcircles, array(0 => null)));
|
|
shuffle($circlegroups);
|
|
} else {
|
|
// all users will be processed at once
|
|
$circlegroups = array(0);
|
|
}
|
|
$this->shuffle_assoc($circlegroups);
|
|
// $o[] = 'debug::circle groups = ' . json_encode($circlegroups);
|
|
foreach ($circlegroups as $circlegroupid) {
|
|
$o[] = 'debug::processing circle group id ' . $circlegroupid;
|
|
$circles = $allcircles[$circlegroupid];
|
|
$this->shuffle_assoc($circles);
|
|
foreach ($circles as $circleid => $circle) {
|
|
$o[] = 'debug::processing circle id ' . $circleid;
|
|
if (!isset($circlelinks[$circleid])) {
|
|
$circlelinks[$circleid] = array();
|
|
}
|
|
$keeptrying = true; // is there a chance to find a square for this circle?
|
|
$failedgroups = array(); // array of groupids where the square should be chosen from (because
|
|
// of their group workload) but it was not possible (for example there
|
|
// was the only square and it had been already connected
|
|
while ($keeptrying && (count($circlelinks[$circleid]) < $numofreviews)) {
|
|
// firstly, choose a group to pick the square from
|
|
if (NOGROUPS == $gmode) {
|
|
if (in_array(0, $failedgroups)) {
|
|
$keeptrying = false;
|
|
$o[] = 'error::indent::No more peers available'; // todo translate
|
|
break;
|
|
}
|
|
$targetgroup = 0;
|
|
} elseif (SEPARATEGROUPS == $gmode) {
|
|
if (in_array($circlegroupid, $failedgroups)) {
|
|
$keeptrying = false;
|
|
$o[] = 'error::indent::No more peers available in this separate group'; // todo translate
|
|
break;
|
|
}
|
|
$targetgroup = $circlegroupid;
|
|
} elseif (VISIBLEGROUPS == $gmode) {
|
|
$trygroups = array_diff_key($squaregroupsworkload, array(0 => null)); // all but [0]
|
|
$trygroups = array_diff_key($trygroups, array_flip($failedgroups)); // without previous failures
|
|
$targetgroup = $this->get_element_with_lowest_workload($trygroups);
|
|
}
|
|
if ($targetgroup === false) {
|
|
$keeptrying = false;
|
|
$o[] = 'error::indent::Not enough peers available'; // todo translate
|
|
break;
|
|
}
|
|
$o[] = 'debug::indent::next square should be from group id ' . $targetgroup;
|
|
// now, choose a square from the target group
|
|
$trysquares = array_intersect_key($squareworkload, $allsquares[$targetgroup]);
|
|
// $o[] = 'debug::indent::individual workloads in this group are ' . json_encode($trysquares);
|
|
unset($trysquares[$circleid]); // can't allocate to self
|
|
$trysquares = array_diff_key($trysquares, array_flip($circlelinks[$circleid])); // can't re-allocate the same
|
|
$targetsquare = $this->get_element_with_lowest_workload($trysquares);
|
|
if (false === $targetsquare) {
|
|
$o[] = 'debug::indent::unable to find an available square. trying another group';
|
|
$failedgroups[] = $targetgroup;
|
|
continue;
|
|
}
|
|
$o[] = 'debug::indent::target square = ' . $targetsquare;
|
|
// ok - we have found the square
|
|
$circlelinks[$circleid][] = $targetsquare;
|
|
$squarelinks[$targetsquare][] = $circleid;
|
|
$squareworkload[$targetsquare]++;
|
|
$o[] = 'debug::indent::increasing square workload to ' . $squareworkload[$targetsquare];
|
|
if ($targetgroup) {
|
|
// recalculate the group workload
|
|
$squaregroupsworkload[$targetgroup] = 0;
|
|
foreach ($allsquares[$targetgroup] as $squareid => $square) {
|
|
$squaregroupsworkload[$targetgroup] += $squareworkload[$squareid];
|
|
}
|
|
$squaregroupsworkload[$targetgroup] /= count($allsquares[$targetgroup]);
|
|
$o[] = 'debug::indent::increasing group workload to ' . $squaregroupsworkload[$targetgroup];
|
|
}
|
|
} // end of processing this circle
|
|
} // end of processing circles in the group
|
|
} // end of processing circle groups
|
|
$returned = array();
|
|
if (self::USERTYPE_AUTHOR == $numper) {
|
|
// circles are authors, squares are reviewers
|
|
foreach ($circlelinks as $circleid => $squares) {
|
|
foreach ($squares as $squareid) {
|
|
$returned[] = array($squareid => $circleid);
|
|
}
|
|
}
|
|
}
|
|
if (self::USERTYPE_REVIEWER == $numper) {
|
|
// circles are reviewers, squares are authors
|
|
foreach ($circlelinks as $circleid => $squares) {
|
|
foreach ($squares as $squareid) {
|
|
$returned[] = array($circleid => $squareid);
|
|
}
|
|
}
|
|
}
|
|
return $returned;
|
|
}
|
|
|
|
/**
|
|
* Extracts the information about reviews from the authors' and reviewers' perspectives
|
|
*
|
|
* @param array $assessments array of assessments as returned by {@link workshop::get_all_assessments()}
|
|
* @return array of two arrays
|
|
*/
|
|
protected function convert_assessments_to_links($assessments) {
|
|
$authorlinks = array(); // [authorid] => array(reviewerid, reviewerid, ...)
|
|
$reviewerlinks = array(); // [reviewerid] => array(authorid, authorid, ...)
|
|
foreach ($assessments as $assessment) {
|
|
if (!isset($authorlinks[$assessment->authorid])) {
|
|
$authorlinks[$assessment->authorid] = array();
|
|
}
|
|
if (!isset($reviewerlinks[$assessment->reviewerid])) {
|
|
$reviewerlinks[$assessment->reviewerid] = array();
|
|
}
|
|
$authorlinks[$assessment->authorid][] = $assessment->reviewerid;
|
|
$reviewerlinks[$assessment->reviewerid][] = $assessment->authorid;
|
|
}
|
|
return array($authorlinks, $reviewerlinks);
|
|
}
|
|
|
|
/**
|
|
* Selects an element with the lowest workload
|
|
*
|
|
* If there are more elements with the same workload, choose one of them randomly. This may be
|
|
* used to select a group or user.
|
|
*
|
|
* @param array $workload [groupid] => (int)workload
|
|
* @return mixed int|bool id of the selected element or false if it is impossible to choose
|
|
*/
|
|
protected function get_element_with_lowest_workload($workload) {
|
|
$precision = 10;
|
|
|
|
if (empty($workload)) {
|
|
return false;
|
|
}
|
|
$minload = round(min($workload), $precision);
|
|
$minkeys = array();
|
|
foreach ($workload as $key => $val) {
|
|
if (round($val, $precision) == $minload) {
|
|
$minkeys[$key] = $val;
|
|
}
|
|
}
|
|
return array_rand($minkeys);
|
|
}
|
|
|
|
/**
|
|
* Shuffle the order of array elements preserving the key=>values
|
|
*
|
|
* @author rich at home dot nl
|
|
* @link http://php.net/manual/en/function.shuffle.php#80586
|
|
* @param array $array to be shuffled
|
|
* @return true
|
|
*/
|
|
protected function shuffle_assoc(&$array) {
|
|
if (count($array) > 1) {
|
|
// $keys needs to be an array, no need to shuffle 1 item or empty arrays, anyway
|
|
$keys = array_rand($array, count($array));
|
|
foreach($keys as $key) {
|
|
$new[$key] = $array[$key];
|
|
}
|
|
$array = $new;
|
|
}
|
|
return true; // because this behaves like in-built shuffle(), which returns true
|
|
}
|
|
|
|
/**
|
|
* Filter new allocations so that they do not contain an already existing assessment
|
|
*
|
|
* @param mixed $newallocations array of ('reviewerid' => 'authorid') tuples
|
|
* @param array $assessments array of assessment records
|
|
* @return void
|
|
*/
|
|
protected function filter_current_assessments(&$newallocations, $assessments) {
|
|
foreach ($assessments as $assessment) {
|
|
$allocation = array($assessment->reviewerid => $assessment->authorid);
|
|
$foundat = array_keys($newallocations, $allocation);
|
|
$newallocations = array_diff_key($newallocations, array_flip($foundat));
|
|
}
|
|
}
|
|
}
|