What have you done for me lately? (Branches, merges, and change logs)
- 111 Downloads
This paper presents an algorithm for computing a change log for an element whose history includes merges. A change log is a list of comments corresponding to versions “between” two selected versions. For example, a user may want to know what changes were made to element foo.c, between the versions labeled Release1 and Release2.
KeywordsDirected Acyclic Graph Adjacency List Gray Node External Report Configuration Record
Unable to display preview. Download preview PDF.
- 1.Atria, Inc. ClearCase Concepts Manual, 1992.Google Scholar
- 2.Atria, Inc. ClearCase Reference Manual, 1992.Google Scholar
- 3.W. Babich. Software Configuration Management. Addison-Wesley, 1986.Google Scholar
- 4.Hewlett-Packard Company. HP-UX Reference, Release 9.0, 1992.Google Scholar
- 5.Hewlett-Packard Company. Programming on HP-UX, Release 9.0, 1992.Google Scholar
- 6.E. Horowitz and S. Sahni. Fundamentals of Data Structures. Computer Science Press, 1982.Google Scholar
- 7.M. Rochkind. The source code control system. IEEE Transactions on Software Engineering, pages 364–370, December 1975.Google Scholar
- 8.W. Tichy. RCS: A system for version control. Software: Practice and Experience, 15(7):637–654, July 1985.Google Scholar
- 9.D. Whitgift. Methods and Tools for Software Configuration Management. Wiley, 1991.Google Scholar