2010-01-12 12:45:02 +00:00
# -*- coding: utf-8 -*-
##############################################################################
#
# OpenERP, Open Source Management Solution
# Copyright (C) 2004-2009 Tiny SPRL (<http://tiny.be>).
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU Affero General Public License as
# published by the Free Software Foundation, either version 3 of the
# License, or (at your option) any later version.
#
# 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 Affero General Public License for more details.
#
# You should have received a copy of the GNU Affero General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
##############################################################################
from lxml import etree
2010-02-18 10:07:31 +00:00
import mx . DateTime
2010-01-12 12:45:02 +00:00
import time
from tools . translate import _
from osv import fields , osv
2010-02-18 10:07:31 +00:00
2010-01-12 12:45:02 +00:00
class project_phase ( osv . osv ) :
_name = " project.phase "
_description = " Project Phase "
2010-02-18 10:07:31 +00:00
2010-01-12 12:45:02 +00:00
def _check_recursion ( self , cr , uid , ids ) :
2010-01-18 13:44:53 +00:00
obj_self = self . browse ( cr , uid , ids [ 0 ] )
prev_ids = obj_self . previous_phase_ids
next_ids = obj_self . next_phase_ids
#it should nither be in prev_ids nor in next_ids
if ( obj_self in prev_ids ) or ( obj_self in next_ids ) :
return False
ids = [ id for id in prev_ids if id in next_ids ]
2010-02-10 06:14:22 +00:00
2010-01-18 13:44:53 +00:00
#both prev_ids and next_ids must be unique
if ids :
return False
#unrelated project
2010-02-10 06:14:22 +00:00
2010-01-18 13:44:53 +00:00
prev_ids = [ rec . id for rec in prev_ids ]
next_ids = [ rec . id for rec in next_ids ]
#iter prev_ids
while prev_ids :
2010-02-26 11:18:14 +00:00
cr . execute ( ' select distinct prv_phase_id from project_phase_rel where next_phase_id in ( ' + ' , ' . join ( map ( str , prev_ids ) ) + ' ) ' )
2010-01-18 13:44:53 +00:00
prv_phase_ids = filter ( None , map ( lambda x : x [ 0 ] , cr . fetchall ( ) ) )
if obj_self . id in prv_phase_ids :
return False
ids = [ id for id in prv_phase_ids if id in next_ids ]
if ids :
return False
prev_ids = prv_phase_ids
2010-02-10 06:14:22 +00:00
2010-01-18 13:44:53 +00:00
#iter next_ids
while next_ids :
2010-02-26 11:18:14 +00:00
cr . execute ( ' select distinct next_phase_id from project_phase_rel where prv_phase_id in ( ' + ' , ' . join ( map ( str , next_ids ) ) + ' ) ' )
2010-01-18 13:44:53 +00:00
next_phase_ids = filter ( None , map ( lambda x : x [ 0 ] , cr . fetchall ( ) ) )
if obj_self . id in next_phase_ids :
return False
ids = [ id for id in next_phase_ids if id in prev_ids ]
if ids :
return False
next_ids = next_phase_ids
return True
2010-01-12 12:45:02 +00:00
2010-02-26 11:18:14 +00:00
def _check_dates ( self , cr , uid , ids ) :
phase = self . read ( cr , uid , ids [ 0 ] , [ ' date_start ' , ' date_end ' ] )
if phase [ ' date_start ' ] and phase [ ' date_end ' ] :
if phase [ ' date_start ' ] > phase [ ' date_end ' ] :
return False
return True
2010-02-26 14:00:28 +00:00
def _check_constraint_start ( self , cr , uid , ids ) :
phase = self . read ( cr , uid , ids [ 0 ] , [ ' date_start ' , ' constraint_date_start ' ] )
if phase [ ' date_start ' ] and phase [ ' constraint_date_start ' ] :
if phase [ ' date_start ' ] < phase [ ' constraint_date_start ' ] :
return False
return True
def _check_constraint_end ( self , cr , uid , ids ) :
phase = self . read ( cr , uid , ids [ 0 ] , [ ' date_end ' , ' constraint_date_end ' ] )
if phase [ ' date_end ' ] and phase [ ' constraint_date_end ' ] :
if phase [ ' date_end ' ] > phase [ ' constraint_date_end ' ] :
return False
return True
2010-02-18 10:07:31 +00:00
2010-01-12 12:45:02 +00:00
_columns = {
' name ' : fields . char ( " Phase Name " , size = 64 , required = True ) ,
' date_start ' : fields . datetime ( ' Starting Date ' ) ,
' date_end ' : fields . datetime ( ' End Date ' ) ,
' constraint_date_start ' : fields . datetime ( ' Constraint Starting Date ' ) ,
' constraint_date_end ' : fields . datetime ( ' Constraint End Date ' ) ,
' project_id ' : fields . many2one ( ' project.project ' , ' Project ' , required = True ) ,
2010-02-25 06:01:27 +00:00
' next_phase_ids ' : fields . many2many ( ' project.phase ' , ' project_phase_rel ' , ' prv_phase_id ' , ' next_phase_id ' , ' Next Phases ' ) ,
' previous_phase_ids ' : fields . many2many ( ' project.phase ' , ' project_phase_rel ' , ' next_phase_id ' , ' prv_phase_id ' , ' Previous Phases ' ) ,
' sequence ' : fields . integer ( ' Sequence ' , help = " Gives the sequence order when displaying a list of phases. " ) ,
' duration ' : fields . float ( ' Duration ' , required = True ) ,
' product_uom ' : fields . many2one ( ' product.uom ' , ' Duration UoM ' , required = True , help = " UoM (Unit of Measure) is the unit of measurement for Duration " ) ,
2010-01-12 12:45:02 +00:00
' task_ids ' : fields . one2many ( ' project.task ' , ' phase_id ' , " Project Tasks " ) ,
' resource_ids ' : fields . one2many ( ' project.resource.allocation ' , ' phase_id ' , " Project Resources " ) ,
2010-02-25 06:01:27 +00:00
' responsible_id ' : fields . many2one ( ' res.users ' , ' Responsible ' ) ,
' state ' : fields . selection ( [ ( ' draft ' , ' Draft ' ) , ( ' open ' , ' In Progress ' ) , ( ' pending ' , ' Pending ' ) , ( ' cancelled ' , ' Cancelled ' ) , ( ' done ' , ' Done ' ) ] , ' State ' , readonly = True , required = True ,
help = ' If the phase is created the state \' Draft \' . \n If the phase is started, the state becomes \' In Progress \' . \n If review is needed the phase is in \' Pending \' state. \
\n If the phase is over , the states is set to \' Done \' . ' )
2010-01-12 12:45:02 +00:00
}
_defaults = {
2010-02-25 06:01:27 +00:00
' responsible_id ' : lambda obj , cr , uid , context : uid ,
2010-01-12 12:45:02 +00:00
' date_start ' : lambda * a : time . strftime ( ' % Y- % m- %d ' ) ,
2010-02-25 06:01:27 +00:00
' state ' : lambda * a : ' draft ' ,
' sequence ' : lambda * a : 10 ,
2010-01-12 12:45:02 +00:00
}
_order = " name "
2010-02-26 11:18:14 +00:00
_constraints = [
( _check_recursion , ' Error ! Loops In Phases Not Allowed ' , [ ' next_phase_ids ' , ' previous_phase_ids ' ] ) ,
2010-02-26 14:00:28 +00:00
( _check_dates , ' Error! Phase start-date must be lower then Phase end-date. ' , [ ' date_start ' , ' date_end ' ] ) ,
( _check_constraint_start , ' Error! Phase must start-after Constraint Start Date. ' , [ ' date_start ' , ' constraint_date_start ' ] ) ,
( _check_constraint_end , ' Error! Phase must end-before Constraint End Date. ' , [ ' date_end ' , ' constraint_date_end ' ] ) ,
2010-02-26 11:18:14 +00:00
]
2010-03-02 13:27:02 +00:00
def onchange_project ( self , cr , uid , ids , project ) :
2010-02-26 11:18:14 +00:00
result = { }
if project :
project_pool = self . pool . get ( ' project.project ' )
2010-03-02 13:27:02 +00:00
project_id = project_pool . browse ( cr , uid , project )
2010-02-26 11:18:14 +00:00
if project_id . date_start :
2010-03-02 13:27:02 +00:00
result [ ' date_start ' ] = mx . DateTime . strptime ( project_id . date_start , " % Y- % m- %d " ) . strftime ( ' % Y- % m- %d % H: % M: % S ' )
return { ' value ' : result }
return { ' value ' : { ' date_start ' : [ ] } }
2010-02-26 11:18:14 +00:00
2010-03-02 13:27:02 +00:00
def constraint_date_start ( self , cr , uid , phase , date_end , context = None ) :
2010-02-26 11:18:14 +00:00
# Recursive call for all previous phases if change in date_start < older time
resource_cal_pool = self . pool . get ( ' resource.calendar ' )
uom_pool = self . pool . get ( ' product.uom ' )
resource_pool = self . pool . get ( ' resource.resource ' )
calendar_id = phase . project_id . resource_calendar_id . id
2010-03-02 13:27:02 +00:00
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , phase . responsible_id . id ) ] )
if resource_id :
calendar_id = resource_pool . browse ( cr , uid , resource_id [ 0 ] ) . calendar_id . id
default_uom_id = uom_pool . search ( cr , uid , [ ( ' name ' , ' = ' , ' Hour ' ) ] ) [ 0 ]
avg_hours = uom_pool . _compute_qty ( cr , uid , phase . product_uom . id , phase . duration , default_uom_id )
work_time = resource_cal_pool . interval_min_get ( cr , uid , calendar_id or False , date_end , avg_hours or 0.0 , resource_id or False )
2010-02-26 11:18:14 +00:00
dt_start = work_time [ 0 ] [ 0 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
2010-03-02 13:27:02 +00:00
self . write ( cr , uid , [ phase . id ] , { ' date_start ' : dt_start , ' date_end ' : date_end . strftime ( ' % Y- % m- %d % H: % M: % S ' ) } )
2010-02-26 11:18:14 +00:00
2010-03-02 13:27:02 +00:00
def constraint_date_end ( self , cr , uid , phase , date_start , context = None ) :
2010-02-26 11:18:14 +00:00
# Recursive call for all next phases if change in date_end > older time
resource_cal_pool = self . pool . get ( ' resource.calendar ' )
uom_pool = self . pool . get ( ' product.uom ' )
resource_pool = self . pool . get ( ' resource.resource ' )
calendar_id = phase . project_id . resource_calendar_id . id
2010-03-02 13:27:02 +00:00
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , phase . responsible_id . id ) ] )
if resource_id :
calendar_id = resource_pool . browse ( cr , uid , resource_id [ 0 ] ) . calendar_id . id
default_uom_id = uom_pool . search ( cr , uid , [ ( ' name ' , ' = ' , ' Hour ' ) ] ) [ 0 ]
avg_hours = uom_pool . _compute_qty ( cr , uid , phase . product_uom . id , phase . duration , default_uom_id )
work_time = resource_cal_pool . interval_get ( cr , uid , calendar_id or False , date_start , avg_hours or 0.0 , resource_id or False )
2010-02-26 11:18:14 +00:00
dt_end = work_time [ - 1 ] [ 1 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
2010-03-02 13:27:02 +00:00
self . write ( cr , uid , [ phase . id ] , { ' date_start ' : date_start . strftime ( ' % Y- % m- %d % H: % M: % S ' ) , ' date_end ' : dt_end } )
2010-02-26 11:18:14 +00:00
2010-03-02 13:27:02 +00:00
def write ( self , cr , uid , ids , vals , context = None ) :
2010-02-26 11:18:14 +00:00
if not context :
context = { }
if context . get ( ' scheduler ' , False ) :
return super ( project_phase , self ) . write ( cr , uid , ids , vals , context = context )
# if the phase is performed by a resource then its calendar and efficiency also taken
# otherwise the project's working calendar considered
2010-03-02 13:27:02 +00:00
phase = self . browse ( cr , uid , ids [ 0 ] )
2010-02-26 11:18:14 +00:00
resource_cal_pool = self . pool . get ( ' resource.calendar ' )
resource_pool = self . pool . get ( ' resource.resource ' )
uom_pool = self . pool . get ( ' product.uom ' )
resource_id = False
calendar_id = phase . project_id . resource_calendar_id . id
2010-03-02 13:27:02 +00:00
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , phase . responsible_id . id ) ] )
if resource_id :
calendar_id = resource_pool . browse ( cr , uid , resource_id [ 0 ] ) . calendar_id . id
default_uom_id = uom_pool . search ( cr , uid , [ ( ' name ' , ' = ' , ' Hour ' ) ] ) [ 0 ]
avg_hours = uom_pool . _compute_qty ( cr , uid , phase . product_uom . id , phase . duration , default_uom_id )
2010-02-26 11:18:14 +00:00
# write method changes the date_start and date_end
#for previous and next phases respectively based on valid condition
if vals . get ( ' date_start ' ) :
if vals [ ' date_start ' ] < phase . date_start :
dt_start = mx . DateTime . strptime ( vals [ ' date_start ' ] , ' % Y- % m- %d % H: % M: % S ' )
2010-03-02 13:27:02 +00:00
work_times = resource_cal_pool . interval_get ( cr , uid , calendar_id or False , dt_start , avg_hours or 0.0 , resource_id or False )
2010-02-26 11:18:14 +00:00
vals [ ' date_end ' ] = work_times [ - 1 ] [ 1 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
super ( project_phase , self ) . write ( cr , uid , ids , vals , context = context )
for prv_phase in phase . previous_phase_ids :
2010-03-02 13:27:02 +00:00
self . constraint_date_start ( cr , uid , prv_phase , dt_start )
2010-02-26 11:18:14 +00:00
if vals . get ( ' date_end ' ) :
if vals [ ' date_end ' ] > phase . date_end :
dt_end = mx . DateTime . strptime ( vals [ ' date_end ' ] , ' % Y- % m- %d % H: % M: % S ' )
2010-03-02 13:27:02 +00:00
work_times = resource_cal_pool . interval_min_get ( cr , uid , calendar_id or False , dt_end , avg_hours or 0.0 , resource_id or False )
2010-02-26 11:18:14 +00:00
vals [ ' date_start ' ] = work_times [ 0 ] [ 0 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
super ( project_phase , self ) . write ( cr , uid , ids , vals , context = context )
for next_phase in phase . next_phase_ids :
2010-03-02 13:27:02 +00:00
self . constraint_date_end ( cr , uid , next_phase , dt_end )
2010-02-26 11:18:14 +00:00
return super ( project_phase , self ) . write ( cr , uid , ids , vals , context = context )
2010-02-25 06:01:27 +00:00
def phase_draft ( self , cr , uid , ids , * args ) :
self . write ( cr , uid , ids , { ' state ' : ' draft ' } )
return True
def phase_start ( self , cr , uid , ids , * args ) :
self . write ( cr , uid , ids , { ' state ' : ' open ' } )
return True
def phase_pending ( self , cr , uid , ids , * args ) :
self . write ( cr , uid , ids , { ' state ' : ' pending ' } )
return True
def phase_cancel ( self , cr , uid , ids , * args ) :
self . write ( cr , uid , ids , { ' state ' : ' cancelled ' } )
return True
def phase_done ( self , cr , uid , ids , * args ) :
self . write ( cr , uid , ids , { ' state ' : ' done ' } )
return True
2010-02-18 10:07:31 +00:00
2010-01-12 12:45:02 +00:00
project_phase ( )
class project_resource_allocation ( osv . osv ) :
_name = ' project.resource.allocation '
_description = ' Project Resource Allocation '
2010-02-10 06:14:22 +00:00
_rec_name = ' resource_id '
2010-01-12 12:45:02 +00:00
_columns = {
' resource_id ' : fields . many2one ( ' resource.resource ' , ' Resource ' , required = True ) ,
2010-02-25 06:01:27 +00:00
' phase_id ' : fields . many2one ( ' project.phase ' , ' Project Phase ' , required = True ) ,
2010-01-12 12:45:02 +00:00
' useability ' : fields . float ( ' Useability ' , help = " Useability of this ressource for this project phase in percentage (=50 % ) " ) ,
}
_defaults = {
' useability ' : lambda * a : 100 ,
}
2010-02-10 06:14:22 +00:00
2010-01-12 12:45:02 +00:00
project_resource_allocation ( )
class project ( osv . osv ) :
_inherit = " project.project "
_columns = {
' phase_ids ' : fields . one2many ( ' project.phase ' , ' project_id ' , " Project Phases " )
2010-03-02 13:27:02 +00:00
2010-01-12 12:45:02 +00:00
}
project ( )
class task ( osv . osv ) :
_inherit = " project.task "
_columns = {
2010-03-02 13:27:02 +00:00
' phase_id ' : fields . many2one ( ' project.phase ' , ' Project Phase ' ) ,
' occupation_rate ' : fields . float ( ' Occupation Rate ' , help = ' The occupation rate fields indicates how much of his time a user is working on a task. A 100 % o ccupation rate means the user works full time on the tasks. The ending date of a task is computed like this: Starting Date + Duration / Occupation Rate. ' ) ,
' planned_hours ' : fields . float ( ' Planned Hours ' , required = True , help = ' Estimated time to do the task, usually set by the project manager when the task is in draft state. ' ) ,
2010-01-12 12:45:02 +00:00
}
2010-03-02 13:27:02 +00:00
_defaults = {
' occupation_rate ' : lambda * a : ' 1 '
}
def onchange_planned ( self , cr , uid , ids , project , user_id = False , planned = 0.0 , effective = 0.0 , date_start = None , occupation_rate = 0.0 ) :
result = { }
if date_start :
resource_pool = self . pool . get ( ' resource.resource ' )
project_pool = self . pool . get ( ' project.project ' )
resource_calendar = self . pool . get ( ' resource.calendar ' )
dt_start = mx . DateTime . strptime ( date_start , ' % Y- % m- %d % H: % M: % S ' )
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , user_id ) ] )
if resource_id :
resource_obj = resource_pool . browse ( cr , uid , resource_id ) [ 0 ]
hrs = planned / ( float ( occupation_rate ) * resource_obj . time_efficiency )
calendar_id = resource_obj . calendar_id . id
else :
hrs = float ( planned / occupation_rate )
calendar_id = project_pool . browse ( cr , uid , project ) . resource_calendar_id . id
work_times = resource_calendar . interval_get ( cr , uid , calendar_id or False , dt_start , hrs or 0.0 , resource_id or False )
result [ ' date_end ' ] = work_times [ - 1 ] [ 1 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
result [ ' remaining_hours ' ] = planned - effective
return { ' value ' : result }
def constraint_date_start ( self , cr , uid , task , date_end , context = None ) :
# Recursive call for all previous tasks if change in date_start < older time
resource_cal_pool = self . pool . get ( ' resource.calendar ' )
resource_pool = self . pool . get ( ' resource.resource ' )
calendar_id = task . project_id . resource_calendar_id . id
hours = task . remaining_hours / task . occupation_rate
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , task . user_id . id ) ] )
if resource_id :
resource_obj = resource_pool . browse ( cr , uid , resource_id [ 0 ] )
calendar_id = resource_obj . calendar_id . id
hours = task . planned_hours / ( float ( task . occupation_rate ) * resource_obj . time_efficiency )
work_time = resource_cal_pool . interval_min_get ( cr , uid , calendar_id or False , date_end , hours or 0.0 , resource_id or False )
dt_start = work_time [ 0 ] [ 0 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
self . write ( cr , uid , [ task . id ] , { ' date_start ' : dt_start , ' date_end ' : date_end . strftime ( ' % Y- % m- %d % H: % M: % S ' ) } )
def constraint_date_end ( self , cr , uid , task , date_start , context = None ) :
# Recursive call for all next tasks if change in date_end > older time
resource_cal_pool = self . pool . get ( ' resource.calendar ' )
resource_pool = self . pool . get ( ' resource.resource ' )
calendar_id = task . project_id . resource_calendar_id . id
hours = task . remaining_hours / task . occupation_rate
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , task . user_id . id ) ] )
if resource_id :
resource_obj = resource_pool . browse ( cr , uid , resource_id [ 0 ] )
calendar_id = resource_obj . calendar_id . id
hours = task . planned_hours / ( float ( task . occupation_rate ) * resource_obj . time_efficiency )
work_time = resource_cal_pool . interval_get ( cr , uid , calendar_id or False , date_start , hours or 0.0 , resource_id or False )
dt_end = work_time [ - 1 ] [ 1 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
self . write ( cr , uid , [ task . id ] , { ' date_start ' : date_start . strftime ( ' % Y- % m- %d % H: % M: % S ' ) , ' date_end ' : dt_end } )
def write ( self , cr , uid , ids , vals , context = None ) :
if not context :
context = { }
if context . get ( ' scheduler ' , False ) :
return super ( task , self ) . write ( cr , uid , ids , vals , context = context )
# if the task is performed by a resource then its calendar and efficiency also taken
# otherwise the project's working calendar considered
tasks = self . browse ( cr , uid , ids [ 0 ] )
resource_cal_pool = self . pool . get ( ' resource.calendar ' )
resource_pool = self . pool . get ( ' resource.resource ' )
calendar_id = tasks . project_id . resource_calendar_id . id
hrs = tasks . remaining_hours / tasks . occupation_rate
resource_id = resource_pool . search ( cr , uid , [ ( ' user_id ' , ' = ' , tasks . user_id . id ) ] )
if resource_id :
resource_obj = resource_pool . browse ( cr , uid , resource_id [ 0 ] )
calendar_id = resource_obj . calendar_id . id
hrs = tasks . planned_hours / ( float ( tasks . occupation_rate ) * resource_obj . time_efficiency )
# write method changes the date_start and date_end
# for previous and next tasks respectively based on valid condition
if vals . get ( ' date_start ' ) :
if vals [ ' date_start ' ] < tasks . date_start :
dt_start = mx . DateTime . strptime ( vals [ ' date_start ' ] , ' % Y- % m- %d % H: % M: % S ' )
work_times = resource_cal_pool . interval_get ( cr , uid , calendar_id or False , dt_start , hrs or 0.0 , resource_id or False )
vals [ ' date_end ' ] = work_times [ - 1 ] [ 1 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
super ( task , self ) . write ( cr , uid , ids , vals , context = context )
for prv_task in tasks . parent_ids :
self . constraint_date_start ( cr , uid , prv_task , dt_start )
if vals . get ( ' date_end ' ) :
if vals [ ' date_end ' ] > tasks . date_end :
dt_end = mx . DateTime . strptime ( vals [ ' date_end ' ] , ' % Y- % m- %d % H: % M: % S ' )
hrs = tasks . remaining_hours / tasks . occupation_rate
work_times = resource_cal_pool . interval_min_get ( cr , uid , calendar_id or False , dt_end , hrs or 0.0 , resource_id or False )
vals [ ' date_start ' ] = work_times [ 0 ] [ 0 ] . strftime ( ' % Y- % m- %d % H: % M: % S ' )
super ( task , self ) . write ( cr , uid , ids , vals , context = context )
for next_task in tasks . child_ids :
self . constraint_date_end ( cr , uid , next_task , dt_end )
2010-03-02 13:41:19 +00:00
2010-03-02 13:27:02 +00:00
return super ( task , self ) . write ( cr , uid , ids , vals , context = context )
2010-01-12 12:45:02 +00:00
task ( )
# vim:expandtab:smartindent:tabstop=4:softtabstop=4:shiftwidth=4: