pip install codesnipper

examples/cs101_instructor  # This directory contains the (hidden) instructor files. You edit these
examples/cs101_students    # This directory contains the (processed) student files. Don't edit these
examples/cs101_output      # This contains automatically generated contents (snippets, etc.).

def myfun(a,b): #!f return the sum of a and b
    """ The doc-string is not removed. """
    sm = a+b
    return sm

if __name__ == "__main__":
    from snipper.snip_dir import snip_dir
    snip_dir("./cs101_instructor", "./cs101_students", output_dir="./cs101_output")

def myfun(a,b): 
    """ The doc-string is not removed. """
    # TODO: 1 lines missing.
    raise NotImplementedError("return the sum of a and b")
    return sm

def primes_sieve(limit):
    limitn = limit+1 #!b
    primes = range(2, limitn)
    for i in primes:
        factors = list(range(i, limitn, i))
        for f in factors[1:]:
            if f in primes:
                primes.remove(f) #!b Compute the list `primes` here of all primes up to `limit`
    return primes
width, height = 2, 4
print("Area of square of width", width, "and height", height, "is:")
print(width*height) #!b #!b Compute and print area here
print("and that is a fact!")

def primes_sieve(limit):
    # TODO: 8 lines missing.
    raise NotImplementedError("Compute the list `primes` here of all primes up to `limit`")
    return primes
width, height = 2, 4
print("Area of square of width", width, "and height", height, "is:")
# TODO: 1 lines missing.
raise NotImplementedError("Compute and print area here")
print("and that is a fact!")

width, height = 2, 4
print("Area of square of width", width, "and height", height, "is:") #!s
print(width*height)  #!s  # This is an example of a simple cutout
print("and that is a fact!")
print("An extra cutout") #!s #!s  # This will be added to the above cutout
def primes_sieve(limit): #!s=a # A named cutout
    limitn = limit+1
    primes = range(2, limitn)
    for i in primes: #!s=b A nested/named cutout.
        factors = list(range(i, limitn, i))
        for f in factors[1:]:
            if f in primes:
                primes.remove(f)  #!s=b
    return primes #!s=a

# s_tag.py
print("Area of square of width", width, "and height", height, "is:") 
print(width*height)  
print("An extra cutout")

# s_tag.py
def primes_sieve(limit): 
    limitn = limit+1
    primes = range(2, limitn)
    for i in primes: #!s=b A nested/named cutout.
        factors = list(range(i, limitn, i))
        for f in factors[1:]:
            if f in primes:
                primes.remove(f)  #!s=b
    return primes

# s_tag.py
    for i in primes: 
        factors = list(range(i, limitn, i))
        for f in factors[1:]:
            if f in primes:
                primes.remove(f)

if __name__ == "__main__":
    print("Here are the first 4 square numbers") #!o=a
    for k in range(1,5):
        print(k*k, "is a square")
    #!o=a
    print("This line will not be part of a cutout.")
    width, height = 2, 4 #!o=b
    print("Area of square of width", width, "and height", height, "is:")
    print(width*height)
    print("and that is a fact!") #!o=b

Here are the first 4 square numbers
1 is a square
4 is a square
9 is a square
16 is a square

Area of square of width 2 and height 4 is:
8
and that is a fact!

for animal in ["Dog", "cat", "wolf"]: #!i=a
    print("An example of a four legged animal is", animal) #!i=a
#!i=b
def myfun(a,b):
    return a+b
myfun(3,4) #!i=b
# Snipper will automatically insert an 'enter' after the function definition.

>>> for animal in ["Dog", "cat", "wolf"]:
...     print("An example of a four legged animal is", animal)
... 
An example of a four legged animal is Dog
An example of a four legged animal is cat
An example of a four legged animal is wolf

>>> def myfun(a,b):
...     return a+b
...
>>> myfun(3,4)
7

\documentclass{article}
\usepackage{url,graphics,rotating,hyperref}
\usepackage{cleveref}
\usepackage{showlabels}
\begin{document}
\section{First section}\label{sec1}
Math is hard \cite{bertsekasII,rosolia2018data,herlau}, see also \cref{eq1} and \cref{fig1}.
\begin{equation}
	2+2 = 4 \label{eq1}
\end{equation}
\begin{figure}\centering
\includegraphics[width=.8\linewidth]{br}\caption{A figure}\label{fig1}
\end{figure}
\bibliographystyle{alpha}
\bibliography{library}						
\end{document}

def myfun():
    """
    Simple aux references \ref{eq1} in \ref{sec1}.
    Simple bibtex citations: \cite{bertsekasII} and \cite[Somewhere around the middle]{herlau}
    Example of custom command (reference notes)
    > \nref{fig1}
    Other example of custom command (reference assignment)
    > \aref2{sec1}
    """
    print("See \ref{sec1}")  # Also works.
    return 42

from snipper.snip_dir import snip_dir
from snipper.load_citations import get_aux, get_bibtex
def main():
    bibfile = get_bibtex('latex/library.bib')
    auxfile = get_aux('latex/index.aux')
    references = dict(bibtex=bibfile,
                      aux=auxfile,
                      commands=[dict(command='\\aref2', output="(Assignment 2, %s)", aux=auxfile),
                                dict(command='\\nref', output="\cite[%s]{herlau}", aux=auxfile),
                               ])
    snip_dir("./cs101_instructor", "./cs101_students", output_dir="./cs101_output", references=references)
if __name__ == "__main__":
    main()

"""
References:
  [Ber07] Dimitri P. Bertsekas. Dynamic Programming and Optimal Control, Vol. II. Athena Scientific, 3rd edition, 2007. ISBN 1886529302.
  [Her21] Tue Herlau. Sequential decision making. (See 02465_Notes.pdf), 2021.
"""
def myfun():
    """
    Simple aux references eq. (1) in Section 1.
    Simple bibtex citations: (Ber07) and (Her21, Somewhere around the middle)
    Example of custom command (reference notes)
    > (Her21, Figure 1)
    Other example of custom command (reference assignment)
    > (Assignment 2, Section 1)
    """
    print("See Section 1")  # Also works.
    return 42

import numpy as np  
# Implement a sieve here.
def primes_sieve(limit):
    limitn = limit+1 #!b
    primes = range(2, limitn)
    for i in primes:
        factors = list(range(i, limitn, i))
        for f in factors[1:]:
            if f in primes:
                primes.remove(f)
    return primes #!b
# Example use: print(primes_sieve(42))

import numpy as np  
# Implement a sieve here.
def primes_sieve(limit):
    #             primes.remove(f)
    #         if f in primes:
    #     factors = list(range(i, limitn, i))
    # for i in primes:
    # 
    # limitn = limit+1 
    # return primes 
    # primes = range(2, limitn)
    #     for f in factors[1:]:
# Example use: print(primes_sieve(42)) 
raise NotImplementedError('Complete the above program')

import numpy as np  
# Implement a sieve here.
def primes_sieve(limit):
    # ?????? = ?????+1 
    # ?????? = ?????(2, ??????)
    # 
    # for ? in ??????:
    #     ??????? = ????(?????(?, ??????, ?))
    #     for ? in ???????[1:]:
    #         if ? in ??????:
    #             ??????.??????(?)
    # return ?????? 
# Example use: print(primes_sieve(42)) 
raise NotImplementedError('Complete the above program')

import numpy as np  
# Implement a sieve here.
def primes_sieve(limit):
    # limitn =????????
    # primes = ran?????????????
    # 
    # for i in????????
    #     factors = list(ra??????????????????
    #     for f in f???????????
    #         if f in????????
    #             primes.r????????
    # return???????
# Example use: print(primes_sieve(42)) 
raise NotImplementedError('Complete the above program')

@online{codesnipper,
	title={Codesnipper (0.1.0): \texttt{pip install codesnipper}},
	url={https://lab.compute.dtu.dk/tuhe/snipper},
	urldate = {2021-09-07}, 
	month={9},
	publisher={Technical University of Denmark (DTU)},
	author={Tue Herlau},
	year={2021},
}