JAVA源代码漏洞测试工程LibrePlan源码下载

/* * This file is part of LibrePlan * * Copyright (C) 2009-2010 Fundación para o Fomento da Calidade Industrial e * Desenvolvemento Tecnolóxico de Galicia * Copyright (C) 2010-2011 Igalia, S.L. * * 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/>. */ package org.zkoss.ganttz.data.criticalpath; import static org.easymock.EasyMock.createNiceMock; import static org.easymock.EasyMock.expect; import static org.easymock.EasyMock.isA; import static org.easymock.EasyMock.replay; import static org.hamcrest.CoreMatchers.anyOf; import static org.hamcrest.CoreMatchers.equalTo; import static org.junit.Assert.assertFalse; import static org.junit.Assert.assertThat; import static org.zkoss.ganttz.data.constraint.ConstraintOnComparableValues.biggerOrEqualThan; import java.util.Arrays; import java.util.Collections; import java.util.HashSet; import java.util.List; import org.joda.time.Days; import org.joda.time.LocalDate; import org.junit.Test; import org.zkoss.ganttz.data.DependencyType; import org.zkoss.ganttz.data.GanttDate; import org.zkoss.ganttz.data.IDependency; import org.zkoss.ganttz.data.ITaskFundamentalProperties; import org.zkoss.ganttz.data.constraint.Constraint; import org.zkoss.ganttz.data.constraint.ConstraintOnComparableValues; /** * Tests for {@link CriticalPathCalculator}. * * @author Manuel Rego Casasnovas <[email protected]> */ public class CriticalPathCalculatorTest { private ICriticalPathCalculable<ITaskFundamentalProperties> diagramGraphExample; private final LocalDate START = new LocalDate(2009, 12, 1); private ITaskFundamentalProperties createTask(LocalDate start, int durationDays) { ITaskFundamentalProperties result = createNiceMock(ITaskFundamentalProperties.class); expect(result.getBeginDate()).andReturn(toDate(start)).anyTimes(); expect(result.getEndDate()).andReturn(toDate(start.plusDays(durationDays))).anyTimes(); replay(result); return result; } private CriticalPathCalculator<ITaskFundamentalProperties, IDependency<ITaskFundamentalProperties>> buildCalculator() { return CriticalPathCalculator.create(false); } private ITaskFundamentalProperties createTaskWithBiggerOrEqualThanConstraint( LocalDate start, int durationDays, LocalDate date) { ITaskFundamentalProperties result = createNiceMock(ITaskFundamentalProperties.class); expect(result.getBeginDate()).andReturn(toDate(start)).anyTimes(); expect(result.getEndDate()).andReturn(toDate(start.plusDays(durationDays))).anyTimes(); GanttDate ganttDate = GanttDate.createFrom(date); Constraint<GanttDate> constraint = biggerOrEqualThan(ganttDate); expect(result.getStartConstraints()).andReturn(Collections.singletonList(constraint)).anyTimes(); replay(result); return result; } private ITaskFundamentalProperties createTaskWithEqualConstraint( LocalDate start, int durationDays, LocalDate date) { ITaskFundamentalProperties result = createNiceMock(ITaskFundamentalProperties.class); expect(result.getBeginDate()).andReturn(toDate(start)).anyTimes(); expect(result.getEndDate()).andReturn(toDate(start.plusDays(durationDays))).anyTimes(); GanttDate ganttDate = GanttDate.createFrom(date); Constraint<GanttDate> constraint = ConstraintOnComparableValues.equalTo(ganttDate); expect(result.getStartConstraints()).andReturn(Collections.singletonList(constraint)).anyTimes(); replay(result); return result; } private IDependency<ITaskFundamentalProperties> createDependency( ITaskFundamentalProperties source, ITaskFundamentalProperties destination, DependencyType dependencyType) { IDependency<ITaskFundamentalProperties> dependency = createNiceMock(IDependency.class); expect(dependency.getSource()).andReturn(source).anyTimes(); expect(dependency.getDestination()).andReturn(destination).anyTimes(); expect(dependency.getType()).andReturn(dependencyType).anyTimes(); replay(dependency); return dependency; } private GanttDate toDate(LocalDate localDate) { return GanttDate.createFrom(localDate); } private int daysBetweenStartAndEnd(ITaskFundamentalProperties task) { LocalDate start = LocalDate.fromDateFields(task.getBeginDate().toDayRoundedDate()); LocalDate end = LocalDate.fromDateFields(task.getEndDate().toDayRoundedDate()); return Days.daysBetween(start, end).getDays(); } /** * <pre> * #### T1 #### * </pre> */ private void givenOneTask(int daysTask1) { diagramGraphExample = createNiceMock(ICriticalPathCalculable.class); List<ITaskFundamentalProperties> listOfTasks = Collections.singletonList(createTask(START, daysTask1)); expect(diagramGraphExample.getTasks()).andReturn(listOfTasks).anyTimes(); expect(diagramGraphExample.getInitialTasks()).andReturn(listOfTasks).anyTimes(); expect(diagramGraphExample.getLatestTasks()).andReturn(listOfTasks).anyTimes(); expect(diagramGraphExample.getDependencyFrom( isA(ITaskFundamentalProperties.class), isA(ITaskFundamentalProperties.class))).andReturn(null) .anyTimes(); expect(diagramGraphExample.getIncomingTasksFor(isA(ITaskFundamentalProperties.class))) .andReturn(new HashSet<>()) .anyTimes(); expect(diagramGraphExample.getOutgoingTasksFor(isA(ITaskFundamentalProperties.class))) .andReturn(new HashSet<>()) .anyTimes(); addTaskMethods(listOfTasks); replay(diagramGraphExample); } private void addTaskMethods(List<ITaskFundamentalProperties> listOfTasks) { for (ITaskFundamentalProperties task : listOfTasks) { expect(diagramGraphExample.getStartDate(task)).andReturn(task.getBeginDate()).anyTimes(); expect(diagramGraphExample.getStartConstraintsFor(task)).andReturn(task.getStartConstraints()).anyTimes(); expect(diagramGraphExample.getEndDateFor(task)).andReturn(task.getEndDate()).anyTimes(); } } /** * <pre> * #### T1 #### * * #### T2 #### * </pre> */ private void givenTwoTasksNotConnected(int daysTask1, int daysTask2) { diagramGraphExample = createNiceMock(ICriticalPathCalculable.class); List<ITaskFundamentalProperties> listOfTasks = Arrays.asList(createTask(START, daysTask1), createTask(START, daysTask2)); expect(diagramGraphExample.getTasks()).andReturn(listOfTasks).anyTimes(); expect(diagramGraphExample.getInitialTasks()).andReturn(listOfTasks).anyTimes(); expect(diagramGraphExample.getLatestTasks()).andReturn(listOfTasks).anyTimes(); expect(diagramGraphExample.getDependencyFrom( isA(ITaskFundamentalProperties.class), isA(ITaskFundamentalProperties.class))).andReturn(null) .anyTimes(); expect(diagramGraphExample.getIncomingTasksFor(isA(ITaskFundamentalProperties.class))) .andReturn(new HashSet<>()) .anyTimes(); expect(diagramGraphExample.getOutgoingTasksFor(isA(I