2020-02-07 17:27:45 +01:00
// Vikunja is a to-do list application to facilitate your life.
2020-01-09 18:33:22 +01:00
// Copyright 2018-2020 Vikunja and contributors. All rights reserved.
2018-11-26 21:17:33 +01:00
//
2019-12-04 20:39:56 +01:00
// This program 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.
2018-11-26 21:17:33 +01:00
//
2019-12-04 20:39:56 +01:00
// 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.
2018-11-26 21:17:33 +01:00
//
2019-12-04 20:39:56 +01:00
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
2018-11-26 21:17:33 +01:00
2018-06-10 15:55:56 +02:00
package models
2018-12-02 01:49:30 +01:00
import (
2019-10-16 22:52:29 +02:00
"code.vikunja.io/api/pkg/files"
2019-07-16 16:15:40 +02:00
"code.vikunja.io/api/pkg/metrics"
2020-02-08 13:48:49 +01:00
"code.vikunja.io/api/pkg/timeutil"
2020-01-26 18:08:06 +01:00
"code.vikunja.io/api/pkg/user"
2019-07-16 16:15:40 +02:00
"code.vikunja.io/api/pkg/utils"
2018-12-02 01:49:30 +01:00
"code.vikunja.io/web"
2019-07-16 16:15:40 +02:00
"github.com/imdario/mergo"
2018-12-19 20:14:48 +01:00
"sort"
2019-12-07 23:28:45 +01:00
"strconv"
2019-07-16 16:15:40 +02:00
"time"
2018-12-02 01:49:30 +01:00
)
2018-12-01 00:26:56 +01:00
2019-08-14 22:19:04 +02:00
// Task represents an task in a todolist
type Task struct {
2019-01-03 23:22:06 +01:00
// The unique, numeric id of this task.
ID int64 ` xorm:"int(11) autoincr not null unique pk" json:"id" param:"listtask" `
// The task text. This is what you'll see in the list.
2019-03-29 18:54:35 +01:00
Text string ` xorm:"varchar(250) not null" json:"text" valid:"runelength(3|250)" minLength:"3" maxLength:"250" `
2019-01-03 23:22:06 +01:00
// The task description.
2019-07-21 23:57:19 +02:00
Description string ` xorm:"longtext null" json:"description" `
2019-01-14 23:32:56 +01:00
// Whether a task is done or not.
2019-03-29 18:54:35 +01:00
Done bool ` xorm:"INDEX null" json:"done" `
2020-02-08 13:48:49 +01:00
// The time when a task was marked as done.
DoneAt timeutil . TimeStamp ` xorm:"INDEX null 'done_at_unix'" json:"doneAt" `
// The time when the task is due.
DueDate timeutil . TimeStamp ` xorm:"int(11) INDEX null 'due_date_unix'" json:"dueDate" `
// An array of datetimes when the user wants to be reminded of the task.
Reminders [ ] timeutil . TimeStamp ` xorm:"-" json:"reminderDates" `
CreatedByID int64 ` xorm:"int(11) not null" json:"-" ` // ID of the user who put that task on the list
2019-01-03 23:22:06 +01:00
// The list this task belongs to.
2019-04-23 21:53:37 +02:00
ListID int64 ` xorm:"int(11) INDEX not null" json:"listID" param:"list" `
2019-01-03 23:22:06 +01:00
// An amount in seconds this task repeats itself. If this is set, when marking the task as done, it will mark itself as "undone" and then increase all remindes and the due date by its amount.
2019-03-29 18:54:35 +01:00
RepeatAfter int64 ` xorm:"int(11) INDEX null" json:"repeatAfter" `
2019-01-03 23:22:06 +01:00
// The task priority. Can be anything you want, it is possible to sort by this later.
2019-03-29 18:54:35 +01:00
Priority int64 ` xorm:"int(11) null" json:"priority" `
2019-01-03 23:22:06 +01:00
// When this task starts.
2020-02-08 13:48:49 +01:00
StartDate timeutil . TimeStamp ` xorm:"int(11) INDEX null 'start_date_unix'" json:"startDate" query:"-" `
2019-01-03 23:22:06 +01:00
// When this task ends.
2020-02-08 13:48:49 +01:00
EndDate timeutil . TimeStamp ` xorm:"int(11) INDEX null 'end_date_unix'" json:"endDate" query:"-" `
2019-01-03 23:22:06 +01:00
// An array of users who are assigned to this task
2020-01-26 18:08:06 +01:00
Assignees [ ] * user . User ` xorm:"-" json:"assignees" `
2019-01-03 23:22:06 +01:00
// An array of labels which are associated with this task.
Labels [ ] * Label ` xorm:"-" json:"labels" `
2019-04-30 11:26:37 +02:00
// The task color in hex
HexColor string ` xorm:"varchar(6) null" json:"hexColor" valid:"runelength(0|6)" maxLength:"6" `
2019-09-21 12:52:10 +02:00
// Determines how far a task is left from being done
PercentDone float64 ` xorm:"DOUBLE null" json:"percentDone" `
2018-12-01 03:00:57 +01:00
2019-12-07 23:28:45 +01:00
// The task identifier, based on the list identifier and the task's index
Identifier string ` xorm:"-" json:"identifier" `
// The task index, calculated per list
Index int64 ` xorm:"int(11) not null default 0" json:"index" `
2019-05-22 19:48:48 +02:00
// The UID is currently not used for anything other than caldav, which is why we don't expose it over json
UID string ` xorm:"varchar(250) null" json:"-" `
2019-09-25 20:44:41 +02:00
// All related tasks, grouped by their relation kind
RelatedTasks RelatedTaskMap ` xorm:"-" json:"related_tasks" `
2018-11-17 00:17:37 +01:00
2019-10-16 22:52:29 +02:00
// All attachments this task has
Attachments [ ] * TaskAttachment ` xorm:"-" json:"attachments" `
2020-02-08 13:48:49 +01:00
// A timestamp when this task was created. You cannot change this value.
Created timeutil . TimeStamp ` xorm:"created not null" json:"created" `
// A timestamp when this task was last updated. You cannot change this value.
Updated timeutil . TimeStamp ` xorm:"updated not null" json:"updated" `
2018-06-10 15:55:56 +02:00
2019-01-03 23:22:06 +01:00
// The user who initially created the task.
2020-01-26 18:08:06 +01:00
CreatedBy * user . User ` xorm:"-" json:"createdBy" valid:"-" `
2018-07-11 02:13:53 +02:00
2018-12-01 00:26:56 +01:00
web . CRUDable ` xorm:"-" json:"-" `
web . Rights ` xorm:"-" json:"-" `
2018-06-10 15:55:56 +02:00
}
2018-08-30 08:09:17 +02:00
// TableName returns the table name for listtasks
2019-08-14 22:19:04 +02:00
func ( Task ) TableName ( ) string {
2018-08-30 08:09:17 +02:00
return "tasks"
2018-06-10 15:55:56 +02:00
}
2019-05-25 09:33:57 +02:00
// TaskReminder holds a reminder on a task
type TaskReminder struct {
2020-02-08 13:48:49 +01:00
ID int64 ` xorm:"int(11) autoincr not null unique pk" `
TaskID int64 ` xorm:"int(11) not null INDEX" `
Reminder timeutil . TimeStamp ` xorm:"int(11) not null INDEX 'reminder_unix'" `
Created timeutil . TimeStamp ` xorm:"created not null" `
2019-05-25 09:33:57 +02:00
}
// TableName returns a pretty table name
func ( TaskReminder ) TableName ( ) string {
return "task_reminders"
}
2019-12-01 14:38:11 +01:00
type taskOptions struct {
search string
startDate time . Time
endDate time . Time
page int
perPage int
2019-12-07 15:30:51 +01:00
sortby [ ] * sortParam
2019-12-01 14:38:11 +01:00
}
// ReadAll is a dummy function to still have that endpoint documented
2019-07-16 16:15:40 +02:00
// @Summary Get tasks
// @Description Returns all tasks on any list the user has access to.
// @tags task
// @Accept json
// @Produce json
2019-10-23 23:11:40 +02:00
// @Param page query int false "The page number. Used for pagination. If not provided, the first page of results is returned."
// @Param per_page query int false "The maximum number of items per page. Note this parameter is limited by the configured maximum of items per page."
2019-07-16 16:15:40 +02:00
// @Param s query string false "Search tasks by task text."
// @Param sort query string false "The sorting parameter. Possible values to sort by are priority, prioritydesc, priorityasc, duedate, duedatedesc, duedateasc."
2020-02-08 13:48:49 +01:00
// @Param startdate query int false "The start date parameter to filter by. Expects a timestamp. If no end date, but a start date is specified, the end date is set to the current time."
// @Param enddate query int false "The end date parameter to filter by. Expects a timestamp. If no start date, but an end date is specified, the start date is set to the current time."
2019-07-16 16:15:40 +02:00
// @Security JWTKeyAuth
2019-08-14 22:19:04 +02:00
// @Success 200 {array} models.Task "The tasks"
2019-07-16 16:15:40 +02:00
// @Failure 500 {object} models.Message "Internal error"
// @Router /tasks/all [get]
2019-10-23 23:11:40 +02:00
func ( t * Task ) ReadAll ( a web . Auth , search string , page int , perPage int ) ( result interface { } , resultCount int , totalItems int64 , err error ) {
2019-12-01 14:38:11 +01:00
return nil , 0 , 0 , nil
2019-08-31 22:56:41 +02:00
}
2019-10-23 23:11:40 +02:00
func getRawTasksForLists ( lists [ ] * List , opts * taskOptions ) ( taskMap map [ int64 ] * Task , resultCount int , totalItems int64 , err error ) {
2019-10-20 17:55:54 +02:00
2019-07-16 16:15:40 +02:00
// Get all list IDs and get the tasks
var listIDs [ ] int64
for _ , l := range lists {
listIDs = append ( listIDs , l . ID )
}
2019-12-07 15:30:51 +01:00
// Since xorm does not use placeholders for order by, it is possible to expose this with sql injection if we're directly
// passing user input to the db.
// As a workaround to prevent this, we check for valid column names here prior to passing it to the db.
2019-07-16 16:15:40 +02:00
var orderby string
2019-12-07 15:30:51 +01:00
for i , param := range opts . sortby {
// Validate the params
if err := param . validate ( ) ; err != nil {
return nil , 0 , 0 , err
}
orderby += param . sortBy . String ( ) + " " + param . orderBy . String ( )
if ( i + 1 ) < len ( opts . sortby ) {
orderby += ", "
}
2019-07-16 16:15:40 +02:00
}
2019-10-20 17:55:54 +02:00
taskMap = make ( map [ int64 ] * Task )
2019-07-16 16:15:40 +02:00
// Then return all tasks for that lists
2019-08-31 22:56:41 +02:00
if opts . startDate . Unix ( ) != 0 || opts . endDate . Unix ( ) != 0 {
2019-07-16 16:15:40 +02:00
startDateUnix := time . Now ( ) . Unix ( )
2019-08-31 22:56:41 +02:00
if opts . startDate . Unix ( ) != 0 {
startDateUnix = opts . startDate . Unix ( )
2019-07-16 16:15:40 +02:00
}
endDateUnix := time . Now ( ) . Unix ( )
2019-08-31 22:56:41 +02:00
if opts . endDate . Unix ( ) != 0 {
endDateUnix = opts . endDate . Unix ( )
2019-07-16 16:15:40 +02:00
}
2019-10-23 23:11:40 +02:00
err := x . In ( "list_id" , listIDs ) .
2019-08-31 22:56:41 +02:00
Where ( "text LIKE ?" , "%" + opts . search + "%" ) .
2019-07-16 16:15:40 +02:00
And ( "((due_date_unix BETWEEN ? AND ?) OR " +
"(start_date_unix BETWEEN ? and ?) OR " +
"(end_date_unix BETWEEN ? and ?))" , startDateUnix , endDateUnix , startDateUnix , endDateUnix , startDateUnix , endDateUnix ) .
OrderBy ( orderby ) .
2019-10-23 23:11:40 +02:00
Limit ( getLimitFromPageIndex ( opts . page , opts . perPage ) ) .
Find ( & taskMap )
if err != nil {
return nil , 0 , 0 , err
}
totalItems , err = x . In ( "list_id" , listIDs ) .
Where ( "text LIKE ?" , "%" + opts . search + "%" ) .
And ( "((due_date_unix BETWEEN ? AND ?) OR " +
"(start_date_unix BETWEEN ? and ?) OR " +
"(end_date_unix BETWEEN ? and ?))" , startDateUnix , endDateUnix , startDateUnix , endDateUnix , startDateUnix , endDateUnix ) .
Count ( & Task { } )
if err != nil {
return nil , 0 , 0 , err
2019-07-16 16:15:40 +02:00
}
} else {
2019-10-23 23:11:40 +02:00
err := x . In ( "list_id" , listIDs ) .
2019-08-31 22:56:41 +02:00
Where ( "text LIKE ?" , "%" + opts . search + "%" ) .
2019-07-16 16:15:40 +02:00
OrderBy ( orderby ) .
2019-10-23 23:11:40 +02:00
Limit ( getLimitFromPageIndex ( opts . page , opts . perPage ) ) .
Find ( & taskMap )
if err != nil {
return nil , 0 , 0 , err
}
totalItems , err = x . In ( "list_id" , listIDs ) .
Where ( "text LIKE ?" , "%" + opts . search + "%" ) .
Count ( & Task { } )
if err != nil {
return nil , 0 , 0 , err
2019-07-16 16:15:40 +02:00
}
}
2019-10-23 23:11:40 +02:00
return taskMap , len ( taskMap ) , totalItems , nil
2019-10-20 17:55:54 +02:00
}
2019-10-23 23:11:40 +02:00
func getTasksForLists ( lists [ ] * List , opts * taskOptions ) ( tasks [ ] * Task , resultCount int , totalItems int64 , err error ) {
2019-10-20 17:55:54 +02:00
2019-10-23 23:11:40 +02:00
taskMap , resultCount , totalItems , err := getRawTasksForLists ( lists , opts )
2019-10-20 17:55:54 +02:00
if err != nil {
2019-10-23 23:11:40 +02:00
return nil , 0 , 0 , err
2019-10-20 17:55:54 +02:00
}
2019-07-16 16:15:40 +02:00
2019-08-31 22:56:41 +02:00
tasks , err = addMoreInfoToTasks ( taskMap )
2019-07-16 16:15:40 +02:00
if err != nil {
2019-10-23 23:11:40 +02:00
return nil , 0 , 0 , err
2019-07-16 16:15:40 +02:00
}
2019-12-07 15:30:51 +01:00
// Because the list is fully unsorted (since we're dealing with maps)
2019-07-16 16:15:40 +02:00
// we have to manually sort the tasks again here.
2019-08-31 22:56:41 +02:00
sortTasks ( tasks , opts . sortby )
2019-07-16 16:15:40 +02:00
2019-10-23 23:11:40 +02:00
return tasks , resultCount , totalItems , err
2019-07-16 16:15:40 +02:00
}
2019-05-22 19:48:48 +02:00
// GetTaskByIDSimple returns a raw task without extra data by the task ID
2019-08-14 22:19:04 +02:00
func GetTaskByIDSimple ( taskID int64 ) ( task Task , err error ) {
2018-12-31 02:18:41 +01:00
if taskID < 1 {
2019-08-14 22:19:04 +02:00
return Task { } , ErrTaskDoesNotExist { taskID }
2018-09-13 20:07:11 +02:00
}
2019-08-14 22:19:04 +02:00
return GetTaskSimple ( & Task { ID : taskID } )
2019-05-22 19:48:48 +02:00
}
// GetTaskSimple returns a raw task without extra data
2019-08-14 22:19:04 +02:00
func GetTaskSimple ( t * Task ) ( task Task , err error ) {
2019-05-22 19:48:48 +02:00
task = * t
exists , err := x . Get ( & task )
2018-06-12 18:35:36 +02:00
if err != nil {
2019-08-14 22:19:04 +02:00
return Task { } , err
2018-06-12 18:35:36 +02:00
}
if ! exists {
2019-08-14 22:19:04 +02:00
return Task { } , ErrTaskDoesNotExist { t . ID }
2018-12-31 02:18:41 +01:00
}
return
}
2018-12-28 22:49:46 +01:00
// GetTasksByIDs returns all tasks for a list of ids
func ( bt * BulkTask ) GetTasksByIDs ( ) ( err error ) {
for _ , id := range bt . IDs {
if id < 1 {
2019-08-14 22:19:04 +02:00
return ErrTaskDoesNotExist { id }
2018-12-28 22:49:46 +01:00
}
}
2019-08-14 22:19:04 +02:00
taskMap := make ( map [ int64 ] * Task , len ( bt . Tasks ) )
2019-05-22 19:48:48 +02:00
err = x . In ( "id" , bt . IDs ) . Find ( & taskMap )
2018-12-28 22:49:46 +01:00
if err != nil {
2019-05-22 19:48:48 +02:00
return
2018-12-28 22:49:46 +01:00
}
2019-05-22 19:48:48 +02:00
bt . Tasks , err = addMoreInfoToTasks ( taskMap )
return
}
// GetTasksByUIDs gets all tasks from a bunch of uids
2019-08-14 22:19:04 +02:00
func GetTasksByUIDs ( uids [ ] string ) ( tasks [ ] * Task , err error ) {
taskMap := make ( map [ int64 ] * Task )
2019-05-22 19:48:48 +02:00
err = x . In ( "uid" , uids ) . Find ( & taskMap )
if err != nil {
return
2018-12-28 22:49:46 +01:00
}
2019-05-22 19:48:48 +02:00
tasks , err = addMoreInfoToTasks ( taskMap )
return
}
2019-11-03 23:08:26 +01:00
func getRemindersForTasks ( taskIDs [ ] int64 ) ( reminders [ ] * TaskReminder , err error ) {
reminders = [ ] * TaskReminder { }
2020-02-08 13:48:49 +01:00
err = x . In ( "task_id" , taskIDs ) . Find ( & reminders )
2019-11-03 23:08:26 +01:00
return
}
2019-05-22 19:48:48 +02:00
// This function takes a map with pointers and returns a slice with pointers to tasks
// It adds more stuff like assignees/labels/etc to a bunch of tasks
2019-08-14 22:19:04 +02:00
func addMoreInfoToTasks ( taskMap map [ int64 ] * Task ) ( tasks [ ] * Task , err error ) {
2019-05-22 19:48:48 +02:00
// No need to iterate over users and stuff if the list doesn't has tasks
if len ( taskMap ) == 0 {
return
2018-12-28 22:49:46 +01:00
}
2019-05-22 19:48:48 +02:00
// Get all users & task ids and put them into the array
var userIDs [ ] int64
var taskIDs [ ] int64
2019-12-07 23:28:45 +01:00
var listIDs [ ] int64
2019-05-22 19:48:48 +02:00
for _ , i := range taskMap {
taskIDs = append ( taskIDs , i . ID )
userIDs = append ( userIDs , i . CreatedByID )
2019-12-07 23:28:45 +01:00
listIDs = append ( listIDs , i . ListID )
2019-05-22 19:48:48 +02:00
}
// Get all assignees
taskAssignees , err := getRawTaskAssigneesForTasks ( taskIDs )
2018-12-28 22:49:46 +01:00
if err != nil {
2019-05-22 19:48:48 +02:00
return
}
// Put the assignees in the task map
for _ , a := range taskAssignees {
if a != nil {
2019-08-14 21:59:31 +02:00
a . Email = "" // Obfuscate the email
2019-05-22 19:48:48 +02:00
taskMap [ a . TaskID ] . Assignees = append ( taskMap [ a . TaskID ] . Assignees , & a . User )
}
2018-12-28 22:49:46 +01:00
}
2019-05-22 19:48:48 +02:00
// Get all labels for all the tasks
2019-10-23 23:11:40 +02:00
labels , _ , _ , err := getLabelsByTaskIDs ( & LabelByTaskIDsOptions {
2019-10-20 17:56:53 +02:00
TaskIDs : taskIDs ,
Page : - 1 ,
} )
2019-05-22 19:48:48 +02:00
if err != nil {
return
}
for _ , l := range labels {
if l != nil {
taskMap [ l . TaskID ] . Labels = append ( taskMap [ l . TaskID ] . Labels , & l . Label )
}
}
2019-10-16 22:52:29 +02:00
// Get task attachments
attachments := [ ] * TaskAttachment { }
err = x .
In ( "task_id" , taskIDs ) .
Find ( & attachments )
if err != nil {
return nil , err
}
fileIDs := [ ] int64 { }
for _ , a := range attachments {
userIDs = append ( userIDs , a . CreatedByID )
fileIDs = append ( fileIDs , a . FileID )
}
// Get all files
fs := make ( map [ int64 ] * files . File )
err = x . In ( "id" , fileIDs ) . Find ( & fs )
if err != nil {
return
}
2019-05-22 19:48:48 +02:00
// Get all users of a task
// aka the ones who created a task
2020-01-26 18:08:06 +01:00
users := make ( map [ int64 ] * user . User )
2019-05-22 19:48:48 +02:00
err = x . In ( "id" , userIDs ) . Find ( & users )
if err != nil {
return
}
2019-08-14 21:59:31 +02:00
// Obfuscate all user emails
for _ , u := range users {
u . Email = ""
}
2019-10-16 22:52:29 +02:00
// Put the users and files in task attachments
for _ , a := range attachments {
a . CreatedBy = users [ a . CreatedByID ]
a . File = fs [ a . FileID ]
taskMap [ a . TaskID ] . Attachments = append ( taskMap [ a . TaskID ] . Attachments , a )
}
2019-05-25 09:33:57 +02:00
// Get all reminders and put them in a map to have it easier later
2019-11-03 23:08:26 +01:00
reminders , err := getRemindersForTasks ( taskIDs )
2019-05-25 09:33:57 +02:00
if err != nil {
return
}
2020-02-08 13:48:49 +01:00
taskRemindersUnix := make ( map [ int64 ] [ ] timeutil . TimeStamp )
2019-05-25 09:33:57 +02:00
for _ , r := range reminders {
2020-02-08 13:48:49 +01:00
taskRemindersUnix [ r . TaskID ] = append ( taskRemindersUnix [ r . TaskID ] , r . Reminder )
2019-05-25 09:33:57 +02:00
}
2019-12-07 23:28:45 +01:00
// Get all identifiers
lists := make ( map [ int64 ] * List , len ( listIDs ) )
err = x . In ( "id" , listIDs ) . Find ( & lists )
if err != nil {
return
}
2019-05-22 19:48:48 +02:00
// Add all user objects to the appropriate tasks
for _ , task := range taskMap {
// Make created by user objects
2019-09-25 20:44:41 +02:00
task . CreatedBy = users [ task . CreatedByID ]
2019-05-22 19:48:48 +02:00
2019-05-25 09:33:57 +02:00
// Add the reminders
2020-02-08 13:48:49 +01:00
task . Reminders = taskRemindersUnix [ task . ID ]
2019-05-25 09:33:57 +02:00
2019-09-25 20:44:41 +02:00
// Prepare the subtasks
task . RelatedTasks = make ( RelatedTaskMap )
2019-12-07 23:28:45 +01:00
// Build the task identifier from the list identifier and task index
task . Identifier = lists [ task . ListID ] . Identifier + "-" + strconv . FormatInt ( task . Index , 10 )
2019-09-25 20:44:41 +02:00
}
// Get all related tasks
relatedTasks := [ ] * TaskRelation { }
err = x . In ( "task_id" , taskIDs ) . Find ( & relatedTasks )
if err != nil {
return
}
// Collect all related task IDs, so we can get all related task headers in one go
var relatedTaskIDs [ ] int64
for _ , rt := range relatedTasks {
relatedTaskIDs = append ( relatedTaskIDs , rt . OtherTaskID )
}
fullRelatedTasks := make ( map [ int64 ] * Task )
err = x . In ( "id" , relatedTaskIDs ) . Find ( & fullRelatedTasks )
if err != nil {
return
}
// NOTE: while it certainly be possible to run this function on fullRelatedTasks again, we don't do this for performance reasons.
// Go through all task relations and put them into the task objects
for _ , rt := range relatedTasks {
taskMap [ rt . TaskID ] . RelatedTasks [ rt . RelationKind ] = append ( taskMap [ rt . TaskID ] . RelatedTasks [ rt . RelationKind ] , fullRelatedTasks [ rt . OtherTaskID ] )
2018-12-28 22:49:46 +01:00
}
2019-05-22 19:48:48 +02:00
// make a complete slice from the map
2019-08-14 22:19:04 +02:00
tasks = [ ] * Task { }
2019-05-22 19:48:48 +02:00
for _ , t := range taskMap {
tasks = append ( tasks , t )
}
// Sort the output. In Go, contents on a map are put on that map in no particular order.
// Because of this, tasks are not sorted anymore in the output, this leads to confiusion.
// To avoid all this, we need to sort the slice afterwards
sort . Slice ( tasks , func ( i , j int ) bool {
return tasks [ i ] . ID < tasks [ j ] . ID
} )
2018-12-28 22:49:46 +01:00
return
}
2019-07-16 16:15:40 +02:00
// Create is the implementation to create a list task
// @Summary Create a task
// @Description Inserts a task into a list.
// @tags task
// @Accept json
// @Produce json
// @Security JWTKeyAuth
// @Param id path int true "List ID"
2019-08-14 22:19:04 +02:00
// @Param task body models.Task true "The task object"
// @Success 200 {object} models.Task "The created task object."
2019-07-16 16:15:40 +02:00
// @Failure 400 {object} code.vikunja.io/web.HTTPError "Invalid task object provided."
// @Failure 403 {object} code.vikunja.io/web.HTTPError "The user does not have access to the list"
// @Failure 500 {object} models.Message "Internal error"
// @Router /lists/{id} [put]
2019-08-14 22:19:04 +02:00
func ( t * Task ) Create ( a web . Auth ) ( err error ) {
2019-07-16 16:15:40 +02:00
t . ID = 0
// Check if we have at least a text
if t . Text == "" {
2019-08-14 22:19:04 +02:00
return ErrTaskCannotBeEmpty { }
2019-07-16 16:15:40 +02:00
}
// Check if the list exists
l := & List { ID : t . ListID }
if err = l . GetSimpleByID ( ) ; err != nil {
return
}
2020-01-26 18:08:06 +01:00
u , err := user . GetUserByID ( a . GetID ( ) )
2019-07-16 16:15:40 +02:00
if err != nil {
return err
}
// Generate a uuid if we don't already have one
if t . UID == "" {
t . UID = utils . MakeRandomString ( 40 )
}
2019-12-08 16:10:34 +01:00
// Get the index for this task
latestTask := & Task { }
_ , err = x . Where ( "list_id = ?" , t . ListID ) . OrderBy ( "id desc" ) . Get ( latestTask )
if err != nil {
return err
}
t . Index = latestTask . Index + 1
2019-07-16 16:15:40 +02:00
t . CreatedByID = u . ID
t . CreatedBy = u
if _ , err = x . Insert ( t ) ; err != nil {
return err
}
// Update the assignees
if err := t . updateTaskAssignees ( t . Assignees ) ; err != nil {
return err
}
// Update the reminders
2020-02-08 13:48:49 +01:00
if err := t . updateReminders ( t . Reminders ) ; err != nil {
2019-07-16 16:15:40 +02:00
return err
}
metrics . UpdateCount ( 1 , metrics . TaskCountKey )
err = updateListLastUpdated ( & List { ID : t . ListID } )
return
}
// Update updates a list task
// @Summary Update a task
// @Description Updates a task. This includes marking it as done. Assignees you pass will be updated, see their individual endpoints for more details on how this is done. To update labels, see the description of the endpoint.
// @tags task
// @Accept json
// @Produce json
// @Security JWTKeyAuth
// @Param id path int true "Task ID"
2019-08-14 22:19:04 +02:00
// @Param task body models.Task true "The task object"
// @Success 200 {object} models.Task "The updated task object."
2019-07-16 16:15:40 +02:00
// @Failure 400 {object} code.vikunja.io/web.HTTPError "Invalid task object provided."
// @Failure 403 {object} code.vikunja.io/web.HTTPError "The user does not have access to the task (aka its list)"
// @Failure 500 {object} models.Message "Internal error"
// @Router /tasks/{id} [post]
2019-08-14 22:19:04 +02:00
func ( t * Task ) Update ( ) ( err error ) {
2020-02-26 22:09:45 +01:00
// Check if the task exists and get the old values
2019-11-02 21:33:18 +01:00
ot , err := GetTaskByIDSimple ( t . ID )
2019-07-16 16:15:40 +02:00
if err != nil {
return
}
2020-02-26 22:09:45 +01:00
// Get the reminders
reminders , err := getRemindersForTasks ( [ ] int64 { t . ID } )
if err != nil {
return
}
ot . Reminders = make ( [ ] timeutil . TimeStamp , len ( reminders ) )
for i , r := range reminders {
ot . Reminders [ i ] = r . Reminder
}
2019-07-16 16:15:40 +02:00
// When a repeating task is marked as done, we update all deadlines and reminders and set it as undone
updateDone ( & ot , t )
// Update the assignees
if err := ot . updateTaskAssignees ( t . Assignees ) ; err != nil {
return err
}
// Update the reminders
2020-02-08 13:48:49 +01:00
if err := ot . updateReminders ( t . Reminders ) ; err != nil {
2019-07-16 16:15:40 +02:00
return err
}
// Update the labels
//
// Maybe FIXME:
// I've disabled this for now, because it requires significant changes in the way we do updates (using the
// Update() function. We need a user object in updateTaskLabels to check if the user has the right to see
// the label it is currently adding. To do this, we'll need to update the webhandler to let it pass the current
// user object (like it's already the case with the create method). However when we change it, that'll break
// a lot of existing code which we'll then need to refactor.
// This is why.
//
//if err := ot.updateTaskLabels(t.Labels); err != nil {
// return err
//}
// set the labels to ot.Labels because our updateTaskLabels function puts the full label objects in it pretty nicely
// We also set this here to prevent it being overwritten later on.
//t.Labels = ot.Labels
// For whatever reason, xorm dont detect if done is updated, so we need to update this every time by hand
2020-02-26 22:09:45 +01:00
// Which is why we merge the actual task struct with the one we got from the db
2019-07-16 16:15:40 +02:00
// The user struct overrides values in the actual one.
if err := mergo . Merge ( & ot , t , mergo . WithOverride ) ; err != nil {
return err
}
//////
// Mergo does ignore nil values. Because of that, we need to check all parameters and set the updated to
// nil/their nil value in the struct which is inserted.
////
// Done
if ! t . Done {
ot . Done = false
}
// Priority
if t . Priority == 0 {
ot . Priority = 0
}
// Description
if t . Description == "" {
ot . Description = ""
}
// Due date
2020-02-08 13:48:49 +01:00
if t . DueDate == 0 {
ot . DueDate = 0
2019-07-16 16:15:40 +02:00
}
// Repeat after
if t . RepeatAfter == 0 {
ot . RepeatAfter = 0
}
// Start date
2020-02-08 13:48:49 +01:00
if t . StartDate == 0 {
ot . StartDate = 0
2019-07-16 16:15:40 +02:00
}
// End date
2020-02-08 13:48:49 +01:00
if t . EndDate == 0 {
ot . EndDate = 0
2019-07-16 16:15:40 +02:00
}
// Color
if t . HexColor == "" {
ot . HexColor = ""
}
2019-09-21 12:52:10 +02:00
// Percent DOnw
if t . PercentDone == 0 {
ot . PercentDone = 0
}
2019-07-16 16:15:40 +02:00
_ , err = x . ID ( t . ID ) .
Cols ( "text" ,
"description" ,
"done" ,
"due_date_unix" ,
"repeat_after" ,
"priority" ,
"start_date_unix" ,
"end_date_unix" ,
"hex_color" ,
2019-09-21 12:52:10 +02:00
"done_at_unix" ,
"percent_done" ) .
2019-07-16 16:15:40 +02:00
Update ( ot )
* t = ot
if err != nil {
return err
}
err = updateListLastUpdated ( & List { ID : t . ListID } )
return
}
2020-02-26 22:09:45 +01:00
// This helper function updates the reminders, doneAtUnix, start and end dates of the *old* task
// and saves the new values in the newTask object.
// We make a few assumtions here:
// 1. Everything in oldTask is the truth - we figure out if we update anything at all if oldTask.RepeatAfter has a value > 0
// 2. Because of 1., this functions should not be used to update values other than Done in the same go
2019-08-14 22:19:04 +02:00
func updateDone ( oldTask * Task , newTask * Task ) {
2019-07-16 16:15:40 +02:00
if ! oldTask . Done && newTask . Done && oldTask . RepeatAfter > 0 {
2020-02-26 22:09:45 +01:00
repeatDuration := time . Duration ( oldTask . RepeatAfter ) * time . Second
// assuming we'll merge the new task over the old task
if oldTask . DueDate > 0 {
newTask . DueDate = timeutil . FromTime ( oldTask . DueDate . ToTime ( ) . Add ( repeatDuration ) )
}
newTask . Reminders = oldTask . Reminders
2020-02-08 13:48:49 +01:00
for in , r := range oldTask . Reminders {
2020-02-26 22:09:45 +01:00
newTask . Reminders [ in ] = timeutil . FromTime ( r . ToTime ( ) . Add ( repeatDuration ) )
}
if oldTask . StartDate > 0 {
newTask . StartDate = timeutil . FromTime ( oldTask . StartDate . ToTime ( ) . Add ( repeatDuration ) )
}
if oldTask . EndDate > 0 {
newTask . EndDate = timeutil . FromTime ( oldTask . EndDate . ToTime ( ) . Add ( repeatDuration ) )
2019-07-16 16:15:40 +02:00
}
newTask . Done = false
}
// Update the "done at" timestamp
if ! oldTask . Done && newTask . Done {
2020-02-26 22:09:45 +01:00
newTask . DoneAt = timeutil . FromTime ( time . Now ( ) )
2019-07-16 16:15:40 +02:00
}
// When unmarking a task as done, reset the timestamp
if oldTask . Done && ! newTask . Done {
2020-02-26 22:09:45 +01:00
newTask . DoneAt = 0
2019-07-16 16:15:40 +02:00
}
}
2020-02-26 22:09:45 +01:00
// Creates or deletes all necessary reminders without unneded db operations.
2019-07-16 16:15:40 +02:00
// The parameter is a slice with unix dates which holds the new reminders.
2020-02-08 13:48:49 +01:00
func ( t * Task ) updateReminders ( reminders [ ] timeutil . TimeStamp ) ( err error ) {
2019-07-16 16:15:40 +02:00
2019-11-03 23:08:26 +01:00
// Load the current reminders
taskReminders , err := getRemindersForTasks ( [ ] int64 { t . ID } )
if err != nil {
return err
}
2020-02-08 13:48:49 +01:00
t . Reminders = make ( [ ] timeutil . TimeStamp , 0 , len ( taskReminders ) )
2019-11-03 23:08:26 +01:00
for _ , reminder := range taskReminders {
2020-02-08 13:48:49 +01:00
t . Reminders = append ( t . Reminders , reminder . Reminder )
2019-11-03 23:08:26 +01:00
}
2019-07-16 16:15:40 +02:00
// If we're removing everything, delete all reminders right away
2020-02-08 13:48:49 +01:00
if len ( reminders ) == 0 && len ( t . Reminders ) > 0 {
2019-07-16 16:15:40 +02:00
_ , err = x . Where ( "task_id = ?" , t . ID ) .
Delete ( TaskReminder { } )
2020-02-08 13:48:49 +01:00
t . Reminders = nil
2019-07-16 16:15:40 +02:00
return err
}
// If we didn't change anything (from 0 to zero) don't do anything.
2020-02-08 13:48:49 +01:00
if len ( reminders ) == 0 && len ( t . Reminders ) == 0 {
2019-07-16 16:15:40 +02:00
return nil
}
// Make a hashmap of the new reminders for easier comparison
2020-02-08 13:48:49 +01:00
newReminders := make ( map [ timeutil . TimeStamp ] * TaskReminder , len ( reminders ) )
2019-07-16 16:15:40 +02:00
for _ , newReminder := range reminders {
2020-02-08 13:48:49 +01:00
newReminders [ newReminder ] = & TaskReminder { Reminder : newReminder }
2019-07-16 16:15:40 +02:00
}
// Get old reminders to delete
var found bool
2020-02-08 13:48:49 +01:00
var remindersToDelete [ ] timeutil . TimeStamp
oldReminders := make ( map [ timeutil . TimeStamp ] * TaskReminder , len ( t . Reminders ) )
for _ , oldReminder := range t . Reminders {
2019-07-16 16:15:40 +02:00
found = false
// If a new reminder is already in the list with old reminders
if newReminders [ oldReminder ] != nil {
found = true
}
// Put all reminders which are only on the old list to the trash
if ! found {
remindersToDelete = append ( remindersToDelete , oldReminder )
}
2020-02-08 13:48:49 +01:00
oldReminders [ oldReminder ] = & TaskReminder { Reminder : oldReminder }
2019-07-16 16:15:40 +02:00
}
// Delete all reminders not passed
if len ( remindersToDelete ) > 0 {
_ , err = x . In ( "reminder_unix" , remindersToDelete ) .
And ( "task_id = ?" , t . ID ) .
2019-11-24 16:13:16 +01:00
Delete ( TaskReminder { } )
2019-07-16 16:15:40 +02:00
if err != nil {
return err
}
}
// Loop through our users and add them
for _ , r := range reminders {
// Check if the reminder already exists and only inserts it if not
if oldReminders [ r ] != nil {
// continue outer loop
continue
}
// Add the new reminder
2020-02-08 13:48:49 +01:00
_ , err = x . Insert ( TaskReminder { TaskID : t . ID , Reminder : r } )
2019-07-16 16:15:40 +02:00
if err != nil {
return err
}
}
2020-02-08 13:48:49 +01:00
t . Reminders = reminders
2019-07-16 16:15:40 +02:00
if len ( reminders ) == 0 {
2020-02-08 13:48:49 +01:00
t . Reminders = nil
2019-07-16 16:15:40 +02:00
}
err = updateListLastUpdated ( & List { ID : t . ListID } )
return
}
// Delete implements the delete method for listTask
// @Summary Delete a task
// @Description Deletes a task from a list. This does not mean "mark it done".
// @tags task
// @Produce json
// @Security JWTKeyAuth
// @Param id path int true "Task ID"
// @Success 200 {object} models.Message "The created task object."
// @Failure 400 {object} code.vikunja.io/web.HTTPError "Invalid task ID provided."
// @Failure 403 {object} code.vikunja.io/web.HTTPError "The user does not have access to the list"
// @Failure 500 {object} models.Message "Internal error"
// @Router /tasks/{id} [delete]
2019-08-14 22:19:04 +02:00
func ( t * Task ) Delete ( ) ( err error ) {
2019-07-16 16:15:40 +02:00
2019-08-14 22:19:04 +02:00
if _ , err = x . ID ( t . ID ) . Delete ( Task { } ) ; err != nil {
2019-07-16 16:15:40 +02:00
return err
}
// Delete assignees
2019-08-14 22:19:04 +02:00
if _ , err = x . Where ( "task_id = ?" , t . ID ) . Delete ( TaskAssginee { } ) ; err != nil {
2019-07-16 16:15:40 +02:00
return err
}
metrics . UpdateCount ( - 1 , metrics . TaskCountKey )
err = updateListLastUpdated ( & List { ID : t . ListID } )
return
}
2019-11-02 21:33:18 +01:00
// ReadOne gets one task by its ID
// @Summary Get one task
// @Description Returns one task by its ID
// @tags task
// @Accept json
// @Produce json
// @Param ID path int true "The task ID"
// @Security JWTKeyAuth
// @Success 200 {object} models.Task "The task"
// @Failure 404 {object} models.Message "Task not found"
// @Failure 500 {object} models.Message "Internal error"
2019-12-07 23:28:45 +01:00
// @Router /tasks/{ID} [get]
2019-11-02 21:33:18 +01:00
func ( t * Task ) ReadOne ( ) ( err error ) {
taskMap := make ( map [ int64 ] * Task , 1 )
taskMap [ t . ID ] = & Task { }
* taskMap [ t . ID ] , err = GetTaskByIDSimple ( t . ID )
if err != nil {
return
}
tasks , err := addMoreInfoToTasks ( taskMap )
if err != nil {
return
}
if len ( tasks ) == 0 {
return ErrTaskDoesNotExist { t . ID }
}
* t = * tasks [ 0 ]
return
}