1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
package model.layout;
import model.html.ElementNode;
import model.html.Node;
import java.awt.*;
import java.util.*;
// Generic Layout class
public abstract class Layout {
// fuck encapsulation all my homies hate encapsulation
// but seriously, what a garbage idea: get a better language
// (please read the above comment in the voice of https://www.youtube.com/watch?v=EdWSg6YwUeo)
public Point location;
public Dimension dimension;
public final Node associatedNode;
public final Layout parent;
public Optional<Layout> previousSibling;
public Optional<Layout> nextSibling;
public ArrayList<Layout> children;
public static final int DEFAULT_WIDTH = 1000;
public static final int DEFAULT_HEIGHT = 800;
// https://developer.mozilla.org/en-US/docs/Web/HTML/Block-level_elements
public static final Set<String> BLOCK_ELEMENTS = new HashSet<>(
Arrays.asList("address", "article", "aside", "blockquote",
"details", "dialog", "dd", "div", "dl", "dt",
"fieldset", "figcaption", "figure", "footer", "form",
"h1", "h2", "h3", "h4", "h5", "h6", "header", "hgroup", "hr",
"li", "main", "nav", "ol", "p", "pre", "section", "table", "ul"));
// the big function
public abstract void layout();
public Layout(Node node, Layout parent) {
this.associatedNode = node;
this.location = new Point();
this.dimension = new Dimension();
this.parent = parent;
this.previousSibling = Optional.empty();
this.nextSibling = Optional.empty();
this.children = new ArrayList<>();
}
// eh, probably the best place to put this
// parent MAY BE nil: a handy call to Optional.ofNullable allows this
public static ArrayList<Layout> constructTree(ArrayList<Node> html, Layout parent) {
var result = new ArrayDeque<Layout>();
for (Node node : html) {
Layout layout;
switch (node) {
case ElementNode e -> {
if (BLOCK_ELEMENTS.contains(e.tag)) {
layout = new BlockLayout(node, parent);
} else {
layout = new InlineLayout(node, parent);
}
layout.children = constructTree(e.children, layout);
}
default -> {
layout = new InlineLayout(node, parent);
}
}
if (result.size() > 0) {
layout.previousSibling = Optional.of(result.getLast());
result.getLast().nextSibling = Optional.of(layout);
}
result.add(layout);
}
return new ArrayList<>(result); // haha
}
public static DocumentLayout constructTree(ArrayList<Node> html) {
var result = new DocumentLayout();
result.children = constructTree(html, result);
result.layout();
return result;
}
}
|
