Wonderfall

use std::collections::HashMap;

fn main () {
    let mut numbers = vec![12, 14, 8, 3, 5, 19, 23, 24, 28, 32, 48, 13, 13, 48];

    println!("median is {}", median(&mut numbers));
    println!("mean is {}", mean(&numbers));
    println!("mode is {}", mode(&numbers));
}

Wonderfall

diff --git a/auto/modules b/auto/modules
index be3561e6..1be97dd1 100644
--- a/auto/modules
+++ b/auto/modules
@@ -436,6 +436,10 @@ if [ $HTTP = YES ]; then
         . auto/module
     fi

+    if [ $HTTP_V2_HPACK_ENC = YES ]; then
+        have=NGX_HTTP_V2_HPACK_ENC . auto/have

Wonderfall

Keybase proof

I hereby claim:

• I am wonderfall on github.
• I am wonderfall (https://keybase.io/wonderfall) on keybase.
• I have a public key ASC6O64BtN0ujLouh_GQcoWcubfodE6wZ4YYuM1vf32TxQo

To claim this, I am signing this object:

Wonderfall

puts "Un simple pendu. On se passera de règles..."
points = 0

loop do

  print "Saisissez un mot : "
  motMystere = gets.chomp
  cache = motMystere.gsub(/./, '_')
  30.times { puts }

Wonderfall

puts "Un simple pendu. On se passera de règles..."
points = 0

loop do

  print "Saisissez un mot : "
  motMystere = gets.chomp
  cache = String.new
  motMystere.length.times { cache += "_" }
  30.times { puts }

Wonderfall

# Copyleft
# Thanks to Caletlog ! Shorter & Faster !
# Good game !
puts "You have to find a secret word, each player has 5 tries !"
score = 0

loop do
  print "Enter some word : "
  secretWord = gets.chomp
  30.times { puts }