2007-09-07 00:33:58 +02:00
|
|
|
<?php
|
|
|
|
|
|
|
|
class TagCloudWidget extends Widget {
|
|
|
|
static $db = array(
|
2008-04-09 01:22:08 +02:00
|
|
|
"Title" => "Varchar",
|
2007-09-07 00:33:58 +02:00
|
|
|
"Limit" => "Int",
|
|
|
|
"Sortby" => "Varchar"
|
|
|
|
);
|
|
|
|
|
|
|
|
static $defaults = array(
|
2008-04-09 01:22:08 +02:00
|
|
|
"Title" => "Tag Cloud",
|
2007-09-07 00:33:58 +02:00
|
|
|
"Limit" => "0",
|
|
|
|
"Sortby" => "alphabet"
|
|
|
|
);
|
|
|
|
|
|
|
|
static $cmsTitle = "Tag Cloud";
|
|
|
|
static $description = "Shows a tag cloud of tags on your blog.";
|
|
|
|
|
|
|
|
function getBlogHolder() {
|
|
|
|
$page = Director::currentPage();
|
|
|
|
|
|
|
|
if($page->is_a("BlogHolder")) {
|
|
|
|
return $page;
|
|
|
|
} else if($page->is_a("BlogEntry") && $page->getParent()->is_a("BlogHolder")) {
|
|
|
|
return $page->getParent();
|
|
|
|
} else {
|
|
|
|
return DataObject::get_one("BlogHolder");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
function getCMSFields() {
|
|
|
|
return new FieldSet(
|
2008-04-09 01:22:08 +02:00
|
|
|
new TextField("Title", _t("TagCloudWidget.TILE", "Title")),
|
2007-12-18 02:41:51 +01:00
|
|
|
new TextField("Limit", _t("TagCloudWidget.LIMIT", "Limit number of tags")),
|
|
|
|
new OptionsetField("Sortby",_t("TagCloudWidget.SORTBY","Sort by"),array("alphabet"=>_t("TagCloudWidget.SBAL", "alphabet"),"frequency"=>_t("TagCloudWidget.SBFREQ", "frequency")))
|
2007-09-07 00:33:58 +02:00
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2008-04-09 01:22:08 +02:00
|
|
|
function Title() {
|
|
|
|
return $this->Title ? $this->Title : 'Tag Cloud';
|
|
|
|
}
|
|
|
|
|
2007-09-07 00:33:58 +02:00
|
|
|
function Tags() {
|
|
|
|
Requirements::css("blog/css/tagcloud.css");
|
|
|
|
|
|
|
|
$allTags = array();
|
|
|
|
$max = 0;
|
|
|
|
$blogHolder = $this->getBlogHolder();
|
|
|
|
|
|
|
|
$entries = $blogHolder->Children();
|
|
|
|
|
|
|
|
if($entries) {
|
|
|
|
foreach($entries as $entry) {
|
|
|
|
$theseTags = split(" *, *", trim($entry->Tags));
|
|
|
|
foreach($theseTags as $tag) {
|
|
|
|
$allTags[$tag] = isset($allTags[$tag]) ? $allTags[$tag] + 1 : 1; //getting the count into key => value map
|
|
|
|
$max = ($allTags[$tag] > $max) ? $allTags[$tag] : $max;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if($allTags) {
|
|
|
|
|
|
|
|
//TODO: move some or all of the sorts to the database for more efficiency
|
|
|
|
|
|
|
|
if($this->Limit > 0){
|
|
|
|
uasort($allTags, "column_sort_by_popularity"); //sort by popularity
|
|
|
|
$allTags = array_slice($allTags, 0, $this->Limit);
|
|
|
|
}
|
|
|
|
if($this->Sortby == "alphabet"){
|
|
|
|
natksort($allTags);
|
|
|
|
}
|
|
|
|
|
|
|
|
$sizes = array();
|
|
|
|
foreach($allTags as $tag => $count){
|
|
|
|
$sizes[$count] = true;
|
|
|
|
}
|
|
|
|
$numsizes = count($sizes)-1; //Work out the number of different sizes
|
|
|
|
if($numsizes > 5){$numsizes = 5;}
|
|
|
|
|
|
|
|
foreach($allTags as $tag => $count) {
|
|
|
|
$popularity = floor($count / $max * $numsizes);
|
|
|
|
|
|
|
|
switch($popularity) {
|
|
|
|
case 0:
|
|
|
|
$class = "not-popular";
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
$class = "not-very-popular";
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
$class = "somewhat-popular";
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
$class = "popular";
|
|
|
|
break;
|
|
|
|
case 4:
|
|
|
|
$class = "very-popular";
|
|
|
|
break;
|
|
|
|
case 5:
|
|
|
|
$class = "ultra-popular";
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
$class = "broken";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
$allTags[$tag] = array(
|
|
|
|
"Tag" => $tag,
|
|
|
|
"Count" => $count,
|
|
|
|
"Class" => $class,
|
2007-12-18 03:10:44 +01:00
|
|
|
"Link" => $blogHolder->Link() . 'tag/' . urlencode($tag)
|
2007-09-07 00:33:58 +02:00
|
|
|
);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
$output = new DataObjectSet();
|
|
|
|
foreach($allTags as $tag => $fields) {
|
|
|
|
$output->push(new ArrayData($fields));
|
|
|
|
}
|
|
|
|
return $output;
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
function column_sort_by_popularity($a, $b){
|
|
|
|
|
|
|
|
if($a == $b) {
|
|
|
|
$result = 0;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
$result = $b - $a;
|
|
|
|
}
|
|
|
|
|
|
|
|
return $result;
|
|
|
|
}
|
|
|
|
|
|
|
|
function natksort(&$aToBeSorted)
|
|
|
|
{
|
|
|
|
$aResult = array();
|
|
|
|
$aKeys = array_keys($aToBeSorted);
|
|
|
|
natcasesort($aKeys);
|
|
|
|
foreach ($aKeys as $sKey)
|
|
|
|
{
|
|
|
|
$aResult[$sKey] = $aToBeSorted[$sKey];
|
|
|
|
}
|
|
|
|
$aToBeSorted = $aResult;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2007-12-18 03:10:44 +01:00
|
|
|
?>
|