summaryrefslogtreecommitdiff
path: root/macros/latex/contrib/pynotebook/doc/pynotebook-examples-pitonpylautex.tex
blob: 86123fccfa4162e2f112ffb6f6ed6d425bdb0070 (plain)
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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
% !TeX TXS-program:compile = txs:///arara
% arara: lualatex: {shell: yes, synctex: yes, interaction: batchmode}
% arara: lualatex: {shell: yes, synctex: yes, interaction: batchmode} if found('log', '(undefined references|Please rerun|Rerun to get)')

\documentclass[a4paper,11pt]{article}
\def\PLver{0.1.0}
\usepackage[margin=1.5cm]{geometry}
\usepackage{pynotebook}
\usepackage[executable=python]{pyluatex}
\usepackage{codehigh}

\begin{document}

\part*{pynotebook (\PLver), with piton and pyluatex}

\section{Preamble}

\begin{codehigh}
\documentclass{article}
\usepackage{pynotebook}
\usepackage[executable=python]{pyluatex}  % with a specific compilation !!
\end{codehigh}

\section{Examples of text blocks}

\begin{codehigh}
\begin{NotebookPitonMarkdown}{\linewidth}
{\Large\bfseries This is a test for a \textsf{Markdown} block.}

It's possible to use \LaTeX{} formulas, like %
\[
  \left\lbrace\begin{array}{l}
    F_0 = 0\\
    F_1 = 1 \\
    F_{n+2} = F_{n+1} + F_n
  \end{array}\right.
\]
\end{NotebookPitonMarkdown}

\begin{NotebookPitonRaw}{\linewidth}
This is a sample block, with RAW output.

Just to use all capacities of Jupyter notebook ;-)
\end{NotebookPitonRaw}
\end{codehigh}

\begin{NotebookPitonMarkdown}{\linewidth}
{\Large\bfseries This is a test for a \textsf{Markdown} block.}

It's possible to use \LaTeX{} formulas, like %
\[
\left\lbrace\begin{array}{l}
F_0 = 0\\
F_1 = 1 \\
F_{n+2} = F_{n+1} + F_n
\end{array}\right.
\]
\end{NotebookPitonMarkdown}

\begin{NotebookPitonRaw}{\linewidth}
This is a sample block, with RAW output.

Just to use all capacities of Jupyter notebook ;-)
\end{NotebookPitonRaw}

\section{Examples of code blocks (with execution of code !)}

\begin{codehigh}
\begin{NotebookPitonIn}{0.75\linewidth}
def fibonacci_of(n) :
  if n in {0,1} :
    return n
  return fibonacci_of(n-1) + fibonacci_of(n-2)

[fibonacci_of(n) for n in range(15)]
\end{NotebookPitonIn}
\end{codehigh}

\begin{NotebookPitonIn}{0.75\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

[fibonacci_of(n) for n in range(15)]
\end{NotebookPitonIn}

\begin{codehigh}
\begin{NotebookPitonOut}{0.75\linewidth}
def fibonacci_of(n) :
  if n in {0,1} :
    return n
  return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonOut}
\end{codehigh}

\begin{NotebookPitonOut}{\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonOut}

\begin{codehigh}
\SetJupyterLng{fr}
\SetJupyterParSkip{\baselineskip}
\setcounter{JupyterIn}{11}
\end{codehigh}

\SetJupyterLng{fr}
\SetJupyterParSkip{\baselineskip}
\setcounter{JupyterIn}{14}

\begin{codehigh}
\begin{NotebookPitonIn}[center]{0.75\linewidth}
def fibonacci_of(n) :
  if n in {0,1} :
    return n
  return fibonacci_of(n-1) + fibonacci_of(n-2)

[fibonacci_of(n) for n in range(15)]
\end{NotebookPitonIn}
\end{codehigh}

\begin{NotebookPitonIn}[center]{0.75\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

[fibonacci_of(n) for n in range(15)]
\end{NotebookPitonIn}

\begin{codehigh}
\begin{NotebookPitonOut}[center]{0.75\linewidth}
def fibonacci_of(n) :
  if n in {0,1} :
    return n
  return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonOut}
\end{codehigh}

\begin{NotebookPitonOut}[center]{0.75\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonOut}

\begin{codehigh}
\begin{NotebookPitonConsole}[center]{0.75\linewidth}
def fibonacci_of(n) :
  if n in {0,1} :
    return n
  return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonConsole}
\end{codehigh}

\begin{NotebookPitonConsole}[center]{0.75\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonConsole}

\pagebreak

\section{Global example}

\SetJupyterParSkip{default}
\setcounter{JupyterIn}{0}

\begin{NotebookPitonMarkdown}{\linewidth}
{\Large\bfseries This is a test for a \textsf{Markdown} block.}

It's possible to use \LaTeX{} formulas, like %
\[
\left\lbrace\begin{array}{l}
F_0 = 0\\
F_1 = 1 \\
F_{n+2} = F_{n+1} + F_n
\end{array}\right.
\]
\end{NotebookPitonMarkdown}

\begin{NotebookPitonRaw}{\linewidth}
This is a sample block, with RAW output.

Just to use all capacities of Jupyter notebook ;-)
\end{NotebookPitonRaw}

\begin{NotebookPitonIn}{\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

[fibonacci_of(n) for n in range(15)]
\end{NotebookPitonIn}

\begin{NotebookPitonOut}{\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(15)])
\end{NotebookPitonOut}

\begin{NotebookPitonRaw}{\linewidth}
Let’s compute Fibonacci terms from 10th to 20th :-)
\end{NotebookPitonRaw}

\begin{NotebookPitonIn}{\linewidth}
[fibonacci_of(n) for n in range(10,21)]
\end{NotebookPitonIn}

\begin{NotebookPitonConsole}{\linewidth}
def fibonacci_of(n) :
	if n in {0,1} :
		return n
	return fibonacci_of(n-1) + fibonacci_of(n-2)

print([fibonacci_of(n) for n in range(10,21)])
\end{NotebookPitonConsole}

\end{document}