From: Dobrica Pavlinusic <dpavlin@rot13.org>
Date: Mon, 23 Mar 2009 09:22:30 +0000 (+0000)
Subject: sort keys so we get predictible order for test
X-Git-Tag: 0.0801~19
X-Git-Url: http://git.rot13.org//?p=perl-Redis.git;a=commitdiff_plain;h=01860f4554d3bba7c67c0c65e28023db4f90ca72

sort keys so we get predictible order for test


git-svn-id: svn+ssh://llin/home/dpavlin/private/svn/Redis@44 447b33ff-793d-4489-8442-9bea7d161be5
---

diff --git a/t/20-Redis-Hash.t b/t/20-Redis-Hash.t
index 687b85c..6a371ec 100755
--- a/t/20-Redis-Hash.t
+++ b/t/20-Redis-Hash.t
@@ -21,7 +21,7 @@ ok( ! keys %h, 'empty' );
 
 ok( %h = ( 'foo' => 42, 'bar' => 1, 'baz' => 99 ), '=' );
 
-is_deeply( [ keys %h ], [ 'bar', 'baz', 'foo' ], 'keys' );
+is_deeply( [ sort keys %h ], [ 'bar', 'baz', 'foo' ], 'keys' );
 
 is_deeply( \%h, { bar => 1, baz => 99, foo => 42, }, 'structure' );