private ClassEntry m_LRU; //maintain the least recently used list for cached class info
public CatalogTree(uint topNodeSId, SegmentManager sgManager, uint nextCId)
{
m_tree = new BTree(topNodeSId, sgManager, new KCatalog());
m_next_cid = nextCId;
m_cid_cache = new Hashtable(m_cache_limit);
m_name_cache = new Hashtable(m_cache_limit);
m_LRU = new ClassEntry();
}
private DiskFile m_dbFile; //the file handler for main database file
public SpaceTree(uint topSid, SegmentManager sgManager, DiskFile dbFile)
{
m_tree = new BTree(topSid, sgManager, new KOffset());
m_sgManager = sgManager;
m_dbFile = dbFile;
}
public SegTree(uint topSid, SegmentManager sgManager)
{
m_tree = new BTree(topSid, sgManager, new KSegId());
m_sgManager = sgManager;
}
public BTEnumerator(BTree tree)
{
m_tree = tree;
m_to_be_visited = new System.Collections.Queue();
m_current = null;
m_current_node = (BNode) m_tree.m_sgManager.GetSegment(m_tree.m_top_sid, m_tree.m_nodeFactory, m_tree.m_keyFactory);
if (m_current_node.KeyNums >0)
{
for (int i=0; i<=m_current_node.KeyNums; i++)
{
m_to_be_visited.Enqueue(m_current_node.GetChildAt(i));
}
}
m_current_key_no = -1;
}
public ObjectTree(uint topNodeSId, SegmentManager sgManager)
{
m_tree = new BTree(topNodeSId, sgManager, new KClass());
}
public SegTree(uint topSid, SegmentManager sgManager)
{
m_tree = new BTree(topSid, sgManager, new KSegId());
m_sgManager = sgManager;
}
private DiskFile m_dbFile; //the file handler for main database file
public SpaceTree(uint topSid, SegmentManager sgManager, DiskFile dbFile)
{
m_tree = new BTree(topSid, sgManager, new KOffset());
m_sgManager = sgManager;
m_dbFile = dbFile;
}
public ObjectTree(uint topNodeSId, SegmentManager sgManager)
{
m_tree = new BTree(topNodeSId, sgManager, new KClass());
}
