1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
#!/usr/bin/env ruby -w
# encoding: UTF-8
#
# = test_PropertySet.rb -- The TaskJuggler III Project Management Software
#
# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014
# by Chris Schlaeger <cs@taskjuggler.org>
#
# 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.
#
$:.unshift File.join(File.dirname(__FILE__), '..', 'lib') if __FILE__ == $0
require 'test/unit'
require 'taskjuggler/Project'
class TaskJuggler
class TestPropertySet < Test::Unit::TestCase
def setup
end
def teardown
end
def test_index
p = TaskJuggler::Project.new('p', 'Project', '1.0')
p['start'] = TjTime.new('2008-07-29')
p['end'] = TjTime.new('2008-08-31')
# This set of Arrays describes the tree structure that we want to test.
# Each Array element is an tuple of breakdown structure idex and parent node.
nodes = [ [ '1', nil ],
[ '1.1', '1' ],
[ '1.1.1', '1.1' ],
[ '1.1.2', '1.1' ],
[ '1.2', '1' ],
[ '1.1.3', '1.1'],
[ '2', nil ],
[ '2.1', '2' ] ]
# Now we create the nodes according to the above list.
i = 0
nodes.each do |id, parent|
# For the node id we use the expected bsi result.
Task.new(p, id, "Node #{id}", parent ? p.task(parent) : nil)
Resource.new(p, id, "Node #{id}", parent ? p.resource(parent) : nil)
i += 1
end
p.tasks.index
p.resources.index
p.tasks.each do |t|
assert_equal(t.fullId, t.get('bsi'))
end
p.tasks.removeProperty('1.1')
p.tasks.index
assert_equal('1.1', p.task('1.2').get('bsi'))
p.resources.each do |r|
assert_equal(r.fullId, r.get('bsi'))
end
end
end
end
|
