getting ready for 0.1

test/speed.js

@@ -27,8 +27,24 @@
     return _.uniq(numbers, true);
   });
   
+  JSLitmus.test('_.sortBy()', function() {
+    return _.sortBy(numbers, function(num){ return -num; });
+  });
+  
   JSLitmus.test('_.isEqual()', function() {
     return _.isEqual(numbers, randomized);
   });
+  
+  JSLitmus.test('_.keys()', function() {
+    return _.keys(objects);
+  });
+  
+  JSLitmus.test('_.values()', function() {
+    return _.values(objects);
+  });
+  
+  JSLitmus.test('_.intersect()', function() {
+    return _.intersect(numbers, randomized);
+  });
 
 })();

test/test.html

@@ -20,8 +20,14 @@
   <h2 id="qunit-userAgent"></h2>
   <ol id="qunit-tests"></ol>
   <br />
-  <h1 class="qunit-header">JSLitmus Speed Suite</h1>
-  <h2 class="qunit-userAgent">Each iteration runs on an array of 1000 elements.</h2>
+  <h1 class="qunit-header">Underscore Speed Suite</h1>
+  <h2 class="qunit-userAgent">
+    A representative sample of the functions are benchmarked here, to provide
+    a sense of how fast they might run in different browsers.
+    Each iteration runs on an array of 1000 elements.<br /><br />
+    For example, the 'intersect' test measures the number of times you can
+    find the intersection of two thousand-element arrays in one second.
+  </h2>
   <br />
 </body>
 </html>