| class Hash | |
| # {'x'=>{'y'=>{'z'=>1,'a'=>2}}}.leaves == [1,2] | |
| def leaves | |
| each_value.flat_map do |value| | |
| value.respond_to?(:leaves) ? value.leaves : [value] | |
| end | |
| end | |
| end |
| require 'rspec/core/formatters/progress_formatter' | |
| require 'awesome_print' | |
| class MyFormatter < RSpec::Core::Formatters::ProgressFormatter | |
| def start_dump | |
| super | |
| current_hash = examples_to_hash(examples) | |
| if File.exist? 'result.txt' | |
| lines = read_log 'result.txt' | |
| previous_hash = lines_to_hash lines |
| /*++ | |
| Copyright (c) 2003 Microsoft Corporation | |
| Module Name: | |
| UriExt.cs | |
| Abstract: | |
| Uri extensibility model Implementation. |
| require 'net/ftp' | |
| require 'timeout' | |
| ftp = Net::FTP.new('ftp.sra.ebi.ac.uk') | |
| ftp.login | |
| puts "connected!" | |
| errors = [] | |
| samples = ["SRR016000"] |
| %html | |
| %ul | |
| - (1..4).each do |x| | |
| %p= x |
| @echo off | |
| rem -------------------------------------------------------- | |
| rem File: which.cmd | |
| rem Description: Windows equivalent of Unix which command | |
| rem Author: Pankaj Kumar | |
| rem Copyright 2004 Pankaj Kumar. All Rights Reserved. | |
| rem License: This software is available under GPL | |
| rem --------------------------------------------------------- | |
| setlocal | |
| if "%1" == "" goto noArg |
This simple framework allows you to assert things that should happen tomorrow*. For example:
assert_tomorrow { Time.now.wday == 2 } # => :passed
# assuming today is Monday (i.e. wday == 1)
Another example shows that the time will never be the same again:
today = Time.now
assert_tomorrow { Time.now == today } # => :failed
| import java.io.File; | |
| public class DirectoryChecker | |
| { | |
| public static boolean isWindows() | |
| { | |
| String os = System.getProperty("os.name").toLowerCase(); | |
| return os.indexOf("windows") != -1; | |
| } | |
| def cons(x,y) | |
| ->(m) { m.call(x, y) } | |
| end | |
| def car(z) | |
| z.call ->(p, q) { p } | |
| end | |
| def cdr(z) | |
| z.call ->(p, q) { q } |
| def cons(x, y) | |
| ->(label) do | |
| case label | |
| when :first then x | |
| when :second then y | |
| else raise "Argument is neither :first nor :second -- cons" | |
| end | |
| end | |
| end |