Abstract:
The present invention is directed to a method, system and program for exporting, from a source electronic data table comprising a plurality of objects having parent-child relationships to a destination electronic data table, one or several of objects with their filiation. The method for use in a computer comprises the steps of : defining objects and associating with each object one or a plurality of parent objects or one or a plurality of child objects or both; associating with each object a unique object reference (OR) equal to a prime number; determining for each object whether said object is associated with at least a child object or not : if said object is not associated with at least one child object, defining a filiation reference (FR) equal to 1; if said object is associated with at least one child object, defining a filiation reference (FR) equal to the product of two terms : a first term, equal to the product of each object reference (OR) associated with each child object of said object: a second term equal to the least common multiplier (LCM) of the filiation references of the child objects associated with said object : receiving an export command for exporting one or a plurality of selected objects with associated child objects; associating with each object, a selected children variable (SC) for determining whether or not said object belongs to the set of child objects associated with selected objects, said selected children variable being equal to : a first Boolean value if the least common multiplier (LCM) of the filiation references of the one or plurality of selected objects is a multiple of the own object reference: a second Boolean value if the least common multiplier (LCM) of the filiation references of the one or plurality of selected objects is not a multiple of the own object reference: exporting to the destination data table, the selected objects and the objects with a selected children variable (SC) equal to said first Boolean value.
Abstract:
The present invention discloses a system and method of copying and pasting a source range of cells (405) onto a destination range of cells (425) in a multi-dimensional spreadsheet comprising a plurality of cells identified by a cell address along each dimension, a range of cells comprising one or a plurality of cells, said source range of cells (405) comprising one or a plurality of working ranges of cells (401), and one or a plurality of fastening ranges of cells in which one or a plurality of graphical objects are represented (402, 403, 404), said one or plurality of graphical objects being associated with said one or plurality of working ranges of cells.
Abstract:
The present invention is directed to a method, system and program in a multi-dimensional electronic data table comprising a plurality of data, for managing deletion operations in a recursive scalable template instance; a recursive scalable template instance comprising a variable number of contiguous recursive element instances ordered and aligned along a first data table dimension and structured according to a recursive scalable template; said recursive scalable template comprising a recursive element including one or a plurality of scalable templates; each recursive element instance having a variable size along said first data table dimension and a same size along a second data table dimension; a recursive element instance comprising one or a plurality of scalable template instances; each scalable template instance of each recursive element instance being aligned along said first data table dimension; each scalable template instance within each recursive element instance being aligned along a second data table dimension; a scalable template instance comprising a variable number of elements structured according to a scalable template; an element being defined as a range of data; a range of data comprising one or a plurality of data.
Abstract:
The present invention is directed to a method, system and program, in a multi-dimensional electronic data table comprising a plurality of data, for creating one or plurality of recursive scalable template instances; a recursive scalable template instance comprising a variable number of contiguous recursive element instances ordered and aligned along a first data table dimension and structured according to a recursive scalable template; a recursive element instance being defined as comprising one or a plurality of scalable template instances; a scalable template instance comprising a variable number of elements structured according to a scalable template; an element being defined as a range of data; a range of data comprising one or a plurality of data; a recursive scalable template comprising a recursive element comprising one or a plurality of scalable templates. The method comprises for each recursive scalable template instance to create, the steps of: . Selecting a recursive scalable template; . Defining a location for creating a recursive scalable template instance; . Creating at the defined location one or a plurality of contiguous recursive element instances ordered and aligned along a first data table dimension; each recursive element instance having a variable size along said first data table dimension and a same size along a second data table dimension; . Structuring each recursive element instance according to the recursive element defined for the recursive scalable template; . Aligning each scalable template instance of each recursive element instance along said first data table dimension; . Aligning within each recursive element instance, each scalable template instance along said second data table dimension.
Abstract:
The present invention is directed to a method, system and program, in a multi-dimensional 5 electronic data table, preferably a spreadsheet, comprising a plurality of data, for managing insertion operations in a recursive scalable template instance; a recursive scalable template instance comprising a variable number of contiguous recursive element instances ordered and aligned along a first data table dimension and structured according to a recursive scalable template; said recursive scalable template comprising a recursive element including one or a plurality of scalable templates; each recursive element instance having a variable size along said first data table dimension and a same size along a second data table dimension; a recursive element instance comprising one or a plurality of scalable template instances; each scalable template instance of each recursive element instance being aligned along said first data table dimension; each scalable template instance within each recursive element instance being aligned along a second data table dimension; a scalable template instance comprising a variable number of elements structured according to a scalable template; an element being defined as a range of data; a range of data comprising one or a plurality of data.
Abstract:
A method and system for managing deletion operations in a recursive scalable template instance (RSTI) of an electronic data table having dimensions D1 and D2. The RSTI includes contiguous recursive element instances (REIs) ordered and aligned along D1. The REIs include scalable template instances (STIs). Contiguous elements are deleted, upon satisfying consistency condition(s), in a first STI. The RSTI is structured according to an associated recursive scalable template (RST) that includes a recursive element (RE) including at least one scalable template (ST). Each STI is structured according to an associated ST. The contiguous elements are structured according to a first ST associated with the first STI. A size of the first REI along dimension D1 is adjusted according to a size of a largest STI in the first REI. All REIs of the RSTI remain contiguous after the deleting and adjusting.
Abstract:
A method and system for managing deletion operations in a recursive scalable template instance (RSTI) of an electronic data table having dimensions D1 and D2. The RSTI includes contiguous recursive element instances (REIs) ordered and aligned along D1. The REIs include scalable template instances (STIs). Contiguous elements are deleted, upon satisfying consistency condition(s), in a first STI. The RSTI is structured according to an associated recursive scalable template (RST) that includes a recursive element (RE) including at least one scalable template (ST). Each STI is structured according to an associated ST. The contiguous elements are structured according to a first ST associated with the first STI. A size of the first REI along dimension D1 is adjusted according to a size of a largest STI in the first REI. All REIs of the RSTI remain contiguous after the deleting and adjusting.
Abstract:
A method and system for creating a recursive scalable template instance (RSTI) in an electronic data table having dimensions D1 and D2. A recursive scalable template (RST) associated with the RSTI is selected such that the RSTI is to be structured in accordance with the RST. A plurality of contiguous recursive element instances (REIs) of the RSTI is created in a memory of a computer system. The REIs are ordered and aligned along the dimension D1. Each REI has a same size along the dimension D2. Each RET includes at least one scalable template instance (STI). Each REI is structured according to a recursive element (RE) defined for the RST such that the RE includes at least one scalable template (ST). Each ST of the RE is instanced to generate an associated scalable template instance (STI) of an REI of the plurality of REIs.
Abstract:
A method and system for creating a recursive scalable template instance (RSTI) in an electronic data table having dimensions D1 and D2. A recursive scalable template (RST) associated with the RSTI is selected such that the RSTI is to be structured in accordance with the RST. A plurality of contiguous recursive element instances (REIs) of the RSTI is created in a memory of a computer system. The REIs are ordered and aligned along the dimension D1. Each REI has a same size along the dimension D2. Each RET includes at least one scalable template instance (STI). Each REI is structured according to a recursive element (RE) defined for the RST such that the RE includes at least one scalable template (ST). Each ST of the RE is instanced to generate an associated scalable template instance (STI) of an REI of the plurality of REIs.