From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3c8a1ddc13ecb354
X-Google-Attributes: gid103376,public
From: st92j0gw@dunx1.ocs.drexel.edu (Chris Papademetrious)
Subject: Re: Configuration Management for Ada on Unix
Date: 1996/05/29
Message-ID: <4oi2s7$fbm@noc2.drexel.edu>#1/1
X-Deja-AN: 157390251
references: <4nvm27$e68@gde.GDEsystems.COM>
 <31A39EB4.15FB7483@escmail.orl.mmc.com> <4o4pup$h7n@scapin.enst.fr>
 <31A79E0A.2F99@hiwaay.net> <4o94io$5ai@foehn.enst.fr>
organization: Drexel University
newsgroups: comp.lang.ada
Date: 1996-05-29T00:00:00+00:00
List-Id: <comp.lang.ada>


pautet@email.enst.fr (Laurent Pautet) wrote:
>Maybe I am wrong, but I think SCCS is very unefficient because it
>stores patches between Version (N+1) - Version (N) and when you want
>to access to version N, internally SCCS retrieves version 0 and
>applies all the patches to obtain version N. RCS stores the last
>version (rather than the first one) and differences between Version
>(N) - Version (N+1).

 This inefficiency has a nice advantage, though.  Let's say you have
three modifications, A, B, and C, which affect the original version of
a program.  Using the method which stores only *modifications* to the
base file, you can selectively create a version which incorporates
only the modifications A and C, while leaving out those in B.  With
the way RCS works, the changes in B are inherently a part of C, and
cannot be bypassed.

 This can be VERY handy when many people make changes often to a large
body of source files.

>-- Laurent
 
 - Chris