Abstract: A process and system for assisting a user to write new lines of code of a computer program based on code examples. A first line in each code sample matching a specified anchor line. A loop having a custom line branch and a code assist branch is executed. The custom line branch generates a new line for the computer program via a custom line provided by the user. The code assist branch generates a new line for the computer program via code assist. The code assist determines a set of assist lines from the code samples, selects from the assist lines set of preferred lines sequenced in an order of preference, presents the set of preferred lines to the user, receives a preferred line selected by the user after the user edits the selected line to fit the user's context, and stores the preferred line as a new line.

Abstract: A process and system for assisting a user to write new lines of code of a computer program based on code examples. A first line in each code sample matching a specified anchor line. A loop having a custom line branch and a code assist branch is executed. The custom line branch generates a new line for the computer program via a custom line provided by the user. The code assist branch generates a new line for the computer program via code assist. The code assist determines a set of assist lines from the code samples, translates the assist lines to a user context in each code example, selects from the assist lines set of preferred lines sequenced in an order of preference, presents the set of preferred lines to the user, receives a preferred line selected by the user, and stores the preferred line as a new line.

Abstract: A method of routing an email message comprises receiving a message to be routed, receiving details of a first recipient of the message, receiving an indication of a second recipient of the message, the indication defining a relationship to the first recipient, obtaining an address for the first recipient, obtaining an address for the second recipient, and transmitting the email message to the first and second recipients.

Abstract: A method and system for code editing using copy and paste operations are provided. The method includes copying a section of text (111) from a source program text (101) and providing source context information (120) for the copied section of text (111). The method further includes pasting (140) the copied section of text (111) to a destination location, including: defining the pasted text (140) as separate from the destination program text (102); carrying out editing (132) to conform variables of the pasted text to the variables of the destination program text (102); and then integrating (133) the pasted text into the destination program text (102). The step of carrying out editing to conform variables of the pasted text (140) to the variables of the destination program text (102) references the source context information (120) and context information (104) of the destination program text (102).

Abstract: A code assistance feature provides a user with a set of suggested program code insertions at a given point in the program code being edited. For example, in response to a user command, the feature identifies syntactically correct possible insertions derived from a search for insertions of a compatible type. The feature identifies members in the set of possible code insertions that can be expanded via a field dereference or subroutine call to provide further possible code insertions for selection by the user.

Abstract: A method, apparatus and computer program element are disclosed for selecting a term for inclusion in a glossary in a document handling or processing system in which a set of functions or rules are applied to the term in order to provide a probability measure for the terms being suitable for inclusion in said glossary.

Abstract: A method, apparatus and computer program product for providing recovery data for program code. A first version of an object code module is received. A second version of the object code module is received, the second version being a subsequent version to the first version. A unique identifier is inserted in the second version, wherein the unique identifier indicates a location of recovery data. First difference data representing a difference between the second version and the first version is calculated. The first difference data is stored as the recovery data. The first difference data is stored within the second version of the object code module at the location. The unique identifier indicates a location of the recovery data.

Abstract: A method of allocating memory in a data processing system 10 and a memory allocation mechanism 54 are provided. Memory is allocated by the memory allocation mechanism in response to a memory allocation request 56 from a process 50 running on the system 10. The request 56 includes data identifying the size of the block required and an indication of a mask bit pattern. The memory allocation mechanism receives the request, selects a block of memory having an appropriate size and having an address with a bit pattern which corresponds correctly to the indicated mask bit pattern, and allocates the selected block of memory to the process.

Abstract: The invention relates to a method of operating a computer system supporting multiple processes, and the intention is to avoid deadlock (an example of which is where process A owns resource A, and is waiting on resource B, but resource B is currently owned by process B, which is waiting on resource A). The method commences with receipt of a request from a first process for access to a resource of said computer system. If the requested resource is currently unavailable because it is currently owned by another process, the system examines which processes own or are waiting for other resources on the system, in order to try to detect whether adding the first process to a queue for the requested resource would cause a deadlock situation to arise. If so, the system will typically throw an exception, or possibly return an error to the request for the resource.

Abstract: A computing apparatus for use in a client/server transaction processing system, the apparatus has: a sending means for sending a transactional request to a server data processing apparatus to request that the server data processing apparatus become involved in processing a distributed transaction, the transactional request including an indication of a computing apparatus to which the server data processing apparatus should direct a registration request to request that a resource local to the server data processing apparatus be registered in the transaction; a receiving means for receiving a reply to the transactional request from the server data processing apparatus, the reply including an indication of an apparatus which is currently the last in a linear chain of apparatuses that have sent out registration requests in response to receiving transactional requests; and a keeping means for keeping track of the current apparatus which is the last in the linear chain based on replies received by the receiving mea

Abstract: The invention relates to a method of operating a computer system supporting multiple processes, and the intention is to avoid deadlock (an example of which is where process A owns resource A, and is waiting on resource B, but resource B is currently owned by process B, which is waiting on resource A). The method commences with receipt of a request from a first process for access to a resource of said computer system. If the requested resource is currently unavailable because it is currently owned by another process, the system examines which processes own or are waiting for other resources on the system, in order to try to detect whether adding the first process to a queue for the requested resource would cause a deadlock situation to arise. If so, the system will typically throw an exception, or possibly return an error to the request for the resource.

Abstract: A method of operating a first server data processing apparatus for use in coordinating a distributed transaction which is carried out by a plurality of server data processing apparatuses is disclosed, the method having steps of: receiving a registration request from a second server data processing apparatus; determining a machine address of the second server data processing apparatus that sent the registration request; keeping a list of the machine addresses of server data processing apparatuses that send registration requests to the first apparatus; determining the destination machine address of an outbound transactional request; determining whether the destination machine address of the outbound transactional request is included in the list of machine addresses kept by the keeping step; and when the destination machine address of the outbound transactional request is included in the list of machine addresses, substituting an identifier in the outbound transaction request identifying a transaction coordinato

Abstract: The invention relates to a method of operating a computer system supporting multiple processes having potentially different priorities. The system provides a wait-notify mechanism, whereby a first process can be suspended pending notification from a second process. The mechanism is controlled via a predetermined resource which-must be-owned by the first process when suspension is initiated, and the second process at the time of notification. During the suspension of the first process, the priority of a process that acquires ownership of said predetermined resource is increased, typically to a level equal to that of the first process. This ensures that the first process does not wait an unduly long time to be notified for resumption.

Abstract: A first server computing apparatus receives a reply from a second server apparatus, the reply includes an indication of the total amount of time that the second apparatus has taken to generate the reply. The first apparatus determines the total amount of time that has elapsed between the sending of the reply and the receipt of the reply. The first apparatus also determines the total amount of transit time for the request to travel from the first apparatus to the second apparatus and the reply to travel from the second apparatus to the first apparatus. The first apparatus selects one of a plurality of apparatuses as a last agent for use in a last agent optimization operation during completion of the distributed transaction based on the determinations.

Abstract: A data processing apparatus in communication with a network for allowing the apparatus to communicate with a second data processing apparatus via the network, the data processing apparatus has: a receiving unit for receiving a request on a target object; an activating unit for activating the target object if the target object is inactive; and a dispatching unit for dispatching the request to the target object for execution thereby; wherein the activating unit determines whether software components which it needs to activate the target object are stored locally and if it determines that the software components are not stored locally the activating unit downloads such software components over the network from the second data processing apparatus; and wherein the activating unit selects candidate software components from the locally stored software components based on predetermined criteria and deletes the candidate software components from local storage.

Abstract: A method for updating a first version of installed application files to a second version is disclosed. The method comprises the steps of: responsive to receiving a delta file defining the changes between a file in the first version and a corresponding file in the second version, transforming said first version of the file into a first transformed image comprising a series of records. The changes contained in the delta file are then applied to selected records of the first transformed image to generate a transformed image of the second version. The transformation on the transformed image of said second version is then reversed to generate the second version of said file on said client computer.

Abstract: A computer system and method for performing concurrency control on work requests, the system having an object request broker for receiving work requests and for dispatching them for execution within the computer system, a processor for processing the requests which have been received by the object request broker, and a concurrency control component in the object request broker for performing concurrency control by isolating the effects of a group of related work requests which form a transaction. The method includes the steps of receiving a work request, analyzing the requested object and method related to the work request, and locking the brokering of the method.

Abstract: An object oriented thread context manager, a method and computer program product are provided for object oriented thread context management. A context manager is provided for managing a plurality of ContextControl objects. Each ContextControl object comprises a plurality of methods for creating and suspending context on a thread for a target object. When a method request for a target object is received at a server process, the server process calls a thread manager requesting a thread. The thread manager calls the context manager for associating context with a current thread for the method request. Responsive to the context manager providing associated context with the current thread, the thread manager dispatches the method request for the target object. The thread manager calls the context manager for disassociating context with the current thread.

Abstract: In brief, an object oriented thread context manager, a method and computer program product are provided for object oriented thread context management, particularly for relational databases working with distributed transactions. A context manager is provided for managing a plurality of ContextControl objects. Each ContextControl object comprises a plurality of methods for creating, resuming and suspending context on a thread for a target object. A ContextCoordinator class is provided for managing calls to the plurality of ContextControl objects. A ContextHandleList is provided for storing context information for the ContextControl objects. A specialized ContextCoordinator is provided for managing calls to a specialized ones of the ContextControl objects. A DatabaseContextCoordinator is an example of the specialized ContextCoordinator. The specialized ones of the ContextControl objects are registered and unregistered with the ContextCoordinator class and then registered DatabaseContextCoordinator.