O1IVER.NET

github.com

o1iver (Oliver Stollmann) · GitHub

https://github.com/o1iver

X6f;liver@stollmann.net. May 20, 2010. Super simple file based blog (really insanely simple.). Markov Chain based text generator. 0 contributions in the last year. Summary of pull requests, issues opened, and commits. Learn how we count contributions. O1iver has no activity during this period. You can't perform that action at this time. You signed in with another tab or window. Reload. To refresh your session. You signed out in another tab or window. Reload. To refresh your session.

blog.o1iver.net

Sorting With Lambda (Python)

http://blog.o1iver.net/2011/07/27/python-sorting-with-lambda.html

Backward Induction - A blog by Oliver Stollmann. Sorting With Lambda (Python). Today somebody on #python on freenode asked about some examples of when they would need lambdas in python. Here is a simple example of how to do a non-trivial sort:. Raquo; Python implementation of the Discrete Fourier Transform and its Inverse. Raquo; Analysing logs with simple UNIX commands. Raquo; Functional Purity (the dangers of non-referentially transparent functions). A blog by Oliver Stollmann.

blog.o1iver.net

Runtime Class Change (Python)

http://blog.o1iver.net/2011/10/22/python-runtime-class-changes.html

Backward Induction - A blog by Oliver Stollmann. Runtime Class Change (Python). Not much need to explain here, just check out the example (I am changing the class of the object at runtime). And I am a woman! And I am a man! Raquo; Python implementation of the Discrete Fourier Transform and its Inverse. Raquo; Analysing logs with simple UNIX commands. Raquo; Functional Purity (the dangers of non-referentially transparent functions). A blog by Oliver Stollmann.

blog.o1iver.net

Snap Framework Basics

http://blog.o1iver.net/2011/11/17/snap-framework-basics.html

Backward Induction - A blog by Oliver Stollmann. This post is a Work-In-Procress. As I dive deeper and deeper into Snap. I will keep updating this with information that I think is key to understanding Snap. I usually develop in Python. Although that has more to do with the languages look-and-feel than anything else. After almost ten years of progamming I have come to the conclusion that that is one of the most important aspects of a language. If you like static-typing. Haskell is a beauty. If Java. So be...

blog.o1iver.net

Function Composition (Python)

http://blog.o1iver.net/2011/08/09/python-function-composition.html

Backward Induction - A blog by Oliver Stollmann. If you know basic mathematics function composition will seem like a very simple and obvious thing. You are applying one function and then applying that function's result to another function. Note: for this to work the return value(s) of the inner function must match the input expected by the outer function. The ability to compose functions is used mostly in functional programming languages (it is the main idea of that big terrible idea called.

blog.o1iver.net

Handling plain/gzip HTTP data on the fly (Python)

http://blog.o1iver.net/2011/08/26/python-handling-plaintext-gzip-http-data-on-the-fly.html

Backward Induction - A blog by Oliver Stollmann. Handling plain/gzip HTTP data on the fly (Python). So today I had a problem that a certain data provider would return either plain text or gziped data depending on the size of the content. The thing was that you didn't know beforehand. So here is how you handle these two datatype on the fly (note: I am using the requests library. Downloaded data of type:. Raise value error in case of other mime type. Received data of invalid type. A blog by Oliver Stollmann.

blog.o1iver.net

Python implementation of the Discrete Fourier Transform and its Inverse

http://blog.o1iver.net/2011/12/06/python-discrete-fourier-transformation.html

Backward Induction - A blog by Oliver Stollmann. Python implementation of the Discrete Fourier Transform and its Inverse. Are exceptionally useful for signal analysis. Here is a python implementation of the discrete fourier transform and it's inverse. Note: computing fourier transforms like this is not efficient. If you actually need to compute fourier tranforms consider using fast fourier transforms. Inverse discrete fourier transform. Note: I have only tested this in python 3. A blog by Oliver Stollmann.

blog.o1iver.net

Caching Referentially Transparent Functions (Python)

http://blog.o1iver.net/2011/11/05/python-caching-referentially-transparent-functions.html

Backward Induction - A blog by Oliver Stollmann. Caching Referentially Transparent Functions (Python). Because such a function will always produce the same output given a same input, it is quite easy to cache. Note: this is an illustration, with shortcomings. For example: calling a function with named arguments in different orders will cause a cache miss, although this is still an equivalent call. Raquo; Python implementation of the Discrete Fourier Transform and its Inverse. A blog by Oliver Stollmann.

blog.o1iver.net

Functional Purity (the dangers of non-referentially transparent functions)

http://blog.o1iver.net/2011/11/27/functional-purity.html

Backward Induction - A blog by Oliver Stollmann. Functional Purity (the dangers of non-referentially transparent functions). People have asked me what is so attractive about a purely functional language like Haskell. Well I thought that instead of tyring to convince people with words I would simply give an example. Here is a very simple piece of C code that shows the dangers of impure code:. What is the value of oliver- name now? You cannot guarantee it! So what's the problem? The type of the. Because of...