|Number of watchers on Github||2246|
|Number of open issues||0|
|Average time to close an issue||25 days|
|Average time to merge a PR||2 days|
|Open pull requests||0+|
|Closed pull requests||3+|
|Last commit||9 months ago|
|Repo Created||over 4 years ago|
|Repo Last Updated||4 months ago|
|Organization / Author||seven1m|
|Do you use 30-days-of-elixir? Leave a review!|
|View 30-days-of-elixir activity|
|View on github|
|Latest Open Source Launches|
Trendy new open source projects in your inbox! View examples
A walk through the Elixir language, one exercise per day for 30 days.
How am I supposed to use this?
I'm not sure! I originally wrote these exercises as I was learning the language myself. I don't know if merely reading them will be of much use though. I recommend you open each file in your favorite editor, change it, break it, rewrite the code in your own style, etc. Experiment, and if you find a mistake, then bonus points for you!
01-hello-world.exs - We start at the very beginning: our first message to the world!
02-unit-testing.exs - We'll need unit testing for the rest of the exercises, so let's do this! The built-in unit testing library ExUnit is capable and easy-to-use.
03-input-output.exs - Here we learn that file input and user input are easy. Jos has even done us a solid and duplicated some familiar Path and File methods from Ruby.
04-list.exs - What's a functional language without a List? Here we learn some simple list manipulation, and for awhile we can pretend lists are like our familiar Ruby arrays. :-)
05-map.exs - Maps are the go-to key-value structure in Elixir, and the syntax is fairly simple coming from other dynamic languages.
06-record.exs - Where are our beloved objects? In functional programming, data is just data, and Elixir gives you the Record structure to organize it a bit. Records are a little like Struct from other imperative languages, except of course they are immutable!
07-fibonacci.exs - You learn recursion by using recursion! We learn about multiple methods of the same name, pattern matching, and guard clauses, cool! Finally we do it all over again, backwards! (Hey, why not?)
08-process-ring.exs - Sometimes a contrived example is the best way to focus on the technology. For now, let's just send messages around in a ring and see how this Process thing works.
09-ping.exs - Now let's build something useful! Wow, it's easy to launch as many processes as you have increments of work. When the work is finished, send a message back to the parent and he'll assemble the results. Cool!
10-sudoku-board.exs - No objects? Pshaaw! Who needs 'em - let's use simple lists to represent our Sudoku board. Easy!
11-sudoku-solver.exs - Epic fail. Our code is pretty, but the algorithm is naive and too slow to use on a full-size board.
12-sudoku-solver-norvig.exs - Time to bring out the big guns! Here we port Peter Norvig's Holy Grail of a Solver over to Elixir. We learn how to change imperative operations on mutable state to functional ones on immutable data. This solver is freakin' fast!
13-card-deck.exs - Let's see how we might represent a deck of cards. Easy, a list of tuples! We'll also build a higher-order function to deal out the cards to players.
14-spades.exs - They're aliiiiive! Processes connect to one another and send messages, across terminal windows, machines, even teh intarwebs! Let's put this to good use and build a multi-player game of Spades. Ace of Spades FTW!
15-quine.exs - A quine is a program that prints its own source code. Let's build the smallest one we can using Elixir... sigils help a lot!
16-euler-tree.exs - Project Euler problem 67 is a fun puzzle; let's solve it with a functional language! We'll make extensive use of list comprehensions in this one.
17-dining-philosophers.exs - Pass the fork! The actor model makes certain problems a lot easier to reason about, and feeding some philosophers is one of them.
18-gen_server.exs - Here we move up a level and build a Prime Factors server using OTP GenServer behaviour.
19-supervisor.exs - This one is simple: when our Prime Factors server craps out, restart it. Easy!
20-inets.exs - Erlang's built-in inets library is nothing to be amazed by, but it gets the job done. We'll simply announce ourselves to the world again, this time via HTTP.
21-wiki.exs - Now let's build something useful, combining our knowledge of inets and some simple File IO to build a wiki web server.
I don't always build web apps, but when I do, I use low-level sockets and parse the HTTP
headers myself, said no one, ever. Turns out gen_tcp is pretty easy to use
if you want to handle socket communication.
23-digest.exs - Erlang/OTP has so many things to offer, yet simple hexdigest using sha1 isn't one of 'em. At least we get to learn one way to import external Erlang code and run it in Elixir, so not all is lost.
24-stream.exs - Let's build a better Fibonacci method using lazy streams. You can tell our understanding of the language has improved, as the amount of code to implement this is 1/10th of the size of our first foray into Fibonacci!
26-frank.exs - Here we'll make a brief incursion into the land of macros. In this exercise, we'll build a web DSL
with custom syntax. This first try we'll just use a macro to write a method.
unquote confounds a bit.
27-frank-2.exs - This version of Frank is only a little better, but lets our path matches contain any character and
utilizes pattern matching to grab the right handler method. But here we're still struggling with
al. What does it all mean?
28-frank-3.exs - Macros are starting to make a little more sense now. The final version of Frank can handle
patterns in the URL, e.g.
/foo/:id and our macro code got simpler!
29-vector.exs - For our last couple of exercises, let's do something completely different! Elixir has a list data structure, but no Vector, so let's create one... our first attempt has us learning about Hash Array Mapped Trie (HAMT), and as it turns out, using this structure for a vector wasn't the best idea.
30-vector.exs - Take 2... Thanks to Jean Niklas L'orange's excellent articles about Clojure's Vectors, we learn how to build a Bit Partitioned Vector Trie. And now, we have a Vector with constant-time access. Cool stuff!
Copyright (c) Tim Morgan
Licensed under MIT, see LICENSE file.