/*
* Blog view renderer module for WebCit
*
- * Copyright (c) 1996-2011 by the citadel.org team
+ * Copyright (c) 1996-2012 by the citadel.org team
*
* This program is open source 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.
+ * modify it under the terms of the GNU General Public License, version 3.
*
* This program 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 this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "webcit.h"
#include "webserver.h"
-#include "groupdav.h"
+#include "dav.h"
/*
for (i=1; i<bp->num_msgs; ++i) {
read_message(WC->WBuf, HKEY("view_blog_comment"), bp->msgs[i], NULL, &Mime);
}
- do_template("blog_comment_box");
+ do_template("view_blog_comment_box");
}
else {
void **ViewSpecific,
long oper,
char *cmd,
- long len)
+ long len,
+ char *filter,
+ long flen)
{
HashList *BLOG = NewHash(1, NULL);
*ViewSpecific = BLOG;
}
bp->msgs[bp->num_msgs++] = Msg->msgnum;
}
+ else {
+ syslog(LOG_DEBUG, "** comment %ld is unparented", Msg->msgnum);
+ }
return 200;
}
int num_blogposts = 0;
int num_blogposts_alloc = 0;
int with_comments = 0;
+ int firstp = 0;
+ int maxp = 0;
/* Comments are shown if we are only viewing a single blog post */
if (atoi(BSTR("p"))) with_comments = 1;
+ firstp = atoi(BSTR("firstp")); /* start reading at... */
+ maxp = atoi(BSTR("maxp")); /* max posts to show... */
+ if (maxp < 1) maxp = 5; /* default; move somewhere else? */
+
/* Iterate through the hash list and copy the data pointers into an array */
it = GetNewHashPos(BLOG, 0);
while (GetNextHashPos(BLOG, it, &len, &Key, &Data)) {
* which they point are still owned by the hash list.
*/
if (num_blogposts > 0) {
-
+ int start_here = 0;
/* Sort newest-to-oldest */
qsort(blogposts, num_blogposts, sizeof(void *), blogview_sortfunc);
- /* FIXME -- allow the user to select a starting point in the list */
+ /* allow the user to select a starting point in the list */
+ for (i=0; i<num_blogposts; ++i) {
+ if (blogposts[i]->top_level_id == firstp) {
+ start_here = i;
+ }
+ }
/* FIXME -- allow the user (or a default setting) to select a maximum number of posts to display */
/* Now go through the list and render what we've got */
- for (i=0; i<num_blogposts; ++i) {
- blogpost_render(blogposts[i], with_comments);
+ for (i=start_here; i<num_blogposts; ++i) {
+ if ((i > 0) && (i == start_here)) {
+ int j = i - maxp;
+ if (j < 0) j = 0;
+ wc_printf("<div class=\"newer_blog_posts\"><a href=\"readfwd?go=");
+ urlescputs(ChrPtr(WC->CurRoom.name));
+ wc_printf("?firstp=%d?maxp=%d\">", blogposts[j]->top_level_id, maxp);
+ wc_printf("%s →</a></div>\n", _("Newer posts"));
+ }
+ if (i < (start_here + maxp)) {
+ blogpost_render(blogposts[i], with_comments);
+ }
+ else if (i == (start_here + maxp)) {
+ wc_printf("<div class=\"older_blog_posts\"><a href=\"readfwd?go=");
+ urlescputs(ChrPtr(WC->CurRoom.name));
+ wc_printf("?firstp=%d?maxp=%d\">", blogposts[i]->top_level_id, maxp);
+ wc_printf("← %s</a></div>\n", _("Older posts"));
+ }
}
/* Done. We are only freeing the array of pointers; the data itself
VIEW_BLOG,
blogview_GetParamsGetServerCall,
NULL,
+ NULL,
NULL,
blogview_LoadMsgFromServer,
blogview_render,