-
-
Notifications
You must be signed in to change notification settings - Fork 43
/
test.html
149 lines (110 loc) · 3.65 KB
/
test.html
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
<!DOCTYPE html><html><head><meta charset="utf-8"/><title>StrapDown.js Test page</title></head><body><xmp>
# Strapdown Test Page
> [Source](http://strapdown.ztx.io/test.html)
## Test Mathjax
If you lend me 5\$, I will have 10\$ in my pocket. Do you know $\sqrt{3x-1}+(1+x)^2$ and $x_{1,2} = \frac{-b \pm \sqrt{b^2-4ac}}{2b}.$
And what's this???
$$ \frac{R_a T_{im}}{V_{im}} $$
| Align Left | Align Center | Align Right |
| ------------- |:-------------:| -----:|
| test one | dollar | $1600 |
| double dollar | also works | \$\$12 |
| zebra stripes | are neat | \$\$1 |
Hey, let's do something fantastic.
$$
\mathbf{I}_n = \left. \left(
\vphantom{
\begin{array}{c}
1\\1\\1\\1\\1
\end{array}
}
\smash{
\underbrace{
\begin{array}{ccccc}
1&0&0&\cdots &0\\ 0&1&0&\cdots &0\\ 0&0&1&\cdots &0\\ \vdots&&&\ddots&\\ 0&0&0&\cdots &1
\end{array}
}
_{n\text{ columns}}
}
\right)\right\} \,n\text{ rows}
$$
Beautiful things always happen
$$ \left( \sum_{k=1}^n a_k b_k \right)^2 \leq \left( \sum_{k=1}^n a_k^2 \right) \left( \sum_{k=1}^n b_k^2 \right) $$
Some more basic ones
$$ (a \pm b) \% m \equiv (a \% m \pm b \% m ) \% m $$
$$ a \equiv b \pmod{m} \rightarrow ac \equiv bc \pmod{m} $$
$$ \left.\begin{array}{l} a\equiv b \pmod{m} \\ x \equiv y\pmod{m} \end{array}\right\} ax \equiv by \pmod{m} $$
$$ \left.\begin{array}{l} ac \equiv bc \pmod{m} \\ (c,m)=1 \end{array}\right\} a\equiv b \pmod{m} $$
$$ a \equiv b \pmod{cm} \rightarrow a \equiv b \pmod{m} $$
$$ \left.\begin{array}{l} a\equiv b\pmod{m}\\ n | m \end{array}\right\} a\equiv b\pmod{n}$$
$$ 1 \times 2 $$
## An Identity of Ramanujan
$$ \frac{1}{\Bigl(\sqrt{\phi \sqrt{5}}-\phi\Bigr) e^{\frac25 \pi}} = 1+\frac{e^{-2\pi}} {1+\frac{e^{-4\pi}} {1+\frac{e^{-6\pi}} {1+\frac{e^{-8\pi}} {1+\ldots} } } } $$
# code syntax highlight
## html test
```html
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta name="keywords" content=""/>
<meta name="description" content=""/>
<link rel="shortcut icon" href="/static/img/favicon.ico"/>
<link rel="stylesheet" type="text/css" href=""/>
<title>title</title>
</head>
<body>
<script type="text/javascript" src="here/but/nowhere.js"></script>
</body>
</html>
```
## python test
``` python
@requires_authorization
def somefunc(param1='', param2=0):
'''A docstring'''
if param1 > param2: # interesting
print 'Greater'
return (param2 - param1 + 1) or None
class SomeClass:
pass
a = int(3)
>>> message = '''interpreter
... prompt'''
```
For `python` use `type(name, bases, dict)` to construct dynamic class and subclass base classes.
## bash test
```bash
#!/bin/sh
dir=.
mode="linear" # linear or recursion
[ ! -z "$1" ] && dir="$1"
shift
echo "playing dir $dir"
while :; do
if [[ "x-l" == "x$1" ]]; then
mode="linear"
elif [[ "x-r" == "x$1" ]]; then
mode="recursion"
elif [[ -z "$1" ]]; then
break
fi
done
IFS=$'\n'
```
# Test nginx config file
```
location ~ \.php$ {
try_files $uri = /404.html;
fastcgi_pass unix:/run/php-fpm/php-fpm.sock;
fastcgi_split_path_info ^(.+\.php)(/.+)$;
fastcgi_param SCRIPT_FILENAME $document_root/$fastcgi_script_name;
fastcgi_index index.php;
include fastcgi_params;
root /usr/share/nginx/html;
}
```
</xmp>
<!-- <script type="text/javascript" src="http://0.0.0.0/s/md/strapdown.min.js?mathjax=y"></script>$ -->
<script type="text/javascript" src="http://cdn.ztx.io/strapdown/strapdown.min.js"></script>$
</body></html>