OLD | NEW |
1 #!/usr/bin/python | 1 #!/usr/bin/env python |
2 # | 2 # |
3 # Copyright (c) 2012 The Native Client Authors. All rights reserved. | 3 # Copyright (c) 2012 The Native Client Authors. All rights reserved. |
4 # Use of this source code is governed by a BSD-style license that can be | 4 # Use of this source code is governed by a BSD-style license that can be |
5 # found in the LICENSE file. | 5 # found in the LICENSE file. |
6 # | 6 # |
7 | 7 |
8 """ | 8 """ |
9 Table minimization algorithm. | 9 Table minimization algorithm. |
10 """ | 10 """ |
11 | 11 |
(...skipping 51 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 if not simp_patterns: | 63 if not simp_patterns: |
64 # Stick in true, so row is always non-empty | 64 # Stick in true, so row is always non-empty |
65 simp_patterns.append(dgen_core.BitPattern(0, 0, '==')) | 65 simp_patterns.append(dgen_core.BitPattern(0, 0, '==')) |
66 r.patterns = simp_patterns | 66 r.patterns = simp_patterns |
67 | 67 |
68 def each_index_pair(sequence): | 68 def each_index_pair(sequence): |
69 """Utility function: Generates each unique index pair in sequence.""" | 69 """Utility function: Generates each unique index pair in sequence.""" |
70 for i in range(0, len(sequence)): | 70 for i in range(0, len(sequence)): |
71 for j in range(i + 1, len(sequence)): | 71 for j in range(i + 1, len(sequence)): |
72 yield (i, j) | 72 yield (i, j) |
OLD | NEW |