3 ms·

Computing Fibonacci in RethinkDB

• mfenniak 13y ago
  Slava, why "r.table('fib').orderBy('id').nth(x.sub(1))"? It looks like "r.table('fib').get(x.sub(1))" would be the same behavior but more efficient, using a primary-key lookup rather than retrieving the entire table and ordering by it. What am I missing? :-)
  • coffeemug 13y ago
    You're absolutely right. (I think what you're missing is that I wrote this at 4am, I'll see if I can write up better solutions soon :))
    • mfenniak 13y ago
      Woohoo, I out RethinkDB'd RethinkDB! :-D Aside from that detail, this is a cool post. I like seeing the power of ReQL.
      • coffeemug 13y ago
        Also, instead of typing the array manually, I could have just used python's `range` operator. I'll fix that too.
  • jdoliner 13y ago
    Another nice way to do this is: r.expr(range(2, n)).reduce(lambda x,y: x+[x[y-1] + x[y-2]], [0,1])