f = 40
t = AnnoyIndex.new(f)  # Length of item vector that will be indexed
1000.times do |i|
  v = f.times.map{rand}
  t.add_item(i, v)
end

t.build(10) # 10 trees
t.save('test.ann')

# ...

u = AnnoyIndex.new(f)
u.load('test.ann') # super fast, will just mmap the file
puts u.get_nns_by_item(0, 1000) # will find the 1000 nearest neighbors

MRuby::Build.new do |conf|

    # Avoid build failures when C and C++ mrbgems exist.
    conf.disable_cxx_exception
    conf.linker do |linker|
        linker.libraries = %w(stdc++)
    end

    # ... (snip) ...

    conf.gem :github => 'monochromegane/mruby-annoy'
end