28 Jul 2012 10:47
Binary Space Partitioning Window Manager
Bastien Dejean <nihilhill <at> gmail.com>
2012-07-28 08:47:58 GMT
2012-07-28 08:47:58 GMT
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*.
Example: insertion of a new node (number 4) into the given tree with the
*replace* method:
b c
/ \ / \
3 a --> 4 b
^ / \ ^ / \
2 1 3 a
/ \
2 1
+-------------------------+ +-------------------------+
| | | | | |
| | 2 | | | 3 |
| | | | | |
| 3 |------------| --> | 4 |------------|
| ^ | | | ^ | | |
| | 1 | | | 2 | 1 |
(Continue reading)
RSS Feed