RAVE
Lib.algorithm_runner.algorithm_job Class Reference

Job that supports the wanted priority handling that we want from the PriorityQueue All jobs that has algorithm_id in the arguments will get priority = 0 instead of priority 1 After that, the date and time are compared. More...

Inheritance diagram for Lib.algorithm_runner.algorithm_job:

Public Member Functions

 __init__ (self, func, jobid, algorithm, files, arguments, jobdone=None)
 get_arg_from_arguments (self, arguments, key)
 get_string_from_arguments (self, arguments, key, defaultvalue)
 func (self)
 jobid (self)
 algorithm (self)
 files (self)
 arguments (self)
 date (self)
 time (self)
 priority (self)
 algorithmid (self)
 setJobid (self, jobid)
 setArguments (self, arguments)
 setFiles (self, files)
 mergeable (self)
 jobdone (self)
 addedtime (self)
 __eq__ (self, other)
 __ne__ (self, other)
 __gt__ (self, other)
 __lt__ (self, other)
 __ge__ (self, other)
 __le__ (self, other)
 __str__ (self)
 __repr__ (self)

Protected Attributes

 _func = func
 _jobid = jobid
 _algorithm = algorithm
 _files = files
 _arguments = arguments
int _priority = 1
int _algorithmid = -1
 _jobdone = jobdone
 _date = self.get_string_from_arguments(arguments, "--date", None)
 _time = self.get_string_from_arguments(arguments, "--time", None)
str _mergeable = "--merge=true" in arguments
 _addedtime = time.time()

Detailed Description

Job that supports the wanted priority handling that we want from the PriorityQueue All jobs that has algorithm_id in the arguments will get priority = 0 instead of priority 1 After that, the date and time are compared.

Date & Time that are newer than now will always get higher priority that old files.


The documentation for this class was generated from the following file: