Re: [dev] Binary Space Partitioning Window Manager

From: Christoph Lohmann <20h_AT_r-36.net>
Date: Sat, 28 Jul 2012 11:12:21 +0200

Greetings.

On Sat, 28 Jul 2012 11:12:21 +0200 Bastien Dejean <nihilhill_AT_gmail.com> wrote:
> Hi,
>
> I'm planning on writing a window manager with the following
> characteristics:
>
> - Windows are represented as the leaves of a binary tree.
> - To each leaf corresponds exactly one window.
> - The only nodes which can be focused are the leaves.
> - The leaves are called *window nodes*.
> - The other nodes are called *container nodes*.
> - Only two methods of node insertion will be provided: *replace* and *pair*.
> [...]
> - Each container node is a split rectangle.
> - The splitting method of a container node is either *automatic* or *manual*.
> - In the *automatic* splitting mode, the split type is vertical if the width of
> the rectangle of the node is greater that its height and horizontal
> otherwise.
> - Several tree transformations will be provided: directional leaf swap, node
> pulling, rotation, contraction, dilatation...
> [...]

What are the practical and productivity gains you expect from such fea‐
tures? What is your reallife example where such features would be need‐
ed?


Sincerely,

Christoph Lohmann
Received on Sat Jul 28 2012 - 11:12:21 CEST