| class E(BaseException): | |
| def __new__(cls, *args, **kwargs): | |
| return cls | |
| def a(): yield | |
| a().throw(E) |
In a functional language, writing recursive functions is common, but it is also possible to write recursive values. Here is a simple example of a recursive value:
ones = 1 :: onesThis is an infinite loop. We just keep growing the ones list to infinity. So #873 logged folks running into this and made it an error. This was especially nice for cases like x = x + 1 where folks were expecting Elm to allow mutation.
| #!/usr/bin/env python2 | |
| # -*- coding: utf-8 -*- | |
| from __future__ import division | |
| import numpy as np | |
| from math import cos, sin, pi, sqrt, atan2 | |
| d2r = pi/180 | |
| class Geometry(object): | |
| def circle_intersection(self, circle1, circle2): |
| # local port forwarding | |
| # the target host 192.168.0.100 is running a service on port 8888 | |
| # and you want that service available on the localhost port 7777 | |
| ssh -L 7777:localhost:8888 [email protected] | |
| # remote port forwarding | |
| # you are running a service on localhost port 9999 | |
| # and you want that service available on the target host 192.168.0.100 port 12340 |