Neither hbal nor hn1 take any arguments beside the options, so if any
are passed is most likely an unintended error. This patch aborts in such
cases.

This patch adds support in hbal for writing the command list to a shell
script, with error checking and allowing for early exit.

Since it's easy to pass a wrong node name as offline, we should abort
instead of silently ignoring it.

This patch adds checking of cluster data in the binaries and display of
node's x_mem/i_mem in the node list.

This patch moves the common CLI functionality (as much as currently
possible) into a separate module. This means we only have one parseOpts
and that Utils.hs doesn't keep this kind of functions anymore.

This is added for better readability, since this is very often used in
declarations.

This patch modifies hbal (only, hn1 not yet) for setting nodes offline.

The modules are moved from the ‘top’ namespace to ‘Ganeti.HTools’, in
compliance with standard practices.

This patch moves the version string creation into a function in Utils
which shows some more information.

This patch adds a -V, --version command line option that shows the
program version and also updates the hn1 usage string (similar to hbal).

This just reorders some functions for a more logical ordering.

This patch changes the solution list to include a step counter so that
it's more clear these are successive steps (in a definite order), and
not just an unordered list of changes.

This patch added a verbose output and changed the output so that by
default it is less verbose and more clear.

This patch moves the formatting of the command list to Cluster.hs and
enhances it with separator messages between the steps.

Currently hbal does multiple rounds, stopping when a rounds doesn't
bring improvements. With the recent changes to not remove instances from
the candidate list, this is obsolete as the first round will always run
to the end of the improvements.

This patch changes this so that the Cluster.checkMove function doesn't
recurse, but just computes the next best move (as its docstring says).
This means we can actually incrementally compute and print the solution,
and this is needed as otherwise an instance could move twice and the
second time it needs the current placement to compute the exact command
line and operation needed for the move.

This patch attempts to embed the VCS id in binaries, based on the way
other projects seem to do this.

Learned how multi-line string literals work in Haskell :)

This patch automatically removes the longest common (domain, i.e.
starting with a dot) suffix from the node and instance names. This gives
a much clearer display, and this format is compatible with the way
Ganeti accepts shortened names.

Based on the node changes, we remove the N+1 check and only show a
warning instead.

Currently we always compute the available node list for moves (for an
instances) based on the nodes of the initial table. This works find,
however is a repeated calculation.

We optimize this by passing a node list (of indexes, not full objects),
which helps in two ways:
  - faster to filter later
  - allows restriction of target nodes by enforcing only this subset as
    target for moves

This patch moves a function to Utils and changes hn1 to be able to take
data from RAPI.

This is the initial import of release 0.0.3.