Timeline
Not logged in

20 ancestors of [e29abeff80]


2007-11-20
23:54:34 * [e29abeff80] Add the SbS_Render() interface for rendering HTML with embedded subscript. (user: drh, tags: trunk)

2007-11-18
20:48:07 * [d5e7891b07] Add a more advanced commit-hook mechanism that allows us to specify multiple procedures in a particular order prior to commit. Continuing work toward getting tickets going. (user: drh, tags: trunk)
2007-11-17
17:48:46 * [8c96ed62f5] Continuing work on the infrastructure for tickets. (user: drh, tags: trunk)
00:29:42 * [38b967dcf5] Merge Merge aku's CVS import changes into the main line. Fix a small bug in diff.c. (user: drh, tags: trunk)
2007-11-16
20:42:31 * [36b96b8616] Rework the merge algorithm. It now only works for text files. But, it no longer gets confused by line endings (\r\n versus \n) and it reports conflicts. (user: drh, tags: trunk)
08:32:40 * [96b7bfb834] Added convenience command to the state package when the sql returns a single row. Added more statistics about revisions, tags, branches, symbols, changesets to various passes. (user: aku, tags: trunk)
06:55:58 * [ce7fb48e8c] Moved out-of-place state declarations to the proper phase (setup, not run). (user: aku, tags: trunk)
06:53:01 * [e7c805f137] Added skeleton of pass 8, the final pass for the breaking of dependency cycles. This pass will handle the remaining cycles crossing revision and symbol changesets. (user: aku, tags: trunk)
06:51:25 * [7b3928681e] Bugfix. Destroy graph object after use. (user: aku, tags: trunk)
04:17:30 * [770a9b576a] Completed pass 7, breaking dependency cycles over symbol changesets. Moved the bulk of the cycle breaker code into its own class as it was common to the passes 6 and 7, and updated the two passes accordingly. Added code to load the changeset counter from the state to start properly. (user: aku, tags: trunk)
03:59:21 * [de64c94f54] Bugfix. When setting up or extended the changeset graph a changeset's successor may lay outside of the set of changesets under consideration, i.e. without a node in the graph. Ignore these. This did not (or only rarely) happen before the bugfix to the successor computation of changesets in project::rev (list instead of single). (user: aku, tags: trunk)
03:54:54 * [2516f4a56d] Bugfix. When I introduced the 'revisionbranchchildren' table to pass 2 I forgot to update pass 4 as well. Added code to drop the excluded revisons from this table as well, as either parent of branches, or branch child of some other revision. (user: aku, tags: trunk)
03:52:18 * [341d96be21] Bugfix. In pass 5, loading the changesets used the type codes instead of the type names. Modified the SQL selecting the data to return the proper names. (user: aku, tags: trunk)
03:17:35 * [f1b55da0ac] Bug fixes in the Myers diff algorithm. (user: drh, tags: trunk)
2007-11-15
21:49:14 * [57b2735ebd] Enhanced text diff subroutine uses Myers enhancements to Wagners minimum edit distance algorithm. White space at the end of lines is ignored. (user: drh, tags: trunk)
07:17:07 * [258366a37a] Added skeleton files for pass 7, the breaking of dependency cycles over symbol-based changesets. (user: aku, tags: trunk)
2007-11-14
05:26:18 * [f631d438b4] Added note regarding 'RevisionTopologicalSortPass', which is not a separate pass for us, but part of pass 6, breaking cycles over revision changesets. (user: aku, tags: trunk)
05:11:56 * [94c39d6375] Completed pass 6, wrote the code performing the breaking of cycles. Done by analysing each triple of changesets in the cycle at the file dependency level to see which revisions can be sorted apart. Added some additional utility routines. Extended the changeset class with the accessors required by the cycle breaker. (user: aku, tags: trunk)
05:08:43 * [67600f777b] Fixed handling of project objects when persisting them. Fill the project map. This is needed if the pass is not skipped. For the skip case we already initialize the project map when 'load'ing from the state. (user: aku, tags: trunk)
2007-11-13
07:22:35 * [85bd219d0b] Continued work on pass 6. Completed creation of changeset graph (nodes, dependencies), started on topological iteration and breaking cycles. Basic iteration is complete, fiding a cycle ditto. Not yet done is to actually break a found cycle. Extended the changeset class with the necessary accessor methods (getting cset type, successors, time range).... (user: aku, tags: trunk)
05:09:07 * [24c0b662de] Reworked the in-memory storage of changesets in pass 5 and supporting classes, and added loading of changesets from the persistent state for when the pass is skipped. (user: aku, tags: trunk)