D Paste by downs
Description: html.d
|
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 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 | module html; import Tools, http, common_chains; import std.string; interface element { void toHtml(inout char[]); } class replaceText : element, cleanable { private char[][] reps; private element dad; void clean() { if (auto c=cast(cleanable)dad) c.clean; } this(element parent, char[][] reps...) { dad=parent; foreach (r; reps) this.reps~=r.dup; } void toHtml(inout char[] c) { char[] prelim; prelim.length=0; dad.toHtml(prelim); char[][][] pairs; /// I always wanted to do that assert((reps.length%2)==0); pairs.length=reps.length>>1; foreach(inout p; pairs) p.length=2; for (int i=0; i<reps.length>>1; ++i) { pairs[i][0]=reps[i*2]; pairs[i][1]=reps[i*2+1]; } foreach (p; pairs) prelim=replace(prelim, p[0], p[1]); c~=prelim; } } interface html_object { tree htmlEncode(HTTPRequest); } // Split, _e_xcluding _q_uotes char[][] eqsplit(char[] string, char delim) { assert(delim!='"'); char[][] result; result.length=1; bool quoting=false; foreach (s; string) { if (quoting) { if (s=='"') quoting=false; result[length-1]~=s; } else { if (s=='"') quoting=true; if (s==delim) result.length=result.length+1; else { result[length-1]~=s; } } } return result; } class tag : element, cleanable { char[] name; char[][char[]] properties; void clean() { name.length=0; name=null; foreach (i, inout e; properties) { e.length=0; e=null; properties.remove(i); } } this(char[] n) { if (find(n, " ")!=-1) { name=n[0..find(n, " ")]; char[] rest=n[find(n, " ")+1 .. length]; static char[] grab(inout char[] inp) { static char[] stringstart="\"'"; // Characters that mark the start of a string if (!inp.length) return ""; char[] res; res~=carve(inp); char startchar=0; foreach (c; stringstart) if (c==res[0]) startchar=c; if (!startchar) return res; while (inp.length&&(inp[0]!=startchar)) res~=carve(inp); return res; } while (rest.length) { while (rest.length&&(rest[0]==' ')) rest=rest[1..length]; char[] pair; while (rest.length&&(rest[0]!=' ')) pair~=grab(rest); char[] name; while (pair.length&&(pair[0]!='=')) name~=grab(pair); assert(pair.length); assert(pair[0]=='='); properties[name]=pair[1..length]; } } else name=n; } static tag opCall(char[] n) { return new tag(n); } void toHtml(inout char[] c) { c~="<"; c~=name; foreach (i, p; properties) { c~=" "; c~=i; c~="="; c~=p; } c~=">"; } } /// \todo proper encoding class text : element, cleanable { private char[] data; this(char[] t) { data=t; } void clean() { data.length=0; data=null; } void toHtml(inout char[] c) { c~=data; } static text opCall(char[] t) { return new text(t); } } /// A tree without a root tag class LooseTree : element, cleanable { element[] children; void clean() { foreach (e; children) if (auto c=cast(cleanable)e) c.clean; } this(element[] elements ...) { foreach (e; elements) if (e) children~=e; } void toHtml(inout char[] st) { foreach (c; children) c.toHtml(st); } static LooseTree opCall(element[] elements ...) { return new LooseTree(elements); } } class tree : LooseTree { tag root; this(tag t, element[] elements ...) { root=t; super(elements); } void clean() { root.clean; super.clean; } this(char[] t, element[] elements ...) { this(new tag(t), elements); } void toHtml(inout char[] c) { root.toHtml(c); foreach (ch; children) ch.toHtml(c); c~="</"~root.name~">"; } static tree opCall(char[] t, element[] elements ...) { return new tree(new tag(t), elements); } } tree[] gather(tree source) { tree[] result; foreach (e; source.children) { if (cast(tree)e) { result~=cast(tree)e; result~=gather(cast(tree)e); } } return result; } tree[] gather(element[] sources) { tree[] result; foreach (t; sources) if (cast(tree)t) result~=gather(cast(tree)t); return result; } tree[] select(tree[] trees, char[] tag) { tree[] result; foreach (t; trees) if (t.root.name==tag) result~=t; return result; } tree makeTable(int rows, int cols, element[] elements ...) { assert(cols>0); if (!elements.length) return new tree("table", new text("No elements found")); if (rows<0) rows=int.max; size_t counter=0; tree table=new tree("table"); for (int i=0; i<rows; ++i) { tree row=new tree("tr"); table.children~=row; for (int j=0; j<cols; ++j) { tree col=new tree("td"); row.children~=col; col.children~=elements[counter++]; if (counter>=elements.length) return table; } } return table; } tree uglyCellwrap(char[] params, element e) { tree t=makeTable(1,1,e); t.root=tag("table "~params); return t; } tree findFirst(tree Tree, bool delegate(tree) match) { if (match(Tree)) return Tree; foreach (c; Tree.children) if (tree t=cast(tree)c) if (tree tm=findFirst(t, match)) return tm; return null; } class stylesheet { static class entry { char[] match; char[] style; this(char[] m, char[] s) { match=m.dup; style=s.dup; } static entry opCall(char[] m, char[] s) { return new entry(m, s); } } entry[] entries; } /// css stylesheet in the head tag of a page class headsheet : stylesheet, appliable { this() { /// On mouse over: display (parent) entries~=stylesheet.entry(".omod", "display: none;"); entries~=stylesheet.entry(".omodp:hover .omod", "display: block;"); } void apply(HTTPResponse rsp) { auto ts=cast(TreeSource)(rsp.payload); assert(ts); tree Tree=findFirst(ts.Tree, delegate bool(tree t) { if (tolower(t.root.name)=="head") return true; return false; } ); Tree.children~=new tree("style type=\"text/css\"", delegate LooseTree() { LooseTree t=new LooseTree; foreach (e; entries) t.children~=text(e.match~"{"~e.style~"} "); return t; }()); // Perform the update <b>before</b> calling getLength! ts.update; // Remember: when changing the response, the response length also changes. rsp.params["Content-Length"]=.toString(rsp.payload.getLength); } } |