It's all about the answers!

Ask a question

How to Programmatically Get Revision Information


Paul Bishop (1154) | asked Jul 14 '09, 5:27 a.m.
Hi again

another scenario

A user takes two Patches, built from two separate Change Sets. The same source/data items exist within both patches, at different revisions. Patch A contains the latest version of some routines, whilst Patch B contains the latest version of some others.

We need to identify the latest revisions of the items contained in the Patches, in order to programmatically transfer the latest iterations to the user’s Unix area. We cannot simply assume Patch A supercedes Patch B or vice versa.

Can anyone provide guidance on how this should be done

many thanks

Paul

One answer



permanent link
Geoffrey Clemm (30.1k33035) | answered Jul 14 '09, 7:57 a.m.
FORUM ADMINISTRATOR / FORUM MODERATOR / JAZZ DEVELOPER
I believe the short answer is that "you can't". A "patch" does not
contain nearly enough information to allow you to do what you describe.
To handle this, you would need the repository's knowledge of the
relationship between change-sets, which is what the RTC SCM system provides.

So you can use the RTC SCM system to perform this operation on change
sets, but cannot do this operation on just the Patches produced from
change sets.

Cheers,
Geoff

PJBishop wrote:
Hi again

another scenario

A user takes two Patches, built from two separate Change Sets. The
same source/data items exist within both patches, at different
revisions. Patch A contains the latest version of some routines,
whilst Patch B contains the latest version of some others.

We need to identify the latest revisions of the items contained in the
Patches, in order to programmatically transfer the latest iterations
to the users Unix area. We cannot simply assume Patch A
supercedes Patch B or vice versa.

Can anyone provide guidance on how this should be done

many thanks

Paul

Your answer


Register or to post your answer.


Dashboards and work items are no longer publicly available, so some links may be invalid. We now provide similar information through other means. Learn more here.