hash-sets,hashtables: improved key@ word

Don't need to check the length of the backing array because it can be
assumed to be > 0. That should make hash lookups a little faster.

core/hash-sets/hash-sets-tests.factor

@@ -1,7 +1,17 @@
 ! Copyright (C) 2010 Daniel Ehrenberg
 ! See http://factorcode.org/license.txt for BSD license.
-USING: accessors fry hash-sets kernel math prettyprint sequences
+USING: accessors arrays fry hash-sets hash-sets.private kernel math
-sets sorting tools.test ;
+prettyprint sequences sets sorting tools.test ;
+FROM: hashtables.private => tombstone ;
+
+! key@
+{
+    { { T{ tombstone } T{ tombstone } } f f }
+    { { T{ tombstone } 123 } 1 t }
+} [
+    "hi" 0 <hash-set> key@ 3array
+    123 HS{ 123 } key@ 3array
+] unit-test
 
 { { 1 2 3 } } [ HS{ 1 2 3 } members natural-sort ] unit-test
 

core/hash-sets/hash-sets.factor

@@ -32,8 +32,7 @@ TUPLE: hash-set
     ] if ; inline recursive
 
 : key@ ( key hash -- array n ? )
-    array>> dup length>> 0 eq?
+    array>> 2dup hash@ 0 (key@) ; inline
-    [ no-key ] [ 2dup hash@ 0 (key@) ] if ; inline
 
 : <hash-array> ( n -- array )
     3 * 1 + 2/ next-power-of-2 +empty+ <array> ; inline

core/hashtables/hashtables.factor

@@ -32,8 +32,7 @@ TUPLE: hashtable
     ] if ; inline recursive
 
 : key@ ( key hash -- array n ? )
-    array>> dup length>> 0 eq?
+    array>> 2dup hash@ 0 (key@) ; inline
-    [ no-key ] [ 2dup hash@ 0 (key@) ] if ; inline
 
 : <hash-array> ( n -- array )
     3 * 1 + 2/ next-power-of-2 2 * +empty+ <array> ; inline