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: pautet@email.enst.fr (Laurent Pautet) Subject: Re: Configuration Management for Ada on Unix Date: 1996/05/30 Message-ID: <4oile8$gl0@foehn.enst.fr>#1/1 X-Deja-AN: 157432032 sender: pautet@enst.fr references: <4nvm27$e68@gde.GDEsystems.COM> <31A79E0A.2F99@hiwaay.net> <4o94io$5ai@foehn.enst.fr> <4oi2s7$fbm@noc2.drexel.edu> content-type: text/plain; charset=iso-8859-1 organization: Ecole Nationale Superieure des Telecommunications mime-version: 1.0 newsgroups: comp.lang.ada Date: 1996-05-30T00:00:00+00:00 List-Id: Chris Papademetrious wrote: > > 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. That's absolutely wrong. You can do it with both RCS *and* SCCS. You didn't understand the difference between RCS and SCCS. Do : rcs -oB and B won't exist anymore and only the difference V(C) - V(A) will be stored. -- -- Laurent