Abstract: A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system differentiates locks based on a priority hierarchy. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

Abstract: A system and process for interacting with a system in an insecure state is described. Before logging into a secure state of a computer system, a user is able to access limited information including calendar information regarding meetings for that day and the like. In some aspects of the invention, a user may interact with a displayed note pad for receiving handwritten or typed notes. Aspects of the described system and method permit a user to quickly review or interact with a computer prior to logging into a secured state of the computer system.

Abstract: Methods for communicating between an application and an ink divider object (which stores ink strokes to be divided into groups) may include: (a) issuing a divide request to the ink divider object, optionally by the application; (b) in response to the divide request, calling a divide method, which groups the stored ink strokes into one or more groupings of strokes having a first predetermined granularity (e.g., words, lines, paragraphs, sentences, drawings, etc.); and (c) making information regarding the one or more groupings of strokes available to the application. This “information” made available to the application may include, for example, the actual groupings of the strokes, the number of stroke groupings having the first predetermined granularity, machine generated text corresponding to the stroke groupings, or the like. The results of the divide method may be stored in an ink division result object.

Abstract: A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

Abstract: Methods for communicating between an application and an ink divider object (which stores ink strokes to be divided into groups) may include: (a) issuing a divide request to the ink divider object, optionally by the application; (b) in response to the divide request, calling a divide method, which groups the stored ink strokes into one or more groupings of strokes having a first predetermined granularity (e.g., words, lines, paragraphs, sentences, drawings, etc.); and (c) making information regarding the one or more groupings of strokes available to the application. This “information” made available to the application may include, for example, the actual groupings of the strokes, the number of stroke groupings having the first predetermined granularity, machine generated text corresponding to the stroke groupings, or the like. The results of the divide method may be stored in an ink division result object.

Abstract: A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system differentiates locks based on a priority hierarchy. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

Abstract: A method and system for causing editable text to substantially occupy an associated text frame. The system and method operate in a standard text editing environment of a text editing application program. The height of the editable text is altered, without the need for user interaction, directly in the standard text editing environment. A fullness ratio is determined, which may be defined as a ratio of the height of the editable text to the height of the text frame. If the fullness ratio is not within a predetermined range of values, the height of the editable text will be altered. An ideal height for the editable text is determined that will cause the fullness ratio to be within the predetermined range of values. The ideal height is a function of the font size of the characters that make up the editable text. So, an ideal font size must be determined, that when applied to the editable text, will cause the fullness ratio to be within the predetermined range of values.