Added status reporting interface to provide a generalized interface for background processes to report their current status; tried to improve documentation of the Progression and RectanglePacker classes
git-svn-id: file:///srv/devel/repo-conversion/nusu@48 d2e56fa2-650e-0410-a79f-9358c0239efd
This commit is contained in:
parent
96e546c2f4
commit
e281b5cbb3
5 changed files with 98 additions and 5 deletions
|
@ -28,14 +28,14 @@ namespace Nuclex.Support.Packing {
|
|||
/// <summary>Packer using a custom algorithm by Markus 'Cygon' Ewald</summary>
|
||||
/// <remarks>
|
||||
/// <para>
|
||||
/// Algorithm conceived by Markus Ewald (cygon at nuclex dot org), thought
|
||||
/// Algorithm conceived by Markus Ewald (cygon at nuclex dot org), though
|
||||
/// I'm quite sure I'm not the first one to come up with it :)
|
||||
/// </para>
|
||||
/// <para>
|
||||
/// The algorithm always places rectangles as low as possible in the packing
|
||||
/// area. So, for any new rectangle that is to be added into the packing area,
|
||||
/// the packer has to determine the X coordinate at which the rectangle can have
|
||||
/// the lowest overall height without intersecting any other rectangles.
|
||||
/// area. So, for any new rectangle that is to be added, the packer has to
|
||||
/// determine the X coordinate at which the rectangle can have the lowest
|
||||
/// overall height without intersecting any other rectangles.
|
||||
/// </para>
|
||||
/// <para>
|
||||
/// To quickly discover these locations, the packer uses a sophisticated
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue