초록 ▼

The invention is a seal apparatus useful as a seal between a commode and a drain pipe comprising a pipe extension, a gasket, and a flanged base. The pipe extension comprises an extension sealing surface. The gasket comprises a sealing lip, a pipe extension clearance, and a gasket sealing surface. Th

The invention is a seal apparatus useful as a seal between a commode and a drain pipe comprising a pipe extension, a gasket, and a flanged base. The pipe extension comprises an extension sealing surface. The gasket comprises a sealing lip, a pipe extension clearance, and a gasket sealing surface. The flanged base comprisies a pipe bonding surface and a base sealing surface.

대표청구항 ▼

The invention is a seal apparatus useful as a seal between a commode and a drain pipe comprising a pipe extension, a gasket, and a flanged base. The pipe extension comprises an extension sealing surface. The gasket comprises a sealing lip, a pipe extension clearance, and a gasket sealing surface. Th

The invention is a seal apparatus useful as a seal between a commode and a drain pipe comprising a pipe extension, a gasket, and a flanged base. The pipe extension comprises an extension sealing surface. The gasket comprises a sealing lip, a pipe extension clearance, and a gasket sealing surface. The flanged base comprisies a pipe bonding surface and a base sealing surface. xecuting. 8. A method according to claim 6, wherein said data gathering step further includes the step of storing in a computer memory, only event data which matches said one or more specified data gathering criterion. 9. A method according to claim 6, wherein said data gathering step further includes the step of storing all events associated with at least one of said transactions and filtering said stored events in accordance with said one or more specified data gathering criterion such that said path map is constructed from said filtered gathered event data. 10. A method according to claim 1, wherein said output is created in accordance with one or more filtering criterion specified by a user. 11. A method according to claim 1, wherein at least one of said events corresponds to at least one category of related data. 12. The method according to claim 1, wherein said method is performed by a mainframe computer. 13. A method according to claim 1, wherein said output comprises output data selected from the group consisting of display data, print data and storage data. 14. A method according to claim 1, wherein said output depicts a path through said computer program showing the actual processing flow of said computer program, said output being comprised of: a header; a plurality of event symbols; and a plurality of textual data, each of said plurality of textual data describing a respective event symbol. 15. A method according to claim 14, wherein a length of each of said event symbols corresponds to a ratio of an average total event duration for a respective gathered event to a sum of an average total event duration for all of said gathered events. 16. A method according to claim 14, wherein a width of each of said event symbols corresponds to a ratio of a quantity of occurrences for a respective gathered event to a sum of the quantity of occurrences for all of said gathered events. 17. A method according to claim 14, wherein at least one of a color, greyscale or shading level of each of said event symbols corresponds to a ratio of an average total event duration for a respective gathered event to a sum of an average event duration for all of said gathered events. 18. A method according to claim 14, wherein at least one of a color, greyscale or shading level corresponds to a proportion of a quantity of occurrences for a respective gathered event to a sum of the quantity of occurrences for all of said gathered events. 19. A method according to claim 14, wherein said output is further comprised of connecting lines, said connecting lines being used to connect said event symbols to show an operational flow of said computer program. 20. A method according to claim 19, wherein a main path is located in approximately a center of said output, said main path being a connected sequence of event symbols of one or more connected sequences of event symbols in which said gathered events corresponding to said event symbols were executed with a highest quantity. 21. A method according to claim 1, wherein said data is gathered in a manner having approximately no adverse impact on the operation of said computer program. 22. A method for profiling one or more operational characteristics of a computer program, said computer program performing one or more transactions, at least one of said transactions having at least one event, said method comprising the steps of: gathering event data corresponding to one or more of said transactions; constructing a path map from said gathered event data, said path map representing program operation performance relationships between said gathered events, said path map being arranged in order of execution; and creating an output, said output being created based on said path map, wherein said path map construction step comprises the steps of: selecting which of said gathered events is to be analyzed; sorting said selected events in order of event occurrence; building one or more event chains in whic