clara-rules VS sortedcontainers

I've met a few young programmers who heard somewhere that object-oriented programming was bad and they want to get the enlightenment of functional programming that they've heard about. Frequently they travel from job to job like itinerant martial artists always looking for somewhere where they practice the true technique but they always seem disappointed as it is just as easy if not easier to screw up handling errors with monads than it is with exceptions and they find analogies like "a monad is like a burrito" just get them more confused.

As for something profound I'd point you to

https://github.com/cerner/clara-rules

which many people will struggle with because like many other production rules engines in LISP (and many other examples of simple compilers), there is hardly any code! Contrast that to the orders of magnitude larger rules engine Drools

https://github.com/kiegroup/drools

which is so crazy-complicated primarily because the Drools language is Java-based so you need all sorts of things that Clara or CLIPS don't need.

If you like Python, the library sortedcontainers as a clear, well documented, yet short source code that is a joy to read for a non trivial problem:

https://github.com/grantjenks/python-sortedcontainers/blob/m...

See for yourself. Looks like sortedset uses sortedlist under the hood, which itself uses a list of lists under the hood.

You could use http://www.grantjenks.com/docs/sortedcontainers/ instead!

Even the Gentoo package repository manages fine with a two-level hierarchy. There's also a Python library, sortedcontainers, that suggests two-level trees are pretty good at any reasonable human-scale (and beyond), even while fixed-arity trees are asymptotically optimal.

It's a good question and to be accurate, depending on the benchmark, Mongita is about the same speed at SQLite to several-times slower.

There is less happening algorithmically than you would think. Where the tricky slow bits do exist, they have largely fallen into the happy-path of fast data structures in the Python language/stdlib. I also use sortedcontainers for indexes which helped quite a bit (http://www.grantjenks.com/docs/sortedcontainers/).

If you're curious, the benchmark code is in the repo: https://github.com/scottrogowski/mongita/blob/master/benchma...

I’d like to add sortedcontainers. I use it all the time. It basically does what it says on the tin. Other than the SortedList, the fact that the container is sorted only comes into play when you iterate over it or perform a bisect left/right.