[3 of 4] Speedup GetRegistryLengthImpl() by seeding the DAFSA in reverse

net/tools/dafsa/make_dafsa_unittest.py

 #!/usr/bin/env python
 # Copyright 2014 The Chromium Authors. All rights reserved.
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
 
+import collections
+import random
 import sys
 import unittest
 import make_dafsa
 
 
 class ParseGperfTest(unittest.TestCase):
   def testMalformedKey(self):
     """Tests exception is thrown at bad format."""
     infile1 = [ '%%', '', '%%' ]
     self.assertRaises(make_dafsa.InputError, make_dafsa.parse_gperf, infile1)
@@ skipping 112 matching lines @@
   def testSingleNode(self):
     """Tests a single node is expanded to a list with the label string."""
 
     # 'ab' -> [ 'ab' ]
 
     node1 = ( 'ab', [ None ] )
     words = [ 'ab' ]
     self.assertEqual(make_dafsa.to_words(node1), words)
 
   def testChain(self):
-    """Tests a sequence of nodes are preoperly expanded."""
+    """Tests a sequence of nodes are properly expanded."""
 
     # 'ab' -> 'cd' => [ 'abcd' ]
 
     node2 = ( 'cd', [ None ] )
     node1 = ( 'ab', [ node2 ] )
     words = [ 'abcd' ]
     self.assertEqual(make_dafsa.to_words(node1), words)
 
   def testInnerTerminator(self):
     """Tests a sequence with an inner terminator is expanded to two strings."""
@@ skipping 600 matching lines @@
     infile = [ '%%', 'aa, 1', 'bbb, 2', 'baa, 1', '%%' ]
     bytes = [ 0x02, 0x83, 0xE2, 0x02, 0x83, 0x61, 0x61, 0x81, 0x62, 0x62,
               0x82 ]
     outfile = make_dafsa.to_cxx(bytes)
     self.assertEqual(make_dafsa.words_to_cxx(make_dafsa.parse_gperf(infile)),
                       outfile)
 
 
 if __name__ == '__main__':
   unittest.main()