taskjuggler 0.0.10 → 0.0.11

data/CHANGELOG

@@ -1,3 +1,118 @@
+= Release 0.0.10 (2011-01-31)
+
+  * Bumping version to 0.0.10
+    
+    0.0.9 was a no-go version.
+  * Bumping version to 0.0.9
+  * Fix entry scripts.
+
+= Release 0.0.9 (2011-01-30)
+
+  * Bumping version to 0.0.9
+  * Executable name and primary Ruby file name should always match.
+  * Adding a .gitignore file.
+  * Add development dependencies to gem spec file.
+  * Fix alertmessages. Don't show overriden old alerts again.
+    
+    If a child had an alert, the parent reset it and another child added
+    another green message after that, the old alert was showing up again.
+  * Fixing dependency symbols in precursor and follower lists.
+  * Supporting listmode option for precursor and follower columns as well.
+  * Properly handle part-time workers in Clarity reports.
+  * Fixing some layout issues in the manual.
+  * Some code consolidation.
+  * Include all Clarity projects in Niku reports.
+    
+    Also add projects with 0 effort so they show up in the actual
+    reporting page of Clarity.
+  * Make 'listmode' options a power of 2.
+  * Make 'celltext' also work for calendar column cells.
+  * Improving the cell content shortener.
+  * Adding new attributes 'listtype' and 'listmode'.
+    
+    These new attributes can be used to customize the lists in report
+    table cells.
+  * Use accurate width even with icons and tooltips in the table.
+  * Column width is now a fixed measure, not a minimum measure.
+  * Adding a default landing page for built-in web server.
+  * Clarify usage of bookings and scenarios in the manual.
+  * Update copyright to 2011.
+  * Make web server work again.
+    
+    Reported-by: Bernhard Wiedemann <bwiedemann@gmx.de>
+  * Fix crash for "<-query scenario='actual' attribute=...->" queries.
+    
+    Reported-by: Patrick Berry <postgradpat@gmail.com>
+  * Fix time-off highlighting at report boundaries.
+    
+    Reported-by: Tom Schutter <t.schutter@comcast.net>
+  * vacation is a cumulative attribute. Don't issue a warning for multiple use.
+  * Fixing "Overwriting a previously provided value" crashes.
+    
+    Reported-by: Bernhard Wiedemann <bwiedemann@gmx.de>
+  * Fixing progress meter off-by-one bug.
+    
+    For long labels the progress meter started one char too far right.
+    
+    Reported-by: Tom Schutter <tschutter@corelogic.com>
+  * Fix handling of container tasks with dependencies.
+    
+    This bug was introduced by the recent onstart/onend changes.
+    
+    Reported-by: Sam Elstob <samelstob@gmail.com>
+  * Prevent crashes in report generator when using -f option with tj3.
+  * Add error message for reports without a file name.
+  * Second part of onstart/onend fixes.
+  * Fix serious problem with 'onstart' and 'onend' dependencies.
+    
+    The parser was too permissive and some illegal cases slipped through.
+    Tasks with start-start deps must be ASAP and end-end tasks must be
+    ALAP.
+    
+    Reported-by: Bernd Wiedemann <bwiedemann@gmx.de>
+  * Add warning if an attribute is used twice in the same context.
+    
+    This is to prevent accidental overwrites of attributes in bigger
+    scopes. This will also alert users that first assign a value to a
+    derived scenario and then to the parent scenario.
+  * Fixing a serious flaw in the handling of inherited scenario specific attributes.
+    
+    This fix will potentially change the result of existing projects that
+    use inheritable attributes in combination with derived scenarios. The
+    handling of these attributes was broken and derived scenarios used
+    wrong attribute values.
+  * Refactored the ProjectBroker API to make it cleaner.
+  * caption, epilog, headline, prolog and title are now inheritable report attributes
+  * tj3client now supports a --format option to request a certain output format.
+  * Properly limit bookings in export report to report period.
+    
+    Reported-by: Magnus Wiklund (wiklund.magnus@comcast.net)
+  * Adding spec for ProjectBrowser.
+    
+    Just a first draft.
+  * Added a rake task to run the RSpec tests.
+  * Fixing completion bars in Gantt charts.
+    
+    The bars were showing random values instead of the correct completion
+    degree.
+  * Show off-duty periods for task lines in Gantt charts.
+  * Don't show global working hour zones for group resources in Gantt
+    charts.
+  * Adding more examples for limits to the manual.
+  * Fix a typo in the manual.
+    
+    Added some comments to the code.
+  * Explaining use of tool tips in the tutorial.
+  * Fixing 'taskprefix' attribute for include files.
+    
+    Reported-by: Sam Elstob <samelstob@gmail.com>
+  * Ensure deterministic order of projects and resources in Niku reports.
+  * Adding test case for niku reports.
+  * Move CSV reference reports into refs directory.
+  * Include vacation time for each resource in Niku reports.
+  * Generate warnings if a non-supported format is requested for a report.
+  * Show releases for last to first in CHANGELOG
+
 = Release 0.0.8 (2010-11-24)
 
   * Bumping version to 0.0.8

data/README.rdoc

@@ -0,0 +1,105 @@
+= About {TaskJuggler III}[http://www.taskjuggler.org]
+
+TaskJuggler is a modern and powerful, Free and Open Source Software project
+management tool. Its new approach to project planing and tracking is more
+flexible and superior to the commonly used Gantt chart editing tools.
+
+TaskJuggler is project management software for serious project managers. It
+covers the complete spectrum of project management tasks from the first idea
+to the completion of the project. It assists you during project scoping,
+resource assignment, cost and revenue planing, risk and communication
+management.
+
+TaskJuggler provides an optimizing scheduler that computes your project time
+lines and resource assignments based on the project outline and the
+constraints that you have provided. The built-in resource balancer and
+consistency checker offload you from having to worry about irrelevant details
+and ring the alarm if the project gets out of hand. The flexible
+as-many-details-as-necessary approach allows you to plan your project as you
+go, making it also ideal for new management strategies such as Extreme
+Programming and Agile Project Management.
+
+If you are about to build a skyscraper or just want to put together the
+release schedule of your open source project, TaskJuggler is the right
+tool for you. If you just want to draw nice looking Gantt charts to impress
+your boss or your investors, TaskJuggler might not be right for you. You
+can of course create nice looking Gantt charts. But it takes a little more
+effort to master its power. If you are up for this, TaskJuggler will
+become a companion that you don't want to miss anymore.
+
+TaskJuggler is written in {Ruby}[http://www.ruby-lang.org/en/] and should
+be easily installable and usable on all popular operating systems. It may
+sound surprising at first, but this software does not need a graphical user
+interface. A command shell, a plain text editor (no word processor!) and a web
+browser is all you need for your work.
+
+TaskJuggler has not yet been released as a stable version. The primary
+reason is that we don't want to freeze the syntax before it has been used by a
+larger audience. By now, changes should be small, but we cannot yet rule out
+minor compatibility issues when upgrading to a newer version. We also have a
+fairly small test suite. It's quite possible, that you will run into a bug or
+two. Please report it into our {issue
+tracker}[https://github.com/taskjuggler/TaskJuggler/issues].
+
+= Features and Highlights
+
+* Manages tasks, resources and accounts of your project
+* Automatic resource leveling and tasks conflict resolution
+* Comprehensive and flexible reports so you can find the information you need when you need it
+* Project tracking and status reporting with dashboard support
+* Time and status sheet reporting infrastructure
+* Unlimited number of scenarios (baselines) of the same project for what-if analysis
+* CSV data export for exchange with Office Suites
+* Projects can be combined to larger projects
+* Multiple project managers can work on the same project
+* Flexible working hours and vacation handling
+* Support for shift working
+* Multiple time zone support
+* Tasks may have initial costs, finishing costs
+* Resources may have running costs
+* Support for profit/loss analysis
+* HTML reports for Web based communication
+* Built-in web server for dynamic and interactive reports
+* Powerful project description syntax with macro support
+* Support for central resource allocation database
+* Scales well on multi-core or multi-CPU systems
+* Runs on all Linux, Unix, Windows, MacOS and several other operating systems
+* Simple installation
+
+= Installation
+
+Installation instructions can be found {here}[http://www.taskjuggler.org/tj3/manual/Installation.html#Installation].
+
+= Introduction and Tutorial
+
+To learn more about how to use TaskJuggler please see the {user
+manual}[http://www.taskjuggler.org/tj3/manual/index.html]. It also contains a
+{tutorial}[http://www.taskjuggler.org/tj3/manual/Tutorial.html#The_Tutorial_Your_first_Project]
+to get you started. It will tell you how to generate HTML reports
+like {these}[http://www.taskjuggler.org/tj3/examples/Overview.html]
+from such a {project
+description}[http://www.taskjuggler.org/tj3/examples/tutorial.tjp].
+
+= Getting Help and reporting Bugs
+
+There are several mailing list for TaskJuggler users and developers.
+Please see {this page}[http://www.taskjuggler.org/forum.php] for
+details. If you have a question about TaskJuggler usage, the user
+list is the best place to go. Please remain subscribed and help other
+users when you get more proficient in TaskJuggler.
+
+If you think that you have found a bug in the software, please the
+the {bug reporting
+guidelines}[http://www.taskjuggler.org/tj3/manual/Reporting_Bugs.html#Reporting_Bugs_and_Sending_Feedback].
+
+= Copyright and License
+
+TaskJuggler is (c) 2006, 2007, 2008, 2009, 2010, 2011 by Chris Schlaeger <chris@linux.com>
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of {version 2 of the GNU General Public
+License}[http://www.gnu.org/licenses/old-licenses/gpl-2.0.html] as
+published by the Free Software Foundation. You accept the terms of
+this license by distributing or using this software.
+
+TaskJuggler[http://www.taskjuggler.org] is a trademark of Chris Schlaeger.

data/examples/tutorial.tjp

@@ -6,6 +6,9 @@
  * description of the various syntax elements.
  */
 project acso "Accounting Software"  2002-01-16 +4m {
+  # Set the default time zone for the project. If not specified, UTC
+  # is used.
+  timezone "Europe/Paris"
   # Hide the clock time. Only show the date.
   timeformat "%Y-%m-%d"
   # Use US format for numbers
@@ -92,10 +95,10 @@ resource misc "The Others" {
     limits { dailymax 6.4h }
     rate 310.0
   }
-  resource doc "Dim Sung" { 
+  resource doc "Dim Sung" {
     email "sung@crappysoftware.com"
     Phone "x482"
-    rate 300.0 
+    rate 300.0
     vacation 2002-03-11 - 2002-03-16
   }
 
@@ -159,7 +162,7 @@ task AcSo "Accounting Software" {
         details -8<-
           We have already contacted the vendor and are now waiting for
           their advise.
-        ->8-  
+        ->8-
       }
     }
 
@@ -242,7 +245,9 @@ task AcSo "Accounting Software" {
     task start "Project start" {
       # A task that has no duration is a milestone. It only needs a
       # start or end criterion. All other tasks depend on this task.
-      start 2002-01-16
+      # Here we use the built-in macro ${projectstart} to align the
+      # start of the task with the above specified project time frame.
+      start ${projectstart}
       # For some reason the actual start of the project got delayed.
       # We record this, so that we can compare the planned run to the
       # delayed run of the project.
@@ -294,15 +299,15 @@ macro TaskTip [
     '''End: ''' <-query attribute='end'->
     ----
     '''Resources:'''
-    
+
     <-query attribute='resources'->
     ----
     '''Precursors: '''
-    
+
     <-query attribute='precursors'->
     ----
     '''Followers: '''
-    
+
     <-query attribute='followers'->
     ->8-
 ]
@@ -330,7 +335,7 @@ textreport frame "" {
       <[report id="status.ongoing"]>
       ----
       <[report id="status.future"]>
-    ->8-   
+    ->8-
   }
 
   textreport development "Development" {
@@ -359,13 +364,13 @@ textreport frame "" {
 taskreport overview "" {
   header -8<-
     === Project Overview ===
-    
+
     The project is structured into 3 phases.
-    
+
     # Specification
     # <-reportlink id='frame.development'->
     # Testing
-    
+
     === Original Project Plan ===
   ->8-
   columns hierarchindex,
@@ -384,9 +389,9 @@ taskreport overview "" {
 
     All project phases are properly staffed. See [[ResourceGraph]] for
     detailed resource allocations.
-    
+
     === Current Status ===
-    
+
     The project started off with a delay of 4 days. This slightly affected
     the original schedule. See [[Deliveries]] for the impact on the
     delivery dates.
@@ -408,12 +413,12 @@ taskreport status "" {
           alert { tooltip plan.journal
                           != '' "<-query attribute='journal'->" width 150 },
           status { width 150 }
-  scenarios delayed 
+  scenarios delayed
 
   taskreport dashboard "" {
     headline "Project Dashboard (<-query attribute='now'->)"
     columns name { title "Task" ${AlertColor} width 200},
-            resources { width 200 ${AlertColor} 
+            resources { width 200 ${AlertColor}
                         listtype bullets listmode 2
                         start ${projectstart} end ${projectend} },
             alerttrend { title "Trend" ${AlertColor} width 50 },
@@ -451,7 +456,7 @@ taskreport development "" {
 taskreport deliveries "" {
   headline "Project Deliverables"
   columns hierarchindex, name, start, end, note { width 150 }, complete,
-          chart { ${TaskTip} } 
+          chart { ${TaskTip} }
   taskroot AcSo.deliveries
   hideresource 1
   scenarios plan, delayed

data/gem_spec.rb

@@ -32,6 +32,6 @@ GEM_SPEC = Gem::Specification.new { |s|
         s.cert_chain  = [CERT_PUBLIC]
     end
     s.platform          = Gem::Platform::RUBY
-    s.required_ruby_version  = '>= 1.8.6'
+    s.required_ruby_version  = '>= 1.8.7'
 }
 

data/lib/{Account.rb → taskjuggler/Account.rb}

@@ -11,9 +11,8 @@
 # published by the Free Software Foundation.
 #
 
-
-require 'PropertyTreeNode'
-require 'AccountScenario'
+require 'taskjuggler/PropertyTreeNode'
+require 'taskjuggler/AccountScenario'
 
 class TaskJuggler
 

data/lib/{AccountScenario.rb → taskjuggler/AccountScenario.rb}

@@ -11,7 +11,7 @@
 # published by the Free Software Foundation.
 #
 
-require 'ScenarioData'
+require 'taskjuggler/ScenarioData'
 
 class TaskJuggler
 

data/lib/taskjuggler/AlgorithmDiff.rb

@@ -0,0 +1,311 @@
+#!/usr/bin/env ruby -w
+# encoding: UTF-8
+#
+# = AccountScenario.rb -- The TaskJuggler III Project Management Software
+#
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011
+#               by Chris Schlaeger <chris@linux.com>
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of version 2 of the GNU General Public License as
+# published by the Free Software Foundation.
+#
+
+# This class is an implementation of the classic UNIX diff functionality. It's
+# based on an original implementation by Lars Christensen, which based his
+# version on the Perl Algorithm::Diff implementation. This is largly a
+# from-scratch implementation that tries to have a less intrusive and more
+# user-friendly interface. But some code fragments are very similar to the
+# origninal and are copyright (C) 2001 Lars Christensen.
+class Diff
+
+  # A Hunk stores all information about a contiguous change of the destination
+  # list. It stores the inserted and deleted values as well as their positions
+  # in the A and B list.
+  class Hunk
+
+    attr_reader :insertValues, :deleteValues
+    attr_accessor :aIdx, :bIdx
+
+    # Create a new Hunk. _aIdx_ is the index in the A list. _bIdx_ is the
+    # index in the B list.
+    def initialize(aIdx, bIdx)
+      @aIdx = aIdx
+      # A list of values to be deleted from the A list starting at aIdx.
+      @deleteValues = []
+
+      @bIdx = bIdx
+      # A list of values to be inserted into the B list at bIdx.
+      @insertValues = []
+    end
+
+    # Has the Hunk any values to insert?
+    def insert?
+      !@insertValues.empty?
+    end
+
+    # Has the Hunk any values to be deleted?
+    def delete?
+      !@deleteValues.empty?
+    end
+
+    def to_s
+      str = ''
+      showSeparator = false
+      if insert? && delete?
+        str << "#{aRange}c#{bRange}\n"
+        showSeparator = true
+      elsif insert?
+        str << "#{aIdx}a#{bRange}\n"
+      else
+        str << "#{aRange}d#{bIdx}\n"
+      end
+
+      @deleteValues.each { |value| str << "< #{value}\n" }
+      str << "---\n" if showSeparator
+      @insertValues.each { |value| str << "> #{value}\n" }
+
+      str
+    end
+
+    def inspect
+      puts to_s
+    end
+
+    private
+
+    def aRange
+      range(@aIdx + 1, @aIdx + @deleteValues.length)
+    end
+
+    def bRange
+      range(@bIdx + 1, @bIdx + @insertValues.length)
+    end
+
+    def range(startIdx, endIdx)
+      if (startIdx == endIdx)
+        "#{startIdx}"
+      else
+        "#{startIdx},#{endIdx}"
+      end
+    end
+
+  end
+
+  # Create a new Diff between the _a_ list and _b_ list.
+  def initialize(a, b)
+    @hunks = []
+    diff(a, b)
+  end
+
+  # Modify the _values_ list according to the stored diff information.
+  def patch(values)
+    res = values.dup
+    @hunks.each do |hunk|
+      if hunk.delete?
+        res.slice!(hunk.bIdx, hunk.deleteValues.length)
+      end
+      if hunk.insert?
+        res.insert(hunk.bIdx, *hunk.insertValues)
+      end
+    end
+    res
+  end
+
+  def editScript
+    script = []
+    @hunks.each do |hunk|
+      if hunk.delete?
+        script << "#{hunk.aIdx + 1}d#{hunk.deleteValues.length}"
+      end
+      if hunk.insert?
+        script << "#{hunk.bIdx + 1}i#{hunk.insertValues.join(',')}"
+      end
+    end
+
+    script
+  end
+
+  # Return the diff list as standard UNIX diff output.
+  def to_s
+    str = ''
+    @hunks.each { |hunk| str << hunk.to_s }
+    str
+  end
+
+  def inspect
+    puts to_s
+  end
+
+  private
+
+  def diff(a, b)
+    indexTranslationTable = computeIndexTranslations(a, b)
+
+    ai = bi = 0
+    tableLength = indexTranslationTable.length
+    while ai < tableLength do
+      # Check if value from index ai should be included in B.
+      destIndex = indexTranslationTable[ai]
+      if destIndex
+        # Yes, it needs to go to position destIndex. All values from bi to
+        # newIndex - 1 are new values in B, not in A.
+        while bi < destIndex
+          insertElement(ai, bi, b[bi])
+          bi += 1
+        end
+        bi += 1
+      else
+        # No, it's not in B. Put it onto the deletion list.
+        deleteElement(ai, bi, a[ai])
+      end
+      ai += 1
+    end
+
+    # The remainder of the A list has to be deleted.
+    while ai < a.length
+      deleteElement(ai, bi, a[ai])
+      ai += 1
+    end
+    # The remainder of the B list are new values.
+    while bi < b.length
+      insertElement(ai, bi, b[bi])
+      bi += 1
+    end
+  end
+
+  def computeIndexTranslations(a, b)
+    aEndIdx = a.length - 1
+    bEndIdx = b.length - 1
+    startIdx = 0
+    indexTranslationTable = []
+
+    while (startIdx < aEndIdx && startIdx < bEndIdx &&
+           a[startIdx] == b[startIdx])
+      indexTranslationTable[startIdx] = startIdx
+      startIdx += 1
+    end
+
+    while (aEndIdx >= startIdx && bEndIdx >= startIdx &&
+           a[aEndIdx] == b[bEndIdx])
+      indexTranslationTable[aEndIdx] = bEndIdx
+      aEndIdx -= 1
+      bEndIdx -= 1
+    end
+
+    return indexTranslationTable if startIdx >= aEndIdx && startIdx >= bEndIdx
+
+    links = []
+    thresholds = []
+    bHashesToIndicies = reverseHash(b, startIdx, bEndIdx)
+
+    startIdx.upto(aEndIdx) do |ai|
+      aValue = a[ai]
+      next unless bHashesToIndicies.has_key? aValue
+
+      k = nil
+      bHashesToIndicies[aValue].each do |bi|
+        if k && (thresholds[k] > bi) && (thresholds[k - 1] < bi)
+          thresholds[k] = bi
+        else
+          k = replaceNextLarger(thresholds, bi, k)
+        end
+        links[k] = [ k == 0 ? nil : links[k - 1], ai, bi ] if k
+      end
+    end
+
+    if !thresholds.empty?
+      link = links[thresholds.length - 1]
+      while link
+        indexTranslationTable[link[1]] = link[2]
+        link = link[0]
+      end
+    end
+
+    return indexTranslationTable
+  end
+
+  def reverseHash(values, startIdx, endIdx)
+    hash = {}
+    startIdx.upto(endIdx) do |i|
+      element = values[i]
+      if hash.has_key?(element)
+        hash[element].insert(0, i)
+      else
+        hash[element] = [ i ]
+      end
+    end
+
+    hash
+  end
+
+  def replaceNextLarger(ary, value, high = nil)
+    high ||= ary.length
+    if ary.empty? || value > ary[-1]
+      ary.push value
+      return high
+    end
+    low = 0
+    while low < high
+      index = (high + low) / 2
+      found = ary[index]
+      return nil if value == found
+
+      if value > found
+        low = index + 1
+      else
+        high = index
+      end
+    end
+
+    ary[low] = value
+
+    low
+  end
+
+  def deleteElement(aIdx, bIdx, value)
+    if @hunks.empty? ||
+       @hunks.last.aIdx + @hunks.last.deleteValues.length != aIdx
+      @hunks << (hunk = Hunk.new(aIdx, bIdx))
+    else
+      hunk = @hunks.last
+    end
+    hunk.deleteValues << value
+  end
+
+  def insertElement(aIdx, bIdx, value)
+    if @hunks.empty? ||
+       @hunks.last.bIdx + @hunks.last.insertValues.length != bIdx
+      @hunks << (hunk = Hunk.new(aIdx, bIdx))
+    else
+      hunk = @hunks.last
+    end
+    hunk.insertValues << value
+  end
+
+end
+
+module Diffable
+
+  def diff(b)
+    Diff.new(self, b)
+  end
+
+  def patch(diff)
+    diff.patch(self)
+  end
+
+end
+
+module DiffableString
+
+  def diff(b)
+    split("\n").extend(Diffable).diff(b.split("\n"))
+  end
+
+  def patch(hunks)
+    split("\n").extend(Diffable).patch(hunks).join("\n") + "\n"
+  end
+
+end
+