Skip to content

Instantly share code, notes, and snippets.

@lazywithclass

lazywithclass/blog-post.md

Last active March 21, 2017 04:08
Show Gist options
  • Save lazywithclass/f9572d7fcb6bd4a1f11fe1ebce035d48 to your computer and use it in GitHub Desktop.
Save lazywithclass/f9572d7fcb6bd4a1f11fe1ebce035d48 to your computer and use it in GitHub Desktop.
Download ZIP
[RC Diary] Presentations and stuff working (-89)
Raw
blog-post.md

[RC Diary] Presentations and stuff working (-89)

Cerebro

Got to the point where I hve two mutations

  • true -> false
  • <= -> <

Now, besides being very happy about how ClojureScript is not getting too much in my way, I have the following taks for Cerebro:

  • pass around simpler data structures, this tutorial and this other resource, both explaining deftype should help
  • rename and reassign functions were applicable
  • solve the "variable already defined in this scope" problem (could this exploit hygienic macros theory?)

Project lamp

We added a REPL to the first chapter, so excited! It's coming along pretty well. This weekend I will check if the contents are approachable by an inexperienced eye like mine (because ultimately this is our goal).

Plans

I've been dragging along lots of stuff recently, as I was concentrating mainly on Cerebro and Project Lamp.

For this weekend I want to shorten that list, so:

Videos from Chomsky

For when you're sad / in need of inspiration / need to pause

Out of the tar pit

Fogus single most favourite whitepaper, worth a read right?

Prepare that in time for Monday for the whitepaper reading group.

https://github.com/papers-we-love/papers-we-love/blob/master/design/out-of-the-tar-pit.pdf?raw=true

Lazy evaluation

https://en.wikipedia.org/wiki/Lazy_evaluation

Come up with a simple definition and an example in a language that has lazy evaluation, can I do it in JavaScript? What about doing it in Clojure?

Skip list

Where is it useful? What's the main idea behind it?

https://en.wikipedia.org/wiki/Skip_list

Dijkstra algorithm

Code a visual representation of how it radiates into a graph.

http://www.geeksforgeeks.org/greedy-algorithms-set-7-dijkstras-algorithm-for-adjacency-list-representation/

Also have a look at this explanation about how shortest path work for real world problems.

And then there's the list

The last two should be easy, the second too, I just need time to go through it

  • still need some attention needed for timsort, radix sort
  • chapter 3 of the little schemer in Clojure
  • allow some time to think
  • find a new apartment
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment