# US 2010/0169865 A1 · Selective Notifications According to Merge Distance for Software Version Branches within a Software Configuration Management System

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0169865 A1
- Document ID: US20100169865A1
- Status: Published application
- Kind: A1
- Application number: 12/344,583
- Filed: 2008-12-28
- Published: 2010-07-01
- Earliest claimed: 2008-12-28
- Assignees: International Business Machines Corporation
- Inventors: Geoffrey M. Clemm
- Web page: https://patentgrep.com/patent/US20100169865A1

## CPC

- G06F 8/71: Version control (security arrangements therefor G06F21/57); Configuration management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer-implemented method of controlling version branching within a software configuration management system (SCMS) can include, responsive to a user initiating a check-out operation of a file within the SCMS, identifying the file and a workspace of the user and searching nodes of the repositories of the SCMS for a successor version of the file. When a successor version of the file is located within a node that is within a predetermined distance of the workspace of the user, a notification that the successor version of the file is within the predetermined distance of the workspace of the user can be output. When a successor version of the file is not located within a node within a predetermined distance of the workspace of the user, the file can be checked-out to the workspace of the user.

## Claims

### Claim 1

A computer-implemented method of controlling version branching within a software configuration management system (SCMS), the method comprising:
responsive to a user initiating a check-out operation of a file within the SCMS, identifying the file and a workspace of the user;
searching nodes of the repositories of the SCMS for a successor version of the file;
when a successor version of the file is located within a node that is within a predetermined distance of the workspace of the user, outputting a notification that the successor version of the file is within the predetermined distance of the workspace of the user; and
when a successor version of the file is not located within a node within a predetermined distance of the workspace of the user, checking-out the file to the workspace of the user.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising determining a distance between the node comprising the successor version of the file and the workspace of the user according to a number of hops to be traversed along a path linking the node comprising the successor version of the file and the workspace of the user through the SCMS.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, further comprising assigning a measure of time to each hop of the path.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, further comprising, for at least one selected hop within the path, determining a measure of time to be assigned to the selected hop according to a declaration of availability of the successor version of the file.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, further comprising, for at least one selected hop within the path, determining a measure of time to be assigned to the selected hop according to a histogram of project transfers along the selected hop.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, further comprising receiving a user-input specifying a limitation on a number of nodes to be searched.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising representing the SCMS as a graph comprising nodes and hops representing allowable connections between nodes, wherein each hop is defined according to source-target relationships between nodes defined within the SCMS.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, further comprising:
defining a plurality of accepted project nodes, wherein each accepted project node corresponds to a workspace of a single user, wherein each accepted project node stores only accepted projects; and
defining a plurality of accepted activity nodes, wherein each accepted activity node corresponds to a workspace of a single user, wherein each accepted activity node stores only accepted activities.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, further comprising defining a plurality of pending bucket nodes, wherein each pending bucket node corresponds to a workspace of a single user, wherein each pending bucket node stores unaccepted activities.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, further comprising defining a plurality of pending project nodes, wherein each pending project node represents a community repository storing at least one state of a project.

### Claim 11

A computer-implemented method of controlling version branching within a software configuration management system (SCMS), the method comprising:
representing the SCMS as a graph comprising a plurality of nodes and a plurality of hops, wherein each hop represents an allowable data transfer between two nodes, wherein each hop is defined according to source-target relationships between nodes within the SCMS;
responsive to a user initiating a check-out operation of a file within the SCMS, determining the file to be checked-out and a workspace of the user to which the file will be checked-out;
searching each node of the SCMS that is within a predetermined number of hops from a node representing the workspace of the user, according to the graph, for a successor version of the file;
when a successor version of the file is identified, outputting a notification that the successor version of the file is within the predetermined distance of the workspace of the user; and
when a successor version of the file is not identified, checking-out the file to the workspace of the user.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein searching each node of the SCMS that is within a predetermined number of hops from a node representing the workspace of the user, according to the graph, for a successor version of the file further comprises:
identifying a node comprising an activity or a project that comprises the successor version of the file; and
counting a number of hops connecting the node comprising the successor version of the file and the node representing the workspace of the user.

### Claim 13 (depends on 12)

The computer-implemented method of claim 12, further comprising assigning a measure of time to each hop of the path and summing the measures of time.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13, further comprising, for at least one selected hop within the path, determining a measure of time to be assigned to the selected hop according to a declaration of availability of the successor version of the file.

### Claim 15 (depends on 13)

The computer-implemented method of claim 13, further comprising, for at least one selected hop within the path, determining a measure of time to be assigned to the selected hop according to a histogram of project transfers along the selected hop.

### Claim 16

A computer program product comprising:
a computer-usable medium comprising computer-usable program code that, when executed by a computer, controls version branching within a software configuration management system (SCMS), the computer-usable medium comprising:
computer-usable program code that, responsive to a user initiating a check-out operation of a file within the SCMS, identifies the file and a workspace of the user;
computer-usable program code that searches nodes of the repositories of the SCMS for a successor version of the file;
computer-usable program code that, when a successor version of the file is located within a node that is within a predetermined distance of the workspace of the user, outputs a notification that the successor version of the file is within the predetermined distance of the workspace of the user; and
computer-usable program code that, when a successor version of the file is not located within a node within a predetermined distance of the workspace of the user, checks-out the file to the workspace of the user.

### Claim 17 (depends on 16)

The computer program product of claim 16, wherein the computer-usable medium further comprises computer-usable program code that determines a distance between the node comprising the successor version of the file and the workspace of the user according to a number of hops to be traversed along a path linking the node comprising the successor version of the file and the workspace of the user through the SCMS.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the computer-usable medium further comprises computer-usable program code that assigns a measure of time to each hop of the path.

### Claim 19 (depends on 16)

The computer program product of claim 16, wherein the computer-usable medium further comprises computer-usable program code that, for at least one selected hop within the path, determines a measure of time to be assigned to the selected hop according to a declaration of availability of the successor version of the file.

### Claim 20 (depends on 16)

The computer program product of claim 16, wherein the computer-usable medium further comprises computer-usable program code that, for at least one selected hop within the path, determines a measure of time to be assigned to the selected hop according to a histogram of project transfers along the selected hop.
