lachie / openaustralia-parser forked from mlandauer/openaustralia-parser

Parser component for Open Australia

This URL has Read+Write access

openaustralia-parser / parse-members.rb
100755 83 lines (68 sloc) 2.856 kb
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
74
75
76
77
78
79
80
81
82
83
#!/usr/bin/env ruby
 
require File.dirname(__FILE__)+'/lib/environment'
 
require 'optparse'
conf = Configuration.new
 
output = Output.new(
                    :xml => PeopleXmlOutput,
                    :couch => Person::CouchLoader
                   )
 
OptionParser.new do |opts|
  opts.banner = <<-EOF
Usage: parse-members.rb [options]
EOF
  opts.on("--xml", "Generate XML") do
    output.select! :xml
  end
 
  opts.on("--couch", "Load into CouchDB") do
    output.select! :couch
  end
end.parse!
 
unless output.selection_valid?
puts "You need to supply at least one output option (--xml or --couch)"
exit!
end
 
output.create! {|o| o.new(conf)}
output.setup!
 
 
puts "Reading members data..."
people = PeopleCSVReader.read_members
PeopleCSVReader.read_all_ministers(people)
puts "Running consistency checks..."
# First check that each constituency is showing a continuous period of members with there never being more than one member at any time.
# Collect all the division names
 
members = people.all_periods_in_house(House.representatives)
divisions = members.map {|member| member.division}.uniq.sort
 
# Electoral divisions that don't exist anymore
old_divisions = ["Angas", "Balaclava", "Bonython", "Burke", "Corinella", "Darling", "Darling Downs", "Diamond Valley",
  "Dundas", "Evans", "Gwydir", "Hawker", "Henty", "Namadgi", "Northern Territory", "Phillip", "Riverina-Darling", "St George",
  "Streeton", "Wilmot"]
 
divisions.each do |division|
  #puts "Checking division #{division}..."
  division_members = members.find_all { |member| member.division == division}.sort {|a,b| a.from_date <=> b.from_date}
  division_members.each do |member|
    #puts " From: #{member.from_date} To: #{member.to_date} Member: #{member.person.name.full_name} Party: #{member.party}"
    throw "From and To date the wrong way round" unless member.from_date < member.to_date
  end
  division_members.each_cons(2) do |a,b|
    overlap = a.to_date - b.from_date
    if overlap > 0
      puts "ERROR: Members #{a.person.name.full_name} and #{b.person.name.full_name} both in at the same time (overlap by #{overlap} days)"
    end
  end
  unless old_divisions.member?(division) || division_members.any? {|m| m.current?}
    puts "WARNING: No current member for #{division}"
  end
  if division_members.first.from_date > Date.new(1980,1,1)
    #puts "WARNING: Earliest member in division #{division} is #{division_members.first.person.name.full_name} who started on #{division_members.first.from_date}"
  end
end
 
people.each do |person|
  person_members = person.periods.sort {|a,b| a.from_date <=> b.from_date}
  person_members.each_cons(2) do |a,b|
    overlap = a.to_date - b.from_date
    if overlap > 0
      puts "ERROR: #{person.name.full_name} has two periods that overlap (by #{overlap} days)"
    end
  end
end
 
output.output(people)
output.finalise!