pg 0.21.0 → 1.2.3

data/ext/pg_text_encoder.c

@@ -1,6 +1,6 @@
 /*
  * pg_text_encoder.c - PG::TextEncoder module
- * $Id: pg_text_encoder.c,v e61a06f1f5ed 2015/12/25 21:14:21 lars $
+ * $Id$
  *
  */
 
@@ -41,7 +41,7 @@
 
 
 #include "pg.h"
-#include "util.h"
+#include "pg_util.h"
 #ifdef HAVE_INTTYPES_H
 #include <inttypes.h>
 #endif
@@ -50,6 +50,9 @@
 VALUE rb_mPG_TextEncoder;
 static ID s_id_encode;
 static ID s_id_to_i;
+static ID s_id_to_s;
+static ID s_cBigDecimal;
+static VALUE s_str_F;
 
 static int pg_text_enc_integer(t_pg_coder *this, VALUE value, char *out, VALUE *intermediate, int enc_idx);
 
@@ -125,11 +128,29 @@ pg_coder_enc_to_s(t_pg_coder *this, VALUE value, char *out, VALUE *intermediate,
 	return -1;
 }
 
+static int
+count_leading_zero_bits(unsigned long long x)
+{
+#if defined(__GNUC__) || defined(__clang__)
+	return __builtin_clzll(x);
+#elif defined(_MSC_VER)
+	DWORD r = 0;
+	_BitScanForward64(&r, x);
+	return (int)r;
+#else
+	unsigned int a;
+	for(a=0; a < sizeof(unsigned long long) * 8; a++){
+		if( x & (1 << (sizeof(unsigned long long) * 8 - 1))) return a;
+		x <<= 1;
+	}
+	return a;
+#endif
+}
 
 /*
  * Document-class: PG::TextEncoder::Integer < PG::SimpleEncoder
  *
- * This is the encoder class for the PostgreSQL int types.
+ * This is the encoder class for the PostgreSQL integer types.
  *
  * Non-Integer values are expected to have method +to_i+ defined.
  *
@@ -144,20 +165,23 @@ pg_text_enc_integer(t_pg_coder *this, VALUE value, char *out, VALUE *intermediat
 			char *start = out;
 			int len;
 			int neg = 0;
-			long long ll = NUM2LL(*intermediate);
+			long long sll = NUM2LL(*intermediate);
+			unsigned long long ll;
 
-			if (ll < 0) {
-				/* We don't expect problems with the most negative integer not being representable
-				 * as a positive integer, because Fixnum is only up to 63 bits.
+			if (sll < 0) {
+				/* Avoid problems with the most negative integer not being representable
+				 * as a positive integer, by using unsigned long long for encoding.
 				 */
-				ll = -ll;
+				ll = -sll;
 				neg = 1;
+			} else {
+				ll = sll;
 			}
 
 			/* Compute the result string backwards. */
 			do {
-				long long remainder;
-				long long oldval = ll;
+				unsigned long long remainder;
+				unsigned long long oldval = ll;
 
 				ll /= 10;
 				remainder = oldval - ll * 10;
@@ -184,45 +208,17 @@ pg_text_enc_integer(t_pg_coder *this, VALUE value, char *out, VALUE *intermediat
 	}else{
 		*intermediate = pg_obj_to_i(value);
 		if(TYPE(*intermediate) == T_FIXNUM){
-			int len;
 			long long sll = NUM2LL(*intermediate);
-			long long ll = sll < 0 ? -sll : sll;
-			if( ll < 100000000 ){
-				if( ll < 10000 ){
-					if( ll < 100 ){
-						len = ll < 10 ? 1 : 2;
-					}else{
-						len = ll < 1000 ? 3 : 4;
-					}
-				}else{
-					if( ll < 1000000 ){
-						len = ll < 100000 ? 5 : 6;
-					}else{
-						len = ll < 10000000 ? 7 : 8;
-					}
-				}
-			}else{
-				if( ll < 1000000000000LL ){
-					if( ll < 10000000000LL ){
-						len = ll < 1000000000LL ? 9 : 10;
-					}else{
-						len = ll < 100000000000LL ? 11 : 12;
-					}
-				}else{
-					if( ll < 100000000000000LL ){
-						len = ll < 10000000000000LL ? 13 : 14;
-					}else{
-						return pg_coder_enc_to_s(this, *intermediate, NULL, intermediate, enc_idx);
-					}
-				}
-			}
-			return sll < 0 ? len+1 : len;
+			unsigned long long ll = sll < 0 ? -sll : sll;
+			int len = (sizeof(unsigned long long) * 8 - count_leading_zero_bits(ll)) / 3;
+			return sll < 0 ? len+2 : len+1;
 		}else{
 			return pg_coder_enc_to_s(this, *intermediate, NULL, intermediate, enc_idx);
 		}
 	}
 }
 
+#define MAX_DOUBLE_DIGITS 16
 
 /*
  * Document-class: PG::TextEncoder::Float < PG::SimpleEncoder
@@ -235,6 +231,12 @@ pg_text_enc_float(t_pg_coder *conv, VALUE value, char *out, VALUE *intermediate,
 {
 	if(out){
 		double dvalue = NUM2DBL(value);
+		int len = 0;
+		int neg = 0;
+		int exp2i, exp10i, i;
+		unsigned long long ll, remainder, oldval;
+		VALUE intermediate;
+
 		/* Cast to the same strings as value.to_s . */
 		if( isinf(dvalue) ){
 			if( dvalue < 0 ){
@@ -248,12 +250,128 @@ pg_text_enc_float(t_pg_coder *conv, VALUE value, char *out, VALUE *intermediate,
 			memcpy( out, "NaN", 3);
 			return 3;
 		}
-		return sprintf( out, "%.16E", dvalue);
+
+		/*
+		 * The following computaion is roughly a conversion kind of
+		 *   sprintf( out, "%.16E", dvalue);
+		 */
+
+		/* write the algebraic sign */
+		if( dvalue < 0 ) {
+			dvalue = -dvalue;
+			*out++ = '-';
+			neg++;
+		}
+
+		/* retrieve the power of 2 exponent */
+		frexp(dvalue, &exp2i);
+		/* compute the power of 10 exponent */
+		exp10i = (int)floor(exp2i * 0.30102999566398114); /* Math.log(2)/Math.log(10) */
+		/* move the decimal point, so that we get an integer of MAX_DOUBLE_DIGITS decimal digits */
+		ll = (unsigned long long)(dvalue * pow(10, MAX_DOUBLE_DIGITS - 1 - exp10i) + 0.5);
+
+		/* avoid leading zeros due to inaccuracy of deriving exp10i from exp2i */
+		/* otherwise we would print "09.0" instead of "9.0" */
+		if( ll < 1000000000000000 ){ /* pow(10, MAX_DOUBLE_DIGITS-1) */
+			exp10i--;
+			ll *= 10;
+		}
+
+		if( exp10i <= -5 || exp10i >= 15 ) {
+			/* Write the float in exponent format (1.23e45) */
+
+			/* write fraction digits from right to left */
+			for( i = MAX_DOUBLE_DIGITS; i > 1; i--){
+				oldval = ll;
+				ll /= 10;
+				remainder = oldval - ll * 10;
+				/* omit trailing zeros */
+				if(remainder != 0 || len ) {
+					out[i] = '0' + remainder;
+					len++;
+				}
+			}
+
+			/* write decimal point */
+			if( len ){
+				out[1] = '.';
+				len++;
+			}
+
+			/* write remaining single digit left to the decimal point */
+			oldval = ll;
+			ll /= 10;
+			remainder = oldval - ll * 10;
+			out[0] = '0' + remainder;
+			len++;
+
+			/* write exponent */
+			out[len++] = 'e';
+			intermediate = INT2NUM(exp10i);
+
+			return neg + len + pg_text_enc_integer(conv, Qnil, out + len, &intermediate, enc_idx);
+		} else {
+			/* write the float in non exponent format (0.001234 or 123450.0) */
+
+			/* write digits from right to left */
+			int lz = exp10i < 0 ? 0 : exp10i;
+			for( i = MAX_DOUBLE_DIGITS - (exp10i < 0 ? exp10i : 0); i >= 0; i-- ){
+				oldval = ll;
+				ll /= 10;
+				remainder = oldval - ll * 10;
+				/* write decimal point */
+				if( i - 1 == lz ){
+					out[i--] = '.';
+					len++;
+				}
+				/* if possible then omit trailing zeros */
+				if(remainder != 0 || len || i - 2 == lz) {
+					out[i] = '0' + remainder;
+					len++;
+				}
+			}
+			return neg + len;
+		}
 	}else{
-		return 23;
+		return 1 /*sign*/ + MAX_DOUBLE_DIGITS + 1 /*dot*/ + 1 /*e*/ + 1 /*exp sign*/ + 3 /*exp digits*/;
 	}
 }
 
+
+/*
+ * Document-class: PG::TextEncoder::Numeric < PG::SimpleEncoder
+ *
+ * This is the encoder class for the PostgreSQL numeric types.
+ *
+ * It converts Integer, Float and BigDecimal objects.
+ * All other objects are expected to respond to +to_s+.
+ */
+static int
+pg_text_enc_numeric(t_pg_coder *this, VALUE value, char *out, VALUE *intermediate, int enc_idx)
+{
+	switch(TYPE(value)){
+		case T_FIXNUM:
+		case T_BIGNUM:
+			return pg_text_enc_integer(this, value, out, intermediate, enc_idx);
+		case T_FLOAT:
+			return pg_text_enc_float(this, value, out, intermediate, enc_idx);
+		default:
+			if(out){ /* second pass */
+				rb_bug("unexpected value type: %d", TYPE(value));
+			} else { /* first pass */
+				if( rb_obj_is_kind_of(value, s_cBigDecimal) ){
+					/* value.to_s('F') */
+					*intermediate = rb_funcall(value, s_id_to_s, 1, s_str_F);
+					return -1; /* no second pass */
+				} else {
+					return pg_coder_enc_to_s(this, value, NULL, intermediate, enc_idx);
+					/* no second pass */
+				}
+			}
+	}
+}
+
+
 static const char hextab[] = {
 	'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'
 };
@@ -261,8 +379,7 @@ static const char hextab[] = {
 /*
  * Document-class: PG::TextEncoder::Bytea < PG::SimpleEncoder
  *
- * This is an encoder class for the PostgreSQL bytea type for server version 9.0
- * or newer.
+ * This is an encoder class for the PostgreSQL +bytea+ type.
  *
  * The binary String is converted to hexadecimal representation for transmission
  * in text format. For query bind parameters it is recommended to use
@@ -468,20 +585,19 @@ pg_text_enc_array(t_pg_coder *conv, VALUE value, char *out, VALUE *intermediate,
 static char *
 quote_identifier( VALUE value, VALUE out_string, char *current_out ){
 	char *p_in = RSTRING_PTR(value);
-	char *ptr1;
 	size_t strlen = RSTRING_LEN(value);
+	char *p_inend = p_in + strlen;
 	char *end_capa = current_out;
 
 	PG_RB_STR_ENSURE_CAPA( out_string, strlen + 2, current_out, end_capa );
 	*current_out++ = '"';
-	for(ptr1 = p_in; ptr1 != p_in + strlen; ptr1++) {
-		char c = *ptr1;
+	for(; p_in != p_inend; p_in++) {
+		char c = *p_in;
 		if (c == '"'){
-			strlen++;
-			PG_RB_STR_ENSURE_CAPA( out_string, p_in - ptr1 + strlen + 1, current_out, end_capa );
+			PG_RB_STR_ENSURE_CAPA( out_string, p_inend - p_in + 2, current_out, end_capa );
 			*current_out++ = '"';
 		} else if (c == 0){
-			break;
+			rb_raise(rb_eArgError, "string contains null byte");
 		}
 		*current_out++ = c;
 	}
@@ -521,7 +637,8 @@ pg_text_enc_array_identifier(VALUE value, VALUE string, char *out, int enc_idx)
  *
  * This is the encoder class for PostgreSQL identifiers.
  *
- * An Array value can be used for "schema.table.column" type identifiers:
+ * An Array value can be used for identifiers of the kind "schema.table.column".
+ * This ensures that each element is properly quoted:
  *   PG::TextEncoder::Identifier.new.encode(['schema', 'table', 'column'])
  *      => '"schema"."table"."column"'
  *
@@ -589,7 +706,13 @@ quote_literal_buffer( void *_this, char *p_in, int strlen, char *p_out ){
  *
  * This is the encoder class for PostgreSQL literals.
  *
- * A literal is quoted and escaped by the +'+ character.
+ * A literal is quoted and escaped by the <tt>'</tt> character, so that it can be inserted into SQL queries.
+ * It works equal to PG::Connection#escape_literal, but integrates into the type cast system of ruby-pg.
+ *
+ * Both expressions have the same result:
+ *   conn.escape_literal(PG::TextEncoder::Array.new.encode(["v1","v2"])) # => "'{v1,v2}'"
+ *   PG::TextEncoder::QuotedLiteral.new(elements_type: PG::TextEncoder::Array.new).encode(["v1","v2"]) # => "'{v1,v2}'"
+ * While escape_literal requires a intermediate ruby string allocation, QuotedLiteral encodes the values directly to the result string.
  *
  */
 static int
@@ -656,6 +779,12 @@ init_pg_text_encoder()
 {
 	s_id_encode = rb_intern("encode");
 	s_id_to_i = rb_intern("to_i");
+	s_id_to_s = rb_intern("to_s");
+	s_str_F = rb_str_freeze(rb_str_new_cstr("F"));
+	rb_global_variable(&s_str_F);
+	rb_require("bigdecimal");
+	s_cBigDecimal = rb_const_get(rb_cObject, rb_intern("BigDecimal"));
+
 
 	/* This module encapsulates all encoder classes with text output format */
 	rb_mPG_TextEncoder = rb_define_module_under( rb_mPG, "TextEncoder" );
@@ -667,6 +796,8 @@ init_pg_text_encoder()
 	pg_define_coder( "Integer", pg_text_enc_integer, rb_cPG_SimpleEncoder, rb_mPG_TextEncoder );
 	/* dummy = rb_define_class_under( rb_mPG_TextEncoder, "Float", rb_cPG_SimpleEncoder ); */
 	pg_define_coder( "Float", pg_text_enc_float, rb_cPG_SimpleEncoder, rb_mPG_TextEncoder );
+	/* dummy = rb_define_class_under( rb_mPG_TextEncoder, "Numeric", rb_cPG_SimpleEncoder ); */
+	pg_define_coder( "Numeric", pg_text_enc_numeric, rb_cPG_SimpleEncoder, rb_mPG_TextEncoder );
 	/* dummy = rb_define_class_under( rb_mPG_TextEncoder, "String", rb_cPG_SimpleEncoder ); */
 	pg_define_coder( "String", pg_coder_enc_to_s, rb_cPG_SimpleEncoder, rb_mPG_TextEncoder );
 	/* dummy = rb_define_class_under( rb_mPG_TextEncoder, "Bytea", rb_cPG_SimpleEncoder ); */

data/ext/pg_tuple.c

@@ -0,0 +1,549 @@
+#include "pg.h"
+
+/********************************************************************
+ *
+ * Document-class: PG::Tuple
+ *
+ * The class to represent one query result tuple (row).
+ * An instance of this class can be created by PG::Result#tuple .
+ *
+ * All field values of the tuple are retrieved on demand from the underlying PGresult object and converted to a Ruby object.
+ * Subsequent access to the same field returns the same object, since they are cached when materialized.
+ * Each PG::Tuple holds a reference to the related PG::Result object, but gets detached, when all fields are materialized.
+ *
+ * Example:
+ *    require 'pg'
+ *    conn = PG.connect(:dbname => 'test')
+ *    res  = conn.exec('VALUES(1,2), (3,4)')
+ *    t0 = res.tuple(0)  # => #<PG::Tuple column1: "1", column2: "2">
+ *    t1 = res.tuple(1)  # => #<PG::Tuple column1: "3", column2: "4">
+ *    t1[0]  # => "3"
+ *    t1["column2"]  # => "4"
+ */
+
+static VALUE rb_cPG_Tuple;
+
+typedef struct {
+	/* PG::Result object this tuple was retrieved from.
+	 * Qnil when all fields are materialized.
+	 */
+	VALUE result;
+
+	/* Store the typemap of the result.
+	 * It's not enough to reference the PG::TypeMap object through the result,
+	 * since it could be exchanged after the tuple has been created.
+	 */
+	VALUE typemap;
+
+	/* Hash with maps field names to index into values[]
+	 * Shared between all instances retrieved from one PG::Result.
+	 */
+	VALUE field_map;
+
+	/* Row number within the result set. */
+	int row_num;
+
+	/* Number of fields in the result set. */
+	int num_fields;
+
+	/* Materialized values.
+	 * And in case of dup column names, a field_names Array subsequently.
+	 */
+	VALUE values[0];
+} t_pg_tuple;
+
+static inline VALUE
+pg_tuple_get_field_names( t_pg_tuple *this )
+{
+	if( this->num_fields != (int)RHASH_SIZE(this->field_map) ){
+		return this->values[this->num_fields];
+	} else {
+		return Qfalse;
+	}
+}
+
+static void
+pg_tuple_gc_mark( t_pg_tuple *this )
+{
+	int i;
+
+	if( !this ) return;
+	rb_gc_mark( this->result );
+	rb_gc_mark( this->typemap );
+	rb_gc_mark( this->field_map );
+
+	for( i = 0; i < this->num_fields; i++ ){
+		rb_gc_mark( this->values[i] );
+	}
+	rb_gc_mark( pg_tuple_get_field_names(this) );
+}
+
+static void
+pg_tuple_gc_free( t_pg_tuple *this )
+{
+	if( !this ) return;
+	xfree(this);
+}
+
+static size_t
+pg_tuple_memsize( t_pg_tuple *this )
+{
+	if( this==NULL ) return 0;
+	return sizeof(*this) +  sizeof(*this->values) * this->num_fields;
+}
+
+static const rb_data_type_t pg_tuple_type = {
+	"pg",
+	{
+		(void (*)(void*))pg_tuple_gc_mark,
+		(void (*)(void*))pg_tuple_gc_free,
+		(size_t (*)(const void *))pg_tuple_memsize,
+	},
+	0, 0,
+#ifdef RUBY_TYPED_FREE_IMMEDIATELY
+	RUBY_TYPED_FREE_IMMEDIATELY,
+#endif
+};
+
+/*
+ * Document-method: allocate
+ *
+ * call-seq:
+ *   PG::VeryTuple.allocate -> obj
+ */
+static VALUE
+pg_tuple_s_allocate( VALUE klass )
+{
+	return TypedData_Wrap_Struct( klass, &pg_tuple_type, NULL );
+}
+
+VALUE
+pg_tuple_new(VALUE result, int row_num)
+{
+	t_pg_tuple *this;
+	VALUE self = pg_tuple_s_allocate( rb_cPG_Tuple );
+	t_pg_result *p_result = pgresult_get_this(result);
+	int num_fields = p_result->nfields;
+	int i;
+	VALUE field_map = p_result->field_map;
+	int dup_names = num_fields != (int)RHASH_SIZE(field_map);
+
+	this = (t_pg_tuple *)xmalloc(
+		sizeof(*this) +
+		sizeof(*this->values) * num_fields +
+		sizeof(*this->values) * (dup_names ? 1 : 0));
+
+	this->result = result;
+	this->typemap = p_result->typemap;
+	this->field_map = field_map;
+	this->row_num = row_num;
+	this->num_fields = num_fields;
+
+	for( i = 0; i < num_fields; i++ ){
+		this->values[i] = Qundef;
+	}
+
+	if( dup_names ){
+		/* Some of the column names are duplicated -> we need the keys as Array in addition.
+		 * Store it behind the values to save the space in the common case of no dups.
+		 */
+		this->values[num_fields] = rb_obj_freeze(rb_ary_new4(num_fields, p_result->fnames));
+	}
+
+	RTYPEDDATA_DATA(self) = this;
+
+	return self;
+}
+
+static inline t_pg_tuple *
+pg_tuple_get_this( VALUE self )
+{
+	t_pg_tuple *this;
+	TypedData_Get_Struct(self, t_pg_tuple, &pg_tuple_type, this);
+	if (this == NULL)
+		rb_raise(rb_eTypeError, "tuple is empty");
+
+	return this;
+}
+
+static VALUE
+pg_tuple_materialize_field(t_pg_tuple *this, int col)
+{
+	VALUE value = this->values[col];
+
+	if( value == Qundef ){
+		t_typemap *p_typemap = DATA_PTR( this->typemap );
+
+		pgresult_get(this->result); /* make sure we have a valid PGresult object */
+		value = p_typemap->funcs.typecast_result_value(p_typemap, this->result, this->row_num, col);
+		this->values[col] = value;
+	}
+
+	return value;
+}
+
+static void
+pg_tuple_detach(t_pg_tuple *this)
+{
+	this->result = Qnil;
+	this->typemap = Qnil;
+	this->row_num = -1;
+}
+
+static void
+pg_tuple_materialize(t_pg_tuple *this)
+{
+	int field_num;
+	for(field_num = 0; field_num < this->num_fields; field_num++) {
+		pg_tuple_materialize_field(this, field_num);
+	}
+
+	pg_tuple_detach(this);
+}
+
+/*
+ * call-seq:
+ *    tup.fetch(key) → value
+ *    tup.fetch(key, default) → value
+ *    tup.fetch(key) { |key| block } → value
+ *
+ * Returns a field value by either column index or column name.
+ *
+ * An integer +key+ is interpreted as column index.
+ * Negative values of index count from the end of the array.
+ *
+ * Depending on Result#field_name_type= a string or symbol +key+ is interpreted as column name.
+ *
+ * If the key can't be found, there are several options:
+ * With no other arguments, it will raise a IndexError exception;
+ * if default is given, then that will be returned;
+ * if the optional code block is specified, then that will be run and its result returned.
+ */
+static VALUE
+pg_tuple_fetch(int argc, VALUE *argv, VALUE self)
+{
+	VALUE key;
+	long block_given;
+	VALUE index;
+	int field_num;
+	t_pg_tuple *this = pg_tuple_get_this(self);
+
+	rb_check_arity(argc, 1, 2);
+	key = argv[0];
+
+	block_given = rb_block_given_p();
+	if (block_given && argc == 2) {
+		rb_warn("block supersedes default value argument");
+	}
+
+	switch(rb_type(key)){
+		case T_FIXNUM:
+		case T_BIGNUM:
+			field_num = NUM2INT(key);
+			if ( field_num < 0 )
+				field_num = this->num_fields + field_num;
+			if ( field_num < 0 || field_num >= this->num_fields ){
+				if (block_given) return rb_yield(key);
+				if (argc == 1) rb_raise( rb_eIndexError, "Index %d is out of range", field_num );
+				return argv[1];
+			}
+			break;
+		default:
+			index = rb_hash_aref(this->field_map, key);
+
+			if (index == Qnil) {
+				if (block_given) return rb_yield(key);
+				if (argc == 1) rb_raise( rb_eKeyError, "column not found" );
+				return argv[1];
+			}
+
+			field_num = NUM2INT(index);
+	}
+
+	return pg_tuple_materialize_field(this, field_num);
+}
+
+/*
+ * call-seq:
+ *    tup[ key ] -> value
+ *
+ * Returns a field value by either column index or column name.
+ *
+ * An integer +key+ is interpreted as column index.
+ * Negative values of index count from the end of the array.
+ *
+ * Depending on Result#field_name_type= a string or symbol +key+ is interpreted as column name.
+ *
+ * If the key can't be found, it returns +nil+ .
+ */
+static VALUE
+pg_tuple_aref(VALUE self, VALUE key)
+{
+	VALUE index;
+	int field_num;
+	t_pg_tuple *this = pg_tuple_get_this(self);
+
+	switch(rb_type(key)){
+		case T_FIXNUM:
+		case T_BIGNUM:
+			field_num = NUM2INT(key);
+			if ( field_num < 0 )
+				field_num = this->num_fields + field_num;
+			if ( field_num < 0 || field_num >= this->num_fields )
+				return Qnil;
+			break;
+		default:
+			index = rb_hash_aref(this->field_map, key);
+			if( index == Qnil ) return Qnil;
+			field_num = NUM2INT(index);
+	}
+
+	return pg_tuple_materialize_field(this, field_num);
+}
+
+static VALUE
+pg_tuple_num_fields_for_enum(VALUE self, VALUE args, VALUE eobj)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	return INT2NUM(this->num_fields);
+}
+
+static int
+pg_tuple_yield_key_value(VALUE key, VALUE index, VALUE _this)
+{
+	t_pg_tuple *this = (t_pg_tuple *)_this;
+	VALUE value = pg_tuple_materialize_field(this, NUM2INT(index));
+	rb_yield_values(2, key, value);
+	return ST_CONTINUE;
+}
+
+/*
+ * call-seq:
+ *    tup.each{ |key, value| ... }
+ *
+ * Invokes block for each field name and value in the tuple.
+ */
+static VALUE
+pg_tuple_each(VALUE self)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	VALUE field_names;
+
+	RETURN_SIZED_ENUMERATOR(self, 0, NULL, pg_tuple_num_fields_for_enum);
+
+	field_names = pg_tuple_get_field_names(this);
+
+	if( field_names == Qfalse ){
+		rb_hash_foreach(this->field_map, pg_tuple_yield_key_value, (VALUE)this);
+	} else {
+		int i;
+		for( i = 0; i < this->num_fields; i++ ){
+			VALUE value = pg_tuple_materialize_field(this, i);
+			rb_yield_values(2, RARRAY_AREF(field_names, i), value);
+		}
+	}
+
+	pg_tuple_detach(this);
+	return self;
+}
+
+/*
+ * call-seq:
+ *    tup.each_value{ |value| ... }
+ *
+ * Invokes block for each field value in the tuple.
+ */
+static VALUE
+pg_tuple_each_value(VALUE self)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	int field_num;
+
+	RETURN_SIZED_ENUMERATOR(self, 0, NULL, pg_tuple_num_fields_for_enum);
+
+	for(field_num = 0; field_num < this->num_fields; field_num++) {
+		VALUE value = pg_tuple_materialize_field(this, field_num);
+		rb_yield(value);
+	}
+
+	pg_tuple_detach(this);
+	return self;
+}
+
+
+/*
+ * call-seq:
+ *    tup.values  -> Array
+ *
+ * Returns the values of this tuple as Array.
+ * +res.tuple(i).values+ is equal to +res.tuple_values(i)+ .
+ */
+static VALUE
+pg_tuple_values(VALUE self)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+
+	pg_tuple_materialize(this);
+	return rb_ary_new4(this->num_fields, &this->values[0]);
+}
+
+static VALUE
+pg_tuple_field_map(VALUE self)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	return this->field_map;
+}
+
+static VALUE
+pg_tuple_field_names(VALUE self)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	return pg_tuple_get_field_names(this);
+}
+
+/*
+ * call-seq:
+ *    tup.length → integer
+ *
+ * Returns number of fields of this tuple.
+ */
+static VALUE
+pg_tuple_length(VALUE self)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	return INT2NUM(this->num_fields);
+}
+
+/*
+ * call-seq:
+ *    tup.index(key) → integer
+ *
+ * Returns the field number which matches the given column name.
+ */
+static VALUE
+pg_tuple_index(VALUE self, VALUE key)
+{
+	t_pg_tuple *this = pg_tuple_get_this(self);
+	return rb_hash_aref(this->field_map, key);
+}
+
+
+static VALUE
+pg_tuple_dump(VALUE self)
+{
+	VALUE field_names;
+	VALUE values;
+	VALUE a;
+	t_pg_tuple *this = pg_tuple_get_this(self);
+
+	pg_tuple_materialize(this);
+
+	field_names = pg_tuple_get_field_names(this);
+	if( field_names == Qfalse )
+		field_names = rb_funcall(this->field_map, rb_intern("keys"), 0);
+
+	values = rb_ary_new4(this->num_fields, &this->values[0]);
+	a = rb_ary_new3(2, field_names, values);
+
+	if (FL_TEST(self, FL_EXIVAR)) {
+		rb_copy_generic_ivar(a, self);
+		FL_SET(a, FL_EXIVAR);
+	}
+
+	return a;
+}
+
+static VALUE
+pg_tuple_load(VALUE self, VALUE a)
+{
+	int num_fields;
+	int i;
+	t_pg_tuple *this;
+	VALUE values;
+	VALUE field_names;
+	VALUE field_map;
+	int dup_names;
+
+	rb_check_frozen(self);
+
+	TypedData_Get_Struct(self, t_pg_tuple, &pg_tuple_type, this);
+	if (this)
+		rb_raise(rb_eTypeError, "tuple is not empty");
+
+	Check_Type(a, T_ARRAY);
+	if (RARRAY_LEN(a) != 2)
+		rb_raise(rb_eTypeError, "expected an array of 2 elements");
+
+	field_names = RARRAY_AREF(a, 0);
+	Check_Type(field_names, T_ARRAY);
+	rb_obj_freeze(field_names);
+	values = RARRAY_AREF(a, 1);
+	Check_Type(values, T_ARRAY);
+	num_fields = RARRAY_LEN(values);
+
+	if (RARRAY_LEN(field_names) != num_fields)
+		rb_raise(rb_eTypeError, "different number of fields and values");
+
+	field_map = rb_hash_new();
+	for( i = 0; i < num_fields; i++ ){
+		rb_hash_aset(field_map, RARRAY_AREF(field_names, i), INT2FIX(i));
+	}
+	rb_obj_freeze(field_map);
+
+	dup_names = num_fields != (int)RHASH_SIZE(field_map);
+
+	this = (t_pg_tuple *)xmalloc(
+		sizeof(*this) +
+		sizeof(*this->values) * num_fields +
+		sizeof(*this->values) * (dup_names ? 1 : 0));
+
+	this->result = Qnil;
+	this->typemap = Qnil;
+	this->row_num = -1;
+	this->num_fields = num_fields;
+	this->field_map = field_map;
+
+	for( i = 0; i < num_fields; i++ ){
+		VALUE v = RARRAY_AREF(values, i);
+		if( v == Qundef )
+			rb_raise(rb_eTypeError, "field %d is not materialized", i);
+		this->values[i] = v;
+	}
+
+	if( dup_names ){
+		this->values[num_fields] = field_names;
+	}
+
+	RTYPEDDATA_DATA(self) = this;
+
+	if (FL_TEST(a, FL_EXIVAR)) {
+		rb_copy_generic_ivar(self, a);
+		FL_SET(self, FL_EXIVAR);
+	}
+
+	return self;
+}
+
+void
+init_pg_tuple()
+{
+	rb_cPG_Tuple = rb_define_class_under( rb_mPG, "Tuple", rb_cObject );
+	rb_define_alloc_func( rb_cPG_Tuple, pg_tuple_s_allocate );
+	rb_include_module(rb_cPG_Tuple, rb_mEnumerable);
+
+	rb_define_method(rb_cPG_Tuple, "fetch", pg_tuple_fetch, -1);
+	rb_define_method(rb_cPG_Tuple, "[]", pg_tuple_aref, 1);
+	rb_define_method(rb_cPG_Tuple, "each", pg_tuple_each, 0);
+	rb_define_method(rb_cPG_Tuple, "each_value", pg_tuple_each_value, 0);
+	rb_define_method(rb_cPG_Tuple, "values", pg_tuple_values, 0);
+	rb_define_method(rb_cPG_Tuple, "length", pg_tuple_length, 0);
+	rb_define_alias(rb_cPG_Tuple, "size", "length");
+	rb_define_method(rb_cPG_Tuple, "index", pg_tuple_index, 1);
+
+	rb_define_private_method(rb_cPG_Tuple, "field_map", pg_tuple_field_map, 0);
+	rb_define_private_method(rb_cPG_Tuple, "field_names", pg_tuple_field_names, 0);
+
+	/* methods for marshaling */
+	rb_define_private_method(rb_cPG_Tuple, "marshal_dump", pg_tuple_dump, 0);
+	rb_define_private_method(rb_cPG_Tuple, "marshal_load", pg_tuple_load, 1);
+}