I hereby claim:
- I am stdcall on github.
- I am nkhodyunya (https://keybase.io/nkhodyunya) on keybase.
- I have a public key whose fingerprint is B8D6 DA8C EAB0 A675 990A 9049 C160 6237 8DA2 F83B
To claim this, I am signing this object:
| export Version=3.4.2 # OpenCV version | |
| env PYTHON_CONFIGURE_OPTS="--enable-shared" pyenv install 3.7.0 | |
| pyenv virtualenv 3.7.0 opencv | |
| pyenv activate opencv | |
| pyenv rehash | |
| pip install numpy | |
| cd ~/Downloads |
I hereby claim:
To claim this, I am signing this object:
| -- Source: Simon Thompson – Haskell: The Craft of Functional Programming | |
| -- http://www.haskellcraft.com/craft3e/Home.html | |
| -- Chapter 17, Lazy Programming, p. 424 | |
| -- A permutation of a list is a list with the same elements in different order. | |
| -- For a list of n elements, there are n! permutations of the list. | |
| -- 1) The empty list has one permutation, itself. If xs is not empty, a | |
| -- permutation is given by picking an element x from xs and putting x at the | |
| -- front of a permutation of the remainder xs with x removed. |
| myFoldl :: (a -> b -> a) -> a -> [b] -> a | |
| myFoldl f z xs = foldr step id xs z | |
| where step x g a = g (f a x) |
| for i in *.srt; do iconv -f cp1251 -t utf-8 -o $i.new $i; done | |
| rm *.srt | |
| for i in *.new; do mv $i ${i%.new}; done |