IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0030733
(2002-02-27)
|
우선권정보 |
JP-0199735 (1999-07-14) |
국제출원번호 |
PCT/JP00/04697
(2000-07-13)
|
국제공개번호 |
WO01/06065
(2001-01-25)
|
발명자
/ 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
4 인용 특허 :
1 |
초록
▼
There is provided a drain pipe ventilating apparatus that prevents water seal from being broken by supplying air to a drain pipe without using a ventilation pipe having a vent hole installed at a high position. The ventilating apparatus to supply the air to the drain pipe includes a first ventilatio
There is provided a drain pipe ventilating apparatus that prevents water seal from being broken by supplying air to a drain pipe without using a ventilation pipe having a vent hole installed at a high position. The ventilating apparatus to supply the air to the drain pipe includes a first ventilation pipe (1) and a second ventilation pipe (2) each having a spherical body (3, 3A) which freely moves up and down therein is characterized in that: the first ventilation pipe (1) has an opening at a lower end thereof to connect to the conduit at a predetermined point, the second ventilation pipe (2) has an opening at a lower end thereof to serve as an air intake port, an upper end of the first ventilation pipe (1) and an upper end of the second ventilation pipe (2) are communicated with each other so that an air path is formed from the lower end of the second ventilation pipe to the lower end of the first ventilation pipe, and the air path is opened and closed by at least one of the spherical bodies moving up and down in the ventilation pipe in accordance to a force acting on the spherical body.
대표청구항
▼
There is provided a drain pipe ventilating apparatus that prevents water seal from being broken by supplying air to a drain pipe without using a ventilation pipe having a vent hole installed at a high position. The ventilating apparatus to supply the air to the drain pipe includes a first ventilatio
There is provided a drain pipe ventilating apparatus that prevents water seal from being broken by supplying air to a drain pipe without using a ventilation pipe having a vent hole installed at a high position. The ventilating apparatus to supply the air to the drain pipe includes a first ventilation pipe (1) and a second ventilation pipe (2) each having a spherical body (3, 3A) which freely moves up and down therein is characterized in that: the first ventilation pipe (1) has an opening at a lower end thereof to connect to the conduit at a predetermined point, the second ventilation pipe (2) has an opening at a lower end thereof to serve as an air intake port, an upper end of the first ventilation pipe (1) and an upper end of the second ventilation pipe (2) are communicated with each other so that an air path is formed from the lower end of the second ventilation pipe to the lower end of the first ventilation pipe, and the air path is opened and closed by at least one of the spherical bodies moving up and down in the ventilation pipe in accordance to a force acting on the spherical body. tructions, said first predetermined operator allocating an unallocated portion of said memory space upon execution; if said first predetermined operator is present, determining the value of a parameter following said first operator in said stream; interposing a second operator within said loop in place of said first operator by said executable module; and reusing the same allocated portion of said memory space to store an instance of said parameter in said allocated portion of said memory space in response to the execution of said second operator during each iteration of said loop, wherein said allocated portion of said memory space is reused as multiple instances of said parameter are created without allocating a new memory space for each said new instance of said parameter. 2. The method according to claim 1, further including performing a safety check on the incoming stream of computer instructions. 3. The method according to claim 1, further comprising: determining whether there is sufficient memory available in said memory space to store said current instance of said parameter. 4. The method according to claim 1, wherein said executable module is a compiler computer program. 5. The method according to claim 4, wherein said executable module is a JAVA compiler computer program. 6. The method according to claim 4, wherein said compiler is a Just In Time compiler. 7. The method according to claim 1, wherein said stream of instructions is a stream of byte-codes. 8. The method according to claim 7, wherein said byte-codes are JAVA byte-codes. 9. The method according to claim 1, wherein said parameter following said predetermined operator is an object. 10. A method according to claim 1, wherein said allocated portion of said memory space occupied by said parameter does not require garbage collecting. 11. A method of optimizing the usage of a memory space in a computer, the method comprising: identifying a computer program module having a plurality of instructions for execution, said computer program module containing at least one loop and at least one first instruction within said at least one loop, said at least one first instruction specifying the allocation of a new instance of an object from said memory space within each iteration of said loop; replacing said at least one first instruction with at least one second instruction, said at least one second instruction reusing the same memory space for each new instance of said object created each time said loop is executed, said replacing step being performed automatically by said computer system; whereby said memory space is reclaimed without garbage collecting and is reused without allocating a new memory space. 12. The method according to claim 11, further comprising: determining if there is a sufficient amount of memory space available to store said object in said memory space prior to reusing said memory space. 13. The method according to claim 11 further comprising: recursively determining all objects potentially referenced by said object. 14. The method according to claim 12 further comprising: recursively determining all objects that potentially reference said object. 15. The method according to claim 11, further comprising: performing a safety check on the instructions of said computer program module. 16. A computer system, comprising: a memory configured and arranged to store an object; a processor associated with said memory executing an executable module having a portion that analyzes an incoming stream of computer instructions; said executable module identifying a loop within said stream of computer instructions and at least one first instruction within said loop which, upon execution, allocates an unallocated portion of said memory for an instance of a first object for each iteration of said loop; said executable module replacing said at least one first instruction with at least one second instruction which, upon execution, reuses the same allocated portion of said memory for an instance of said first object for each iteration of said loop. 17. The system according to claim l6, wherein said at least one second instruction being interposed by said executable module is hidden from the programmer. 18. The system according to claim 16, wherein said at least one second instruction acts to reuse a memory space previously allocated for an existing object. 19. The system according to claim 16, wherein said executable module performs a safety check prior to replacing said at least one first instruction with said at least one second instruction. 20. The system according to claim 19 wherein, in performing the safety check said executable module executes a transitive closure of all functions along a function tree called while said object is still in use. 21. The system according to claim 19 wherein, said executable module executes the transitive closure of the constructor used by said object. 22. The system according to claim 19 wherein, said executable module executes the transitive closure of any function using said object as an argument along said function tree. 23. The system according to claim 19 wherein, said executable module executes the transitive closure of any function called by said object along said function tree. 24. The method according to claim 16, wherein said instances of said first object are reclaimed without garbage collecting. 25. The system according to claim 16, wherein said executable module is a compiler. 26. The system according to claim 25, wherein said executable module compiler is a JAVA compiler. 27. The system according to claim 26, wherein said JAVA compiler is a Just In Time compiler. 28. A program storage device readable by a computer system, the program storage device tangibly embodying a program of instructions executable by the computer system to perform a method of reusing a memory space in a computer, the method comprising: analyzing an incoming stream of computer instructions with an executable module; determining the presence of a first predetermined operator within a loop in said stream of computer instructions, said first predetermined operator allocating an unallocated portion of said memory space upon execution; if said first predetermined operator is present, determining the value of a parameter following said first operator in said stream; interposing a second operator within said loop in place of said first operator by said executable module; and reusing the same allocated portion of said memory space to store an instance of said parameter in said allocated portion of said memory space in response to the execution of said second operator during each iteration of said loop, wherein said allocated portion of said memory space is reused as multiple instances of said parameter are created without allocating a new memory space for each said new instance of said parameter. 29. A method of transmitting a program product to a computer system, the method comprising: (a) establishing a connection with the computer system; and (b) transmitting the program product being executable by the computer system to perform a method of reusing a memory space in a computer, the method comprising: analyzing an incoming stream of computer instructions with an executable module; determining the presence of a first predetermined operator within a loop in said stream of computer instructions, said first predetermined operator allocating an unallocated portion of said memory space upon execution; if said first predetermined operator is present, determining the value of a parameter following said first operator in said stream; interposing a second operator within said loop in place of said first operator by said executable module; and reusing the same allocated portion of said memory space to store an instance of said parameter in said allocated portion of said memory space in response to the execution of said second operator during each iteration of said loop, wherein said allocated portion of said memory space is reused as multiple instances of said parameter are created without allocating a new memory space for each said new instance of said parameter.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.