whistlepig 0.1 → 0.2

data/README

@@ -8,32 +8,33 @@ the frills, Whistlepig may be for you.
 Whistlepig is written in ANSI C99. It currently provides a C API and Ruby
 bindings.
 
-Latest version: 0.1, released 2010-02-08.
+Latest version: 0.2, released 2011-02-09.
         Status: alpha
           News: http://all-thing.net/label/whistlepig/
       Homepage: http://masanjin.net/whistlepig/
+   Bug reports: http://github.com/wmorgan/whistlepig/issues
 
 = Getting it
 
-       Tarball:  http://masanjin.net/whistlepig/whistlepig-0.1.tar.gz
+       Tarball:  http://masanjin.net/whistlepig/whistlepig-0.2.tar.gz
        Rubygem:  gem install whistlepig
            Git:  git clone git://github.com/wmorgan/whistlepig.git
 
 = Realtime search
 
 Roughly speaking, realtime search means:
-- documents are available to to queries immediately after indexing, without
-  any further index merging steps; and
+- documents are available to to queries immediately after indexing, without any
+  reindexing or index merging;
 - later documents are more important than earlier documents.
 
-Whistlepig takes these principles to an extreme. In particular:
-- It only returns documents in the reverse order to which they were added
-  (i.e. LIFO order), and performs no ranking, reordering, or scoring.
+Whistlepig takes these principles to an extreme.
+- It only returns documents in the reverse (LIFO) order to which they were
+  added, and performs no ranking, reordering, or scoring.
 - It only supports incremental indexing. There is no notion of batch indexing
   or index merging.
 - It does not support document deletion or modification (except in the
   special case of labels; see below).
-- In only supports in-memory indexes.
+- It only supports in-memory indexes.
 
 Features that Whistlepig does provide:
 - Incremental indexing. Updates to the index are immediately available to
@@ -42,10 +43,8 @@ Features that Whistlepig does provide:
 - A full query language and parser with conjunctions, disjunctions, phrases,
   negations, grouping, and nesting.
 - Labels: arbitrary tokens which can be added to and removed from documents
-  at any point, and incorporated into search queries. (This is the only
-  mutable aspect of a document once it has been indexed.)
-- Early query termination.
-- Resumable queries.
+  at any point, and incorporated into search queries.
+- Early query termination and resumable queries.
 - A tiny, < 3 KLOC ANSI C99 implementation.
 
 == Synopsis (using Ruby bindings)
@@ -81,6 +80,6 @@ Features that Whistlepig does provide:
 Whistlepig is currently single-process and single-thread only. However, it is
 built with multi-process access in mind. Per-segment single-writer,
 multi-reader support is planned in the near future. Multi-writer support can be
-accomplished via index striping and is planned for the distant future.
+accomplished via index striping and may be attempted in the distant future.
 
-Please send bug reports and comments to: wmorgan-whistlepig-design@masanjin.net.
+Please send bug reports and comments to: wmorgan-whistlepig-readme@masanjin.net.

data/ext/whistlepig/entry.c

@@ -46,7 +46,7 @@ wp_entry* wp_entry_new() {
   return ret;
 }
 
-RAISING_STATIC(add_token(wp_entry* entry, const char* field, const char* term, int field_len, int term_len)) {
+RAISING_STATIC(add_token(wp_entry* entry, const char* field, const char* term, size_t field_len, size_t term_len)) {
   fielded_term ft;
   int status;
 
@@ -89,7 +89,7 @@ uint32_t wp_entry_size(wp_entry* entry) {
 
 RAISING_STATIC(add_from_lexer(wp_entry* entry, yyscan_t* scanner, const char* field)) {
   int token_type;
-  int field_len = strlen(field);
+  size_t field_len = strlen(field);
 
   do {
     token_type = yylex(*scanner);

data/ext/whistlepig/extconf.rb

@@ -1,6 +1,6 @@
 require 'mkmf'
 
-$CFLAGS = "-g -O3 -std=c99 $(cflags)"
+$CFLAGS = "-g -O3 -std=c99 $(cflags) -D_ANSI_SOURCE"
 
 create_header
 create_makefile "whistlepigc"

data/ext/whistlepig/index.c

@@ -1,3 +1,4 @@
+#include <inttypes.h>
 #include <stdio.h>
 #include <sys/types.h>
 #include <sys/stat.h>
@@ -261,7 +262,7 @@ wp_error* wp_index_add_label(wp_index* index, const char* label, uint64_t doc_id
     else DEBUG("did not find doc %llu in segment %u", doc_id, i - 1);
   }
 
-  if(!found) RAISE_ERROR("couldn't find doc id %llu", doc_id);
+  if(!found) RAISE_ERROR("couldn't find doc id %"PRIu64, doc_id);
 
   return NO_ERROR;
 }
@@ -279,7 +280,7 @@ wp_error* wp_index_remove_label(wp_index* index, const char* label, uint64_t doc
     else DEBUG("did not find doc %llu in segment %u", doc_id, i - 1);
   }
 
-  if(!found) RAISE_ERROR("couldn't find doc id %llu", doc_id);
+  if(!found) RAISE_ERROR("couldn't find doc id %"PRIu64, doc_id);
 
   return NO_ERROR;
 }
@@ -292,3 +293,11 @@ uint64_t wp_index_num_docs(wp_index* index) {
 
   return ret;
 }
+
+// insane. but i'm putting this here. not defined in c99. don't want to make a
+// "utils.c" or "compat.c" or whatever just yet.
+char* strdup(const char* old) {
+  size_t len = strlen(old) + 1;
+  char *new = malloc(len * sizeof(char));
+  return memcpy(new, old, len);
+}

data/ext/whistlepig/khash.h

@@ -1,3 +1,8 @@
+/* modified by william morgan to cast sizeof() properly.
+   otherwise it has trouble compiling on 64-bit platforms with
+  -Wshorten-64-to-32 enabled.
+*/
+
 /* The MIT License
 
    Copyright (c) 2008, by Attractive Chaos <attractivechaos@aol.co.uk>
@@ -102,10 +107,10 @@ static const uint32_t __ac_prime_list[__ac_HASH_PRIME_SIZE] =
 #define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
 #define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
 #define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
-#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
-#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
-#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
-#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
+#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(uint32_t)(1ul<<((i&0xfU)<<1)))
+#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(uint32_t)(2ul<<((i&0xfU)<<1)))
+#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(uint32_t)(3ul<<((i&0xfU)<<1)))
+#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=(uint32_t)(1ul<<((i&0xfU)<<1)))
 
 static const double __ac_HASH_UPPER = 0.77;
 

data/ext/whistlepig/mmap-obj.c

@@ -13,7 +13,7 @@ wp_error* mmap_obj_create(mmap_obj* o, const char* magic, const char* pathname,
   o->fd = open(pathname, O_EXCL | O_CREAT | O_RDWR, 0640);
   if(o->fd == -1) RAISE_SYSERROR("cannot create %s", pathname);
 
-  uint32_t size = initial_size + sizeof(mmap_obj_header);
+  uint32_t size = initial_size + (uint32_t)sizeof(mmap_obj_header);
   DEBUG("creating %s with %u + %u = %u bytes for %s object", pathname, initial_size, sizeof(mmap_obj_header), size, magic);
   lseek(o->fd, size - 1, SEEK_SET);
   ssize_t num_bytes = write(o->fd, "", 1);
@@ -39,7 +39,7 @@ wp_error* mmap_obj_load(mmap_obj* o, const char* magic, const char* pathname) {
 
   RELAY_ERROR(validate(o->header, magic));
 
-  uint32_t size = o->header->size + sizeof(mmap_obj_header);
+  uint32_t size = o->header->size + (uint32_t)sizeof(mmap_obj_header);
   DEBUG("full size is %u bytes (including %u-byte header)", size, sizeof(mmap_obj_header));
   if(munmap(o->header, sizeof(mmap_obj_header)) == -1) RAISE_SYSERROR("munmap");
 
@@ -54,7 +54,7 @@ wp_error* mmap_obj_resize(mmap_obj* o, uint32_t data_size) {
   DEBUG("going to expand from %u to %u bytes. current header is at %p", o->header->size, data_size, o->header);
 
   if(munmap(o->header, sizeof(mmap_obj_header) + o->header->size) == -1) RAISE_SYSERROR("munmap");
-  uint32_t size = data_size + sizeof(mmap_obj_header);
+  uint32_t size = data_size + (uint32_t)sizeof(mmap_obj_header);
 
   lseek(o->fd, size - 1, SEEK_SET);
   ssize_t num_bytes = write(o->fd, "", 1);

data/ext/whistlepig/query-parser.lex.c

@@ -677,6 +677,7 @@ static yyconst flex_int32_t yy_rule_can_match_eol[7] =
 #line 1 "query-parser.lex"
 #line 2 "query-parser.lex"
 #include <string.h>
+#include "whistlepig.h"
 #include "query-parser.h"
 #include "query-parser.tab.h"
 
@@ -694,7 +695,7 @@ static yyconst flex_int32_t yy_rule_can_match_eol[7] =
   }                                   \
 }
 
-#line 698 "query-parser.lex.c"
+#line 699 "query-parser.lex.c"
 
 #define INITIAL 0
 
@@ -924,10 +925,10 @@ YY_DECL
 	register int yy_act;
     struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
 
-#line 31 "query-parser.lex"
+#line 32 "query-parser.lex"
 
 
-#line 931 "query-parser.lex.c"
+#line 932 "query-parser.lex.c"
 
     yylval = yylval_param;
 
@@ -1023,12 +1024,12 @@ do_action:	/* This label is used only to access EOF actions. */
 
 case 1:
 YY_RULE_SETUP
-#line 33 "query-parser.lex"
+#line 34 "query-parser.lex"
 return OR;
 	YY_BREAK
 case 2:
 YY_RULE_SETUP
-#line 35 "query-parser.lex"
+#line 36 "query-parser.lex"
 {
   yylval->string = strdup(yytext);
   return WORD;
@@ -1036,7 +1037,7 @@ YY_RULE_SETUP
 	YY_BREAK
 case 3:
 YY_RULE_SETUP
-#line 40 "query-parser.lex"
+#line 41 "query-parser.lex"
 {
   yylval->string = strdup(yytext);
   return WORD;
@@ -1045,20 +1046,20 @@ YY_RULE_SETUP
 case 4:
 /* rule 4 can match eol */
 YY_RULE_SETUP
-#line 45 "query-parser.lex"
+#line 46 "query-parser.lex"
 { } ; // nothing
 	YY_BREAK
 case 5:
 YY_RULE_SETUP
-#line 47 "query-parser.lex"
+#line 48 "query-parser.lex"
 return yytext[0];
 	YY_BREAK
 case 6:
 YY_RULE_SETUP
-#line 49 "query-parser.lex"
+#line 50 "query-parser.lex"
 ECHO;
 	YY_BREAK
-#line 1062 "query-parser.lex.c"
+#line 1063 "query-parser.lex.c"
 case YY_STATE_EOF(INITIAL):
 	yyterminate();
 
@@ -2242,7 +2243,7 @@ void query_parser_free (void * ptr , yyscan_t yyscanner)
 
 #define YYTABLES_NAME "yytables"
 
-#line 49 "query-parser.lex"
+#line 50 "query-parser.lex"
 
 
 

data/ext/whistlepig/query-parser.lex.h

@@ -351,7 +351,7 @@ extern int query_parser_lex \
 #undef YY_DECL
 #endif
 
-#line 49 "query-parser.lex"
+#line 50 "query-parser.lex"
 
 
 #line 358 "query-parser.lex.h"

data/ext/whistlepig/query.c

@@ -1,3 +1,4 @@
+#include "whistlepig.h"
 #include "query.h"
 
 static wp_query* wp_query_new() {
@@ -11,12 +12,6 @@ static wp_query* wp_query_new() {
   return ret;
 }
 
-static char* strdup(const char* old) { // sigh... not in c99
-  size_t len = strlen(old) + 1;
-  char *new = malloc(len * sizeof(char));
-  return memcpy(new, old, len);
-}
-
 wp_query* wp_query_clone(wp_query* other) {
   wp_query* ret = malloc(sizeof(wp_query));
   ret->type = other->type;
@@ -128,13 +123,13 @@ static int subquery_to_s(wp_query* q, size_t n, char* buf) {
     buf += wp_query_to_s(child, n - (buf - orig_buf), buf);
   }
 
-  return buf - orig_buf;
+  return (int)(buf - orig_buf);
 }
 
 #define min(a, b) (a < b ? a : b)
 
-int wp_query_to_s(wp_query* q, size_t n, char* buf) {
-  int ret;
+size_t wp_query_to_s(wp_query* q, size_t n, char* buf) {
+  size_t ret;
   char* orig_buf = buf;
 
   if(q->type == WP_QUERY_EMPTY) {

data/ext/whistlepig/query.h

@@ -73,6 +73,6 @@ wp_query* wp_query_set_all_child_fields(wp_query* q, const char* field);
 void wp_query_free(wp_query* q);
 
 // public: build a string representation of a query by writing at most n chars to buf
-int wp_query_to_s(wp_query* q, size_t n, char* buf);
+size_t wp_query_to_s(wp_query* q, size_t n, char* buf);
 
 #endif

data/ext/whistlepig/segment.c

@@ -241,8 +241,8 @@ wp_error* wp_segment_ensure_fit(wp_segment* seg, uint32_t postings_bytes, uint32
 
 static uint32_t size_of(uint32_t num_positions, pos_t positions[]) {
   (void)positions;
-  uint32_t position_size = sizeof(pos_t) * num_positions;
-  uint32_t size = sizeof(posting) - sizeof(pos_t*) + position_size;
+  uint32_t position_size = (uint32_t)sizeof(pos_t) * num_positions;
+  uint32_t size = (uint32_t)sizeof(posting) - (uint32_t)sizeof(pos_t*) + position_size;
 
   return size;
 }
@@ -253,23 +253,22 @@ wp_error* wp_segment_sizeof_posarray(wp_segment* seg, uint32_t num_positions, po
   return NO_ERROR;
 }
 
-#define BITMASK 0x7f
-
+#define VALUE_BITMASK 0x7f
 RAISING_STATIC(write_multibyte(uint8_t* location, uint32_t val, uint32_t* size)) {
   //printf("xx writing %u to position %p as:\n", val, location);
   uint8_t* start = location;
 
-  while(val > BITMASK) {
-    uint8_t c = (val & BITMASK) | 0x80;
+  while(val > VALUE_BITMASK) {
+    uint8_t c = (val & VALUE_BITMASK) | 0x80;
     *location = c;
     //printf("xx %d = %d | %d at %p\n", c, val & BITMASK, 0x80, location);
     location++;
     val >>= 7;
   }
-  uint8_t c = (val & BITMASK);
+  uint8_t c = (val & VALUE_BITMASK);
   *location = c;
   //printf("xx %d at %p\n", c, location);
-  *size = location + 1 - start;
+  *size = (uint32_t)(location + 1 - start);
   //printf("xx total %u bytes\n", *size);
   return NO_ERROR;
 }
@@ -287,7 +286,7 @@ RAISING_STATIC(read_multibyte(uint8_t* location, uint32_t* val, uint32_t* size))
   }
   *val |= *location << shift;
   //printf("yy read final byte %d at %p\n", *location, location);
-  *size = location + 1 - start;
+  *size = (uint32_t)(location + 1 - start);
   //printf("yy total %d bytes, val = %d\n\n", *size, *val);
   return NO_ERROR;
 }
@@ -522,7 +521,7 @@ wp_error* wp_segment_add_label(wp_segment* s, const char* label, docid_t doc_id)
   po->doc_id = doc_id;
   po->next_offset = next_offset;
 
-  pr->postings_head += sizeof(label_posting);
+  pr->postings_head += (uint32_t)sizeof(label_posting);
   DEBUG("label postings list head now at %u", pr->postings_head);
 
   // really finally, update either the previous offset or the tail pointer

data/ext/whistlepig/stringmap.c

@@ -15,10 +15,10 @@ static const uint32_t prime_list[] = {
 #define isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
 #define isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
 #define iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
-#define set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
-#define set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
-#define set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
-#define set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
+#define set_isdel_false(flag, i) (flag[i>>4]&=~(uint32_t)(1ul<<((i&0xfU)<<1)))
+#define set_isempty_false(flag, i) (flag[i>>4]&=~(uint32_t)(2ul<<((i&0xfU)<<1)))
+#define set_isboth_false(flag, i) (flag[i>>4]&=~(uint32_t)(3ul<<((i&0xfU)<<1)))
+#define set_isdel_true(flag, i) (flag[i>>4]|=(uint32_t)(1ul<<((i&0xfU)<<1)))
 
 static const double HASH_UPPER = 0.77;
 
@@ -234,9 +234,9 @@ int stringmap_needs_bump(stringmap* h) {
 //   ((n_buckets >> 4) + 1) uint32_t's for the flags
 //   n_buckets uint32_t for the keys
 static uint32_t size(uint32_t n_buckets) {
-  uint32_t size = sizeof(stringmap) +
-    (((n_buckets >> 4) + 1) * sizeof(uint32_t)) +
-    (n_buckets * sizeof(uint32_t));
+  uint32_t size = (uint32_t)sizeof(stringmap) +
+    (((n_buckets >> 4) + 1) * (uint32_t)sizeof(uint32_t)) +
+    (n_buckets * (uint32_t)sizeof(uint32_t));
   return size;
 }
 

data/ext/whistlepig/stringpool.c

@@ -6,11 +6,11 @@ void stringpool_init(stringpool* p) {
 }
 
 uint32_t stringpool_size(stringpool* p) {
-  return sizeof(stringpool) + (p->size * sizeof(char));
+  return (uint32_t)sizeof(stringpool) + (p->size * (uint32_t)sizeof(char));
 }
 
 uint32_t stringpool_add(stringpool* p, const char* s) {
-  int len = strlen(s) + 1;
+  uint32_t len = (uint32_t)strlen(s) + 1;
   if((p->next + len) >= p->size) {
     DEBUG("out of space in string pool for %s (len %d, next %d, size %d)", s, len, p->next, p->size);
     return (uint32_t)-1;
@@ -27,11 +27,11 @@ int stringpool_needs_bump(stringpool* p) {
 }
 
 uint32_t stringpool_next_size(stringpool* p) {
-  return sizeof(stringpool) + (2 * (p->size == 0 ? 1 : p->size) * sizeof(char));
+  return (uint32_t)sizeof(stringpool) + (2 * (p->size == 0 ? 1 : p->size) * (uint32_t)sizeof(char));
 }
 
 uint32_t stringpool_initial_size() {
-  return sizeof(stringpool) + INITIAL_POOL_SIZE;
+  return (uint32_t)sizeof(stringpool) + INITIAL_POOL_SIZE;
 }
 
 void stringpool_bump_size(stringpool* p) {

data/ext/whistlepig/termhash.c

@@ -15,10 +15,10 @@ static const uint32_t prime_list[] = {
 #define isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
 #define isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
 #define iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
-#define set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
-#define set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
-#define set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
-#define set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
+#define set_isdel_false(flag, i) (flag[i>>4]&=~(uint32_t)(1ul<<((i&0xfU)<<1)))
+#define set_isempty_false(flag, i) (flag[i>>4]&=~(uint32_t)(2ul<<((i&0xfU)<<1)))
+#define set_isboth_false(flag, i) (flag[i>>4]&=~(uint32_t)(3ul<<((i&0xfU)<<1)))
+#define set_isdel_true(flag, i) (flag[i>>4]|=(uint32_t)(1ul<<((i&0xfU)<<1)))
 
 static const double HASH_UPPER = 0.77;
 
@@ -264,10 +264,10 @@ int termhash_needs_bump(termhash* h) {
 //   n_buckets terms for the keys
 //   n_buckets uint32_t's for the vals (offsets into postings lists)
 static uint32_t size(uint32_t n_buckets) {
-  uint32_t size = sizeof(termhash) +
-    (((n_buckets >> 4) + 1) * sizeof(uint32_t)) +
-    (n_buckets * sizeof(term)) +
-    (n_buckets * sizeof(uint32_t));
+  uint32_t size = (uint32_t)sizeof(termhash) +
+    (((n_buckets >> 4) + 1) * (uint32_t)sizeof(uint32_t)) +
+    (n_buckets * (uint32_t)sizeof(term)) +
+    (n_buckets * (uint32_t)sizeof(uint32_t));
 
   DEBUG("size of a termhash with %u buckets is %lu + %lu + %lu + %lu = %u",
     n_buckets,

data/ext/whistlepig/tokenizer.lex.c

@@ -1064,7 +1064,7 @@ YY_RULE_SETUP
 #line 23 "tokenizer.lex"
 {
   yyextra->start = yyextra->end;
-  yyextra->end += yyleng;
+  yyextra->end += (pos_t)yyleng;
   return TOK_NUMBER;
 }
 	YY_BREAK
@@ -1073,7 +1073,7 @@ YY_RULE_SETUP
 #line 29 "tokenizer.lex"
 {
   yyextra->start = yyextra->end;
-  yyextra->end += yyleng;
+  yyextra->end += (pos_t)yyleng;
   return TOK_WORD;
 }
 	YY_BREAK
@@ -1082,7 +1082,7 @@ YY_RULE_SETUP
 #line 35 "tokenizer.lex"
 {
   yyextra->start = yyextra->end;
-  yyextra->end += yyleng;
+  yyextra->end += (pos_t)yyleng;
   return TOK_WORD;
 }
 	YY_BREAK

data/ext/whistlepig/whistlepig.h

@@ -12,4 +12,7 @@
 #include "query-parser.h"
 #include "error.h"
 
+// see comments in index.c
+char* strdup(const char* old);
+
 #endif

data/ext/whistlepig/whistlepigc.c

@@ -9,12 +9,6 @@ static VALUE c_query;
 static VALUE c_error;
 static VALUE c_parseerror;
 
-static char* strdup(const char* old) { // wtf stupid
-  size_t len = strlen(old) + 1;
-  char *new = malloc(len * sizeof(char));
-  return (char *)memcpy(new, old, len);
-}
-
 static void index_free(wp_index* index) {
   wp_error* e = wp_index_free(index);
   //printf("# index free at %p with error %p\n", index, e);

metadata

@@ -1,11 +1,12 @@
 --- !ruby/object:Gem::Specification 
 name: whistlepig
 version: !ruby/object:Gem::Version 
+  hash: 15
   prerelease: false
   segments: 
   - 0
-  - 1
-  version: "0.1"
+  - 2
+  version: "0.2"
 platform: ruby
 authors: 
 - William Morgan
@@ -13,7 +14,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-02-08 21:42:39 -08:00
+date: 2011-02-09 20:32:41 -08:00
 default_executable: 
 dependencies: []
 
@@ -81,6 +82,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
       segments: 
       - 0
       version: "0"
@@ -89,6 +91,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
       segments: 
       - 0
       version: "0"