| {:paths ["."]} |
| # Given an ordered list of elements, how can the possible combinations | |
| # of those elements (of all lengths, order does not matter, no | |
| # repetition) be traversed in the sequence shown below? Either | |
| # iterative or recursive, but it needs to be in such a way that the | |
| # computation of certain branches can be skipped based on a condition | |
| # computed from the combination. E.g. when it reaches [:a, :b], it | |
| # should be possible to say: if check?([:a, :b]) then skip everything | |
| # until [:a, :b, :d] and continue with [:a, :c]. | |
| # | |
| # In the concrete problem behind this, the list of elements is a lot |
Arne is a developer, public speaker, programming coach, author and open-source contributor. With a passion for both human and programming languages, he has spent the last decade teaching and exploring the finer points of Ruby, LISP, Haskell, Mandarin Chinese, and others.
| # Add this to your spec_helper.rb | |
| RSpec.configure do |config| | |
| config.treat_symbols_as_metadata_keys_with_true_values = true | |
| config.around(:each, :vcr) do |example| | |
| name = example.metadata[:full_description].downcase.gsub(/\W+/, "_").split("_", 2).join("/") | |
| begin | |
| VCR.use_cassette(name, :record => :new_episodes) do | |
| example.call | |
| end | |
| rescue Errno::ENAMETOOLONG |