tom/qubed
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add nicer formatting for html

Browse Source
This commit is contained in:
Tom 2025-02-12 15:06:26 +00:00
parent 37298b7096
commit ee1bee2a01
2 changed files with 7 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
docs/index.md
View File

@ -66,7 +66,8 @@ q = Qube.from_dict({
}, },
}) })
q.print() # depth controls how much of the tree is open when rendered as html.
q.html(depth=100)
``` ```
But it's clear that the above tree contains a lot of redundant information. Many of the subtrees are identical for example. Indeed in practice a lot of our data turns out to be 'nearly dense' in that it contains many dense datacubes within it. But it's clear that the above tree contains a lot of redundant information. Many of the subtrees are identical for example. Indeed in practice a lot of our data turns out to be 'nearly dense' in that it contains many dense datacubes within it.
@ -74,7 +75,7 @@ But it's clear that the above tree contains a lot of redundant information. Many
There are many valid ways one could compress this tree. If we add the restriction that no identical key=value pairs can be adjacent then here is the compressed tree we might get: There are many valid ways one could compress this tree. If we add the restriction that no identical key=value pairs can be adjacent then here is the compressed tree we might get:
```{code-cell} python3 ```{code-cell} python3
q.compress().print() q.compress()
```` ````
Without the above restriction we could, for example, have: Without the above restriction we could, for example, have:
@ -91,7 +92,7 @@ but we do not allow this because it would mean we would have to take multiple br
What we have now is a tree of dense datacubes which represents a single larger sparse datacube in a more compact manner. For want of a better word we'll call it a Qube. What we have now is a tree of dense datacubes which represents a single larger sparse datacube in a more compact manner. For want of a better word we'll call it a Qube.
### HTML Output ### HTML Output
```{code-cell} python3 ```{code-cell} python3
q.compress().html() q.compress().html()

3
src/python/qubed/tree_formatters.py
View File

@ -79,6 +79,9 @@ def node_tree_to_html(node : TreeLike, depth = 1, **kwargs) -> str:
.qubed-tree-view { .qubed-tree-view {
font-family: monospace; font-family: monospace;
white-space: pre; white-space: pre;
font-family: SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;
font-size: 12px;
line-height: 1.4;
} }
.qubed-tree-view details { .qubed-tree-view details {
# display: inline; # display: inline;