Imagine you inherit a significantly large Java codebase. The code is very poor. What are the libraries and methods that might help you regain sanity?
To start:
| (def a {:k [1 2]}) | |
| (update-in a [:k 1] (constantly :ha)) |
| (def greeting-defaults {:hello (fn [who] (str "hello " who))}) | |
| (defprotocol Greeting | |
| (hello [who])) | |
| (defrecord Person [name]) | |
| (extend Person | |
| Greeting | |
| greeting-defaults) |
| :-:-:-:-:- | |
| :-:-:-:-:- | |
| :-:-:-:-:- | |
| :-:-:-:-:- | |
| :-:-:-:-:- | |
| move :X [1 0] | |
| 0 plies generated by AI (by far) | |
| :-:-:-:-:- | |
| :X:-:-:-:- |
| (set! *print-length* 10) | |
| (set! *print-level* 4) |
| // Make an array of the LatLng's of the markers you want to show | |
| var LatLngList = array (new google.maps.LatLng (52.537,-2.061), new google.maps.LatLng (52.564,-2.017)); | |
| // Create a new viewpoint bound | |
| var bounds = new google.maps.LatLngBounds (); | |
| // Go through each... | |
| for (var i = 0, LtLgLen = LatLngList.length; i < LtLgLen; i++) { | |
| // And increase the bounds to take this point | |
| bounds.extend (LatLngList[i]); | |
| } | |
| // Fit these bounds to the map |
Imagine you inherit a significantly large Java codebase. The code is very poor. What are the libraries and methods that might help you regain sanity?
To start:
| ;; http://software-lab.de/doc/faq.html#interpreted | |
| (de incMe () | |
| (do 8 | |
| (printsp 0) | |
| (inc (cdadr (cdadr incMe))) ) ) | |
| : (incMe) | |
| 0 1 2 3 4 5 6 7 -> 8 | |
| : (incMe) |
| (de frame @ | |
| (when (next) | |
| (link | |
| (make | |
| (if (= 10 (link (arg))) | |
| (apply link (head 2 (rest))) | |
| (when (= 10 (+ (arg) (link (next)))) | |
| (link (car (rest))) ) ) ) ) | |
| (pass frame) ) ) |
| openssl sha1 ${FILE_PATH} | sed 's/SHA1(.*)= //' |
| service http | |
| { | |
| disable = no | |
| socket_type = stream | |
| user = root | |
| wait = no | |
| redirect = 127.0.0.1 3000 | |
| log_type = FILE /tmp/somefile.log | |
| } |