发明授权
US07925640B2 Dynamic multiple inheritance method dispatch data structure including an m-table size, i-table containing one or more holder addressor regions and type extension testing by frugal perfect hashing
有权
动态多重继承方法调度数据结构，包括m表大小，包含一个或多个持有者地址区域的i表和通过节俭完美散列的类型扩展测试
- 专利标题： Dynamic multiple inheritance method dispatch data structure including an m-table size, i-table containing one or more holder addressor regions and type extension testing by frugal perfect hashing
- 专利标题（中）： 动态多重继承方法调度数据结构，包括m表大小，包含一个或多个持有者地址区域的i表和通过节俭完美散列的类型扩展测试
-
申请号： US12031387申请日： 2008-02-14
-
公开(公告)号： US07925640B2公开(公告)日： 2011-04-12
- 发明人: Bernd J.W. Mathiske , Laurent P. Daynes , Gregory M. Wright
- 申请人： Bernd J.W. Mathiske , Laurent P. Daynes , Gregory M. Wright
- 申请人地址： US CA Redwood Shores
- 专利权人： Oracle America, Inc.
- 当前专利权人： Oracle America, Inc.
- 当前专利权人地址： US CA Redwood Shores
- 代理机构： Park, Vaughan, Fleming & Dowler LLP
- 主分类号： G06F17/00
- IPC分类号： G06F17/00 ; G06F17/30 ; G06F9/44 ; G06F9/26
摘要：
In the described embodiments, a computer constructs a dispatch data structure for a holder by first determining a set of member holders from which the holder inherits. The computer then constructs an “i-table” that includes holder addressor regions that each contains addressors for an associated set of members. Each of the holder addressor regions is associated with an i-table index. The computer next collects a set of identification numbers for the set of member holders and, from these, constructs an “m-table.” The size of the m-table is selected to perfectly hash the set of identification numbers by the m-table size. The computer then computes an m-table index for each of the set of identification numbers modulo the m-table size and uses the m-table index to populate the m-table. The computer next stores the i-table index in the m-table in accordance with the m-table index.
公开/授权文献
信息查询
