4 4 * Using identical highlevel architecture (pass-based)
5 5 * Using some specific algorithms (graph traversal).
6 6
7 7 Differences:
8 8 * Not using any of its code (Different languages for one thing, [http://www.python.org/|Python] there, [http://www.tcl.tk/|Tcl] here).
9 9 * Persistent state completely different, using [http://www.sqlite.org/|sqlite] database for all things we wish to keep between passes.
10 10
11 +<p>
11 12 Status:
12 13 <table align=left border=1>
13 14 <tr>
14 15 <th>Pass</th>
15 16 <th>Description</th>
16 17 <th>Notes</th>
17 18 </tr>
................................................................................
66 67 <td><b>May still change the order of revision changesets over the result of pass 7.</b></td>
67 68 </tr>
68 69 <tr>
69 70 <td>AllTopologicallSort</td>
70 71 <td>Topologically sort all changesets</td>
71 72 <td>Ok</td>
72 73 </tr>
73 -</table>
74 74
75 +<tr>
76 +<td>Import</td>
77 +<td>Import files and changesets</td>
78 +<td>Being worked on, currently files</td>
79 +</tr>
80 +</table>
81 +</p>
75 82
76 83 Passes to do:
77 84 * Put changeset order from the top.sort passes and tree of symbols from the coll|FilterSym passes together into a tree of changesets. Note that it might not be a tree if there is an NTDB around.
78 85 * Perform the actual import.
79 86
80 87 Notes regarding the actual import:
81 88 <ul>