Abstract: A method for implementing virtual bases with fixed offsets in a class hierarchy graph, having nodes representing object classes and edges representing immediate inheritance therebetween, corresponding to an object oriented program includes determining whether a set N including all nodes is empty. A node x is removed from N, when N is not empty. It is determined whether a set Y is empty, Y including nodes that directly and virtually inherit from x. When Y is empty, return to determining whether N is empty, otherwise a node y is removed from Y. It is determined whether y is duplicated. When y is duplicated, return to determining whether Y is empty, otherwise an edge e, representing that y virtually inherits from x, is replaced with an edge e?, representing that x has a fixed offset with respect to y. Upon replacing e, return to determining whether N is empty.

Abstract: A method of representing a dataset having a plurality of elements characterized by a plurality of relations, the method comprising the following steps. A first step includes, slicing at least a portion of the dataset into a plurality of slices, each of the slices comprises a portion of the plurality of elements. A second step includes, for each element of the plurality of elements, assigning a set of identifiers, each identifier of the set being characterized by a position within the set, the position representing one of the slices. A third step includes, for each element of the plurality of elements, assigning an interval, the interval representing at least one relation of the element to at least one element of the plurality of elements.

Abstract: Data filtering apparatus comprising: an input for receiving a stream of data, each data item taking a range of at least two values ranging between a low value to a high value, a segmentation device for dividing the stream into segments, a segment midpoint definer for defining a midpoint of each segment, a segment orderer for ordering the segment in a first direction from low to high on a first side of the midpoint and in a second direction from low to high on a second side of the midpoint, an extremity filter unit for comparing the ordered data on either side of the midpoint to create a temporary output per segment, for each segment, each data item on either side of the midpoint being given an extremity filter value, the filter unit being operable to utilize the ordering to find the extremity value via a minimal number of comparisons, the extremity filter for initially comparing a single end of each segment, and being operable to alternate between ends per segment, the extremity filter being further operable

Abstract: There is provided a method for implementing virtual bases with fixed offsets in a class hierarchy graph corresponding to an object oriented program. The graph has nodes representing object classes and edges representing immediate inheritance therebetween. The method includes the step of determining whether a set N is empty, the set N including all nodes in the graph. A node x is removed from the set N, when the set N is not empty. It is determined whether a set Y is empty, the set Y including nodes that directly and virtually inherit from the node x. A return is made to the step of determining whether the set N is empty, when the set Y is empty. A node y is removed from the set Y, when the set Y is not empty. It is determined whether the node y is duplicated in the graph. A return is made to the step of determining whether the set Y is empty, when the node y is duplicated. An edge e is replaced with an edge e′, when the node y is not duplicated.

Abstract: There is provided a method for implementing virtual bases with fixed offsets in a class hierarchy graph corresponding to an object oriented program. The graph has nodes representing object classes and edges representing immediate inheritance therebetween. The method includes the step of determining whether a set N is empty, the set N including all nodes in the graph. A node x is removed from the set N, when the set N is not empty. It is determined whether a set Y is empty, the set Y including nodes that directly and virtually inherit from the node x. A return is made to the step of determining whether the set N is empty, when the set Y is empty. A node y is removed from the set Y, when the set Y is not empty. It is determined whether the node y is duplicated in the graph. A return is made to the step of determining whether the set Y is empty, when the node y is duplicated. An edge e is replaced with an edge e′, when the node y is not duplicated.

Abstract: There is provided a method for laying out objects corresponding to an object-oriented application. The method including the step of determining whether any two given objects have opposing directionalities. A virtual function table pointer is shared between the two given objects, and the directionalities of the two given objects are changed to mixed, when the two given objects have opposing directionalities.

Abstract: A method of representing a dataset having a plurality of elements characterized by a plurality of relations, the method comprising the following steps. A first step includes, slicing at least a portion of the dataset into a plurality of slices, each of the slices comprises a portion of the plurality of elements. A second step includes, for each element of the plurality of elements, assigning a set of identifiers, each identifier of the set being characterized by a position within the set, the position representing one of the slices. A third step includes, for each element of the plurality of elements, assigning an interval, the interval representing at least one relation of the element to at least one element of the plurality of elements.

Abstract: Data filtering apparatus comprising: an input for receiving a stream of data, each data item taking a range of at least two values ranging between a low value to a high value, a segmentation device for dividing the stream into segments, a segment midpoint definer for defining a midpoint of each segment, a segment orderer for ordering the segment in a first direction from low to high on a first side of the midpoint and in a second direction from low to high on a second side of the midpoint, an extremity filter unit for comparing the ordered data on either side of the midpoint to create a temporary output per segment, for each segment, each data item on either side of the midpoint being given an extremity filter value, the filter unit being operable to utilize the ordering to find the extremity value via a minimal number of comparisons, the extremity filter for initially comparing a single end of each segment, and being operable to alternate between ends per segment, the extremity filter being further operable