• Code Golf: New Year Tree

    Let's celebrate geeky New Year by drawing New Year Tree using Clojure!

    Read on →
  • Clojure Design Patterns

    Quick overview of the classic Design Patterns in Clojure

    Read on →
  • Littlepot: Autofilled Cache

    Cook, little pot, cook!

    -- The Magic Porridge Pot, Brothers Grimm

    Read on →
  • Spark in Clojure

    Apache Spark is a fast and general engine for large-scale data processing.

    100 times faster than Hadoop.

    Everyone knows SQL. But traditional databases are not good in hadling big amount of data. Nevertheless, SQL is a good DSL for data processing and it is much easier to understand Spark if you have similar query implemented in SQL.

    This article shows how common SQL queries implemented in Spark.

    Read on →
  • Emacs: org mode

    Emacs org-mode use cases, for non-programmers.

    Read on →
  • Code Golf: Calculating PI

    Let's celebrate Pi day in clojure!

    Read on →
  • Java Magic. Part 5: SecurityManager

    Pouring a bit light on SecurityManager and its use cases.

    Read on →
  • ClojureCup 2014: Impressions

    Clojure Cup 2014 has finished and we've build clojure app in two days!
    We are proud to announce funstructor (pre-alpha)

    Read on →
  • Clojure Euler: Problem 025

    What is the first term in the Fibonacci sequence to contain 1000 digits?

    Permalink: https://projecteuler.net/problem=25

    Read on →
  • Clojure Euler: Problem 024

    A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:

    012 021 102 120 201 210

    What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?

    Permalink: http://projecteuler.net/problem=24

    Read on →
Blog Archive