<form action="/example/myaction" method="POST">
<input type="hidden" name="object" value="123">
<input type="text" name="object[name]">
<input type="submit">
</form>

Conflicting types for parameter containers. Expected an instance of Hash, but found an instance of String. 
This can be caused by passing Array and Hash based paramters qs[]=value&qs[key]=value.

<form action="/example/myaction" method="POST">
<input type="hidden" name="object_id" value="123">
<input type="text" name="object[name]">
<input type="submit">
</form>

The First Amendment is already in trouble with the rising generation. A 2006 survey by the John S. and James L. Knight Foundation found that 46 percent of high school students think newspapers should only publish stories with government approval.

#include <stdio.h>
#include <string.h>

int str_hash() {
  char str[]  = "errorvaljustin";
  int len = strlen(str);
  char *p = str;
  int key = 0;

  while (len--) {
    key = key*65599 + *p;
    p++;
  }
  key = key + (key>>5);
  printf("Key is %i\n", key);
  return(0);
}

while read line ; do mv $line /tmp ; done <list-of-files

xargs mv -t /tmp < list-of-files

tar: This does not look like a tar archive
tar: Skipping to next header
tar: Error exit delayed from previous errors

Make no statement to the police under any circumstances. - Supreme Court Justice Robert Jackson

[Indexes] can be used when the first non-const table in the join order has an index that matches the ORDER BY list.

my_array = [1,2,3,4,5,6,7,8,9,10]
samples = 0
average = my_array.inject(0.0) do |avg, sample|
  samples += 1
  avg + (Float(sample) - avg)/samples
end

samples=0
my_array=[1,2,3,4,5,6,7,8,9,10]
average = my_array.inject(0.0) {|avg, s| avg + (s.to_f-avg)/(samples += 1) }

my_array=[1,2,3,4,5,6,7,8,9,10]
average = my_array.inject {|sum, s| sum + s } / my_array.length

class Chunkable
  # allow a method to process 1000 rows at a time instead of loading the entire
  # table into memory
  def self.chunk(klass, num_items=1000, opts={}, &block)
    item_count = klass.count
    current=0
    while current < item_count
      items=klass.find(:all, {:limit => num_items, :offset => current}.merge(opts))
      current += num_items + 1
      items.each do |item|
        begin
          block.call(item)
        rescue Exception => e
          raise e
        end
      end
    end
  end
end