def txn():
level = root_task.hierarchy_level() + 1 if root_task else 0
query = TaskIndex.all(keys_only=True).\
ancestor(Domain.key_from_name(domain_identifier)).\
filter('assignees =', user.identifier()).\
filter('level =', level)
if root_task:
query.filter('hierarchy =', root_task.identifier())
fetched = query.fetch(limit)
tasks = Task.get([key.parent() for key in fetched])
return tasks
def txn():
level = root_task.hierarchy_level() + 1 if root_task else 0
query = TaskIndex.all(keys_only=True).\
ancestor(Domain.key_from_name(domain_identifier)).\
filter('assignees =', user.identifier()).\
filter('level =', level)
if root_task:
query.filter('hierarchy =', root_task.identifier())
fetched = query.fetch(limit)
tasks = Task.get([key.parent() for key in fetched])
return tasks
def get_all_subtasks(domain, task, limit=50, depth_limit=None):
"""
Returns a list of all subtasks of the given task, in the order
as a pre-order traversal through the task hierarchy.
This function will perform one query for each level of the subtask
hierarchy.
Args:
domain: The domain identifier string.
task: An instance of the Task model.
limit: The maximum number of subtasks to return.
depth_limit: The maximum depth of subtasks in the task
hierarchy.
Returns:
A list with all subtasks of the given task.
Raises:
ValueError: The depth_limit or limit are not positive integers
"""
if not depth_limit:
# ListProperties cannot contain more than 5000 elements anyway
depth_limit = 5000
if depth_limit < 0 or limit < 0:
raise ValueError("Invalid limits")
task_level = task.level
tasks = []
for depth in range(depth_limit):
query = TaskIndex.all(keys_only=True).\
ancestor(Domain.key_from_name(domain)).\
filter('level = ', task_level + depth + 1).\
filter('hierarchy = ', task.identifier())
fetched = query.fetch(limit)
tasks.extend(Task.get([key.parent() for key in fetched]))
limit = limit - len(fetched)
if not fetched or limit < 1:
break # stop
# Sort the tasks on completion status and then on time, as this is
# not possible in the query.
def task_cmp(t1, t2):
if t1.completed != t2.completed:
return cmp(t1.completed, t2.completed)
return -cmp(t1.time, t2.time)
tasks.sort(cmp=task_cmp)
return _group_tasks(tasks)
def get_all_subtasks(domain, task, limit=50, depth_limit=None):
"""
Returns a list of all subtasks of the given task, in the order
as a pre-order traversal through the task hierarchy.
This function will perform one query for each level of the subtask
hierarchy.
Args:
domain: The domain identifier string.
task: An instance of the Task model.
limit: The maximum number of subtasks to return.
depth_limit: The maximum depth of subtasks in the task
hierarchy.
Returns:
A list with all subtasks of the given task.
Raises:
ValueError: The depth_limit or limit are not positive integers
"""
if not depth_limit:
# ListProperties cannot contain more than 5000 elements anyway
depth_limit = 5000
if depth_limit < 0 or limit < 0:
raise ValueError("Invalid limits")
task_level = task.level
tasks = []
for depth in range(depth_limit):
query = TaskIndex.all(keys_only=True).\
ancestor(Domain.key_from_name(domain)).\
filter('level = ', task_level + depth + 1).\
filter('hierarchy = ', task.identifier())
fetched = query.fetch(limit)
tasks.extend(Task.get([key.parent() for key in fetched]))
limit = limit - len(fetched)
if not fetched or limit < 1:
break # stop
# Sort the tasks on completion status and then on time, as this is
# not possible in the query.
def task_cmp(t1, t2):
if t1.completed != t2.completed:
return cmp(t1.completed, t2.completed)
return -cmp(t1.time, t2.time)
tasks.sort(cmp=task_cmp)
return _group_tasks(tasks)