Path: utzoo!attcan!uunet!littlei!intelisc!joel From: joel@intelisc.UUCP (Joel Clark) Newsgroups: comp.unix.questions Subject: Re: RCS and SCCS Message-ID: <293@intelisc.UUCP> Date: 29 Jun 88 15:37:58 GMT References: <890@fig.bbn.com> <710@ubu.warwick.UUCP> <661@pyuxe.UUCP> <290@intelisc.UUCP> <10406@ulysses.homer.nj.att.com> Reply-To: joel@intelisc.UUCP (Joel Clark) Organization: Intel Scientific Computer, Beaverton, OR Lines: 26 In article <10406@ulysses.homer.nj.att.com> ekrell@hector (Eduardo Krell) writes: >In article <290@intelisc.UUCP> joel@intelisc.UUCP (Joel Clark) writes: > >>Can anyone explain to me how a program could store `the most recent version` >>such that each line in the file does not need to be examined to determine >>if it is in the most recent version? > >You store the most recent version at the beginning of the file in clear >text followed by the reverse delta to get the previous version >(followed by the reverse delta to get the version before that, etc.). > >Time to get the latest version is thus proportional only to the size of >that version. Time to get version N is proportional to the size of >the last version plus the size of all deltas necessary to get from there >down to version N. > > Eduardo Krell AT&T Bell Laboratories, Murray Hill, NJ > > UUCP: {ihnp4,ucbvax}!ulysses!ekrell ARPA: ekrell@ulysses.att.com How well does this work if (as we are) you are working from 3 branches at once. We keep major branches for Development engineers, Sustaining engineers and Evaluation all in the same source file. This allows us to proceed with project that may not go into production for 12-18 months based on the same sources that we ship, folding in the changes to the production code as they become solid.